Computer Science – Networking and Internet Architecture
Scientific paper
2009-08-11
IEEE International Conference on Communication Systems. (2008) 709-714
Computer Science
Networking and Internet Architecture
11th IEEE International Conference on Communication Systems, Guangzhou. China, 19-21 Nov. 2008. (ICCS 2008)
Scientific paper
10.1109/ICCS.2008.4737278
As we know, the member-only algorithm in provides the best links stress and wavelength usage for the construction of multicast light-trees in WDM networks with sparse splitting. However, the diameter of tree is too big and the average delay is also too large, which are intolerant for QoS required multimedia applications. In this paper, a distance priority based algorithm is proposed to build light-trees for multicast routing, where the Candidate Destinations and the Candidate Connectors are introduced. Simulations show the proposed algorithm is able to greatly reduce the diameter and average delay of the multicast tree (up to 51% and 50% respectively), while keep the same or get a slightly better link stress as well as the wavelength usage than the famous Member-Only algorithm.
Cousin Bernard
Molnar Miklos
Zhou Fen
No associations
LandOfFree
Distance priority based multicast routing in WDM networks considering sparse light splitting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Distance priority based multicast routing in WDM networks considering sparse light splitting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance priority based multicast routing in WDM networks considering sparse light splitting will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-164475