{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:28Z","timestamp":1740103828725,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T00:00:00Z","timestamp":1523577600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10951-018-0564-2","type":"journal-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T07:52:43Z","timestamp":1523605963000},"page":"533-543","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Admission control in shared memory switches"],"prefix":"10.1007","volume":"21","author":[{"given":"Patrick","family":"Eugster","sequence":"first","affiliation":[]},{"given":"Alex","family":"Kesselman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5384-1899","authenticated-orcid":false,"given":"Kirill","family":"Kogan","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Nikolenko","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Sirotkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,13]]},"reference":[{"issue":"1","key":"564_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1435375.1435378","volume":"5","author":"W Aiello","year":"2008","unstructured":"Aiello, W., Kesselman, A., & Mansour, Y. (2008). Competitive buffer management for shared-memory switches. ACM Transactions on Algorithms, 5(1), 3.","journal-title":"ACM Transactions on Algorithms"},{"issue":"2","key":"564_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.jalgor.2004.04.004","volume":"55","author":"W Aiello","year":"2005","unstructured":"Aiello, W., Mansour, Y., Rajagopolan, S., & Ros\u00e9n, A. (2005). Competitive queue policies for differentiated services. Journal of Algorithms, 55(2), 113\u2013141.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"564_CR3","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1137\/S0097539704446268","volume":"35","author":"S Albers","year":"2005","unstructured":"Albers, S., & Schmidt, M. (2005). On the performance of greedy algorithms in packet buffering. SIAM Journal on Computing, 35(2), 278\u2013304.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"564_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00453-005-1190-x","volume":"45","author":"Y Azar","year":"2006","unstructured":"Azar, Y., & Litichevskey, A. (2006). Maximizing throughput in multi-queue switches. Algorithmica, 45(1), 69\u201390.","journal-title":"Algorithmica"},{"issue":"2","key":"564_CR5","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1145\/1150334.1150342","volume":"2","author":"Y Azar","year":"2006","unstructured":"Azar, Y., & Richter, Y. (2006). An improved algorithm for CIOQ switches. ACM Transactions on Algorithms, 2(2), 282\u2013295.","journal-title":"ACM Transactions on Algorithms"},{"key":"564_CR6","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."},{"key":"564_CR7","doi-asserted-by":"crossref","unstructured":"Chuprikov, P., Nikolenko, S. I., & Kogan, K. (2015). Priority queueing with multiple packet characteristics. In INFOCOM, pp. 1418\u20131426.","DOI":"10.1109\/INFOCOM.2015.7218519"},{"key":"564_CR8","unstructured":"Costa, P., Donnelly, A., Rowstron, A. I. T., & O\u2019Shea, G. (2012). Camdoop: Exploiting in-network aggregation for big data applications. In Proceedings of the 9th USENIX symposium on networked systems design and implementation, NSDI 2012, San Jose, CA, USA, 25\u201327 April 2012, pp. 29\u201342."},{"key":"564_CR9","unstructured":"for Internet Data Analysis, C. T. C. A. (2015). http:\/\/www.caida.org\/."},{"key":"564_CR10","doi-asserted-by":"crossref","unstructured":"Davydow, A., Chuprikov, P., Nikolenko, S. I., & Kogan, K. (2017) Throughput optimization with latency constraints. In INFOCOM, pp. 1\u20139.","DOI":"10.1109\/INFOCOM.2017.8057015"},{"issue":"4","key":"564_CR11","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00453-008-9236-5","volume":"53","author":"M Englert","year":"2009","unstructured":"Englert, M., & Westermann, M. (2009). Lower and upper bounds on FIFO buffer management in QoS switches. Algorithmica, 53(4), 523\u2013548.","journal-title":"Algorithmica"},{"key":"564_CR12","doi-asserted-by":"crossref","unstructured":"Eugster, P., Kesselman, A., Kogan, K., Nikolenko, S. I., & Sirotkin, A. (2015). Essential traffic parameters for shared memory switch performance. In SIROCCO, pp. 1\u201315.","DOI":"10.1007\/978-3-319-25258-2_5"},{"key":"564_CR13","doi-asserted-by":"crossref","unstructured":"Eugster, P. T., Kogan, K., Nikolenko, S. I., & Sirotkin, A. (2014). Shared memory buffer management for heterogeneous packet processing. In IEEE 34th international conference on distributed computing systems, ICDCS 2014, Madrid, Spain, June 30\u2013July 3, 2014, pp. 471\u2013480.","DOI":"10.1109\/ICDCS.2014.55"},{"issue":"1","key":"564_CR14","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/1753171.1753195","volume":"41","author":"M Goldwasser","year":"2010","unstructured":"Goldwasser, M. (2010). A survey of buffer management policies for packet switches. SIGACT News, 41(1), 100\u2013128.","journal-title":"SIGACT News"},{"issue":"6","key":"564_CR15","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/JSAC.1986.1146393","volume":"4","author":"H Heffes","year":"1986","unstructured":"Heffes, H., & Lucantoni, D. (1986). A markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE Journal on Selected Areas in Communications, 4(6), 856\u2013868. https:\/\/doi.org\/10.1109\/JSAC.1986.1146393.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"564_CR16","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TCOM.1978.1094076","volume":"26","author":"M Irland","year":"1978","unstructured":"Irland, M. (1978). Best effort and priority queuing policies for buffered crossbar switches. IEEE Transactions on Communications, 26(3), 328\u2013337.","journal-title":"IEEE Transactions on Communications"},{"issue":"6","key":"564_CR17","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1109\/TNET.2012.2186979","volume":"20","author":"I Keslassy","year":"2012","unstructured":"Keslassy, I., Kogan, K., Scalosub, G., & Segal, M. (2012). Providing performance guarantees in multipass network processors. IEEE\/ACM Transactions on Networking, 20(6), 1895\u20131909.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"564_CR18","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TCOMM.2007.898848","volume":"55","author":"A Kesselman","year":"2007","unstructured":"Kesselman, A., & Kogan, K. (2007). Nonpreemptive scheduling of optical switches. IEEE Transactions on Communications, 55(6), 1212\u20131219.","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"564_CR19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s00446-010-0114-4","volume":"23","author":"A Kesselman","year":"2010","unstructured":"Kesselman, A., Kogan, K., & Segal, M. (2010). Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distributed Computing, 23(3), 163\u2013175.","journal-title":"Distributed Computing"},{"issue":"5","key":"564_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/cjtcs.2012.005","volume":"2012","author":"A Kesselman","year":"2012","unstructured":"Kesselman, A., Kogan, K., & Segal, M. (2012). Best effort and priority queuing policies for buffered crossbar switches. Chicago Journal of Theoretical Computer Science, 2012(5), 1\u201314.","journal-title":"Chicago Journal of Theoretical Computer Science"},{"issue":"1\u20132","key":"564_CR21","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00453-011-9539-9","volume":"63","author":"A Kesselman","year":"2012","unstructured":"Kesselman, A., Kogan, K., & Segal, M. (2012b). Improved competitive performance bounds for CIOQ switches. Algorithmica, 63(1\u20132), 411\u2013424.","journal-title":"Algorithmica"},{"issue":"3","key":"564_CR22","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/S0097539701399666","volume":"33","author":"A Kesselman","year":"2004","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.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"564_CR23","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/S0097539701399666","volume":"33","author":"A Kesselman","year":"2004","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.","journal-title":"SIAM Journal on Computing"},{"issue":"2\u20133","key":"564_CR24","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. (2004). Harmonic buffer management policy for shared memory switches. Theoretical Computer Science, 324(2\u20133), 161\u2013182.","journal-title":"Theoretical Computer Science"},{"key":"564_CR25","doi-asserted-by":"crossref","unstructured":"Kogan, K., L\u00f3pez-Ortiz, A., Nikolenko, S. I., & Sirotkin, A. V. (2012). A taxonomy of semi-FIFO policies. In Proceedings of 31st IEEE international performance computing and communications conference (pp. 295\u2013304). IEEE Press.","DOI":"10.1109\/PCCC.2012.6407771"},{"key":"564_CR26","doi-asserted-by":"crossref","unstructured":"Kogan, K., L\u00f3pez-Ortiz, A., Nikolenko, S. I., Sirotkin, A. V., & Tugaryov, D. (2012). FIFO queueing policies for packets with heterogeneous processing. In Proceedings of 1st Mediterranean Conference on Algorithms, Lecture Notes in Computer Science (Vol. 7659, pp. 248\u2013260). IEEE Press.","DOI":"10.1007\/978-3-642-34862-4_18"},{"key":"564_CR27","doi-asserted-by":"crossref","unstructured":"Kogan, K., Nikolenko, S. I., Keshav, S., & L\u00f3pez-Ortiz, A. (2013). Efficient demand assignment in multi-connected microgrids with a shared central grid. In SustainIT, pp. 1\u20135.","DOI":"10.1109\/SustainIT.2013.6685197"},{"key":"564_CR28","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.jnca.2016.07.010","volume":"74","author":"K Kogan","year":"2016","unstructured":"Kogan, K., L\u00f3pez-Ortiz, A., Nikolenko, S. I., Scalosub, G., & Segal, M. (2016). Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors. Journal of Network and Computer Applications, 74, 31\u201343.","journal-title":"Journal of Network and Computer Applications"},{"issue":"1","key":"564_CR29","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00446-003-0101-0","volume":"17","author":"Y Mansour","year":"2004","unstructured":"Mansour, Y., Patt-Shamir, B., & Lapid, O. (2004). Optimal smoothing schedules for real-time streams. Distributed Computing, 17(1), 77\u201389.","journal-title":"Distributed Computing"},{"key":"564_CR30","unstructured":"Nikolenko, S. I., & Kogan, K. (2015). Single and multiple buffer processing. In Encyclopedia of algorithms. Springer."},{"issue":"4","key":"564_CR31","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/1243401.1243411","volume":"34","author":"K Pruhs","year":"2007","unstructured":"Pruhs, K. (2007). Competitive online scheduling for server systems. SIGMETRICS Performance Evaluation Review, 34(4), 52\u201358.","journal-title":"SIGMETRICS Performance Evaluation Review"},{"key":"564_CR32","doi-asserted-by":"crossref","unstructured":"ShahHeydari, S., & LeNgoc, T. (2000). MMPP models for multimedia traffic. Telecommunication Systems, 15(3), 273\u2013293. https:\/\/doi.org\/10.1023\/A:1019199013546.","DOI":"10.1023\/A:1019199013546"},{"issue":"2","key":"564_CR33","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":"564_CR34","doi-asserted-by":"crossref","unstructured":"Yang, H., Dasdan, A., Hsiao, R., Jr., & D. S. P. (2007). Map-reduce-merge: Simplified relational data processing on large clusters. In Proceedings of the ACM SIGMOD international conference on management of data, Beijing, China, 12\u201314 June 2007, pp. 1029\u20131040.","DOI":"10.1145\/1247480.1247602"},{"key":"564_CR35","doi-asserted-by":"crossref","unstructured":"Yu, Y., Gunda, P. K., & Isard, M. (2009). Distributed aggregation for data-parallel computing: Interfaces and implementations. In SOSP, pp. 247\u2013260.","DOI":"10.1145\/1629575.1629600"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0564-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0564-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0564-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T15:04:19Z","timestamp":1571151859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0564-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,13]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["564"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0564-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2018,4,13]]}}}