Performance analysis of multicast routing and wavelength assignment protocol with dynamic traffic grooming in WDM networks

2011 ◽  
Vol 26 (2) ◽  
pp. 198-211 ◽  
Author(s):  
N. Kaliammal ◽  
G. Gurusamy
Keyword(s):  
Performance Analysis ◽  
Multicast Routing ◽  
Traffic Grooming ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Wdm Networks ◽  
Dynamic Traffic ◽  
Dynamic Traffic Grooming

Dynamic Traffic Grooming under a Differentiated Resilience Scheme for WDM Mesh Networks

2011 ◽  
pp. 181-194
Author(s):  
Taisir E.H. El-Gorashi ◽  
Jaafar Elmirghani
Keyword(s):  
Optical Fibre ◽  
Level Scheme ◽  
Mesh Networks ◽  
Traffic Grooming ◽  
Wdm Networks ◽  
Bandwidth Efficiency ◽  
Dynamic Traffic ◽  
Wavelength Division ◽  
Telecommunications Services ◽  
Dynamic Traffic Grooming

Due to its huge bandwidth, optical fibre is currently widely deployed to provide a variety of telecommunications services and applications. Wavelength-division multiplexing (WDM) has emerged as the technology of choice to harness the huge bandwidth available in an optical fibre. Traffic grooming supports efficient utilization of network resources by allowing sub-wavelength granularity connections to be groomed onto a single lightpath. Fault-tolerance for WDM networks is a major architectural and design issue as a single link failure can cause loss of an enormous amount of information. However, providing 100% guaranteed resilience to all types of traffic supported by existing and future networks may be unnecessary and wasteful in terms of resource utilization and cost efficiency. This chapter investigates the problem of dynamic traffic grooming for WDM networks under a differentiated resilience scheme. We propose two differentiated resilience schemes at different grooming levels— Differentiated Resilience at Lightpath (DRAL) level scheme, and Differentiated Resilience at Connection (DRAC) level scheme. These schemes explore different ways of provisioning backup paths and tradeoff between bandwidth efficiency and the number of required grooming ports. Both schemes support three resilience classes: dedicated protection, shared protection, and restoration. Simulation is carried out to evaluate and compare the two differentiated resilience schemes. Simulation results show that the DRAL scheme is not very sensitive to the changes in the number of grooming ports, while the DRAC scheme utilizes grooming ports more aggressively as it trades grooming ports for bandwidth efficiency in routing and grooming.

Multicast routing and wavelength assignment with delay constraint in WDM networks with sparse wavelength conversions

2009 ◽  
Vol 19 (2) ◽  
pp. 144-154 ◽  
Author(s):  
Qiwu Wu ◽  
Xianwei Zhou ◽  
Jianping Wang ◽  
Zhizhong Yin ◽  
Lin Lin
Keyword(s):  
Multicast Routing ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Wdm Networks ◽  
Delay Constraint

Dynamic routing and wavelength assignment for efficient traffic grooming

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Neeraj Mohan ◽  
Priyanka Kaushal
Keyword(s):  
Optical Networks ◽  
Resource Utilization ◽  
Wavelength Division Multiplexing ◽  
Computer Network ◽  
Blocking Probability ◽  
Traffic Grooming ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Dynamic Traffic ◽  
Network Efficiency

AbstractThe routing and wavelength assignment (RWA) schemes play an important role in all computer networks. The performance of a computer network and resource utilization largely depend on the RWA. The demand for higher bandwidth is increasing with each passing day, so more efficient RWA schemes need to be devolved to cater the increasing requirements. RWA becomes more challenging for dynamic traffic as the nature and flow of data are not known in advance. In this paper, a dynamic RWA scheme has been proposed for establishing a path in optical networks. The proposed scheme is based upon dynamic conversion sensing algorithm. It can be applied on a number of different network topologies. The proposed scheme is dynamic in nature, which is significantly useful for dynamic traffic grooming. The proposed scheme has been applied on 14 nodes National Science Foundation Network (NFSNet). Simulation results have shown that the blocking probability of this scheme is very low as compared to the existing schemes. So, the proposed dynamic RWA scheme enhances the network efficiency. It is useful for congestion hit networks. The reduced blocking probability in wavelength division multiplexing optical networks leads to better resource utilization and enhanced performance.

Sign in / Sign up

Export Citation Format

Share Document