A new approach for designing fault-tolerant WDM 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
A novel graph model for dynamic multicast flow aggregation in optical networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
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)
Two-layer mesh network optimization based on inter-layer decomposition
Photonic Network Communications
Approximation algorithms for many-to-many traffic grooming in optical WDM networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper we consider the optimal design and provisioning of WDM networks for the grooming of multicast subwavelength traffic. We develop a unified framework for the optimal provisioning of different practical scenarios of multicast traffic grooming. We also introduce heuristic solutions. Optimal solutions are designed by exploiting the specifies of the problems to formulate Mixed Integer Linear Programs (MILPs). Specifically, we solve the generic multicast problem in which, given a set of multicast sessions and all destination nodes of a multicast session requiring the same amount of traffic, all demands need to be accommodated. The objective is to minimize the network cost by minimizing the number of higher layer electronic equipment and, simultaneously, minimizing the total number of wavelengths used. We also solve two interesting and practical variants of the traditional multicast problem, namely, multicasting with partial destination set reachability and multicasting with traffic thinning. For both variants, we also provide optimal as well as heuristic solutions. Also, the paper presents a number of examples based on the exact and heuristic approaches