Topologies for linear lightwave networks

Simple topologies are proposed for linear lightwave networks (LLN). Tree-based networks which preclude the possibility of certain violations are compared to networks that allow violations to occur but achieve better load distribution within the network. The performance of each topology, from the point of view of blocking probability, is compared by a simulator using a call routing algorithm based on the K-shortest path algorithm. It is found that general topologies that allow for better load distribution perform better than tree-based topologies.

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

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

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

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

[5]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

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

[7]  Mischa Schwartz,et al.  Telecommunication networks: protocols, modeling and analysis , 1986 .