{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:43:47Z","timestamp":1782834227514,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540245742","type":"print"},{"value":"9783540318330","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31833-0_20","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:11:05Z","timestamp":1278094265000},"page":"239-252","source":"Crossref","is-referenced-by-count":4,"title":["Universal Bufferless Routing"],"prefix":"10.1007","author":[{"given":"Costas","family":"Busch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Malik","family":"Magdon-Ismail","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Khanna, S., Rajaraman, R., Rosen, A.: Time-constrained scheduling of weighted packets on trees and meshes. In: Proceedings of 11th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1\u201312 (1999)","DOI":"10.1145\/305619.305620"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/S0895480192236628","volume":"7","author":"N. Alon","year":"1994","unstructured":"Alon, N., Chung, F.R.K., Graham, R.L.: Routing permutations on graphs via matching. SIAM Journal on Discrete Mathematics\u00a07(3), 513\u2013530 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"20_CR3","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Direct routing on trees. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 342\u2013349 (1998)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Raghavan, P., Schieber, B., Tamaki, H.: Fast deflection routing for packets and worms. In: Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, Ithaca, New York, USA, August 1993, pp. 75\u201386 (1993)","DOI":"10.1145\/164051.164062"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Baran, P.: On distributed communications networks. IEEE Transactions on Communications, 1\u20139 (1964)","DOI":"10.1109\/TCOM.1964.1088883"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s002240000076","volume":"31","author":"A. Ben-Dor","year":"1998","unstructured":"Ben-Dor, A., Halevi, S., Schuster, A.: Potential function analysis of greedy hot-potato routing. Theory of Computing Systems\u00a031(1), 41\u201361 (1998)","journal-title":"Theory of Computing Systems"},{"key":"20_CR7","first-page":"112","volume-title":"Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"P. Berenbrink","year":"1999","unstructured":"Berenbrink, P., Scheideler, C.: Locally efficient on-line strategies for routing packets along fixed paths. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, January \u00a017\u201319, pp. 112\u2013121. ACM-SIAM, New York (1999)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/12.506427","volume":"45","author":"S.N. Bhatt","year":"1996","unstructured":"Bhatt, S.N., Bilardi, G., Pucci, G., Ranade, A.G., Rosenberg, A.L., Schwabe, E.J.: On bufferless routing of variable-length message in leveled networks. IEEE Trans. Comput.\u00a045, 714\u2013729 (1996)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"20_CR9","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/71.395401","volume":"6","author":"J.T. Brassil","year":"1995","unstructured":"Brassil, J.T., Cruz, R.L.: Bounds on maximum delay in networks with deflection routing. IEEE Transactions on Parallel and Distributed Systems\u00a06(7), 724\u2013732 (1995)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Broder, A., Upfal, E.: Dynamic deflection routing on arrays. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, May 1996, pp. 348\u2013358 (1996)","DOI":"10.1145\/237814.237981"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Busch, C.: \u00d5(Congestion + Dilation) hot-potato routing on leveled networks. In: Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, August 2002, pp. 20\u201329 (2002)","DOI":"10.1145\/564870.564874"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Wattenhofer, R.: Hard-potato routing. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, May 2000, pp. 278\u2013285 (2000)","DOI":"10.1145\/335305.338762"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b98465","volume-title":"Algorithms \u2013 ESA 2004","author":"C. Busch","year":"2004","unstructured":"Busch, C., Magdon-Ismail, M., Mavronicolas, M., Spirakis, P.: In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221. Springer, Heidelberg (2004)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-540-27866-5_109","volume-title":"Euro-Par 2004 Parallel Processing","author":"C. Busch","year":"2004","unstructured":"Busch, C., Magdon-Ismail, M., Mavronicolas, M., Wattenhofer, R.: Near-optimal hot-potato routing on trees. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol.\u00a03149, pp. 820\u2013827. Springer, Heidelberg (2004)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Cypher, R., auf der Heide, F.M., Scheideler, C., V\u00f6cking, B.: Universal algorithms for store-and-forward and wormhole routing. In: Proceedings of the 28th ACM Symp. on Theory of Computing (STOC), pp. 356\u2013365 (1996)","DOI":"10.1145\/237814.237982"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Feige, U., Raghavan, P.: Exact analysis of hot-potato routing. In: IEEE (ed.) Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PN, October 1992, pp. 553\u2013562 (1992)","DOI":"10.1109\/SFCS.1992.267796"},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/71.584091","volume":"8","author":"R.I. Greenberg","year":"1997","unstructured":"Greenberg, R.I., Oh, H.-C.: Universal wormhole routing. IEEE Transactions on Parallel and Distributed Systems\u00a08(3), 254\u2013262 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02311228","volume":"1","author":"B. Hajek","year":"1991","unstructured":"Hajek, B.: Bounds on evacutation time for deflection routing. Distributed Computing\u00a01, 1\u20136 (1991)","journal-title":"Distributed Computing"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Kaklamanis, Ch., Krizanc, D., Rao, S.: Hot-potato routing on processor arrays. In: Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, Velen, Germany, June 30\u2013July 2, pp. 273\u2013282 (1993)","DOI":"10.1145\/165231.376321"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-scheduling in O(congestion+dilation) steps. Combinatorica\u00a014, 167\u2013186 (1994); (preliminary version appears in FOCS 1988)","journal-title":"Combinatorica"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-60313-1_154","volume-title":"Algorithms - ESA \u201995","author":"F.M. Heide auf der","year":"1995","unstructured":"auf der Heide, F.M., Scheideler, C.: Routing with bounded buffers and hot-potato routing in vertex-symmetric networks. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 341\u2013354. Springer, Heidelberg (1995)"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jagm.1998.0980","volume":"31","author":"F.M. Heide auf der","year":"1999","unstructured":"auf der Heide, F.M., V\u00f6cking, B.: Shortest-path routing in arbitrary networks. Journal of Algorithms\u00a031(1), 105\u2013131 (1999)","journal-title":"Journal of Algorithms"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y.: Universal O(congestion+dilation+log1\u2009+\u2009\u03b5 N) local control packet switching algorithms. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, New York, May 1997, pp. 644\u2013653 (1997)","DOI":"10.1145\/258533.258659"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Rabani, Y., Tardos, \u00c9.: Distributed packet switching in arbitrary networks. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, May 22\u201324, pp. 366\u2013375 (1996)","DOI":"10.1145\/237814.237983"},{"key":"20_CR25","unstructured":"Roberts, A., Symvonis, A., Wood, D.R.: Lower bounds for hot-potato permutation routing on trees. In: Proceedings of the 7th Int. Coll. Structural Information and Communication Complexity, SIROCCO, June 20\u201322, pp. 281\u2013295 (2000)"},{"key":"20_CR26","unstructured":"Zhang, L.: Optimal bounds for matching routing on trees. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 445\u2013453 (1997)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31833-0_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:27:41Z","timestamp":1605760061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31833-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245742","9783540318330"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31833-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}