2008 IEEE International Conference on Communications
This paper addresses the problem of on-line traffic grooming in WDM paths. Each request consists of a source node, a destination node, and the desired bandwidth for the connection. Connections may be multi-hop, permitting the use of multiple lightpaths. We describe a new distributed on-line algorithm for this problem that is provably wide-sense non-blocking under cer- tain assumptions. Moreover, we use simulations to demonstrate that the algorithm is extremely effective even when some of these assumptions are relaxed.
© the authors
Crouser, R. Jordan; Rice, Brian; Sampson, Adrian; and Libeskind-Hadas, Ran, "On-Line Distributed Traffic Grooming" (2008). Computer Science: Faculty Publications, Smith College, Northampton, MA.