{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T04:44:56Z","timestamp":1782967496705,"version":"3.54.5"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,16]]},"DOI":"10.1109\/icc45855.2022.9839159","type":"proceedings-article","created":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T19:37:11Z","timestamp":1660246631000},"page":"322-328","source":"Crossref","is-referenced-by-count":4,"title":["Stable, Loop-Free, Multi-Path Inter-Domain Routing Using BGP"],"prefix":"10.1109","author":[{"given":"J. J.","family":"Garcia-Luna-Aceves","sequence":"first","affiliation":[{"name":"University of California,Computer Science and Engineering Department,Santa Cruz,CA,95064"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633047"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312685"},{"key":"ref12","article-title":"A Border Gateway Protocol 4 (BGP-4)","author":"rekhter","year":"2005","journal-title":"RFC 4271"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2017.7876163"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863963"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2009.5207968"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159934"},{"key":"ref17","article-title":"System for Maintaining Multiple Loop-Free Paths between Source Node and Destination Node in Computer Network","author":"zaumen","year":"1999","journal-title":"U S Patent"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/90.222907"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.125"},{"key":"ref6","article-title":"Stable Internet Routing without Global Coordination","author":"gao","year":"2001","journal-title":"IEEE\/ACM Trans Networking"},{"key":"ref5","article-title":"BGP Best Path Selection Algorithm","author":"systems","year":"2016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832222"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316231"},{"key":"ref2","author":"carre","year":"1979","journal-title":"Graphs and Networks"},{"key":"ref1","article-title":"Intermediate System to Intermediate System Inter-Domain Routing Information Exchange Protocol","year":"1990"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347428"}],"event":{"name":"ICC 2022 - IEEE International Conference on Communications","location":"Seoul, Korea, Republic of","start":{"date-parts":[[2022,5,16]]},"end":{"date-parts":[[2022,5,20]]}},"container-title":["ICC 2022 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9837954\/9838246\/09839159.pdf?arnumber=9839159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T20:03:28Z","timestamp":1663013008000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9839159\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,16]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icc45855.2022.9839159","relation":{},"subject":[],"published":{"date-parts":[[2022,5,16]]}}}