Name
Abstract | ||
|---|---|---|
This paper focuses on the assignment of multiple- wavelength lightpaths and presents a computationally simple algorithm to increase the number of simultaneous lightpath assignments in optical networks. Several approaches for lightpath assignment have been proposed in the literature, and most of them involve some variation of selecting or rejecting edge-disjoint paths for lightpath allocation, fol- lowed by assigning wavelengths in order. We have developed the Hybrid algorithm which either selects or rejects an edge- disjoint path, depending on the length of that path. We show using simulations that the algorithm performs significantly better (up to ~1,300%) than the consistent selection or rejec- tion of edge-disjoint paths, and it performs comparably with (and in some cases even better than) an algorithm that makes lightpath selections dynamically based on the current net- work state. Index TermsLightpath Assignment, Routing and Wave- length Assigning. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.4304/jnw.4.1.19-29 | JNW |
Keywords | Field | DocType |
indexation,hybrid algorithm | Hybrid algorithm,Computer science,SIMPLE algorithm,Distributed computing | Journal |
Volume | Issue | Citations |
4 | 1 | 2 |
PageRank | References | Authors |
0.38 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neena R. Kaushik | 1 | 18 | 1.70 |
| Silvia M. Figueira | 2 | 320 | 75.28 |
| Stephen A. Chiappari | 3 | 20 | 3.50 |