In search of path diversity in ISP networks
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
TIE breaking: tunable interdomain egress selection
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Providing public intradomain traffic matrices to the research community
ACM SIGCOMM Computer Communication Review
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ICDMW '08 Proceedings of the 2008 IEEE International Conference on Data Mining Workshops
Impact of hot-potato routing changes in IP networks
IEEE/ACM Transactions on Networking (TON)
ClubMED: coordinated multi-exit discriminator strategies for peering carriers
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Routing games for traffic engineering
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Peering equilibrium multipath routing: a game theory framework for internet peering settlements
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
It is generally admitted that Inter-domain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, which use independent and "selfish" routing policies. We are interested in identifying possible "light" coordination strategies, that would allow carriers to better control their peering links, while preserving their independence and respective interests. We propose a robust multi-path routing coordination framework for peering carriers, which relies on the MED attribute of BGP as signalling medium. Our scheme relies on a game theoretic modelling, with a non-cooperative potential game considering both routing and congestions costs. Peering Equilibrium MultiPath (PEMP) coordination policies can be implemented by selecting Pareto-superior Nash equilibria at each carrier. We compare different PEMP policies to BGP Multipath schemes by emulating a realistic peering scenario. Our results show that the routing cost can be decreased by roughly 10% with PEMP. We also show that the stability of routes can be significantly improved and that congestion can be practically avoided on the peering links.