{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T04:10:03Z","timestamp":1740543003821,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_1","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T04:13:22Z","timestamp":1285647202000},"page":"1-13","source":"Crossref","is-referenced-by-count":5,"title":["The Network as a Storage Device: Dynamic Routing with Bounded Buffers"],"prefix":"10.1007","author":[{"given":"Stanislav","family":"Angelov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keshav","family":"Kunal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Aiello, W., Ostrovsky, R., Kushilevitz, E., Ros\u00e9n, A.: Dynamic routing on networks with fixed-size buffers. In: Proceedings of the 14th SODA, pp. 771\u2013780 (2003)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Mansour, Y., Lotker, Z., Patt-Shamir, B.: Buffer overflows of merging streams. In: Proceedings of the 15th SPAA, pp. 244\u2013245 (2003)","DOI":"10.1145\/777412.777452"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Kothapalli, K., Scheideler, C.: Information gathering in adversarial systems: lines and cycles. In: SPAA 2003: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pp. 333\u2013342 (2003)","DOI":"10.1145\/777412.777471"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/11561071_44","volume-title":"Algorithms \u2013 ESA 2005","author":"Y. Azar","year":"2005","unstructured":"Azar, Y., Zachut, R.: Packet routing and information gathering in lines, rings and trees. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 484\u2013495. Springer, Heidelberg (2005)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Labrador, M., Banerjee, S.: Packet dropping policies for ATM and IP networks. IEEE Communications Surveys\u00a02 (1999)","DOI":"10.1109\/COMST.1999.5340708"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Frieze, A.M., Upfal, E.: A general approach to dynamic packet routing with bounded buffers. In: Proceedings of the 37th FOCS, p. 390 (1996)","DOI":"10.1109\/SFCS.1996.548498"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Broder, A., Upfal, E.: Dynamic deflection routing on arrays. In: Proceedings of the 28th annual ACM Symposium on Theory of Computing, pp. 348\u2013355 (1996)","DOI":"10.1145\/237814.237981"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Mihail, M.: Conductance and convergence of markov chains\u2013a combinatorial treatment of expanders. In: Proceedings of the 30th FOCS, pp. 526\u2013531 (1989)","DOI":"10.1109\/SFCS.1989.63529"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1996.0072","volume":"53","author":"M. Mitzenmacher","year":"1996","unstructured":"Mitzenmacher, M.: Bounds on the greedy routing algorithm for array networks. Journal of Computer System Sciences\u00a053, 317\u2013327 (1996)","journal-title":"Journal of Computer System Sciences"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/26.328987","volume":"42","author":"G. Stamoulis","year":"1994","unstructured":"Stamoulis, G., Tsitsiklis, J.: The efficiency of greedy routing in hypercubes and butterflies. IEEE Transactions on Communications\u00a042, 3051\u20133208 (1994)","journal-title":"IEEE Transactions on Communications"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queueing theory. In: Proceedings of the 28th STOC, pp. 376\u2013385 (1996)","DOI":"10.1145\/237814.237984"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Andrews, M., Mansour, Y., Fern\u00e9ndez, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution protocols. In: Proceedings of the 37th FOCS, pp. 380\u2013389 (1996)","DOI":"10.1109\/SFCS.1996.548497"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-30140-0_14","volume-title":"Algorithms \u2013 ESA 2004","author":"C. Busch","year":"2004","unstructured":"Busch, C., Magdon-Ismail, M., Mavronicolas, M., Spirakis, P.G.: Direct routing: Algorithms and complexity. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 134\u2013145. Springer, Heidelberg (2004)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput competitive on-line routing. In: Proceedings of 34th FOCS, pp. 32\u201340 (1993)","DOI":"10.1109\/SFCS.1993.366884"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Scheideler, C., V\u00f6cking, B.: Universal continuous routing strategies. In: Proceedings of the 8th SPAA, pp. 142\u2013151 (1996)","DOI":"10.1145\/237502.237519"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.tcs.2004.05.014","volume":"324","author":"A. Kesselman","year":"2004","unstructured":"Kesselman, A., Mansour, Y.: Harmonic buffer management policy for shared memory switches. Theor. Comput. Sci.\u00a0324, 161\u2013182 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Lotker, Z., Patt-Shamir, B.: Nearly optimal FIFO buffer management for DiffServ. In: Proceedings of the 21th PODC, pp. 134\u2013143 (2002)","DOI":"10.1145\/571825.571851"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T03:06:44Z","timestamp":1740539204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11538462_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}