{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T00:28:31Z","timestamp":1673396911849},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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 Networks"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1389-1286(03)00288-3","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T22:47:42Z","timestamp":1054075662000},"page":"389-416","source":"Crossref","is-referenced-by-count":6,"title":["Reinforcing reachable routes"],"prefix":"10.1016","volume":"43","author":[{"given":"Srinidhi","family":"Varadarajan","sequence":"first","affiliation":[]},{"given":"Naren","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"Muthukumar","family":"Thirunavukkarasu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(03)00288-3_BIB1","first-page":"1","article-title":"On distributed communication networks","volume":"CS-12","author":"Baran","year":"1994","journal-title":"IEEE Transactions on Communications Systems"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB2","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TAC.1982.1102980","article-title":"Distributed dynamic programming","volume":"27","author":"Bertsekas","year":"1982","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB3","series-title":"Data Networks","author":"Bertsekas","year":"1992"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB4","series-title":"Neuro-Dynamic Programming","author":"Bertsekas","year":"1996"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB5","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","year":"1997"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB6","series-title":"Advances in Neural Information Processing Systems 6 (NIPS6)","first-page":"671","article-title":"Packet routing in dynamically changing networks: a reinforcement learning approach","author":"Boyan","year":"1994"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB7","series-title":"Proceedings of the IEEE INFOCOM Conference on Computer Communications","first-page":"661","article-title":"A new approach to routing with dynamic metrics","author":"Chen","year":"1999"},{"issue":"8","key":"10.1016\/S1389-1286(03)00288-3_BIB8","first-page":"19","article-title":"OSPF: an internet routing protocol","volume":"3","author":"Coltun","year":"1989","journal-title":"ConneXions"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB9","series-title":"Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI\u201988)","first-page":"49","article-title":"An analysis of time-dependent planning","author":"Dean","year":"1988"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","article-title":"AntNet: distributed stigmergetic control for communications networks","volume":"9","author":"Di Caro","year":"1998","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1613\/jair.639","article-title":"Hierarchical reinforcement learning with the MAXQ value function decomposition","volume":"13","author":"Dietterich","year":"2000","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB12","series-title":"Machine Learning: Proceedings of the Nineteenth International Conference (ICML 2002)","article-title":"Coordinated reinforcement learning","author":"Guestrin","year":"2002"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB13","doi-asserted-by":"crossref","unstructured":"C. Hedrick, Routing Information Protocol, Request for Comments 1058, Network Working Group, June 1988","DOI":"10.17487\/rfc1058"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","article-title":"Reinforcement learning: a survey","volume":"4","author":"Kaelbling","year":"1996","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB15","doi-asserted-by":"crossref","unstructured":"G. Malkin, RIP Version 2, Request for Comments 2453, Network Working Group, November 1998","DOI":"10.17487\/rfc2453"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB16","doi-asserted-by":"crossref","unstructured":"A.K. McCallum, Reinforcement learning with selective perception and hidden state, Ph.D. Thesis, Department of Computer Science, University of Rochester, 1995, revised 1996","DOI":"10.1016\/B978-1-55860-377-6.50055-4"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB17","doi-asserted-by":"crossref","unstructured":"J. Moy, OSPF Version 2, Request for Comments 1247, Network Working Group, July 1991","DOI":"10.17487\/rfc1247"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB18","doi-asserted-by":"crossref","unstructured":"J. Moy, OSPF Version 2, Request for Comments 1583, Network Working Group, March 1994","DOI":"10.17487\/rfc1583"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB19","series-title":"Machine Learning: Proceedings of the Seventeenth International Conference (ICML 2000)","first-page":"663","article-title":"Algorithms for inverse reinforcement learning","author":"Ng","year":"2000"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB20","series-title":"Routing in Communications Networks","year":"1995"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB21","series-title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI\u201997)","first-page":"832","article-title":"Ants and reinforcement learning: a case study in routing in dynamic networks","author":"Subramanian","year":"1997"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB22","series-title":"Reinforcement Learning","author":"Sutton","year":"1998"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB23","unstructured":"S. Varadarajan, Ethereal: a fault tolerant host-transparent mechanism for bandwidth guarantees over switched ethernet networks, Ph.D. Thesis, Department of Computer Science, State University of New York, Stony Brook, 2000"},{"key":"10.1016\/S1389-1286(03)00288-3_BIB24","series-title":"Proceedings of the IEEE INFOCOM Conference on Computer Communications","first-page":"557","article-title":"MDVA: a distance-vector multipath routing protocol","author":"Vutukury","year":"2001"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603002883?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603002883?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T06:44:21Z","timestamp":1584686661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128603002883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S1389128603002883"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00288-3","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}