Robust routing in networks with time-varying links
Article No.: 71, Pages 1 - 2
Abstract
In this work we consider the problem of routing in networks with time-varying links. We focus on wireless and mobile ad-hoc networks where link changes occur at the timescale of seconds to minutes. Since links are changing, to maintain network connectivity paths must be periodically recomputed, incurring increased control overhead. Suppose, however, we can perform routing in such a way that paths are "robust" to link changes in the network: i.e., link changes may occur, but paths still perform well enough. Then paths can be recomputed less frequently and the control overhead decreased. In this work we specifically examine the problem of how to perform such "robust" routing.
References
[1]
H. Han, S. Shakkottai, C. V. Hollot, R. Srikant, and D. Towsley, "Multi-path tcp: A joint congestion control and routing scheme to exploit path diversity on the internet," IEEE/ACM Transactions on Networking, vol. 14:6, 2006.
[2]
C. J. Colbourn, The Combinatorics of Network Reliabiilty. New York: Oxford University Press, 1987.
[3]
L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Transactions on Automatic Control, vol. 37:12, 1992.
Recommendations
Dynamics of hot-potato routing in IP networks
SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systemsDespite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, ...
Comments
Information & Contributors
Information
Published In
December 2007
448 pages
Copyright © 2007 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Alcatel-Lucent
- SIGCOMM: ACM Special Interest Group on Data Communication
- Thomson
- CISCO
- IMDEA
- IBM: IBM
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 10 December 2007
Check for updates
Qualifiers
- Research-article
Acceptance Rates
Overall Acceptance Rate 198 of 789 submissions, 25%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 86Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in