IEEE/ACM Transactions on Networking (TON)
Cost-effective traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers
Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers
On hierarchical traffic grooming in WDM networks
IEEE/ACM Transactions on Networking (TON)
Grooming of non-uniform traffic on unidirectional and bidirectional rings
Computer Communications
Grooming of multicast sessions in metropolitan WDM ring networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithms for many-to-many traffic grooming in WDM mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Design and provisioning of WDM networks with many-to-many traffic grooming
IEEE/ACM Transactions on Networking (TON)
Algorithms for multicast traffic grooming in WDM mesh networks
IEEE Communications Magazine
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Design and provisioning of WDM networks with multicast traffic grooming
IEEE Journal on Selected Areas in Communications - Part Supplement
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
IEEE Journal on Selected Areas in Communications - Part Supplement
Many-to-one traffic grooming with aggregation in WDM networks
IEEE Journal on Selected Areas in Communications - Part Supplement
Grooming multicast traffic in unidirectional SONET/WDM rings
IEEE Journal on Selected Areas in Communications - Part Supplement
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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 grooming subwavelength many-to-many traffic (e.g., OC-3) into high-bandwidth wavelength channels (e.g., OC-192) in optical wavelength division multiplexing (WDM) mesh networks. The cost of an optical WDM network is dominated by the cost of higher-layer electronic ports (i.e., transceivers). A transceiver is needed for each initiation and termination of a lightpath. Therefore, our objective is to minimize the total number of lightpaths established. Unfortunately, the grooming problem even with unicast traffic has been shown to be NP-hard. In this paper, we introduce two novel approximation algorithms for the many-to-many traffic grooming problem. We also consider the routing and wavelength assignment problem with the objective of minimizing the number of wavelengths used. Through extensive experiments, we show that the proposed algorithms use a number of lightpaths that is very close to that of a derived lower bound. Also, we compare the two algorithms on other important objectives such as the number of logical hops traversed by a traffic stream, total amount of electronic switching at a node, and Min-Max objectives.