{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:52:08Z","timestamp":1787500328021,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540603139","type":"print"},{"value":"9783540449133","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60313-1_154","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:16:03Z","timestamp":1330262163000},"page":"341-354","source":"Crossref","is-referenced-by-count":9,"title":["Routing with bounded buffers and hot-potato routing in vertex-symmetric networks"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"25_CR1","unstructured":"N. Alon, P. Erd\u0151s, J. Spencer. The Probabilistic Method. Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, 1992."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"A. Acampora, S. Shah. Multihop Lightwave Networks: a Comparison of Store-and-Forward and Hot-Potato Routing. IEEE Transaction on Communications, pp. 1082\u20131090, 1992.","DOI":"10.1109\/26.142798"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"U. Feige, P. Raghavan. Exact Analysis of Hot-Potato Routing. In Proc. of the 33rd Symp. on Foundations of Computer Science, pp. 553\u2013562, 1992.","DOI":"10.1109\/SFCS.1992.267796"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"A. Greenberg, B. Hajek. Deflection Routing in Hypercube Networks. IEEE Transactions on Communications, pp. 1070\u20131081, 1992.","DOI":"10.1109\/26.142797"},{"key":"25_CR5","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, B.M. Maggs, S.B. Rao. Universal Packet Routing Algorithms. In Proc. of the 29th Ann. Symp. on Foudations of Computer Science, pp. 256\u2013271, 1988.","DOI":"10.21236\/ADA204273"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1006\/jagm.1994.1030","volume":"17","author":"F.T. Leighton","year":"1994","unstructured":"F.T. Leighton, B.M. Maggs, A.G. Ranade, S.B. Rao. Randomized Routing and Sorting on Fixed-Connection Networks. Journal of Algorithms 17, pp. 157\u2013205, 1994.","journal-title":"Journal of Algorithms"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"F.T. Leighton, B.M. Maggs, S.B. Rao. Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps. Combinatorica 14, pp. 167\u2013186, 1994.","journal-title":"Combinatorica"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, S.B. Rao. An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms. In Proc. of the 29th Ann. Symp. on Foudations of Computer Science, pp. 422\u2013431, 1988.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"N. Maxemchuk. Comparison of Deflection and Store-and-Forward Techniques in the Manhattan Street and Shuffle-Exchange Networks. In Proc. of the IEEE INFOCOM, pp. 800\u2013809, 1989.","DOI":"10.1109\/INFCOM.1989.101529"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M. Morgenstern","year":"1994","unstructured":"M. Morgenstern. Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q. Journal of Comb. Theory, Series B 62, pp. 44\u201362, 1994.","journal-title":"Journal of Comb. Theory, Series B"},{"key":"25_CR12","unstructured":"F. Meyer auf der Heide, C. Scheideler. Space-Efficient Routing in Vertex-Symmetric Networks. To appear at SPAA 95."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"F. Meyer auf der Heide, B. V\u00f6cking. A Packet Routing Protocol for Arbitrary Networks. In Proc. of the 12th Symp. on Theoretical Aspects of Computer Science, pp. 291\u2013302, 1995.","DOI":"10.1007\/3-540-59042-0_81"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"F. Meyer auf der Heide, M. Westermann. Hot-Potato Routing on Multi-Dimensional Tori. To appear at WG95 (21st Workshop on Graph-Theoretical Concepts in Computer Science), June 1995.","DOI":"10.1007\/3-540-60618-1_77"},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"A.G. Ranade","year":"1991","unstructured":"A.G. Ranade. How to Emulate Shared Memory. Journal of Computer and System Sciences 42, pp. 307\u2013326, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"T. Szymanski. An Analysis of Hot-Potato Routing in a Fiber Optic Packet Switched Hypercube. In Proc. of the IEEE INFOCOM, pp. 918\u2013925, 1990.","DOI":"10.1109\/INFCOM.1990.91340"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"E. Upfal. An O(log N) Deterministic Packet Routing Scheme. Journal of the ACM 39, 1992.","DOI":"10.1145\/147508.147517"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60313-1_154.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:58:06Z","timestamp":1605628686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60313-1_154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603139","9783540449133"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60313-1_154","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}