Message-Efficient Dissemination for Loop-Free Centralized Routing

Loading...
Thumbnail Image
Penn collection
Departmental Papers (ESE)
Degree type
Discipline
Subject
Network
Routing
Loops
Graph
Complexity
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Peterson, Haldane
Chandrashekar, Jaideep
Gao, Lixin
Zhang, Zhi-Li
Contributor
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.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2008-06-07
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Reprinted from ACM Computer Communication Review, Volume 38, Issue 3, July 2008, pp. 65-74. Publisher URL: http://doi.acm.org/10.1145/1384609.1384616
Recommended citation
Collection