Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Many-to-Many Traffic Grooming in WDM Networks

Not Accessible

Your library or personal account may give you access

Abstract

A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group communication, a session consists of a group of users (we refer to them as members), where each member transmits its traffic to all other members in the same group. In this paper, we address the problem of many-to-many traffic grooming in WDM mesh networks. In this problem, a set of many-to-many session requests, each with an arbitrary subwavelength traffic demand, is given and the objective is to provision the sessions on the WDM network with the minimum network cost. The cost of a WDM network is dominated by the cost of higher-layer electronic ports (we refer to them as transceivers). Therefore, our objective is to minimize the total number of transceivers used. We address the problem in both nonsplitting networks, where the nodes do not have optical splitting capabilities, and in splitting networks, where the nodes do have optical splitting capabilities. First, we formulate the problem in each of the two networks as a mixed integer linear program (MILP). Afterwards, based on observations from optimal solutions, we develop a heuristic approach for each network by relaxing and simplifying its corresponding MILP. Through extensive experiments, we verify the accuracy of our proposed heuristics and also show when each of the two networks is a more cost-effective choice for many-to-many traffic grooming.

© 2009 Optical Society of America

Full Article  |  PDF Article
More Like This
Multicast Traffic Grooming in Tap-and-Continue WDM Mesh Networks

Rongping Lin, Wen-De Zhong, Sanjay Kumar Bose, and Moshe Zukerman
J. Opt. Commun. Netw. 4(11) 918-935 (2012)

Dynamic Multicast Traffic Grooming in Optical WDM Mesh Networks: Lightpath Versus Light-Tree

Xiaojun Yu, Gaoxi Xiao, and Tee-Hiang Cheng
J. Opt. Commun. Netw. 5(8) 870-880 (2013)

Clustering Methods for Hierarchical Traffic Grooming in Large-Scale Mesh WDM Networks

Bensong Chen, George N. Rouskas, and Rudra Dutta
J. Opt. Commun. Netw. 2(8) 502-514 (2010)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (5)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (9)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (53)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved