作者
Sundar Iyer, Supratik Bhattacharyya, Nina Taft, Christophe Diot
发表日期
2003/3/30
研讨会论文
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No. 03CH37428)
卷号
1
页码范围
406-416
出版商
IEEE
简介
Shortest path routing protocols may suffer from congestion due to the use of a single shortest path between a source and a destination. The goal of our work is to first understand how links become overloaded in an IP backbone, and then to explore if the routing protocol, -either in its existing form, or in some enhanced form could be made to respond immediately to overload and reduce the likelihood of its occurrence. Our method is to use extensive measurements of Sprint's backbone network, measuring 138 links between September 2000 and June 2001. We find that since the backbone is designed to be overprovisioned, link overload is rare, and when it occurs, 80% of the time it is caused due to link failures. Furthermore, we find that when a link is overloaded, few (if any) other links in the network are also overloaded. This suggests that deflecting packets to less utilized alternate paths could be an effective method …
引用总数
200220032004200520062007200820092010201120122013201420152016201720182019202020212022202321116151620171313613891331461213
学术搜索中的文章
S Iyer, S Bhattacharyya, N Taft, C Diot - IEEE INFOCOM 2003. Twenty-second Annual Joint …, 2003