Name
Abstract | ||
|---|---|---|
Waveband switching (WBS) has recently attracted attention from a wide range of industry and academia groups for its practical and hierarchial concepts in handling massive lightpaths with reduced control complexity and nodal size. Previous studies demonstrate that non-uniform waveband switching, in which wavebands contain various number of wavelengths, can provide more flexibility for wavelength grouping thus achieving more port saving. In this work, for the first time, we model the non-uniform waveband switching problem in a mesh topology with static off-line traffic, by using Integer Liner Programming (ILP) formulations. As an optimal approach, the proposed ILP model takes routing, wavelength grouping, traffic demands and non-uniform band settings into consideration. In the cases that the optimal ILP becomes intractable, we develop an efficient heuristic called simulated non-uniform waveband assignment (SNWS). Our simulations and analysis show that the proposed heuristic SNWS can achieve smaller port count than the existing near-optimal uniform waveband switching scheme. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/GLOCOM.2009.5426287 | GLOBECOM |
Keywords | Field | DocType |
telecommunication switching,simulated nonuniform waveband assignment,optimal ilp,non-uniform band setting,nonuniform band settings,multi-granular optical network,optical fibre networks,mesh topology,nonuniform waveband switching,integer liner programming,integer programming,telecommunication network topology,linear programming,waveband switching,efficient heuristic,non-uniform waveband,static off-line traffic,existing near-optimal uniform waveband,routing,proposed ilp model,multi-granular optical networks,non-uniform waveband switching,telecommunication traffic,simulated non-uniform waveband assignment,optimal approach,traffic demands,wavelength grouping,optical switches,mathematical model | Integer,Mesh networking,Heuristic,Optical switch,Computer science,Computer network,Peer to peer computing,Integer programming,Linear programming,Control complexity | Conference |
ISSN | ISBN | Citations |
1930-529X | 978-1-4244-4148-8 | 2 |
PageRank | References | Authors |
0.39 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yang Wang | 1 | 102 | 12.48 |
| Xiaojun Cao | 2 | 530 | 74.55 |