{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:10:26Z","timestamp":1736287826983,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_49","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"596-607","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Node Routing"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoel","family":"Chaiutin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Kushilevitz, E., Ostrovsky, R.: Adaptive packet routing for bursty adversarial traffic. In: Proc. of the 30th ACM Symp. on Theory of Computing (STOC), pp. 359\u2013368 (1998)","DOI":"10.1145\/276698.276788"},{"key":"49_CR2","unstructured":"Aiello, W., Ostrovsky, R., Kushilevitz, E., Ros\u00e9n, A.: Dynamic routing on networks with fixed-size buffers. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 771\u2013780 (2003)"},{"issue":"2","key":"49_CR3","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1998.0953","volume":"29","author":"M. Ajtai","year":"1998","unstructured":"Ajtai, M., Aspnes, J., Naor, M., Rabani, Y., Schulman, L.J., Waarts, O.: Fairness in scheduling. Journal of Algorithms\u00a029(2), 306\u2013357 (1998)","journal-title":"Journal of Algorithms"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. 36th ACM Symp. on Theory of Computing, pp. 35\u201344 (2004)","DOI":"10.1145\/1007352.1007366"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Andrews, M., Awerbuch, B., Fern\u00e1ndez, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution protocols. In: Proc. 37th IEEE Symp. on Found. of Comp. Science, pp. 380\u2013389 (1996)","DOI":"10.1109\/SFCS.1996.548497"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Berenbrink, P., Brinkmann, A., Scheideler, C.: Simple online strategies for adversarial systems. In: Proc. of the 42nd IEEE Symp. on Foundation of Comupter Science (FOCS) (2001)","DOI":"10.1109\/SFCS.2001.959890"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/3-540-45061-0_88","volume-title":"Automata, Languages and Programming","author":"B. Awerbuch","year":"2003","unstructured":"Awerbuch, B., Brinkmann, A., Scheideler, C.: Anycasting and multicasting in adversarial systems: Routing and admission control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1153\u20131168. Springer, Heidelberg (2003)"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Leighton, F.: Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. In: Proc. of the 26th ACM Symp. on Theory of Computing (STOC), pp. 487\u2013496 (1994)","DOI":"10.1145\/195058.195238"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Mansour, Y., Shavit, N.: End-to-end communication with polynomial overhead. In: Proc. of the 30th IEEE Symp. on Foundation of Comupter Science (FOCS), pp. 358\u2013363 (1989)","DOI":"10.1109\/SFCS.1989.63503"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Azar, Y., Litichevskey, M.: Maximizing throughput in multi-queue switches. In: Proc. 12th Annual European Symposium on Algorithms, pp. 53\u201364 (2004)","DOI":"10.1007\/978-3-540-30140-0_7"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. In: Proc. 35th ACM Symp. on Theory of Computing, pp. 82\u201389 (2003)","DOI":"10.1145\/780542.780556"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Azar, Y., Richter, Y.: An improved algorithm for CIOQ switches. In: Proc. 12th Annual European Symposium on Algorithms, pp. 65\u201376 (2004)","DOI":"10.1007\/978-3-540-30140-0_8"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proc. 36th ACM Symp. on Theory of Computing, pp. 64\u201371 (2004)","DOI":"10.1145\/1007352.1007369"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Bansal, N., Fleischer, L., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M.: Further improvements in competitive guarantees for QoS buffering, pp. 196\u2013207 (2004)","DOI":"10.1007\/978-3-540-27836-8_19"},{"issue":"3","key":"49_CR15","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1145\/210346.210422","volume":"42","author":"A. Birman","year":"1995","unstructured":"Birman, A., Gail, H.R., Hantler, S.L., Rosberg, Z., Sidi, M.: An optimal service policy for buffer systems. Journal of the Association Computing Machinery (JACM)\u00a042(3), 641\u2013657 (1995)","journal-title":"Journal of the Association Computing Machinery (JACM)"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial queuing theory. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 376\u2013385 (1996)","DOI":"10.1145\/237814.237984"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Gamarnik, D.: Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks. In: Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pp. 206\u2013214 (1999)","DOI":"10.1145\/301250.301306"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Karp, R., Vazirani, U., Vazirani, V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of 22nd Annual ACM Symposium on Theory of Computing, May 1990, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B.: Buffer overflows of merging streams. In: Proc. 11th Annual European Symposium on Algorithms, pp. 349\u2013360 (2003)","DOI":"10.1145\/777412.777452"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. 33rd ACM Symp. on Theory of Computing, pp. 520\u2013529 (2001)","DOI":"10.1145\/380752.380847"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"May, M., Bolot, J.C., Jean-Marie, A., Diot, C.: Simple performance models of differentiated services for the internet. In: Proceedings of the IEEE INFOCOM 1999, pp. 1385\u20131394 (1999)","DOI":"10.1109\/INFCOM.1999.752158"},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Scheideler, C., Vocking, B.: From static to dynamic routing: efficient transformations of store-and-forward protocols. In: Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pp. 215\u2013224 (1999)","DOI":"10.1145\/301250.301307"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:55:22Z","timestamp":1736286922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11672142_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}