{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:48Z","timestamp":1725558948052},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141614"},{"type":"electronic","value":"9783642141621"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_20","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:26:21Z","timestamp":1278307581000},"page":"236-248","source":"Crossref","is-referenced-by-count":4,"title":["Asynchronous Throughput-Optimal Routing in Malicious Networks"],"prefix":"10.1007","author":[{"given":"Paul","family":"Bunn","sequence":"first","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/jagm.1996.0819","volume":"22","author":"Y. Afek","year":"1997","unstructured":"Afek, Y., Awerbuch, B., Gafni, E., Mansour, Y., Rosen, A., Shavit, N.: Slide\u2013 The Key to Poly. End-to-End Communication. J. of Algo\u2019s\u00a022, 158\u2013186 (1997)","journal-title":"J. of Algo\u2019s"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E.: End-to-End Communication in Unreliable Networks. In: PODC (1988)","DOI":"10.1145\/62546.62570"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Ros\u00e9n, A.: The Slide Mechanism with Applications in Dynamic Networks. In: Proc. 11th ACM SODA, pp. 35\u201346 (1992)","DOI":"10.1145\/135419.135430"},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1006\/jcss.1999.1681","volume":"60","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Adaptive Packet Routing For Bursty Adversarial Traffic. J. Comput. Syst. Sci.\u00a060(3), 482\u2013509 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR5","unstructured":"Aiello, W., Ostrovsky, R., Kushilevitz, E., Ros\u00e9n, A.: Dynamic Routing on Networks with Fixed-Size Buffers. In: Proc. 14th ACM SODA, pp. 771\u2013780 (2003)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Aspnes, J., Dwork, C., Waarts, O.: A Theory of Competitive Analysis for Distributed Algorithms. In: Proc. 35th IEEE FOCS, pp. 32\u201340 (1994)","DOI":"10.1109\/SFCS.1994.365676"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Amir, Y., Bunn, P., Ostrovsky, R.: Authenticated Adversarial Routing. In: 6th Theory of Crypt. Conf., pp. 163\u2013182 (2009)","DOI":"10.1007\/978-3-642-00457-5_11"},{"key":"20_CR8","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 FOCS, pp. 380\u2013389 (1996)","DOI":"10.1109\/SFCS.1996.548497"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-Competitive On-Line Routing. In: Proc. 34th IEEE FOCS, pp. 401\u2013411 (1993)","DOI":"10.1109\/SFCS.1993.366884"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Holmer, D., Nina-Rotaru, C., Rubens, H.: An On-Demand Secure Routing Protocol Resilient to Byzantine Failures. In: Proc. of 2002 Workshop on Wireless Security, pp. 21\u201330 (2002)","DOI":"10.1145\/570681.570684"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Leighton, T.: Improved Approximation Algorithms for the Multi-Commodity Flow Problem and Local Competitive Routing in Dynamic Networks. In: Proc. 26th ACM STOC, pp. 487\u2013496 (1994)","DOI":"10.1145\/195058.195238"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Mansour, Y., Shavit, N.: End-to-End Communication With Polynomial Overhead. In: Proc. of the 30th IEEE FOCS, pp. 358-363 (1989)","DOI":"10.1109\/SFCS.1989.63503"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-78967-3_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"B. Barak","year":"2008","unstructured":"Barak, B., Goldberg, S., Xiao, D.: Protocols and Lower Bounds for Failure Localization in the Internet. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 341\u2013360. Springer, Heidelberg (2008)"},{"key":"20_CR14","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Camb. Univ Press, Cambridge (1998)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial Queuing Theory. In: Proc. 28th ACM STOC, pp. 376\u2013385 (1996)","DOI":"10.1145\/237814.237984"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Broder, A., Frieze, A., Upfal, E.: A General Approach to Dynamic Packet Routing with Bounded Buffers. In: Proc. 37th IEEE FOCS, pp. 390\u2013399 (1996)","DOI":"10.1109\/SFCS.1996.548498"},{"key":"20_CR17","unstructured":"Bunn, P., Ostrovsky, R.: Throughput in Asynchronous Networks. arXiv Technical Report, arXiv:0910.4572 (2009)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Bunn, P., Ostrovsky, R.: Asynchronous Throughput Optimal Routing in Malicious Networks. IACR Eprint Archive, Report 2010\/231. April 2010 (2010)","DOI":"10.1007\/978-3-642-14162-1_20"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/1384529.1375480","volume":"36","author":"S. Goldberg","year":"2008","unstructured":"Goldberg, S., Xiao, D., Tromer, E., Barak, B., Rexford, J.: Path-Quality Monitoring in the Presence of Adversaries. SIGMETRICS\u00a036, 193\u2013204 (2008)","journal-title":"SIGMETRICS"},{"issue":"6","key":"20_CR20","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1137\/S0097539795296760","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Log-Space Polynomial End-to-End Communication. SIAM Journal of Computing\u00a027(6), 1531\u20131549 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, \u00c9., Tragoudas, S.: Fast Approximation Algorithms for Multicommodity Flow Problem. In: Proc. 23rd ACM STOC, pp. 101\u2013111 (1991)","DOI":"10.1145\/103418.103425"},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Amortized Efficiency of List Update and Paging Rules. Commun. ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:48:06Z","timestamp":1606168086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}