Algorithms for routing in a linear lightwave network
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9 vol.1
- https://doi.org/10.1109/infcom.1991.147477
Abstract
Routing algorithms are proposed for setting up calls on a circuit-switched basis in linear lightwave networks (LLN), i.e., networks composed only of linear components, including controllable power combiners and dividers, and possibly linear (non-regenerative) optical amplifiers. The overall problem is decomposed into three subproblems: (1) physical path allocation, (2) checking for violations of the special optical constraints on the allocated physical path, and (3) channel assignment. Only point to point connections are considered. The physical path allocation technique uses the K-shortest path algorithm and tries to minimize the number of sources potentially interfering with each other, as a result of the incoming call. A channel assignment heuristic that tends to spread out calls evenly among the available channels works better than one that tries to maximize channel reuse.<>Keywords
This publication has 3 references indexed in Scilit:
- A multi-fiber ring architecture for distributed lightwave networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Linear lightwave networks: how far can they go?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A wavelength division multiple access network for computer communicationIEEE Journal on Selected Areas in Communications, 1990