{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T11:23:19Z","timestamp":1709292199553},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T00:00:00Z","timestamp":1196985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s00453-007-9143-1","type":"journal-article","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T12:58:19Z","timestamp":1196945899000},"page":"71-94","source":"Crossref","is-referenced-by-count":12,"title":["The Network as a Storage Device: Dynamic Routing with Bounded Buffers"],"prefix":"10.1007","volume":"55","author":[{"given":"Stanislav","family":"Angelov","sequence":"first","affiliation":[]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[]},{"given":"Keshav","family":"Kunal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,7]]},"reference":[{"key":"9143_CR1","first-page":"771","volume-title":"Proceedings of the 14th Anual ACM-SIAM Symposium on Discrete Algorithms","author":"W. Aiello","year":"2003","unstructured":"Aiello, W., Ostrovsky, R., Kushilevitz, E., Ros\u00e9n, A.: Dynamic routing on networks with fixed-size buffers. In: Proceedings of the 14th Anual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0771\u2013780. SIAM, Philadelphia (2003)"},{"key":"9143_CR2","first-page":"244","volume-title":"Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms","author":"A. Kesselman","year":"2003","unstructured":"Kesselman, A., Mansour, Y., Lotker, Z., Patt-Shamir, B.: Buffer overflows of merging streams. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms, pp.\u00a0244\u2013245. ACM Press, New York (2003)"},{"key":"9143_CR3","doi-asserted-by":"crossref","unstructured":"Kothapalli, K., Scheideler, C.: Information gathering in adversarial systems: lines and cycles. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms, pp.\u00a0333\u2013342 (2003)","DOI":"10.1145\/777412.777471"},{"key":"9143_CR4","first-page":"484","volume-title":"Proceedings of the 13th Annual European Symposium on Algorithms","author":"Y. Azar","year":"2005","unstructured":"Azar, Y., Zachut, R.: Packet routing and information gathering in lines, rings and trees. In: Proceedings of the 13th Annual European Symposium on Algorithms, pp.\u00a0484\u2013495. Springer, New York (2005)"},{"key":"9143_CR5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/COMST.1999.5340708","volume":"2","author":"M. Labrador","year":"1999","unstructured":"Labrador, M., Banerjee, S.: Packet dropping policies for ATM and IP networks. IEEE Commun. Surv. 2, 2\u201314 (1999)","journal-title":"IEEE Commun. Surv."},{"key":"9143_CR6","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/375827.375849","volume":"48","author":"A.Z. Broder","year":"2001","unstructured":"Broder, A.Z., Frieze, A.M., Upfal, E.: A general approach to dynamic packet routing with bounded buffers. J. ACM 48, 324\u2013349 (2001)","journal-title":"J. ACM"},{"key":"9143_CR7","first-page":"348","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","author":"A. Broder","year":"1996","unstructured":"Broder, A., Upfal, E.: Dynamic deflection routing on arrays. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp.\u00a0348\u2013355. ACM Press, New York (1996)"},{"key":"9143_CR8","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/SFCS.1989.63529","volume-title":"Proceedings of the 30th Annual IEEE Symposium on Fondations of Computer Science","author":"M. Mihail","year":"1989","unstructured":"Mihail, M.: Conductance and convergence of markov chains\u2014a combinatorial treatment of expanders. In: Proceedings of the 30th Annual IEEE Symposium on Fondations of Computer Science, pp.\u00a0526\u2013531. IEEE, Philadelphia (1989)"},{"key":"9143_CR9","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 53, 317\u2013327 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"9143_CR10","doi-asserted-by":"crossref","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 Trans. Commun. 42, 3051\u20133061 (1994)","journal-title":"IEEE Trans. Commun."},{"key":"9143_CR11","first-page":"13","volume":"48","author":"A. Borodin","year":"2001","unstructured":"Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J.\u00a0ACM 48, 13\u201338 (2001)","journal-title":"J.\u00a0ACM"},{"key":"9143_CR12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/363647.363677","volume":"48","author":"M. Andrews","year":"2001","unstructured":"Andrews, M., Awerbuch, B., Fern\u00e1ndez, A., Leighton, T., Liu, Z., Kleinberg, J.: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48, 39\u201369 (2001)","journal-title":"J. ACM"},{"key":"9143_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00453-005-1189-3","volume":"45","author":"C. Busch","year":"2006","unstructured":"Busch, C., Magdon-Ismail, M., Mavronicolas, M., Spirakis, P.G.: Direct routing: Algorithms and complexity. Algorithmica 45, 45\u201368 (2006)","journal-title":"Algorithmica"},{"key":"9143_CR14","first-page":"32","volume-title":"Proceedings of the 34th Annual IEEE Symposium on Fondations of Computer Science","author":"B. Awerbuch","year":"1993","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput competitive on-line routing. In: Proceedings of the 34th Annual IEEE Symposium on Fondations of Computer Science, pp.\u00a032\u201340. IEEE, Philadelphia (1993)"},{"key":"9143_CR15","first-page":"142","volume-title":"Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms","author":"C. Scheideler","year":"1996","unstructured":"Scheideler, C., V\u00f6cking, B.: Universal continuous routing strategies. In: Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms, pp.\u00a0142\u2013151. ACM Press, New York (1996)"},{"key":"9143_CR16","doi-asserted-by":"crossref","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. 324, 161\u2013182 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9143_CR17","first-page":"134","volume-title":"Proceedings of the 21th Annual ACM Symposium on Principles of Distributed Computing","author":"Z. Lotker","year":"2002","unstructured":"Lotker, Z., Patt-Shamir, B.: Nearly optimal FIFO buffer management for DiffServ. In: Proceedings of the 21th Annual ACM Symposium on Principles of Distributed Computing, pp.\u00a0134\u2013143. ACM Press, New York (2002)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9143-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9143-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9143-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:01Z","timestamp":1559123101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9143-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,7]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9143"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9143-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,7]]}}}