Proceedings ArticleDOI
Traffic grooming for survivable WDM mesh networks
Sashisekaran Thiagarajan,Arun K. Somani +1 more
- Vol. 4599, pp 54-65
Reads0
Chats0
TLDR
A dynamic algorithm to obtain the optimal spare capacity on a wavelength on a link when a number of backup traffic streams are multiplexed onto it is presented.Abstract:
This paper addresses the problem of dynamically establishing dependable low-rate traffic stream connections in WDM mesh networks with traffic grooming capabilities. To establish a dependable connection, we set up link-disjoint primary and backup traffic stream paths between the source and destination and use backup multiplexing to reduce the overhead of backup traffic streams. We present a dynamic algorithm to obtain the optimal spare capacity on a wavelength on a link when a number of backup traffic streams are multiplexed onto it. We propose two schemes for grooming traffic streams onto wavelengths: Mixed Primary-Backup Grooming Policy (MGP) and Segregated Primary-Backup Grooming Policy (SGP). We illustrate how these schemes can be applied in a WDM mesh network scenario along with a routing and wavelength assignment algorithm. We conduct simulation experiments to evaluate the effectiveness of the proposed schemes on different network topologies, using different routing and wavelength assignment methods. The effect of change in granularity and change in the number of alternate paths on the grooming policies are also presented. From the simulation results, it is inferred that SGP is useful in network topologies, such as mesh-torus, characterized by good connectivity and a good amount of traffic switching and mixing at the nodes. On the other hand, MGP is useful in network topologies, such as a ring, characterized by low connectivity and high load correlation.read more
Citations
More filters
Journal ArticleDOI
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
TL;DR: A new generic graph model for traffic grooming in heterogeneous WDM mesh networks, based on the auxiliary graph, is proposed which can achieve various objectives using different grooming policies, while taking into account various constraints such as transceivers, wavelengths, wavelength-conversion capabilities, and grooming capabilities.
Journal ArticleDOI
Traffic grooming for survivable WDM networks - shared protection
TL;DR: This work investigates the survivable traffic-grooming problem for optical mesh networks employing wavelength-division multiplexing (WDM), and proposes effective heuristics for grooming a connection request with shared protection.
Journal ArticleDOI
Shared Sub-Path Protection Algorithm in Traffic-Grooming WDM Mesh Networks
TL;DR: The results show that SSPP can make the tradeoffs between resource utilization and restoration time, and based on dynamic traffic with different load, the performance of S SPP has been investigated via simulations.
Journal ArticleDOI
Optical Network Design for a Multiline-Rate Carrier-Grade Ethernet Under Transmission-Range Constraints
TL;DR: An auxiliary graph is constructed, called mixed topology (MT), using which it is possible to identify traffic grooming possibilities and select a path which requires the minimum amount of 3R regeneration and effectively choose the data rate of the channel to be established.
Journal ArticleDOI
Traffic engineering in next-generation optical Networks
TL;DR: In this article traffic-engineering issues regarding network survivability, traffic grooming, impairment-aware routing, virtual-topology engineering, and coordination among multiple layers of network architecture will be reviewed for next-generation optical networks based on wavelength-division multiplexing (WDM).
References
More filters
Performance of Alternate Routing Methods in All-Optical Switching Networks
TL;DR: In this article, the authors considered an alternate routing method with limited trunk reservation in which connections with more hops are prepared more alternate routes, and they showed that their method keeps good performance when compared with the existing alternate routing methods.
Proceedings ArticleDOI
Wavelength assignment in fixed routing WDM networks
TL;DR: A new algorithm for the dynamic centralized wavelength assignment problem in fixed-routing WDM networks without wavelength conversion is proposed and an earlier analytical model for predicting the blocking probability with and without wavelength Conversion to dense multi-fiber networks is extended.
Proceedings ArticleDOI
An adaptive routing algorithm for wavelength-routed optical networks with a distributed control scheme
Jason P. Jue,Gaoxi Xiao +1 more
TL;DR: A distributed control scheme which utilizes a new adaptive routing approach called alternate-link routing, where routing decisions for a light path are made adaptively on a hop-by-hop basis by individual nodes in a distributed manner is considered.
Related Papers (5)
A Review of Traffic Grooming in WDM Optical Networks: Architectures and Challenges
Keyao Zhu,Biswanath Mukherjee +1 more