2013Procedia TechnologyOpen access

Multicast Traffic Grooming based Light-tree in WDM Mesh Networks

Ashok Kumar Pradhan, Tanmay De

Open full text 4 citations

Abstract

Multicast applications such as video conferencing, weather forecasting and on-line multi player gaming are major areas of Internet traffic growth. The disparity between bandwidth offered by a wavelength and the bandwidth requirement of a multicast connection can be purposefully solved by grooming low bandwidth connection requests into a high bandwidth wavelength channel in an optical network. In this paper, we discuss multicast traffic grooming problem using light-tree approach with static multicast connection requests. As higher layer electronic ports such as transmitters and receivers are dominant cost factors in a WDM mesh networks, it is critical to reduce their number when grooming multicast traffic into high bandwidth trees. This paper propose a heuristic algorithm called Saturated-Light-Tree based Multicast Traffic Grooming (SLTMTG) that solves grooming, routing and wavelength assignment problems. SLTMTG algorithm is based on grooming of multicast traffic to constrained light-trees in which traffic is groomed for better resource utilizations. This approach is used to minimize the grooming cost as well as wavelength requirement. Here, proposed approach tries to satisfy all connection requests. The performance of proposed algorithm has compared with existing Multicast Traffic Grooming (MTG) algorithm. The results are compared on several standard networks to measure cost and wavelength utilization.

Open-access reader

About this research paper

What this paper is about

Multicast applications such as video conferencing, weather forecasting and on-line multi player gaming are major areas of Internet traffic growth. The disparity between bandwidth offered by a wavelength and the bandwidth requirement of a multicast connection can be purposefully solved by grooming low bandwidth connection requests into a high bandwidth wavelength channel in an optical network. In this paper, we discuss multicast traffic grooming problem using light-tree approach with static multicast connection requests. As higher layer electronic ports such as transmitters and receivers are dominant cost factors in a WDM mesh networks, it is critical to reduce their number when grooming multicast traffic into high bandwidth trees. This paper propose a heuristic algorithm called Saturated-Light-Tree based Multicast Traffic Grooming (SLTMTG) that solves grooming, routing and wavelength assignment problems. SLTMTG algorithm is based on grooming of multicast traffic to constrained light-trees in which traffic is groomed for better resource utilizations. This approach is used to minimize the grooming cost as well as wavelength requirement. Here, proposed approach tries to satisfy all connection requests. The performance of proposed algorithm has compared with existing Multicast Traffic Grooming (MTG) algorithm. The results are compared on several standard networks to measure cost and wavelength utilization.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Multicast applications such as video conferencing, weather forecasting and on-line multi player gaming are major areas of Internet traffic growth. The disparity between bandwidth offered by a wavelength and the bandwidth requirement of a multicast connection can be purposefully solved by grooming low bandwidth connection requests into a high bandwidth wavelength channel in an optical network. In this paper, we discuss multicast traffic grooming problem using light-tree approach with static multicast connection requests. As higher layer electronic ports such as transmitters and receivers are dominant cost factors in a WDM mesh networks, it is critical to reduce their number when grooming multicast traffic into high bandwidth trees. This paper propose a heuristic algorithm called Saturated-Light-Tree based Multicast Traffic Grooming (SLTMTG) that solves grooming, routing and wavelength assignment problems. SLTMTG algorithm is based on grooming of multicast traffic to constrained light-trees in which traffic is groomed for better resource utilizations. This approach is used to minimize the grooming cost as well as wavelength requirement. Here, proposed approach tries to satisfy all connection requests. The performance of proposed algorithm has compared with existing Multicast Traffic Grooming (MTG) algorithm. The results are compared on several standard networks to measure cost and wavelength utilization.

Key concepts: Traffic grooming, Multicast, Computer network, Protocol Independent Multicast, Computer science, Xcast, Source-specific multicast, Distance Vector Multicast Routing Protocol

Related papers

Back to paper searchBrowse research topicsOriginal source
Multicast Traffic Grooming based Light-tree in WDM Mesh Networks — Research Paper | ScholarLens