On the tradeoffs between path computation efficiency and information abstraction in optical mesh networks

Distributed, IP-based control architecture has been proposed for switched optical mesh 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 also offers ch...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2004 IEEE Itnernational Conference on Communications Ročník 3; s. 1684 - 1688
Hlavní autoři: Hang Liu, Bouillet, E., Pendarakis, D., Komaee, N., Labourdette, J.-F., Chaudhuri, S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Piscataway, New Jersey IEEE 2004
Témata:
Access methods and protocols, osi model
Applied sciences
Computer networks
Conferences
Distributed control
Exact sciences and technology
Intelligent networks
Mesh networks
Optical computing
Optical control
Optical fiber communications
Optical fiber networks
optical networks
Optical receivers
Optical telecommunications
path computation algorithms
Protection
shared mesh restoration
Signal restoration
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Performance evaluation
Meshed network
Scalability
Transmission protocol
Abstracting
Resource sharing
Algorithm
Flexibility
Interoperability
Optical fiber network
Algorithm performance
Optical switching
Information network
Heuristic method
Optical fiber communication
Routing protocols
Information exchange
ISBN:0780385330, 9780780385337
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Distributed, IP-based control architecture has been proposed for switched optical mesh 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 also offers challenges to path computation, especially for shared mesh restored paths, because of the summarization of link state information disseminated by the routing protocol. This paper discusses the tradeoffs between the path computation efficiency and the abstraction level of link state information. Several heuristic algorithms for computing shared mesh restored paths are described, which require different levels of abstraction and summarization of link resource sharing information. The performance of these algorithms is compared in term of the efficiency of network capacity utilization, the computation complexity, and the amount of required network information. We show that with appropriately aggregated link state information the proposed path computation algorithms are able to utilize the network resource very efficiently.
ISBN:0780385330
9780780385337
DOI:10.1109/ICC.2004.1312796