On-line Network Routing

In this chapter we have described competitive on-line algorithms for on-line network routing problems. We have concentrated on routing in electrical and optical networks, presented algorithms for load minimization and throughput maximization problems, and mentioned some of the most popular open problems in the area.

[1]  Yuan Ma,et al.  An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration , 1997, Inf. Process. Lett..

[2]  J. van Leeuwen,et al.  Graph Algorithms , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1993, J. Algorithms.

[5]  Ekkart Kindler,et al.  Mutex Needs Fairness , 1997, Inf. Process. Lett..

[6]  Stefano Leonardi,et al.  On-Line Routing in All-Optical Networks , 1997, ICALP.

[7]  Shay Kutten,et al.  Dynamic wavelength allocation in all-optical ring networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[8]  Amos Fiat,et al.  Packet Routing via Min-Cost Circuit Routing , 1996, ISTCS.

[9]  Shay Kutten,et al.  Dynamic wavelength conversion in optical networks , 1997, PODC '97.

[10]  Fillia Makedon,et al.  Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.

[11]  Ashish Goel,et al.  Online througput-competitive algorithm for multicast routing and admission control , 1998, SODA '98.

[12]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[13]  Ran Canetti,et al.  Bandwidth allocation with preemption , 1995, STOC '95.

[14]  Alberto Marchetti-Spaccamela,et al.  On-line randomized call control revisited , 1998, SODA '98.

[15]  Yossi Azar,et al.  Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[16]  Amos Fiat,et al.  Lower bounds for on-line graph problems with application to on-line circuit and optical routing , 1996, STOC '96.

[17]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[18]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[19]  Amos Fiat,et al.  On-line Competive Algorithms for Call Admission in Optical Networks , 1996, ESA.

[20]  Y. Mansour,et al.  Eecient On-line Call Control Algorithms , 1993 .

[21]  Yossi Azar.  On-line Load Balancing , 1996, Online Algorithms.

[22]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

[23]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[24]  Serge A. Plotkin,et al.  Routing and admission control in general topology networks with Poisson arrivals , 1995, SODA '96.

[25]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[26]  Satish Rao,et al.  Efficient access to optical bandwidth , 1995, FOCS 1995.

[27]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[28]  Yossi Azar,et al.  Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.

[29]  Maciej Slusarek.  Optimal On-Line Coloring of Circular Arc Graphs , 1995, RAIRO Theor. Informatics Appl..

[30]  Amos Fiat,et al.  Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract) , 1996, STOC '96.

[31]  Baruch Awerbuch,et al.  Online algorithms for selective multicast and maximal dense trees , 1997, STOC '97.

[32]  Galen H. Sasaki,et al.  Dynamic Channel Assignment For WDM Optical Networks With Little Or No Wavelength Conversion , 1996 .

[33]  Alberto Marchetti-Spaccamela,et al.  On-line Resource Management with Applications to Routing and Scheduling , 1995, ICALP.

[34]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[35]  Yossi Azar,et al.  Competitive multicast routing , 1995, Wirel. Networks.

[36]  Sandy Irani,et al.  Bounding the power of preemption in randomized scheduling , 1995, STOC '95.

[37]  Moti Yung,et al.  Efficient on-line call control algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.