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)
Grooming of multicast sessions in metropolitan WDM ring networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Information Theory
Algorithms for multicast traffic grooming in WDM mesh networks
IEEE Communications Magazine
Design and provisioning of WDM networks with multicast traffic grooming
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
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
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)
| Hi-index | 0.00 |
A large number of network applications today allow several users to interact together using the many-to-many service mode. A many-to-many session consists of group of users (we refer to them as members), where each member transmits its traffic to all other members in the same group. We address the problem of designing and provisioning of WDM networks to support many-to-many traffic grooming. Our objective is to minimize the overall network cost which is dominated by the cost of transceivers and the number of wavelengths used. We consider three different WDM networks for this problem. One is the non-splitting network, where the nodes do not support optical splitting. The other two networks are the hubbed and the all-optical networks, where the nodes support optical splitting. In the hubbed network, all members in a session transmit their traffic to a designated hub node. Using the new technique of network coding, the hub then linearly combines the traffic units received and sends back to the members a set of linear combinations using light-tree(s). In the all-optical network, each member in a session transmits its traffic directly to all other members in the same session using a light-tree. A comprehensive comparison between the three networks reveals that each of the networks is a cost-effective choice for a certain range of traffic granularities.