Greedy online algorithms for routing permanent virtual circuits

Networks

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

  Havill, Jessen T ^a   Mao, Weizhen ^b  

^a DENISON UNIVERSITY   (United States)

^b Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

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

References (25)

1. [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.
2. [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.
3. [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.
4. [4] B. Awerbuch, Y. Azar, and A. Fiat, "Packet routing via min-cost circuit routing," Proc Israeli Symp on the Theory of Computing and Systems, 1996, pp. 37-42.
5. [5] B. Awerbuch, Y. Azar, and S. Plotkin, "Throughput-competitive on-line routing," Proc IEEE Symp on Foundations of Computer Science, 1993, pp. 32-40.
6. [6] B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts, "Competitive routing of virtual circuits with unknown duration," Proc ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 321-327.
7. [7] B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosen, "Competitive non-preemptive call control," Proc ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 312-320.
8. [8] B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani, "On-line admission control and circuit routing for high performance computing and communication," Proc IEEE Symp on Foundations of Computer Science, 1994, pp. 412-423.
9. [9] Y. Azar, B. Kalyanasundaram, S. Plotkin, K.R. Pruhs, and O. Waarts, "On-line load balancing of temporary tasks," Workshop on Algorithms and Data Structures, 1993, pp. 119-130.
10. [10] Y. Azar, J. Naor, and R. Rom, "The competitiveness of on-line assignments," Proc ACM-SIAM Symp on Discrete Algorithms, 1992, pp. 203-210.
11. [11] Y. Azar, J. Naor, and R. Rom, The competitiveness of on-line assignments, J Alg 18 (1995), 221-237.
12. [12] Y. Bartal, A. Fiat, H. Karloff, and R. Vohra, "New algorithms for an ancient scheduling problem," Proc ACM Symp on Theory of Computing, 1992, pp. 51-58.
13. [13] J.A. Garay and I.S. Gopal, "Call preemption in communication networks," Proc IEEE INFOCOM, 1992, pp. 1043-1050.
14. [14] R. Gawlick, C. Kalmanek, and K.G. Ramakrishnan, "On-line routing for permanent virtual circuits," IEEE INFOCOM, 1995, pp. 278-288.
15. [15] R.L. Graham, Bounds for certain multiprocessing anomalies, Bell Syst Tech J 45 (1966), 1563-1581.
16. [16] J.T. Havill and W. Mao, "Greedy on-line file transfer routing," Proc IASTED International Conf on Parallel and Distributed Systems, 1997, pp. 225-230.
17. [17] J.T. Havill, W. Mao, and R. Simha, "A lower bound for on-line file transfer routing and scheduling," Proc 31st Annual Conf on Information Sciences and Systems, 1997, pp. 936-941.
18. [18] D.R. Karger, S.J. Phillips, and E. Torng, "A better algorithm for an ancient scheduling problem," Proc ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 132-140.
19. [19] R.M. Karp, On-line algorithms versus off-line algorithms: How much is it worth to know the future? Technical Report TR-92-044, International Computer Science Institute, 1992.
20. [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.
21. [21] T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas, "Fast approximation algorithms for multicommodity flow problems," Proc ACM Symp on Theory of Computing, 1991, 101-111.
22. [22] S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti, and A. Rosen, "On-line randomized call control revisited," Proc ACM-SIAM Symp on Discrete Algorithms, 1998, 323-332.
23. [23] W. Mao and R. Simha, Routing and scheduling file transfers in packet-switched networks, J Comput Inf 1 (1994), 559-574.
24. [24] S. Plotkin. Competitive routing of virtual circuits in ATM networks, IEEE J Select Areas Commun 13 (1995), 1128-1136.
25. [25] F. Shahrokhi and D.W. Matula, The maximum concurrent flow problem, J Assoc Comput Machin 37 (1990), 318-334.