{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:57Z","timestamp":1759638897046,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T00:00:00Z","timestamp":1443571200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad (ES)","doi-asserted-by":"publisher","award":["TEC2014-55713-R"],"award-info":[{"award-number":["TEC2014-55713-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad (ES)","doi-asserted-by":"publisher","award":["RYC-2012-10788"],"award-info":[{"award-number":["RYC-2012-10788"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003176","name":"Ministerio de Educaci\u00f3n, Cultura y Deporte (ES)","doi-asserted-by":"publisher","award":["FPU12\/00505"],"award-info":[{"award-number":["FPU12\/00505"]}],"id":[{"id":"10.13039\/501100003176","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"crossref","award":["S2013\/ICE-2919"],"award-info":[{"award-number":["S2013\/ICE-2919"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"crossref","award":["S2013\/ICE2919"],"award-info":[{"award-number":["S2013\/ICE2919"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10951-015-0451-z","type":"journal-article","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T09:41:33Z","timestamp":1443606093000},"page":"135-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Measuring the impact of adversarial errors on packet scheduling strategies"],"prefix":"10.1007","volume":"19","author":[{"given":"Antonio","family":"Fern\u00e1ndez\u00a0Anta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chryssis","family":"Georgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joerg","family":"Widmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elli","family":"Zavou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,30]]},"reference":[{"key":"451_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W.\u00a0A., Mansour, Y., Rajagopolan, S., & Ros\u00e9n, A. (2000). Competitive queue policies for differentiated services. In INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE (vol.\u00a02, pp. 431\u2013440). IEEE.","DOI":"10.1109\/INFCOM.2000.832216"},{"key":"451_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Aspnes, J., Dwork, C., & Waarts, O. (1994). A theory of competitive analysis for distributed algorithms. In Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on, (pp. 401\u2013411). IEEE.","DOI":"10.1109\/SFCS.1994.365676"},{"key":"451_CR3","doi-asserted-by":"crossref","unstructured":"Anantharamu, L., Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2011). Medium access control for adversarial channels with jamming. In A. Kosowski & M. Yamashita (Eds.), Structural Information and Communication Complexity (pp. 89\u2013100). Berlin: Springer.","DOI":"10.1007\/978-3-642-22212-2_9"},{"issue":"5","key":"451_CR4","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1145\/1089023.1089028","volume":"52","author":"M Andrews","year":"2005","unstructured":"Andrews, M., & Zhang, L. (2005). Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data. Journal of the ACM, 52(5), 809\u2013834. doi: 10.1145\/1089023.1089028 . ISSN 0004-5411.","journal-title":"Journal of the ACM"},{"key":"451_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kutten, S., & Peleg, D. (1992). Competitive distributed job scheduling. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing (pp. 571\u2013580). ACM.","DOI":"10.1145\/129712.129768"},{"key":"451_CR6","unstructured":"Becchi, M. (2008). From poisson processes to self-similarity: a survey of network traffic models. Technical report, Citeseer."},{"key":"451_CR7","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press."},{"issue":"34","key":"451_CR8","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.disopt.2007.09.004","volume":"4","author":"L Epstein","year":"2007","unstructured":"Epstein, L., & van Stee, R. (2007). Online bin packing with resource augmentation. Discrete Optimization, 4(34), 322\u2013333. doi: 10.1016\/j.disopt.2007.09.004 . (ISSN 1572-5286).","journal-title":"Discrete Optimization"},{"issue":"1","key":"451_CR9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/1753171.1753195","volume":"41","author":"MH Goldwasser","year":"2010","unstructured":"Goldwasser, M. H. (2010). A survey of buffer management policies for packet switches. ACM SIGACT News, 41(1), 100\u2013128.","journal-title":"ACM SIGACT News"},{"key":"451_CR10","doi-asserted-by":"crossref","unstructured":"Jamieson, K., & Balakrishnan, H. (2007). PPR: Partial packet recovery for wireless networks. In Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM \u201907 (pp. 409\u2013420), New York, NY, USA, ACM. ISBN 978-1-59593-713-1. doi: 10.1145\/1282380.1282426 .","DOI":"10.1145\/1282380.1282426"},{"key":"451_CR11","first-page":"193","volume-title":"Approximation and online algorithms","author":"T Jurdzinski","year":"2014","unstructured":"Jurdzinski, T., Kowalski, D. R., & Lorys, K. (2014). Online packet scheduling under adversarial jamming. Approximation and online algorithms (pp. 193\u2013206). Berlin: Springer."},{"key":"451_CR12","doi-asserted-by":"crossref","unstructured":"Kesselheim, T. (2012). Dynamic packet scheduling in wireless networks. In PODC, (pp. 281\u2013290)","DOI":"10.1145\/2332432.2332487"},{"key":"451_CR13","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir,B., Schieber, B., & Sviridenko, M. (2004). Buffer overflow management in qos switches. SIAM Journal on Computing, 33(3), 563\u2013583.","DOI":"10.1137\/S0097539701399666"},{"key":"451_CR14","doi-asserted-by":"crossref","unstructured":"Kogan, K., Lpez-Ortiz, A., Nikolenko, S. I., Sirotkin, A. V., & Tugaryov, D. (2012). Fifo queueing policies for packets with heterogeneous processing. In G. Even & D. Rawitz (Eds.), Design and analysis of algorithms (Vol. 7659, pp. 248\u2013260). Lecture Notes in Computer Science Berlin Heidelberg: Springer. doi: 10.1007\/978-3-642-34862-4 . (ISBN 978-3-642-34861-7).","DOI":"10.1007\/978-3-642-34862-4"},{"key":"451_CR15","doi-asserted-by":"crossref","unstructured":"Kogan, K., Lopez-Ortiz, A., Nikolenko, S. I., & Sirotkin, A. V. (2013). Multi-queued network processors for packets with heterogeneous processing requirements. In Communication Systems and Networks (COMSNETS), 2013 Fifth International Conference on, pp. 1\u201310. doi: 10.1109\/COMSNETS.2013.6465538 .","DOI":"10.1109\/COMSNETS.2013.6465538"},{"key":"451_CR16","doi-asserted-by":"crossref","unstructured":"Li, F. (2011). A near-optimal memoryless online algorithm for fifo buffering two packet classes. In W. Wang, X. Zhu & D.-Z. Du (Eds.), Combinatorial Optimization and Applications (pp. 222\u2013233). Berlin: Springer.","DOI":"10.1007\/978-3-642-22616-8_18"},{"key":"451_CR17","unstructured":"Li, F., & Zhang, Z. (2009). Scheduling weighted packets with deadlines over a fading channel. In Information Sciences and Systems, 2009. CISS 2009. 43rd Annual Conference on, (pp. 707\u2013712). IEEE."},{"key":"451_CR18","volume-title":"Error control coding","author":"S Lin","year":"2004","unstructured":"Lin, S., & Costello, D. J. (2004). Error control coding (Vol. 123). Englewood Cliffs, NJ: Prentice-hall."},{"key":"451_CR19","doi-asserted-by":"crossref","unstructured":"Mansour, Y., Patt-Shamir, B., & Lapid, O. (2000). Optimal smoothing schedules for real-time streams. In Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (pp. 21\u201329). ACM.","DOI":"10.1145\/343477.343511"},{"key":"451_CR20","series-title":"Algorithmic aspects in information and management","volume-title":"Mixed criteria packet scheduling","author":"C Meiners","year":"2007","unstructured":"Meiners, C., & Torng, E. (2007). Mixed criteria packet scheduling., Algorithmic aspects in information and management Berlin Heidelberg: Springer."},{"key":"451_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and computing","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., & Upfal, E. (2005). Probability and computing. Cambridge: Cambridge University Press."},{"key":"451_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M. L. (2012). Scheduling: Theory, algorithms, and systems. Berlin: Springer."},{"key":"451_CR23","unstructured":"Pruhs, K., Sgall, J., & Torng, E. (2004). Online scheduling. In J. Leung (Ed.), Handbook of scheduling: Algorithms, Models and Performance analysis (pp. 15-1\u201315-41). Boca Raton, FL: CRC Press."},{"issue":"9","key":"451_CR24","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1109\/26.950341","volume":"49","author":"A Raghavan","year":"2001","unstructured":"Raghavan, A., Ramchandran, K., & Kozintsev, I. (2001). Continuous error detection (CED) for reliable communication. IEEE Transactions on Communications, 49(9), 1540\u20131549.","journal-title":"IEEE Transactions on Communications"},{"key":"451_CR25","doi-asserted-by":"crossref","unstructured":"Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing, 26, (159\u2013171).","DOI":"10.1007\/s00446-012-0180-x"},{"issue":"2","key":"451_CR26","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D. D., & Tarjan, R. E. (1985). Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2), 202\u2013208.","journal-title":"Communications of the ACM"},{"key":"451_CR27","unstructured":"Van Stee, R. (2002). On-line scheduling and bin packing, IPA dissertation series. https:\/\/books.google.com.cy\/books?id=1UzMGAAACAAJ ."},{"key":"451_CR28","doi-asserted-by":"crossref","unstructured":"Yao, A. C.-C. (1977). Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, SFCS \u201977, (pp. 222\u2013227), Washington, DC, USA. IEEE Computer Society. doi: 10.1109\/SFCS.1977.24 .","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0451-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0451-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0451-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T22:52:38Z","timestamp":1589583158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0451-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,30]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["451"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0451-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2015,9,30]]}}}