Name
Abstract | ||
|---|---|---|
The Routing and Wavelength Assignment problem is investigated in the context of collaboration where tools are shared and used simultaneously over a fiber optic network. Both online and offline versions are discussed, with and without using time as a parameter for scheduling purposes, and including the case where the network is used to carry time-multiplexed traffic. Also, the problem of rescheduling a blocked demand is studied. Several solutions based on Integer Linear Programs (ILP) and heuristics are proposed, implemented and their performance compared. The offline case is solved using two types of ILPs: link and path formulations. ILPs are also proposed for the online problem in addition to heuristic algorithms. While the link formulations give optimal solutions, they take a long time to solve and thus they can only be used for small problems. Path formulations and heuristics scale better but at the expense of optimality. The online approach is recommended when the resort to an offline approach is forbidden by the size of the problem. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s11107-010-0302-y | Photonic Network Communications |
Keywords | Field | DocType |
Collaboration,Routing and wavelength assignment,Integer linear programming,Lightpath,Scheduling | Integer,Mathematical optimization,Heuristic,Fiber-optic communication,Scheduling (computing),Computer science,Routing and wavelength assignment,Heuristics,Integer programming,Online and offline,Distributed computing | Journal |
Volume | Issue | ISSN |
22 | 1 | 1572-8188(Series Online ISSN)1387-974X(Series Print ISSN) |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yosri Harzallah | 1 | 8 | 1.37 |
| Joseph D. Horton | 2 | 80 | 5.91 |
| Bruce Spencer | 3 | 128 | 14.25 |