Traffic Grooming Algorithm Using Shortest EDPs Table in WDM Mesh Networks
نویسندگان
چکیده
In optical networks with huge transmission capability, Wavelength Division Multiplexing (WDM) has been actively studied in the research community. Traffic grooming technology based on divided bandwidth of a wavelength by WDM is very important for the network cost. This paper proposes a traffic grooming algorithm that employs the table for shortest Edge Disjoint Paths (EDPs) with clever selection on demands. Comprehensive simulations in various network environments show that the proposed algorithm outperforms well-known Maximizing Resource Utilization (MRU) up to 15% for the network throughput and up to 17% for the running time.
منابع مشابه
Traffic Grooming Based on Shortest Path in Optical WDM Mesh Networks
This paper investigates the static traffic grooming in WDM optical mesh networks. Our objective is to improve the network throughput and to minimize the blocking probability. As take care of this problem efficiently, we propose Shortest-path First Traffic grooming(SFT) algorithm. The comprehensive computer simulation shows that our proposed algorithm is up to about 14% superior to the existing ...
متن کاملOptical WDM Networks: Traffic Grooming in Mesh Networks and Metro Networks using ROADMs
Optical Fiber technology employing wavelength-division multiplexing (WDM) has and continues to be investigated and commercially deployed to meet our ever-increasing bandwidth demands. WDM partitions the huge bandwidth of an optical fiber into many non-overlapping wavelength channels, each of which can operate at the data rate of 10 Gbps (or 40 Gbps or higher). This dissertation investigates des...
متن کاملDynamic traffic grooming in WDM mesh networks using a novel graph model
As our fiber-optic backbone networks migrate from interconnected SONET rings to arbitrary mesh topology, traffic grooming on WDM mesh networks becomes an extremely important research problem. (Traffic grooming refers to the problem of efficiently packing a set of low-speed connection requests onto high-capacity channels.) To address this problem, we employ a new, generic graph model for dynamic...
متن کاملDynamic Traffic Grooming using Fixed-Alternate Routing in WDM Mesh Optical Networks
There is a mismatch between lightpath channel capacity and traffic request capacity in wavelength division multiplexed (WDM) optical mesh networks. Traffic grooming is needed to resolve this mismatch in an efficient way. We study the dynamic traffic grooming problem in WDM mesh networks using the fixed-alternate routing (FAR) approach. Based on the FAR approach, we propose the fixed-order groom...
متن کاملTraffic Engineering in Multi-Granularity, Heterogeneous, WDM Optical Mesh Networks Through Dynamic Traffic Grooming
In this paper, we investigate the problem of efficiently provisioning connections of different bandwidth granularities in a heterogeneous WDM mesh network through dynamic traffic-grooming schemes under traffic-engineering (TE) principles. Due to the huge amount of traffic a WDM backbone network can support and the large geographic area it can cover, constructing and upgrading such an optical WD...
متن کامل