{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T18:28:11Z","timestamp":1673116091186},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0140-3664(97)00136-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:03:07Z","timestamp":1027623787000},"page":"147-161","source":"Crossref","is-referenced-by-count":1,"title":["A loop-free routing protocol for large-scale internets using distance vectors"],"prefix":"10.1016","volume":"21","author":[{"given":"Shree","family":"Murthy","sequence":"first","affiliation":[]},{"given":"J.J.","family":"Garcia-Luna-Aceves","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00136-9_BIB1","article-title":"Adaptive routing algorithms for distributed computer networks","author":"McQuillan","year":"1974"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB2","article-title":"Design considerations for large computer communications network","author":"Kamoun","year":"1976"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB3","series-title":"INFOCOM","first-page":"311","article-title":"Establishing virtual circuits in large computer networks","author":"Baratz","year":"1983"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB4","series-title":"INFOCOM","first-page":"292","article-title":"Analysis of routing strategies for packet ratio networks","author":"Garcia-Luna-Aceves","year":"1985"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB5","series-title":"ICC","first-page":"93","article-title":"Hierarchical routing design for suran","author":"Lauer","year":"1986"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB6","series-title":"COMPSAC","first-page":"93","article-title":"An adaptive hierarchical routing algorithm","author":"Ramamoorthy","year":"1983"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB7","series-title":"MILCOM","first-page":"15.3.1","article-title":"Reducing routing overhead in a growing ddn","author":"Seeger","year":"1986"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB8","series-title":"INFOCOM","first-page":"1000","article-title":"Area-based loop-free internet routing","volume":"3","author":"Garcia-Luna-Aceves","year":"1994"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB9","article-title":"OSPF version 2","author":"Moy","year":"1992","journal-title":"RFC 1247"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB10","first-page":"224","article-title":"A loop-free extended bellman-ford routing protocol without bouncing effect","volume":"19","author":"Cheng","year":"1989"},{"issue":"6","key":"10.1016\/S0140-3664(97)00136-9_BIB11","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/26.87189","article-title":"Another adaptive shortest-path algorithm","volume":"39","author":"Humblet","year":"1991","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0140-3664(97)00136-9_BIB12","series-title":"28th Asilomar Conf.","first-page":"229","article-title":"A more efficient path-finding algorithm","author":"Murthy","year":"1994"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB13","first-page":"237","article-title":"A new responsive distributed shortest path routing algorithm","volume":"19","author":"Rajagopalan","year":"1989"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB14","series-title":"INFOCOM","article-title":"A loop-free path-finding algorithm: specification, verification and complexity","author":"Garcia-Luna-Aceves","year":"1995"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB15","article-title":"RIP Version 2, Carrying Additional Information","author":"Malin","year":"1994","journal-title":"RFC 1723"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB16","doi-asserted-by":"crossref","DOI":"10.1109\/90.554729","article-title":"A path-finding algorithm for loop-free routing","author":"Garcia-Luna-Aceves","year":"1997","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0140-3664(97)00136-9_BIB17","series-title":"Simulations in drama","author":"Zaumen","year":"1991"},{"issue":"9","key":"10.1016\/S0140-3664(97)00136-9_BIB18","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","article-title":"Routing of multipoint connections","volume":"6","author":"Waxman","year":"1988","journal-title":"J. Selected Areas Commun."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497001369?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497001369?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T03:20:19Z","timestamp":1555989619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497001369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0140366497001369"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00136-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}