Research: Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks

Authors:
Xiao-Hua Jia;Ding-Zhu Du;Xiao-Dong Hu
Affiliations:
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong and Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, USA and Institute of Applied Ma ...;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong and Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, People's Republic of China
Venue:
Computer Communications
Year:
2001

Citing 16
Cited 6

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Steiner problem in networks: a survey

Networks
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Lower bounds for on-line graph problems with application to on-line circuit and optical routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Bicriteria network design problems

Journal of Algorithms
A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

IEEE/ACM Transactions on Networking (TON)
Improved access to optical bandwidth in trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Ring routing and wavelength translation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-Line Routing in All-Optical Networks

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Multicast Communication in a Class of Wide-Sense Nonblocking Optical WDM Networks

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Path coloring on the mesh

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
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
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A real-time multicast routing algorithm for multimedia applications

Computer Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities

Journal of Network and Computer Applications
Inapproximability and approximability of minimal tree routing and coloring

Journal of Discrete Algorithms
A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Applied Soft Computing
Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities

Computer Communications
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

Journal of Network and Computer Applications
Optical multicast over wavelength-routed WDM networks: A survey

Optical Switching and Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

There are two steps to set-up a multicast connection in all optical wavelength division multiplexing (WDM) networks: routing and wavelength assignment. Multicast routing is to find a tree in the network rooted from a source node and connecting all destination nodes. Wavelength assignment is to assign a wavelength to the generated routing tree in such a way that if two trees share a common link, then they must be assigned with two different wavelengths. This paper proposes two integrated algorithms to integrate routing and wavelength assignment. The proposed algorithms have the following advantages: (1) the number of wavelengths used is small; (2) the network cost of routing trees is low; and (3) the transmission delay from the source to any multicast destination is bounded.