Name
Title | ||
|---|---|---|
A routing and spectrum assignment algorithm in elastic optical network based on minimizing contiguity reduction |
Abstract | ||
|---|---|---|
AbstractElastic optical network, due to its flexibility of spectrum assignment, has been the most promising technology in the next generation of backbone transport network. Routing and spectrum assignment (RSA) is one of its key issues. Several RSA algorithms have been proposed in recent years. In the spectrum assignment process, the more contiguous the idle frequency slices, the more likely it is to find available spectrum blocks for connection requests. Therefore, in this paper, we first give the concept of link/path contiguity reduction (LCR/PCR) to express the change of spectrum contiguity on a link/path after a spectrum block is used. Then, we propose a RSA algorithm named Min-PCR-LCR, which always chooses a spectrum block with the minimum path contiguity reduction to a connection request, and if there is a tie, the one with the minimum sum of link contiguity reductions is finally chosen. Simulation results show that the Min-PCR-LCR algorithm can get lower blocking probability than the existing well-performed RSA algorithms. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s11107-019-00851-1 | Periodicals |
Keywords | Field | DocType |
Elastic optical network,Routing and spectrum assignment,Contiguity reduction,Min-PCR-LCR | Contiguity,Idle,Computer science,Contiguity (probability theory),Algorithm,Transport network | Journal |
Volume | Issue | ISSN |
38 | 1 | 1387-974X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junling Yuan | 1 | 16 | 6.52 |
| Di Zhang | 2 | 64 | 20.01 |
| Qikun Zhang | 3 | 41 | 11.70 |
| Xuhong Li | 4 | 28 | 7.56 |
| Zhongbao Ren | 5 | 0 | 0.34 |