The case for separating routing from routers
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Two Routing Algorithms for Failure Protection in IP Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
A clean slate 4D approach to network control and management
ACM SIGCOMM Computer Communication Review
Achieving convergence-free routing using failure-carrying packets
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
IGP link weight assignment for operational Tier-1 backbones
IEEE/ACM Transactions on Networking (TON)
Improving service differentiation in IP networks through dual topology routing
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Message-efficient dissemination for loop-free centralized routing
ACM SIGCOMM Computer Communication Review
Tesseract: a 4D network control plane
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
On the impact of layer-2 on node degree distribution
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Data-driven network connectivity
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
On the feasibility and efficacy of protection routing in IP networks
IEEE/ACM Transactions on Networking (TON)
Selecting shorter alternate paths for tunnel-based IP Fast ReRoute in linear time
Computer Networks: The International Journal of Computer and Telecommunications Networking
Permutation routing for increased robustness in IP networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Joint coverage and link utilization for fast IP local protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ensuring connectivity via data plane mechanisms
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options can be activated, while waiting for an update from the centralized server after the failure of an individual component (link or node). We provide analytical insight into the feasibility of such backups as a function of network structure, and quantify their computational complexity. We also develop an efficient heuristic reconciling protectability and performance, and demonstrate its effectiveness in a broad range of scenarios. The results should facilitate deployments of centralized routing solutions.