On-Line Routing in All-Optical Networks

The paper deals with on-line routing in WDM (wavelength division multiplexing) optical networks. A sequence of requests arrives over time, each is a pair of nodes to be connected by a path. The problem is to assign a wavelength and a path to each pair, so that no two paths sharing a link are assigned the same wavelength. The goal is to minimize the number of wavelengths used to establish all connections.

[1]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[2]  Klaus Jansen,et al.  Constrained Bipartite Edge Coloring with Applications to Wavelength Routing , 1997, ICALP.

[3]  Alok Aggarwal,et al.  Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.

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

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

[6]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[7]  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.

[8]  Vijay Kumar,et al.  Improved access to optical bandwidth in trees , 1997, SODA '97.

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

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

[11]  Sandy Irani,et al.  Coloring inductive graphs on-line , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[12]  Christos Kaklamanis,et al.  Efficient Wavelength Routing on Directed Fiber Trees , 1996, ESA.

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

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

[15]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

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

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

[18]  Yuval Rabani,et al.  Path coloring on the mesh , 1996, Proceedings of 37th Conference on Foundations of Computer Science.