{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:02:57Z","timestamp":1648782177179},"reference-count":14,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":[[1997,10]]},"DOI":"10.1016\/s0140-3664(97)00084-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:06:36Z","timestamp":1027613196000},"page":"988-998","source":"Crossref","is-referenced-by-count":2,"title":["An efficient adaptive routing algorithm for a network management system"],"prefix":"10.1016","volume":"20","author":[{"given":"T.","family":"Srikanthan","sequence":"first","affiliation":[]},{"given":"Gurdeep S.","family":"Hura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00084-4_BIB1","first-page":"299","article-title":"Routing Problems in Computer Networks: Communication and Networks","author":"Ephremides","year":"1990"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB2","first-page":"170","article-title":"A new minimum-loop routing algorithm","volume":"13","author":"Aceves","year":"1987"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB3","series-title":"Proceedings of IEEE INFOCOM","first-page":"527","article-title":"Congestion-free of real time traffic packet network","author":"Golestanni","year":"1990"},{"issue":"8","key":"10.1016\/S0140-3664(97)00084-4_BIB4","volume":"7","author":"IEEE Network 2","year":"1988","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB5","series-title":"Proceedings in Modelling and Simulation","first-page":"963","article-title":"A protocol for global message ordering","author":"Ramakrishnan","year":"1989"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB6","series-title":"Proceeding on Modeling and Simulation","first-page":"983","article-title":"Simulating a heuristic policy for load sharing in distributed computing systems","author":"Finkel","year":"1989"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB7","article-title":"A note on two problems in connection with graphs","volume":"October","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0140-3664(97)00084-4_BIB8","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB9","series-title":"Graph Theory with Applications to Engineering and Computer Science","author":"Narsingh","year":"1974"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB10","article-title":"Bond graph analysis","author":"Srikanthan","year":"1986"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB11","series-title":"Linear Network Optimisation Algorithms and Codes","author":"Bertsekas","year":"1991"},{"key":"10.1016\/S0140-3664(97)00084-4_BIB12","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/35.60367","article-title":"Distributed dynamic routing schemes","volume":"28","author":"Key","year":"1991","journal-title":"IEEE Commun. Mag."},{"key":"10.1016\/S0140-3664(97)00084-4_BIB13","first-page":"291","article-title":"Minimum-cost spanning tree as a path finding problem","volume":"26","author":"Maggs","year":"1988","journal-title":"Int. Lett."},{"key":"10.1016\/S0140-3664(97)00084-4_BIB14","first-page":"1199","article-title":"Optimal dynamic routing in single commodity network by iterative methods","volume":"35","author":"Sasaki","year":"1986"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000844?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000844?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:30:15Z","timestamp":1556278215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497000844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":14,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0140366497000844"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00084-4","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}