Author:
Feigenbaum Joan,Karger David R.,Mirrokni Vahab S.,Sami Rahul
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Varadhan, K., Govindan, R., Estrin, D.: Persistent route oscillations in inter-domain routing. Technical Report 96-631, USC/ISI (1996)
2. Griffin, T., Wilfong, G.: An analysis of BGP convergence properties. In: Proceedings of ACM SIGCOMM 1999, pp. 277–288 (1999)
3. Griffin, T., Shepherd, B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking 10, 232–243 (2002)
4. Feamster, N., Johari, R., Balakrishnan, H.: The implications of autonomy for stable policy routing. In: Proceedings of the ACM SIGCOMM Conference (SIGCOMM 2005), pp. 25–36 (2005)
5. Feigenbaum, J., Sami, R., Shenker, S.: Mechanism design for policy routing. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 11–20 (2004)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs;Journal of the ACM;2023-10-11
2. Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21
3. Fault-Tolerant Distance Labeling for Planar Graphs;Structural Information and Communication Complexity;2021
4. Compact Forbidden-Set Routing;STACS 2007