Name
Abstract | ||
|---|---|---|
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 certain assumptions. Moreover, we use simulations to demonstrate that the algorithm is extremely effective even when some of these assumptions are relaxed. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICC.2008.984 | 2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13 |
Keywords | Field | DocType |
wavelength division multiplexing,traffic grooming,network topology,bandwidth | Wavelength-division multiplexing,Computer science,Computer network,Bandwidth (signal processing),Traffic grooming,Distributed computing | Conference |
ISSN | Citations | PageRank |
1550-3607 | 1 | 0.36 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Jordan Crouser | 1 | 189 | 15.89 |
| Brian Rice | 2 | 1 | 0.36 |
| Adrian Sampson | 3 | 564 | 21.82 |