Name
Abstract | ||
|---|---|---|
Optical mesh network infrastructure has emerged as the technology of choice for next-generation transport networks. At the same time, distributed, IP-based, control architecture has been proposed for intelligent optical networks, as a means to automate operations, enhance interoperability, and facilitate the deployment of new applications. While distributed control in general enhances scalability and flexibility, it has also been observed that the requisite network topology and link-state information summarization may result in suboptimal path computation, especially for shared mesh restored paths. This paper presents a distributed control plane for optical mesh networks, focusing on distributed path computation and provisioning mechanisms. It discusses the tradeoffs between the path computation efficiency for shared mesh restored paths and the amount of network topology and link-state information that is disseminated via routing protocols. We show that with appropriately aggregated link resource availability and sharing information, the proposed distributed path computation algorithms are able to determine the shareability of restoration links with remarkable accuracy. A local channel assignment scheme, which is used in conjunction with the distributed path computation algorithms to assign shared channels when provisioning restoration paths, is also proposed. The additional information that signaling messages are required to carry in order to perform the local channel assignment at each node along the restoration path is discussed. Furthermore, we specify the extensions to the open shortest-path first (OSPF) routing protocol in support of shared mesh restoration. We analyze the performance of the proposed distributed path computation algorithms and the local channel assignment scheme, as well as the overhead of OSPF extensions. In particular, we study the tradeoffs between network capacity utilization, restoration path computation complexity, OSPF extension overhead, and memory requirements for storing the modified link-state database. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/JSAC.2004.833836 | IEEE Journal on Selected Areas in Communications |
Keywords | Field | DocType |
network capacity,shared mesh restored path,ip networks,optical mesh network infrastructure,restoration path,path computation algorithm,suboptimal path computation,path computation,optical fibre networks,distributed path computation algorithm,route computation,open shortest-path first routing protocol,path computation algorithms,distributed ip-based control architecture,photonic switching systems,network topology,shared mesh,distributed control,telecommunication network topology,65,channel allocation,computational complexity,network protection and restoration,network protection,modified link-state database,optical network,internet,ospf,distributed control plane,intelligent networks,routing protocols,optical networks,routing,intelligent network,path computation efficiency,local channel assignment scheme,restoration path computation complexity,shared mesh optical networks,link-state information summarization,optical mesh network,next-generation transport network,signaling message,routing protocol,open shortest path first,mesh network | Open Shortest Path First,Switched mesh,Optical mesh network,Computer science,Computer network,Network topology,Intelligent Network,Shared mesh,Distributed computing,Routing protocol,Scalability | Journal |
Volume | Issue | ISSN |
22 | 9 | 0733-8716 |
Citations | PageRank | References |
4 | 0.63 | 9 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hang Liu | 1 | 835 | 90.79 |
| E. Bouillet | 2 | 86 | 7.41 |
| D. Pendarakis | 3 | 116 | 11.85 |
| N. Komaee | 4 | 4 | 0.97 |
| J. -F. Labourdette | 5 | 36 | 4.08 |
| S. Chaudhuri | 6 | 4 | 0.63 |