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)
On hierarchical traffic grooming in WDM networks
IEEE/ACM Transactions on Networking (TON)
Grooming of multicast sessions in metropolitan WDM ring networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and provisioning of WDM networks for many-to-many traffic grooming
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
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
Approximation algorithms for many-to-many traffic grooming in optical WDM networks
IEEE/ACM Transactions on Networking (TON)
| 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 sub-wavelength many-to-many traffic (e.g., OC-3) into high-bandwidth wavelength channels (e.g., OC-192) in WDM mesh networks. The cost of a 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. For a number of special cases where the many-to-many traffic grooming problem is tractable, we efficiently derive the optimal solution, while in the general case, we introduce two novel approximation algorithms. 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 two algorithms use a number of lightpaths that is very close to that of a derived lower bound. Also, we compare the two algorithms on the several costs mentioned in the paper including the number of lightpaths and the number of wavelengths used.