TY - GEN
T1 - TIE breaking
T2 - 1st International Conference on Emerging Networking Experiments and Technologies, CoNEXT'05
AU - Teixeira, Renata
AU - Griffin, Timothy G.
AU - Resende, Mauricio G.C.
AU - Rexford, Jennifer L.
PY - 2005
Y1 - 2005
N2 - The separation of intradomain and interdomain routing has been a key feature of the Internet's routing architecture from the early days of the ARPAnet. However, the appropriate "division of labor" between the two protocols becomes unclear when an Autonomous System (AS) has interdomain routes to a destination prefix through multiple border routers-a situation that is extremely common today because neighboring domains often connect in several locations. We believe that the current mechanism of early-exit or hot-potato routing-where each router in an AS directs traffic to the "closest" border router based on the intradomain path costs-is convoluted, restrictive, and sometimes quite disruptive. In this paper, we propose a flexible mechanism for routers to select the egress point for each destination prefix, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. We present one example optimization problem that uses integer-programming techniques to tune our mechanism to improve network robustness. Experiments with topology and routing data from two backbone networks demonstrate that our solution is both simple (for the routers) and expressive (for the network administrators).
AB - The separation of intradomain and interdomain routing has been a key feature of the Internet's routing architecture from the early days of the ARPAnet. However, the appropriate "division of labor" between the two protocols becomes unclear when an Autonomous System (AS) has interdomain routes to a destination prefix through multiple border routers-a situation that is extremely common today because neighboring domains often connect in several locations. We believe that the current mechanism of early-exit or hot-potato routing-where each router in an AS directs traffic to the "closest" border router based on the intradomain path costs-is convoluted, restrictive, and sometimes quite disruptive. In this paper, we propose a flexible mechanism for routers to select the egress point for each destination prefix, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. We present one example optimization problem that uses integer-programming techniques to tune our mechanism to improve network robustness. Experiments with topology and routing data from two backbone networks demonstrate that our solution is both simple (for the routers) and expressive (for the network administrators).
KW - BGP
KW - Egress-point selection
UR - http://www.scopus.com/inward/record.url?scp=48349142167&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=48349142167&partnerID=8YFLogxK
U2 - 10.1145/1095921.1095935
DO - 10.1145/1095921.1095935
M3 - Conference contribution
AN - SCOPUS:48349142167
SN - 159593197X
SN - 9781595931979
T3 - CoNEXT 2005 - Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology
SP - 93
EP - 104
BT - CoNEXT 2005 - Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology
Y2 - 24 October 2005 through 27 October 2005
ER -