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

Abstract

The need for on-demand provisioning of wavelength-routed channels with service-differentiated offerings within the transport layer has become more essential because of the recent emergence of high bit rate Internet protocol (IP) network applications. Diverse optical transport network architectures have been proposed to achieve the above requirements. This approach is determined by fundamental advances in wavelength division multiplexing (WDM) technologies. Because of the availability of ultra long-reach transport and all-optical switching, the deployment of all-optical networks has been made possible. The concurrent transmission of multiple streams of data with the assistance of special properties of fiber optics is called WDM. The WDM network provides the capability of transferring huge amounts of data at high speeds by the users over large distances. There are several network applications that require the support of QoS multicast, such as multimedia conferencing systems, video-on-demand systems, real-time control systems, etc. In a WDM network, the route decision and wavelength assignment of lightpath connections are based mainly on the routing and wavelength assignment (RWA). The multicast RWA's task is to maximize the number of multicast groups admitted or minimize the call-blocking probability. The dynamic traffic-grooming problem in wavelength-routed networks is generally a two-layered routing problem in which traffic connections are routed over lightpaths in the virtual topology layer and lightpaths are routed over physical links in the physical topology layer. In this paper, a multicast RWA protocol for capacity improvement in WDM networks is designed. In the wavelength assignment technique, paths from the source node to each of the destination nodes and the potential paths are divided into fragments by the junction nodes and these junction nodes have the wavelength conversion capability. By using the concept of fragmentation and grouping, the proposed scheme can be generally applied for the wavelength assignment of multicast in WDM networks. An optimized dynamic traffic grooming algorithm is also developed to address the traffic grooming problem in mesh networks in the multicast scenario for maximizing the resource utilization and minimizing the blocking probability.

Design of light-tree based multicast traffic grooming in WDM mesh networks

“…Guo et al [16] proposed a new multicast multi-granular grooming approach to perform the hierarchical sequential grooming to improve the joint performances of integrated auxiliary grooming graph (IAGG) which supports both multicast traffic grooming and multicast waveband grooming. Kaliammal and Gurusamy [17] used the concept of fragmentation and grouping for the assignment of wavelength in multicast capable WDM networks and proposed an optimized dynamic traffic grooming algorithm for maximizing the resource utilization and minimizing the blocking probability. Khalil et al [18] presented a different routing scheme to efficiently groom low speed connections on the light-tree based logical topology using dynamic multicast traffic grooming in WDM mesh networks.…”

“…In WDM network without wavelength conversion, the same wavelength is assigned to each fiber link along the lightpath, which is referred to as wavelength continuity constraint. A virtual topology (logical layer) can be either formed by set of lightpaths [3][4][5][6][7][8][9][10] or light-trees [11][12][13][14][15][16][17][18][19][20]. A lightpath is an all optical communication channel which passes through all intermediate nodes between single source and single destination node without OEO (Optical Electrical Optical) conversion.…”

Multicast protection and grooming scheme in survivable WDM optical networks

“…The authors in [4] proposed a light-tree based ILP formulation which minimized the network cost associated with network resources such as higher layer electronic ports and number of wavelengths used in a static traffic scenario. The concept of fragmentation and grouping for the assignment of wavelength in multicast capable WDM networks with dynamic traffic grooming algorithm is proposed in [31] for maximizing the resource utilization and minimizing the blocking probability. Although traffic grooming and survivability have been studied extensively in the past decades, survivability of traffic grooming remains relatively an unexplored issue, only gaining attention recently.…”

A reconstructing approach to end‐to‐end network traffic based on multifractal wavelet model

“…Lin et al [28] propose an efficient traffic control technique to reduce the bottleneck problem of networks. And, Kaliammal et al [29] study dynamic traffic grooming issues in WDM networks.…”