A minimum interference routing algorithm for a linear lightwave network

A routing algorithm for setting up point to point connection is proposed for a linear lightwave network (LLN). The overall problem of routing is decomposed into the subproblems of physical path allocation, checking for violations of some of the special constraints (MISC (mutually independent sources combining) and color clash) of the LLN on the allocated physical path and the allocation of an appropriate channel. It is shown that the problem of finding a physical path that does not violate the MISC constraint of the LLN is NP-complete.<<ETX>>

[1]  Mischa Schwartz,et al.  Telecommunication networks , 1987 .

[2]  Kavita Bala,et al.  Algorithms for routing in a linear lightwave network , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[3]  Rajiv Ramaswami,et al.  A Wavelength Division Multiple Access Network for Computer Communication , 1990, IEEE J. Sel. Areas Commun..

[4]  Kai Y. Eng,et al.  A multi-fiber ring architecture for distributed lightwave networks , 1988, IEEE International Conference on Communications, - Spanning the Universe..

[5]  Haim Kobrinski,et al.  Application of Wavelength Division Multiplexing to Communication Network Architectures , 1986, ICC.

[6]  Thomas E. Stern.  Linear lightwave networks: how far can they go? , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.