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

—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...

• Type: Conference
• Year: 2008
• Where: LCN
• Authors: Long Long, Ahmed E. Kamal
• Keywords: Computer Networks, LCN 2008, Many-to-many, Minimum Cost, Network Coding