{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:34:22Z","timestamp":1725834862358},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252575"},{"type":"electronic","value":"9783319252582"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_5","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T07:10:18Z","timestamp":1445238618000},"page":"61-75","source":"Crossref","is-referenced-by-count":6,"title":["Essential Traffic Parameters for Shared Memory Switch Performance"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Eugster","sequence":"first","affiliation":[]},{"given":"Alex","family":"Kesselman","sequence":"additional","affiliation":[]},{"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":[[2015,11,20]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. ACM Transactions on Algorithms\u00a05(1) (2008)","DOI":"10.1145\/1435375.1435378"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","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.: Competitive queue policies for differentiated services. J. Algorithms\u00a055(2), 113\u2013141 (2005)","journal-title":"J. Algorithms"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1137\/S0097539704446268","volume":"35","author":"S. Albers","year":"2005","unstructured":"Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. SIAM Journal on Computing\u00a035(2), 278\u2013304 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Alizadeh, M., Edsall, T., Dharmapurikar, S., Vaidyanathan, R., Chu, K., Fingerhut, A., Lam, V.T., Matus, F., Pan, R., Yadav, N., Varghese, G.: CONGA: distributed congestion-aware load balancing for datacenters. In: ACM SIGCOMM 2014 Conference, pp. 503\u2013514 (2014)","DOI":"10.1145\/2619239.2626316"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-005-1190-x","volume":"45","author":"Y. Azar","year":"2006","unstructured":"Azar, Y., Litichevskey, A.: Maximizing throughput in multi-queue switches. Algorithmica\u00a045(1), 69\u201390 (2006)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1145\/1150334.1150342","volume":"2","author":"Y. Azar","year":"2006","unstructured":"Azar, Y., Richter, Y.: An improved algorithm for CIOQ switches. ACM Transactions on Algorithms\u00a02(2), 282\u2013295 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"5_CR7","unstructured":"BBC News. US Watchdog to Propose New Net Neutrality Rules (2014). http:\/\/www.bbc.com\/news\/technology-27141121 ."},{"key":"5_CR8","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"5_CR9","unstructured":"Feng, W.C., Kandlur, D.D., Saha, D., Shin, K.G.: Stochastic fair blue: A queue management algorithm for enforcing fairness. In: INFOCOM, pp. 1520\u20131529 (2001)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Zhong, Y., Stoica, I.: Efficient coflow scheduling with varys. In: SIGCOMM, pp. 443\u2013454 (2014)","DOI":"10.1145\/2619239.2626315"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Chuprikov, P., Nikolenko, S.I., Kogan, K.: Priority queueing with multiple packet characteristics. In: INFOCOM, pp. 1\u20139 (2015)","DOI":"10.1109\/INFOCOM.2015.7218519"},{"key":"5_CR12","unstructured":"Costa, P., Donnelly, A., Rowstron, A.I.T., O\u2019Shea, G.: Camdoop: Exploiting in-network aggregation for big data applications. In: Proc. 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2012), pp. 29\u201342 (2012)"},{"key":"5_CR13","unstructured":"Das, S., Sankar, R.: Broadcom smart-buffer technology in data center switches for cost-effective performance scaling of cloud applications (2012). https:\/\/www.broadcom.com\/collateral\/etp\/SBT-ETP100.pdf"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00453-008-9236-5","volume":"53","author":"M. Englert","year":"2009","unstructured":"Englert, M., Westermann, M.: Lower and upper bounds on FIFO buffer management in QoS switches. Algorithmica\u00a053(4), 523\u2013548 (2009)","journal-title":"Algorithmica"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Eugster, P., Kogan, K., Nikolenko, S., Sirotkin, A.: Shared memory buffer management for heterogeneous packet processing. In: ICDCS (2014)","DOI":"10.1109\/ICDCS.2014.55"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance, pp. 397\u2013413 (1993)","DOI":"10.1109\/90.251892"},{"key":"5_CR17","unstructured":"CAIDA The Cooperative\u00a0Association for Internet Data\u00a0Analysis. http:\/\/www.caida.org\/"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1753171.1753195","volume":"41","author":"M. Goldwasser","year":"2010","unstructured":"Goldwasser, M.: A survey of buffer management policies for packet switches. SIGACT News\u00a041(1), 100\u2013128 (2010)","journal-title":"SIGACT News"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Hong, C.-Y., Kandula, S., Mahajan, R., Zhang, M., Gill, V., Nanduri, M., Wattenhofer, R.: Achieving high utilization with software-driven WAN. In: ACM SIGCOMM 2013 Conference, pp. 15\u201326 (2013)","DOI":"10.1145\/2486001.2486012"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., Zolla, J., H\u00f6lzle, U., Stuart, S., Vahdat, A.: B4: experience with a globally-deployed software defined wan. In: ACM SIGCOMM 2013 Conference, pp. 3\u201314 (2013)","DOI":"10.1145\/2486001.2486019"},{"issue":"6","key":"5_CR21","doi-asserted-by":"publisher","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.: Providing performance guarantees in multipass network processors. IEEE\/ACM Trans. Netw.\u00a020(6), 1895\u20131909 (2012)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00446-010-0114-4","volume":"23","author":"A. Kesselman","year":"2010","unstructured":"Kesselman, A., Kogan, K., Segal, M.: Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distributed Computing\u00a023(3), 163\u2013175 (2010)","journal-title":"Distributed Computing"},{"issue":"1-2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00453-011-9539-9","volume":"63","author":"A. Kesselman","year":"2012","unstructured":"Kesselman, A., Kogan, K., Segal, M.: Improved competitive performance bounds for CIOQ switches. Algorithmica\u00a063(1-2), 411\u2013424 (2012)","journal-title":"Algorithmica"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Kogan, K., Segal, M.: Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. Chicago Journal of Theoretical Computer Science (2012)","DOI":"10.4086\/cjtcs.2012.005"},{"issue":"6","key":"5_CR25","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/TCOMM.2007.898848","volume":"55","author":"A. Kesselman","year":"2007","unstructured":"Kesselman, A., Kogan, K.: Nonpreemptive Scheduling of Optical Switches. IEEE Transactions on Communications\u00a055(6), 1212\u20131219 (2007)","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"5_CR26","doi-asserted-by":"publisher","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.: Buffer overflow management in QoS switches. SIAM Journal on Computing\u00a033(3), 563\u2013583 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"2-3","key":"5_CR27","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(2-3), 161\u2013182 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR28","unstructured":"Kogan, K., L\u00f3pez-Ortiz, A., Nikolenko, S., Scalosub, G., Segal, M.: Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors. CoRR, abs\/1202.5755 (2013)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Kogan, K., L\u00f3pez-Ortiz, A., Nikolenko, S., Sirotkin, A.: Multi-queued network processors for packets with heterogeneous processing requirements. In: COMSNETS, pp. 1\u201310 (2013)","DOI":"10.1109\/COMSNETS.2013.6465538"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Kogan, K., L\u00f3pez-Ortiz, A., Nikolenko, S., Scalosub, G., Segal, M.: Balancing work and size with bounded buffers. In: COMSNETS, pp. 1\u20138 (2014)","DOI":"10.1109\/COMSNETS.2014.6734878"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-34862-4_18","volume-title":"Design and Analysis of Algorithms","author":"K. Kogan","year":"2012","unstructured":"Kogan, K., L\u00f3pez-Ortiz, A., Nikolenko, S.I., Sirotkin, A.V., Tugaryov, D.: FIFO queueing policies for packets with heterogeneous processing. In: Even, G., Rawitz, D. (eds.) MedAlg 2012. LNCS, vol.\u00a07659, pp. 248\u2013260. Springer, Heidelberg (2012)"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Kogan, K., L\u00f3pez-Ortiz, A., Nikolenko, S., Sirotkin, A.: A taxonomy of semi-FIFO policies. In: IPCCC, pp. 295\u2013304 (2012)","DOI":"10.1109\/PCCC.2012.6407771"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Kogan, K., Nikolenko, S., Keshav, S., L\u00f3pez-Ortiz, A.: Efficient demand assignment in multi-connected microgrids with a shared central grid. In: SustainIT, pp. 1\u20135 (2013)","DOI":"10.1109\/SustainIT.2013.6685197"},{"issue":"1","key":"5_CR34","doi-asserted-by":"publisher","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.: Optimal smoothing schedules for real-time streams. Distributed Computing\u00a017(1), 77\u201389 (2004)","journal-title":"Distributed Computing"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Nikolenko, S.I., Kogan, K.: Single and multiple buffer processing. In: Encyclopedia of Algorithms. Springer (2015)","DOI":"10.1007\/978-1-4939-2864-4_535"},{"issue":"2","key":"5_CR36","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Yang, H.-C., Dasdan, A., Hsiao, R.-L., Parker Jr., D.S.: Map-reduce-merge: simplified relational data processing on large clusters. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 1029\u20131040 (2007)","DOI":"10.1145\/1247480.1247602"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Yu, Y., Gunda, P.K., Isard, M.: Distributed aggregation for data-parallel computing: interfaces and implementations. In: SOSP, pp. 247\u2013260 (2009)","DOI":"10.1145\/1629575.1629600"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T17:54:26Z","timestamp":1567274066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}