Design and provisioning of WDM networks for traffic grooming

Wavelength Division Multiplexing (WDM) is the most viable technique for utilizing the enormous amounts of bandwidth inherently available in optical fibers. However, the bandwidth offered by a single wavelength in WDM networks is on the order of tens of Gigabits per second, while most of the applications\u27 bandwidth requirements are still subwavelength. Therefore, cost-effective design and provisioning of WDM networks require that traffic from different sessions share bandwidth of a single wavelength by employing electronic multiplexing at higher layers. This is known as traffic grooming. Optical networks supporting traffic grooming are usually designed in a way such that the cost of the higher layer equipment used to support a given traffic matrix is reduced. In this thesis, we propose a number of optimal and heuristic solutions for the design and provisioning of optical networks for traffic grooming with an objective of network cost reduction. In doing so, we address several practical issues. Specifically, we address the design and provisioning of WDM networks on unidirectional and bidirectional rings for arbitrary unicast traffic grooming, and on mesh topologies for arbitrary multipoint traffic grooming. In multipoint traffic grooming, we address both multicast and many-to-one traffic grooming problems. We provide a unified frame work for optimal and approximate network dimensioning and channel provisioning for the generic multicast traffic grooming problem, as well as some variants of the problem. For many-to-one traffic grooming we propose optimal as well as heuristic solutions. Optimal formulations which are inherently non-linear are mapped to an optimal linear formulation. In the heuristic solutions, we employ different problem specific search strategies to explore the solution space. We provide a number of experimental results to show the efficacy of our proposed techniques for the traffic grooming problem in WDM networks

Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3

We consider traffic grooming in WDM unidirectional rings with all-to-all uniform unitary traffic. We determine the minimum number of SONET/SDH add-drop multiplexers (ADMs) required when the grooming ratio is 3. In fact, using tools of design theory, we solve the equivalent edge partitioning problem: find a partition of the edges of the complete graph on n vertices (K_n) into subgraphs having at most 3 edges and in which the total number of vertices has to be minimized

Traffic Grooming Pada Jaringan Ring SONET DWDM

Suatu hal yang paling menjanjikan untuk jaringan masa depan yaitu jaringan DWDM (Dense Wavelength Division Multiplexing) terutama ketika diperlukan lebar pita yang cukup besar. Kapasitas transmisi dari suatu jaringan SONET (Synchronous Optical Network) telah mengalami peningkatan secara berarti berkaitan dengan penggunaan teknologi DWDM. Traffic grooming pada jaringan ring SONET DWDM merupakan pemecahan masalah packing traffic yang berbeda kecepatan menjadi beberapa aliran trafik pada ring DWDM dengan tujuan menghemat penggunaan perangkat SONET. Traffic grooming adalah proses pengelompokan beberapa jalur telekomunikasi, yang akan menentukan penggabungan aliran-aliran trafik di setiap node. Dalam tugas akhir ini akan disimulasikan perencanaan dari jaringan transport yang didasarkan pada jaringan ring SONET DWDM. Dalam kasus ini traffic grooming akan menentukan optimalisasi perencanaan jaringan ring SONET DWDM. RWA (Routing and Wavelength Assignment) akan menempatkan rute-rute trafik ke panjang gelombang tertentu sebagai cara untuk meminimalkan biaya keseluruhan dari penggunaan perangkat SADM (SONET Add/drop Multiplexers). Dengan masukan beberapa node serta jumlah trafik tiap node, sehingga akan didapatkan suatu alur jaringan ring SONET DWDM yang optimal sebagai cara untuk meminimalkan biaya keseluruhan dari perangkat SADM. Dari hasil pengujian, dapat disimpulkan bahwa tingkat penurunan jumlah pemakaian perangkat SADM terbesar ditunjukkan pada pengujian dengan masukan 25 node dan nilai rata-rata trafik 30 Gbps yaitu sebesar 73,33 %.. Tingkat penurunan jumlah pemakaian perangkat SADM terendah ditunjukkan pada pengujian dengan masukan 20 node dan nilai rata-rata trafik 10 Gbps yaitu sebesar 50,55 %. Kata kunci : traffic grooming, RWA, SONET, DWDM

Traffic Grooming in Bidirectional WDM Ring Networks

We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor $C$ and $N$, the size of the ring. We first study exhaustively the cases $C=1$, $C = 2$, and $C=3$, providing improved lower bounds, optimal constructions for several infinite families, as well as asymptotically optimal constructions and approximations. We then study the case $C>3$, focusing specifically on the case $C = k(k+1)/2$ for some $k \geq 1$. We give optimal decompositions for several congruence classes of $N$ using the existence of some combinatorial designs. We conclude with a comparison of the cost functions in unidirectional and bidirectional WDM rings

Grooming

chapter VI.27International audienceState-of-the-art on traffic grooming with a design theory approac

Grooming of Dynamic Traffic in WDM Star and Tree Networks Using Genetic Algorithm

The advances in WDM technology lead to the great interest in traffic grooming problems. As traffic often changes from time to time, the problem of grooming dynamic traffic is of great practical value. In this paper, we discuss dynamic grooming of traffic in star and tree networks. A genetic algorithm (GA) based approach is proposed to support arbitrary dynamic traffic patterns, which minimizes the number of ADM's and wavelengths. To evaluate the algorithm, tighter bounds are derived. Computer simulation results show that our algorithm is efficient in reducing both the numbers of ADM's and wavelengths in tree and star networks.Comment: 15 page