Subjective-cost policy routing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3828 LNCS, Issue , 2005, Pages 174-183

  Feigenbaum, Joan ^a   Karger, David R ^b   Mirrokni, Vahab S ^b   Sami, Rahul ^c  

^a YALE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SYSTEMS; CONSTRAINT THEORY; MATHEMATICAL MODELS; MEASUREMENT THEORY; NETWORK PROTOCOLS; PUBLIC POLICY; ROUTERS; TREES (MATHEMATICS);

AUTONOMOUS SYSTEMS; INTERDOMAIN ROUTING; OPTIMAL ROUTES; SUBJECTIVE COST ASSESSMENTS;

COST ACCOUNTING;

EID: 33744943260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_18     Document Type: Conference Paper

References (7)

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 '99. (1999) 277-288
3. Griffin, T., Shepherd, B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking 10 (2002) 232-243
4. Feamster, N., Johari, R., Balakrishnan, H.: The implications of autonomy for stable policy routing. In: Proceedings of the ACM SIGCOMM Conference (SIGCOMM '05). (2005) 25-36
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 '04). (2004) 11-20
6. Gao, L., Rexford, J.: Stable internet routing without global coordination. IEEE/ACM Transactions on Networking 9 (2001) 681-692
7. Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distributed Computing 18 (2005) 61-72