Reducing network cost of many-to-many communication in unidirectional WDM rings with network coding

Abstract

Abstract-In this 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 un-hubbed 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.

Approximation Algorithms for Many-to-Many Traffic Grooming in Optical WDM Networks

“…To the best of our knowledge, many-to-many traffic grooming is a new research problem that has been only considered in [17], [21], [19]. In [21], the authors addressed the many-tomany traffic grooming problem in WDM ring networks with the objective of reducing the overall network cost.…”

“…In [21], the authors addressed the many-tomany traffic grooming problem in WDM ring networks with the objective of reducing the overall network cost. In our previous works [17], [19], MILP formulations and heuristic solutions were introduced for the many-to-many traffic grooming problem in WDM mesh networks.…”