Abstract
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interruptions in modern networks. This has led to a renewed interest in centralized routing systems that, compared to distributed routing, can provide greater control over routing decisions and better visibility of the results. One benefit of centralized control is the opportunity to readily eliminate transient routing loops, which arise frequently after network changes because of inconsistent routing states across devices. Translating this conceptual simplicity into a solution with tolerable message complexity is non-trivial. Addressing this issue is the focus of this paper. We identify when and why avoiding transient loops might require a significant number of messages in a centralized routing system, and demonstrate that this is the case under many common failure scenarios. We also establish that minimizing the number of required messages is NP-hard, and propose a greedy heuristic that we show to perform well under many conditions. The paper's results can facilitate the deployment and evaluation of centralized architectures by leveraging their strengths without incurring unacceptable overhead.
- Albrightson, R., Garcia-Luna-Aceves, J., and Boyle, J. EIGRP--A fast routing protocol based on distance vectors. In Proc. Network/Interop (Las Vegas, NV, May 1994).Google Scholar
- Feamster, N., Balakrishnan, H., Rexford, J., Shaikh, A., and van der Merwe, K. The case for separating routing from routers. In Proc. ACM SIGCOMM Workshop on Future Directions in Network Architecture (FDNA) (Portland, OR, September 2004). Google Scholar
Digital Library
- Francois, P., and Bonaventure, O. Avoiding transient loops during the convergence of link-state routing protocols. IEEE/ACM Transactions on Networking 15, 6 (Dec. 2007), 1280--1292. Google Scholar
Digital Library
- Francois, P., Bonaventure, O., Shand, M., Bryant, S., and Privedi, S. Loop-free convergence using oFIB. Internet draft, February 2008. Work in progress, revision 02.Google Scholar
- Fu, J., Sjödin, P., and Karlsson, G. Loop-free updates of forwarding tables. Tech. rep., Royal Institute of Technology (KTH), Aug. 2007. Accepted in IEEE Transactions on Network and Service Management (TNSM). Google Scholar
Digital Library
- Garcia-Lunes-Aceves, J. J. Loop-free routing using diffusing computations. IEEE/ACM Trans. Netw. 1, 1 (February 1993), 130--141. Google Scholar
Digital Library
- Greenberg, A., Hjalmtysson, G., Maltz, D., Myers, A., Rexford, J., Xie, G., Yan, H., Zhan, J., and Zhang, H. A clean slate 4D approach to network control and management. ACM Comput. Commun. Rev. (CCR) 35, 5 (October 2005), 41--54. Google Scholar
Digital Library
- Hengartner, U., Moon, S., Mortier, R., and Diot, C. Detection and analysis of routing loops in packet traces. In IMW '02: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment (New York, NY, USA, 2002), ACM Press, pp. 107--112. Google Scholar
Digital Library
- Hochbaum, D. S. Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. In Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, Ed. PWS Publishing, 1997, ch. 3, pp. 94--143. Google Scholar
Digital Library
- Meyer, D., et al. University of Oregon Route Views project. http://www.routeviews.org.Google Scholar
- Peterson, H., Sen, S., Chandrashekhar, J., Gao, L., Guerin, R., and Zhang, Z.-L. Message-efficient dissemination for loop-free centralized routing. Tech. rep., University of Minnesota Department of Computer Science, 2008. http://www-users.cs.umn.edu/~peterson/tr-dddd-2008-01.pdf.Google Scholar
- Spring, N., Mahajan, R., Wetherall, D., and Anderson, T. Measuring ISP topologies with Rocketfuel. IEEE/ACM Transactions on Networking 12, 1 (2004), 2--16. Google Scholar
Digital Library
- Teixeira, R., Shaikh, A., Griffin, T., and Rexford, J. Dynamics of hot-potato routing in IP networks. ACM SIGMETRICS Performance Evaluation Review 32, 1 (2004), 307--319. Google Scholar
Digital Library
- Yan, H., Maltz, D. A., Ng, T. S. E., Gogineni, H., Zhang, H., and Cai, Z. Tesseract: A 4D network control plane. In Proceedings of USENIX Symposium on Networked Systems Design and Implementation (NSDI '07) (2007). Google Scholar
Digital Library
Index Terms
Message-efficient dissemination for loop-free centralized routing
Recommendations
A Simple Distributed Loop-Free Routing Strategy for Computer Communication Networks
The loops resulting from either component failures or load changes in a computercommunication network degrade the performance and the adaptability of conventionaldistributed adaptive routing strategies, such as ARPANET's previous routing strategy(APRS). ...
A journey into multicomputer routing algorithms
PAS '95: Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture SynthesisWe survey various aspects of packet routing, namely (partial) permutation, h-relation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We present theoretical results for ...
Distance routing on series parallel networks
ICDCS '96: Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)We consider the problem of routing messages on Series Parallel Graphs (SPGs) and we introduce a new technique called Distance Routing. This technique is based on the idea of encoding in the label of each node x some information about a shortest path ...





Comments