Constrained shortest path first algorithm for lambda-switched mesh optical networks with logical overlay OCh/SP rings
| Autor: | Fabrice Poppe, Guido Henri Marguerite Petit, H. De Neve |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Static routing
Computer science Equal-cost multi-path routing business.industry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Path vector protocol Private Network-to-Network Interface Link-state routing protocol Destination-Sequenced Distance Vector routing K shortest path routing business Algorithm Constrained Shortest Path First Computer network |
| Zdroj: | 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552). |
| DOI: | 10.1109/hpsr.2001.923622 |
| Popis: | We describe a constrained shortest path first (CSPF) routing algorithm for lambda-switched optical networks with logical overlay OCh/SP rings. Speed is definitely a requirement if the algorithm is to be used for lambda-switching, but several features of the network architecture complicate the routing problem. The algorithm we present in this paper meets the requirement of being fast. Moreover, the routing of a lightpath is based on a limited amount of link state information, which can be disseminated by a lightweight routing protocol. Our numerical results show that the performance of the algorithm does not improve significantly if the routing decisions are based on more detailed information about the configuration of the network. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|