{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:53:54Z","timestamp":1772726034187,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2011,2,25]],"date-time":"2011-02-25T00:00:00Z","timestamp":1298592000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00446-011-0126-8","type":"journal-article","created":{"date-parts":[[2011,2,24]],"date-time":"2011-02-24T03:48:30Z","timestamp":1298519310000},"page":"301-319","source":"Crossref","is-referenced-by-count":4,"title":["Incentive-compatible interdomain routing"],"prefix":"10.1007","volume":"23","author":[{"given":"Joan","family":"Feigenbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Ramachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,25]]},"reference":[{"issue":"6","key":"126_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/MNET.2005.1541715","volume":"19","author":"M. Caesar","year":"2005","unstructured":"Caesar M., Rexford J.: BGP policies in ISP Networks. IEEE Network Mag. 19(6), 5\u201311 (2005)","journal-title":"IEEE Network Mag."},{"issue":"6","key":"126_CR2","doi-asserted-by":"crossref","first-page":"1266","DOI":"10.1109\/TNET.2007.896531","volume":"15","author":"N. Feamster","year":"2007","unstructured":"Feamster N., Johari R., Balakrishnan H.: The implications of autonomy for the expressiveness of path-vector routing. IEEE\/ACM Trans. Network. 15(6), 1266\u20131279 (2007)","journal-title":"IEEE\/ACM Trans. Network."},{"issue":"2","key":"126_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.tcs.2007.02.020","volume":"378","author":"J. Feigenbaum","year":"2007","unstructured":"Feigenbaum J., Karger D., Mirrokni V., Sami R.: Subjective-cost policy routing. Theor. Comput. Sci. 378(2), 175\u2013189 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"126_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00446-005-0122-y","volume":"18","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum J., Papadimitriou C.H., Sami R., Shenker S.: A BGP-based mechanism for lowest-cost routing. Distribut. Comput. 18(1), 61\u201372 (2005)","journal-title":"Distribut. Comput."},{"key":"126_CR5","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Ramachandran, V., Schapira, M.: Incentive- compatible interdomain routing (extended abstract). In: Proceedings of 7th ACM Conference on Electronic Commerce (EC\u201906), pp. 130\u2013139. ACM Press, New York (2006)","DOI":"10.1145\/1134707.1134722"},{"issue":"4","key":"126_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00446-005-0134-7","volume":"18","author":"J. Feigenbaum","year":"2006","unstructured":"Feigenbaum J., Sami R., Shenker S.: Mechanism design for policy routing. Distribut. Comput. 18(4), 293\u2013305 (2006)","journal-title":"Distribut. Comput."},{"key":"126_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1017\/CBO9780511800481.016","volume-title":"Algorithmic Game Theory","author":"J. Feigenbaum","year":"2007","unstructured":"Feigenbaum J., Schapira M., Shenker S.: Distributed algorithmic mechanism design. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V. (eds) Algorithmic Game Theory, pp. 363\u2013384. Cambridge University Press, Cambridge (2007)"},{"key":"126_CR8","unstructured":"Gao, L., Griffin, T.G., Rexford, J.: Inherently Safe Backup Routing with BGP. In: Proceedings of 20th IEEE International Conference on Computer Communications (INFOCOM\u201901), pp. 547\u2013556. IEEE Computer Society (2001)"},{"issue":"6","key":"126_CR9","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/90.974523","volume":"9","author":"L. Gao","year":"2001","unstructured":"Gao L., Rexford J.: Stable internet routing without global coordination. IEEE\/ACM Trans. Network. 9(6), 681\u2013692 (2001)","journal-title":"IEEE\/ACM Trans. Network."},{"key":"126_CR10","doi-asserted-by":"crossref","unstructured":"Goldberg, S., Halevi, S., Jaggard, A.D., Ramachandran, V., Wright, R.N.: Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP. In: Proceedings of 14th ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM\u201908), pp. 267\u2013278. ACM Press, New York (2008)","DOI":"10.1145\/1402958.1402989"},{"key":"126_CR11","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Jaggard, A.D., Ramachandran, V.: Design Principles of Policy Languages for Path Vector Protocols. In: Proceedings of 9th ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM\u201903), pp. 61\u201372. ACM Press, New York (2003)","DOI":"10.1145\/863961.863964"},{"key":"126_CR12","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Shepherd, F.B., Wilfong, G.: Policy Disputes in Path Vector Protocols. In: Proceedings of 7th International Conference on Network Protocols (ICNP\u201999), pp. 21\u201330. IEEE Computer Society (1999)","DOI":"10.1109\/ICNP.1999.801912"},{"issue":"2","key":"126_CR13","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/90.993304","volume":"10","author":"T.G. Griffin","year":"2002","unstructured":"Griffin T.G., Shepherd F.B., Wilfong G.: The stable paths problem and interdomain routing. IEEE\/ACM Trans. Network. 10(2), 232\u2013243 (2002)","journal-title":"IEEE\/ACM Trans. Network."},{"key":"126_CR14","unstructured":"Green, J., Laffont, J.: Incentives in Public Decision Making. In: Studies in Public Economics, vol. 1, pp. 65\u201378. North Holland, Amsterdam (1979)"},{"key":"126_CR15","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey Prices and Shortest Paths: What is an edge worth?. In: Proceedings of 42nd IEEE Symposium on Foundations of Computer Science (FOCS\u201901), pp. 129\u2013140. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"key":"126_CR16","unstructured":"Huston, G.: Interconnection, Peering, and Settlements. In: Proceedings of 9th Internet Global Summit (INET\u201999). The Internet Society (1999)"},{"issue":"2","key":"126_CR17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias E., Papadimitriou C.H.: Worst-Case Equilibria. Comp. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comp. Sci. Rev."},{"key":"126_CR18","doi-asserted-by":"crossref","unstructured":"Levin, H., Schapira, M., Zohar, A.: Interdomain Routing and Games. In: Proceedings of 40th ACM Symposium on Theory of Computing (STOC\u201908), pp. 57\u201366. ACM Press, New York (2008)","DOI":"10.1145\/1374376.1374388"},{"key":"126_CR19","doi-asserted-by":"crossref","unstructured":"Moy, J.: Open Shortest Pouting First (OSPF) version 2. RFC 2328. Internet Engineering Task Force (1998)","DOI":"10.17487\/rfc2328"},{"issue":"1\u20132","key":"126_CR20","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan N., Ronen A.: Algorithmic mechanism design. Games Econ. Behav. 35(1\u20132), 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"key":"126_CR21","doi-asserted-by":"crossref","unstructured":"Rekhter, Y., Li, T.: A Border Gateway Protocol (BGP-4). RFC 4271. Internet Engineering Task Force (2006)","DOI":"10.17487\/rfc4271"},{"key":"126_CR22","doi-asserted-by":"crossref","unstructured":"Shneidman, J., Parkes, D.C.: Specification Faithfulness in Networks with Rational Nodes. In: Proceedings of 23rd ACM Symposium on Principles of Distributed Computing (PODC\u201904), pp. 88\u201397. ACM Press, New York (2004)","DOI":"10.1145\/1011767.1011781"},{"issue":"5","key":"126_CR23","doi-asserted-by":"crossref","first-page":"1160","DOI":"10.1109\/TNET.2005.857111","volume":"13","author":"J.L. Sobrinho","year":"2005","unstructured":"Sobrinho J.L.: An algebraic theory of dynamic network routing. IEEE\/ACM Trans. Network. 13(5), 1160\u20131173 (2005)","journal-title":"IEEE\/ACM Trans. Network."},{"issue":"1","key":"126_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S1389-1286(99)00108-5","volume":"32","author":"K. Varadhan","year":"2000","unstructured":"Varadhan K., Govindan R., Estrin D.: Persistent route oscillations in interdomain routing. Comput. Networks 32(1), 1\u201316 (2000)","journal-title":"Comput. Networks"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0126-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-011-0126-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0126-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T23:15:12Z","timestamp":1740957312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-011-0126-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,25]]},"references-count":24,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["126"],"URL":"https:\/\/doi.org\/10.1007\/s00446-011-0126-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,25]]}}}