{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:10:07Z","timestamp":1725495007335},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423027"},{"type":"electronic","value":"9783540477280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47728-4_65","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:39:45Z","timestamp":1194986385000},"page":"657-672","source":"Crossref","is-referenced-by-count":1,"title":["Avoiding Counting to Infinity in Distance Vector Routing"],"prefix":"10.1007","author":[{"given":"A.","family":"Schmid","sequence":"first","affiliation":[]},{"given":"O.","family":"Kandel","sequence":"additional","affiliation":[]},{"given":"Ch.","family":"Steigner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"R. Braden and J. Postel, Requirements for internet gateways, IETF RFC 1009, USC\/Information Sciences Institute, June 1987","DOI":"10.17487\/rfc1009"},{"key":"65_CR2","doi-asserted-by":"crossref","unstructured":"C. Cheng, R. Riley, S. P. R. Kumar and J.J. Garcia-Luna-Aceves, A loop-free extended bellman-ford routing protocol without bouncing effect, in ACM SIGCOMM Symposium Commun. Arch. and Protocols, pp. 224\u2013236, Austin,Texas","DOI":"10.1145\/75247.75269"},{"key":"65_CR3","doi-asserted-by":"crossref","unstructured":"J. J. Garcia-Luna-Aceves, A unified approach to loop-free routing using distance vectors or link states, in ACM SIGCOMM Symposium Commun. Arch. and Protocols, pp. 212\u2013223, Austin, Texas, Sept. 1989","DOI":"10.1145\/75247.75268"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Garcia-Luna-Aceves (1993), Loop-free routing using diffusing computations, IEEE\/ACM Transactions on Networking 1, No. 1, pp. 130\u2013141","DOI":"10.1109\/90.222913"},{"key":"65_CR5","doi-asserted-by":"crossref","unstructured":"J. M. Jaffe and F. M. Moss, A responsive routing algorithm for computer networks, IEEE Transactions on Communications COM-30, No. 7, pp. 1785\u20131762, July 1982","DOI":"10.1109\/TCOM.1982.1095632"},{"key":"65_CR6","unstructured":"O. Kandel, RIP-MTI-Simulation des erweiterten RIP-Algorithmus, Diploma thesis, University of Koblenz-Landau, Institute for Computer Science, Rheinau 1, 56075 Koblenz, Germany, July 2000 (German)"},{"key":"65_CR7","doi-asserted-by":"crossref","unstructured":"B. Rajagopalan and M. Faiman, A new responsive distributed shortest path routing algorithm, in ACM SIGCOMM Symposium Commun. Arch. and Protocols, pp. 237\u2013246, Austin, Texas, Sept. 1989","DOI":"10.1145\/75247.75270"},{"key":"65_CR8","unstructured":"G. C. Sackett and C. Metz, ATM and multiprotocol networking, McGraw-Hill,1996"},{"key":"65_CR9","unstructured":"A. J. Schmid, Solution for the counting to infinity problem of distance vector routing, Research report 7\u201398, University of Koblenz-Landau, Institute for Computer Science, Rheinau 1, 56075 Koblenz, Germany, June 1998, URL http:\/\/www.uni-koblenz.de\/fb4\/publikationen\/gelbereihe\/RR-7-98.ps.gz"},{"key":"65_CR10","unstructured":"A. J. Schmid, RIP-MTI: Minimum-effort loop-free distance vector routing algorithm, Diploma thesis, University of Koblenz-Landau, Institute for Computer Science, Rheinau 1, 56075 Koblenz, Germany, March 1999"},{"key":"65_CR11","unstructured":"A. J. Schmid and C. Steigner, A solution for the counting to infinity problem of distance vector routing, Proc. of the Second IASTED International Conference on Parallel and Distributed Computing and Networks (Brisbane, Queensland, Australia), December 1998, pp. 471\u2013477"},{"key":"65_CR12","doi-asserted-by":"crossref","unstructured":"K. G. Shin and M.-S. Chen, Performance analysis of distributed routing strategies free of ping-pong-type looping, IEEE Transactions on Computers C-36, No. 2, pp. 870\u2013881, Feb. 1987","DOI":"10.1109\/TC.1987.1676875"},{"key":"65_CR13","unstructured":"A. S. Tanenbaum, Computer Networks, Prentice Hall, third edition, 1996"}],"container-title":["Lecture Notes in Computer Science","Networking \u2014 ICN 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47728-4_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:31:47Z","timestamp":1556955107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47728-4_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423027","9783540477280"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-47728-4_65","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}