


Volume 20 No 10 (2022)
Download PDF
EFFECTIVE CALCULATION ON HEURISTICS APPROACHES FOR TRAFFIC GROOMING
Sarala D & Dr. Dayananda R. B
Abstract
In this research paper we address the problem of traffic grooming in WDM rings with all-to-all and its
generalization to many-to-many service by using network coding. We consider minimizing the number
of Line Terminating Equipment (LTE) on two types of unidirectional rings, namely, single-hub and unhubbed rings, as our objective. In single-hub rings, we investigate the minimum cost provisioning of
uniform all-to-all traffic in two cases: where network coding is used to linearly combine data, and where
it is not used and data is transmitted without coding. We generalize the service mode to many-to-many
and evaluate the cost of provisioning. In unhubbed ring, we propose a multi-hub approach to obtain the
minimum cost provisioning in the case of all-to-all and many-to-many traffic. In each type of ring
topology, two network scenarios are considered: first, the distinct communication groups in the ring are
node-disjoint and second, the different groups may have common member nodes. From our numerical
results, we find that under many-to-many traffic pattern for both scenarios, network coding can reduce
the network cost by 10-20% in single-hub rings and 1-5% in un-hubbed rings in both network scenarios.
Keywords
Traffic, Line Ending Hardware, unidirectional rings.
Copyright
Copyright © Neuroquantology
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Articles published in the Neuroquantology are available under Creative Commons Attribution Non-Commercial No Derivatives Licence (CC BY-NC-ND 4.0). Authors retain copyright in their work and grant IJECSE right of first publication under CC BY-NC-ND 4.0. Users have the right to read, download, copy, distribute, print, search, or link to the full texts of articles in this journal, and to use them for any other lawful purpose.