Algorithmic graph theory
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
Efficient scheduling of transmissions in optical broadcast networks
IEEE/ACM Transactions on Networking (TON)
Dynamic wavelength conversion in optical networks
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Optical networks: a practical perspective
Optical networks: a practical perspective
Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Improved access to optical bandwidth in trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient routing and scheduling algorithms for optical networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Cost-effective traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Performance of Alternate Routing Methods in All--Optical Switching Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Computing approximate blocking probabilities for a class of all-optical networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Routing and wavelength assignment in all-optical wdm wavelength-routing networks
Routing and wavelength assignment in all-optical wdm wavelength-routing networks
Call Scheduling in Trees, Rings and Meshes
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Models of blocking probability in all-optical networks with and without wavelength changers
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Lightpath (wavelength) routing in large WDM networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper considers a network design problem introduced by Gerstel, Lin and Sasaki (INFOCOM '98) in which resource allocation is performed within a Wavelength Division Multiplexing (WDM) optical ring network to reduce overall equipment cost. The problem can be summarized as follows. The Add-Drop Multiplexers (ADM's) that are used to terminate lightpaths in an optical (SONET/SDH) ring are expensive. A naive implementation would require ADM's for each wavelength at each node. However, by carefully assigning connections to wavelengths and routing the resulting lightpaths, one may avoid terminating all wavelengths at every node, and thereby reduce the number of ADM's needed.While Gerstel et al. consider wavelength assignment with respect to this problem, they do not consider the additional complication of routing. In this paper, we consider joint routing and wavelength assignment, and show that the number of ADM's required is significantly less than the number resulting from applying the heuristics in Gerstel et al. Our algorithm analyzes connection requirements and, using a decomposition based on Euler paths, performs routing and wavelength assignment.