Design of Survivable Networks Based on p-Cycles
| Autor: | Gangxiang Shen, Matthieu Clouqueur, John Doucette, Dion Leung, Wayne D. Grover, Anthony Sack, Adil Kodian |
|---|---|
| Rok vydání: | 2008 |
| Předmět: | |
| Zdroj: | Handbook of Optimization in Telecommunications ISBN: 9780387306629 Handbook of Optimization in Telecommunications |
| DOI: | 10.1007/978-0-387-30165-5_16 |
| Popis: | p-Cycles are a recently discovered and promising new paradigm for surviv-able networking. p-Cycles simultaneously provide the switching speed and simplicity of rings with the much greater capacity-efficiency and flexibility for reconfiguration of a mesh network. p-Cycles also permit shortest-path routing of working paths (as opposed to ring-constrained working path routing), which adds further to network capacity efficiency. Operationally p-cycles are similar to BLSRs in that, upon failure, switching actions are required at only two nodes and both those nodes are fully pre-planned as to the actions that are required for any failure detected at their sites. With the optimization models in this chapter, entire survivable transport networks can be easily designed with essentially the same spare to working capacity (redundancy) ratios as optimized span-restorable mesh networks. p-Cycles thus bridge the ring versus mesh debate that dominated work in survivable networks through the 1990s and provide the best of both worlds: the efficiency of mesh with the speed of rings. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|