Conference Paper

Multicast routing and wavelength assignment in WDM networks with limited drop-offs

Inst. of Appl. Math., Chinese Acad. of Sci., Beijing, China
DOI: 10.1109/INFCOM.2004.1354520 Conference: INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Volume: 1
Source: DBLP

ABSTRACT In WDM networks with limited drop-offs, the route of a multicast connection consists of a set of light-trees. Each of the light-tree is rooted at the source node and contains no more than a limited number, say k, destination nodes due to the power loss of dropping optical signals off at destination nodes. We call such a light-tree k-drop light-tree. In this paper we study the multicast routing problem of constructing a set of k-drop light-trees that have the minimal network cost. The network cost of a set of light-trees is defined as the summation of the link cost of all the light-trees. We first prove that this problem is polynomial-time solvable for k=2 and NP-hard for k≥3. We then propose a 4-approximation algorithm for the problem for k ≥3. A wavelength assignment algorithm is also proposed to assign wavelengths to the light-trees of a multicast connection. In the end we give simulation results showing that k-drop multitree muting can significantly save not only the network cost but also wavelengths used. Moreover, when k≥5 its performance is very close to the case where k is infinite (i.e., the case of using a single tree for a multicast connection).

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: To minimize the number of wavelengths required by a multicast session in sparse light splitting wavelength division multiplexing (WDM) networks, a light-hierarchy structure, which occupies the same wavelength on all links, is proposed to span as many destinations as possible. Different from a light-tree, a light-hierarchy accepts cycles, which are used to traverse crosswise a 4-degree (or above) multicast incapable (MI) node twice (or above) and switch two light signals on the same wavelengths to two destinations in the same multicast session. In this paper, firstly, a graph renewal and distance priority light-tree algorithm (GRDP-LT) is introduced to improve the quality of light-trees built for a multicast request. Then, it is extended to compute light-hierarchies. Obtained numerical results demonstrate the GRDP-LT light-trees can achieve a much lower links stress, better wavelength channel cost, and smaller average end-to-end delay as well as diameter than the currently most efficient algorithm. Furthermore, compared to light-trees, the performance in terms of link stress and network throughput is greatly improved again by employing the light-hierarchy, while consuming the same amount of wavelength channel cost.
    Computer Communications and Networks, 2009. ICCCN 2009. Proceedings of 18th Internatonal Conference on; 09/2009
  • [Show abstract] [Hide abstract]
    ABSTRACT: All-to-all broadcast communication is to disseminate a unique message from each node to every other node in a network. This is a fundamental problem in multiprocessor systems and telecommunication networks that need to collect information about other nodes in the network regularly in order to manage network resources efficiently. It is known that in wavelength division multiplexing (WDM) optical networks with single hop routing, the number of wavelengths needed for realizing all-to-all broadcast is quite large, even for a moderately sized network. One possible method to reduce the number of wavelengths is to adopt a network with drop-and-continue capable nodes. In such networks, a message from a source node can be dropped only at a limited number of destination nodes along a light path due to power loss of the dropping optical signals at the destination nodes. In this paper, a new wavelength assignment method is proposed to establish all-to-all broadcast in unidirectional ring and bi-directional ring networks which contain drop-and-continue capable nodes. An upper bound on the number of wavelengths required to establish all-to-all broadcast is also derived for unidirectional ring and bi-directional ring.
    01/2009; 38(2):103-123.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider one light-path based and two light-tree based traffic grooming schemes for supporting IP multicast services. We made performance comparisons for call blocking probability and bandwidth blocking probability on those schemes. Simulation results reveal that light-path scheme has lower blocking probability and less consumes bandwidth consumption as IP demand volumes are small (i.e., several Megabit/sec). On the other hand, Light-tree based schemes have better performance as the IP demands become high. We conclude that the selection of grooming strategies should take the volume of demands of the provided services into account and the results in this work can provide a basic guideline for grooming strategy selection.
    International Conference on Networking. 01/2010;

Full-text (2 Sources)

Available from
Aug 15, 2014