{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215081,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45706-2_107","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:37:18Z","timestamp":1191735438000},"page":"767-774","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Mixed Deflection and Convergence Routing Algorithm: Design and Performance"],"prefix":"10.1007","author":[{"given":"D.","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Berthom\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Czarchoski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. M.","family":"Fourneau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Laforest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Vial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"107_CR1","unstructured":"D. Barth, P. Berthom\u00e9, A. Borrero, J.M. Fourneau, C. Laforest, F. Quessette, and S. Vial. Performance comparisons of Eulerian routing and deflection routing in a 2d-mesh all optical network. In ESM\u20192001, 2001."},{"key":"107_CR2","unstructured":"D. Barth, P. Berthom\u00e9, and J. Cohen. The Eulerian stretch of a digraph and the ending guarantee of a convergence routing. Technical Report A00-R-400, LORIA, BP 239-F54506 Vandoeuvre-l\u00e8s-Nancy, France, 2000."},{"issue":"7","key":"107_CR3","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/71.395401","volume":"6","author":"J. C. Brassil","year":"1995","unstructured":"J. C. Brassil and R. L. Cruz. Bounds on maximum delay in networks with deflection routing. IEEE Trans. on Parallel and Distributed Systems, 6(7):724\u2013732, 1995.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"107_CR4","unstructured":"U. Feige. Observations on hot potato routing. In ISTCS: 3rd Israeli Symposium on the Theory of Computing and Systems, 1995."},{"key":"107_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/50.914481","volume":"19","author":"P. Gravey","year":"2001","unstructured":"P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthom\u00e9, C. Laforest, S. Vial, T. Atmaca, G. H\u00e9buterne, H. El Biaze, R. Laalaoua, E. Gangloff, and I. Kotuliak. Multiservice optical network: Main concepts and first achievements of the ROM program. Journal of Ligthwave Technology, 19:23\u201331, January 2001.","journal-title":"Journal of Ligthwave Technology"},{"key":"107_CR6","doi-asserted-by":"crossref","unstructured":"C. Laforest and S. Vial. Short cut Eulerian routing of datagrams in all optical point-to-point networks. In IPDPS, 2002.","DOI":"10.1109\/IPDPS.2002.1015518"},{"key":"107_CR7","doi-asserted-by":"crossref","unstructured":"A. Mayer, Y. Ofek, and M. Yung. Local fairness in general-topology networks with convergence routing. In Infocom, volume 2, pages 891\u2013899. IEEE, June 1995.","DOI":"10.1109\/INFCOM.1995.515961"},{"key":"107_CR8","doi-asserted-by":"crossref","unstructured":"Y. Ofek and M. Yung. Principles for high speed network control: loss-less and deadlock-freeness, self-routing and a single buffer per link. In ACM Symposium On Principles of Distributed Computing, pages 161\u2013175, 1990.","DOI":"10.1145\/93385.93414"},{"key":"107_CR9","unstructured":"D. Potier. New user\u2019s introduction to QNAP2. Technical Report RT40, INRIA, Roquencourt FRANCE, 1984."},{"key":"107_CR10","doi-asserted-by":"crossref","unstructured":"A. Schuster. Optical Interconnections and Parallel Processing: The Interface, chapter Bounds and analysis techniques for greedy hot-potato routing, pages 284\u2013354. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4757-2791-3_11"},{"issue":"4","key":"107_CR11","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/90.649468","volume":"5","author":"B. Yener","year":"1997","unstructured":"B. Yener, S. Matsoukas, and Y. Ofek. Iterative approach to optimizing convergence routing priorities. IEEE\/ACM Trans. on Networking, 5(4):530\u2013542, August 1997.","journal-title":"IEEE\/ACM Trans. on Networking"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:42:41Z","timestamp":1737463361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_107","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}