Architectures for linear lightwave networks
Architectures for linear lightwave networks
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
Bipartite Edge Coloring in $O(\Delta m)$ Time
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Dynamic wavelength routing using congestion and neighborhood information
IEEE/ACM Transactions on Networking (TON)
Worst-case analysis of dynamic wavelength allocation in optical networks
IEEE/ACM Transactions on Networking (TON)
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
IEEE/ACM Transactions on Networking (TON)
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
Architectural study of high-speed networks with optical bypassing
Architectural study of high-speed networks with optical bypassing
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
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
Computing approximate blocking probabilities for a class of all-optical networks
IEEE Journal on Selected Areas in Communications
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
Efficient routing and wavelength assignment for reconfigurable WDM networks
IEEE Journal on Selected Areas in Communications
Achieving 100% throughput in reconfigurable optical networks
IEEE/ACM Transactions on Networking (TON)
Reconfiguration of the routing in WDM networks with two classes of services
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
The choice of the best among the shortest routes in transparent optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness
International Journal of Distributed Systems and Technologies
Hi-index | 0.00 |
We develop on-line routing and wavelength assignment (RWA) algorithms for WDM bidirectional ring and torus networks with N nodes. The algorithms dynamically support all k-allowable traffic matrices, where k denotes an arbitrary integer vector [k1, k2,..., kN], and node i, 1 ≤ i ≤ N, can transmit at most ki wavelengths and receive at most ki wavelengths. Both algorithms support the changing traffic in a rearrangeably nonblocking fashion. Our first algorithm, for a bidirectional ring, uses ⌈(Σi=1N ki)/3⌉ wavelengths in each fiber and requires at most three lightpath rearrangements per new session request regardless of the number of nodes N and the amount of traffic k. When all the ki's are equal to k, the algorithm uses ⌈kN/3⌉ wavelengths, which is known to be the minimum for any off-line rearrangeably nonblocking algorithm. Our second algorithm, for a torus topology, is an extension of a known off-line algorithm for the special case with all the ki's equal to k. For an R × C torus network with R ≥ C nodes, our on-line algorithm uses ⌈kR/2⌉ wavelengths in each fiber, which is the same as in the off-line algorithm, and is at most two times a lower bound obtained by assuming full wavelength conversion at all nodes. In addition, the on-line algorithm requires at most C - 1 lightpath rearrangements per new session request regardless of the amount of traffic k. Finally, each RWA update requires solving a bipartite matching problem whose time complexity is only O(R), which is much smaller than the time complexity O(kCR2) of the bipartite matching problem for an off-line algorithm.