메뉴 건너뛰기




Volumn 34, Issue 2, 1999, Pages 136-153

Greedy online algorithms for routing permanent virtual circuits

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0033196399     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199909)34:2<136::AID-NET7>3.0.CO;2-6     Document Type: Article
Times cited : (4)

References (25)
  • 1
    • 0027188166 scopus 로고
    • On-line load balancing with applications to machine scheduling and virtual circuit routing
    • [1] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, "On-line load balancing with applications to machine scheduling and virtual circuit routing," Proc ACM Symp on Theory of Computing, 1993, pp. 623-631.
    • (1993) Proc ACM Symp on Theory of Computing , pp. 623-631
    • Aspnes, J.1    Azar, Y.2    Fiat, A.3    Plotkin, S.4    Waarts, O.5
  • 2
    • 0031147056 scopus 로고    scopus 로고
    • On-line routing of virtual circuits with applications to load balancing and machine scheduling
    • [2] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, On-line routing of virtual circuits with applications to load balancing and machine scheduling, J Assoc Comput Mach 44 (1997), 486-504.
    • (1997) J Assoc Comput Mach , vol.44 , pp. 486-504
    • Aspnes, J.1    Azar, Y.2    Fiat, A.3    Plotkin, S.4    Waarts, O.5
  • 3
    • 0002591736 scopus 로고
    • Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation
    • [3] B. Awerbuch and Y. Azar, "Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation," Proc IEEE Symp on Foundations of Computer Science, 1994, pp. 240-249.
    • (1994) Proc IEEE Symp on Foundations of Computer Science , pp. 240-249
    • Awerbuch, B.1    Azar, Y.2
  • 11
    • 58149209970 scopus 로고
    • The competitiveness of on-line assignments
    • [11] Y. Azar, J. Naor, and R. Rom, The competitiveness of on-line assignments, J Alg 18 (1995), 221-237.
    • (1995) J Alg , vol.18 , pp. 221-237
    • Azar, Y.1    Naor, J.2    Rom, R.3
  • 13
    • 0026978022 scopus 로고
    • Call preemption in communication networks
    • [13] J.A. Garay and I.S. Gopal, "Call preemption in communication networks," Proc IEEE INFOCOM, 1992, pp. 1043-1050.
    • (1992) Proc IEEE Infocom , pp. 1043-1050
    • Garay, J.A.1    Gopal, I.S.2
  • 14
    • 0009254732 scopus 로고
    • On-line routing for permanent virtual circuits
    • [14] R. Gawlick, C. Kalmanek, and K.G. Ramakrishnan, "On-line routing for permanent virtual circuits," IEEE INFOCOM, 1995, pp. 278-288.
    • (1995) IEEE Infocom , pp. 278-288
    • Gawlick, R.1    Kalmanek, C.2    Ramakrishnan, K.G.3
  • 15
    • 84944813080 scopus 로고
    • Bounds for certain multiprocessing anomalies
    • [15] R.L. Graham, Bounds for certain multiprocessing anomalies, Bell Syst Tech J 45 (1966), 1563-1581.
    • (1966) Bell Syst Tech J , vol.45 , pp. 1563-1581
    • Graham, R.L.1
  • 20
    • 0028454922 scopus 로고
    • Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
    • [20] P. Klein, S. Plotkin, C. Stein, and E. Tardos, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts, SIAM J Comput 23 (1994), 466-487.
    • (1994) SIAM J Comput , vol.23 , pp. 466-487
    • Klein, P.1    Plotkin, S.2    Stein, C.3    Tardos, E.4
  • 23
    • 0009183935 scopus 로고
    • Routing and scheduling file transfers in packet-switched networks
    • [23] W. Mao and R. Simha, Routing and scheduling file transfers in packet-switched networks, J Comput Inf 1 (1994), 559-574.
    • (1994) J Comput Inf , vol.1 , pp. 559-574
    • Mao, W.1    Simha, R.2
  • 24
    • 0029358479 scopus 로고
    • Competitive routing of virtual circuits in ATM networks
    • [24] S. Plotkin. Competitive routing of virtual circuits in ATM networks, IEEE J Select Areas Commun 13 (1995), 1128-1136.
    • (1995) IEEE J Select Areas Commun , vol.13 , pp. 1128-1136
    • Plotkin, S.1
  • 25
    • 0025415365 scopus 로고
    • The maximum concurrent flow problem
    • [25] F. Shahrokhi and D.W. Matula, The maximum concurrent flow problem, J Assoc Comput Machin 37 (1990), 318-334.
    • (1990) J Assoc Comput Machin , vol.37 , pp. 318-334
    • Shahrokhi, F.1    Matula, D.W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.