Name
Title | ||
|---|---|---|
Adaptive Wavelength Assignment Scheme for Distributed Path Restoration in Optical Networks |
Abstract | ||
|---|---|---|
In wavelength-routed optical networks, routing and wavelength assignment (RWA) can be implemented in a dynamic and distributed way. During the distributed restoration process after a failure occurs, the concurrent reservation attempts from different original nodes may lead to collisions because they select the same wavelength with a large possibility, resulting in high recovery blocking probabilities. This paper presents a contention avoidance mechanism to improve restoration performance. With the adaptive wavelength assignment method, reservation contentions between adjacent nodes are reduced significantly and higher recovery ratio is achieved. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/PACCS.2009.15 | PACCS |
Keywords | Field | DocType |
high recovery,reservation contention,optical fibre networks,adaptive wavelength assignment method,wavelength assignment,adaptive wavelength assignment scheme,path restoration,wavelength-routed optical networks,optical networks,restoration,higher recovery ratio,contention avoidance mechanism,telecommunication network routing,routing and wavelength assignment,blocking probabilities,restoration performance,concurrent reservation attempt,distributed path restoration,restoration process,adjacent node,routing,tail,degradation,probability density function,circuits,data mining,adaptive systems | Reservation,Computer science,Routing and wavelength assignment,Computer network,Probability density function,Wavelength,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-0-7695-3614-9 | 0 | 0.34 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yining Cao | 1 | 2 | 1.42 |
| Yanhe Li | 2 | 15 | 5.58 |
| Xiaoping Zheng | 3 | 91 | 24.55 |
| Hanyi Zhang | 4 | 72 | 16.35 |