Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
463579 | Optical Switching and Networking | 2015 | 15 Pages |
Abstract
This paper investigates approaches for the traffic grooming problem that consider connection holding-times and bandwidth availability. Moreover, solutions can indicate the splitting of connections into two or more sub-streams by multipath routing and fine-tuned by traffic grooming to utilize network resources better. Algorithms are proposed and the results of simulations using a variety of realistic scenarios indicate that the proposed algorithms significantly reduce the blocking of connection requests yet promote a fair distribution of the network resources in relation to the state-of-the-art solutions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Juliana de Santi, André C. Drummond, Nelson L.S. da Fonseca, Xiaomin Chen,