Admission control in shared memory switches
Cloud applications bring new challenges to the design of network elements, in particular the burstiness of traffic workloads. A shared memory switch is a good candidate architecture to exploit buffer capacity; in this work, we analyze the performance of this architecture. Our goal is to explore the impact of additional traffic characteristics such as varying processing requirements and packet values on objective functions. The outcome of this work is a better understanding of the relevant parameters for buffer management to achieve better performance in dynamic environments of data centers. We consider a model that captures more of the properties of the target architecture than previous work and consider several scheduling and buffer management algorithms that are specifically designed to optimize its performance. In particular, we provide analytic guarantees for the throughput performance of our algorithms that are independent from specific distributions of packet arrivals. We furthermore report on a comprehensive simulation study which validates our analytic results.
KeywordsBuffer management Admission control Packet scheduling
- Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press.Google Scholar
- Chuprikov, P., Nikolenko, S. I., & Kogan, K. (2015). Priority queueing with multiple packet characteristics. In INFOCOM, pp. 1418–1426.Google Scholar
- Costa, P., Donnelly, A., Rowstron, A. I. T., & O’Shea, 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–27 April 2012, pp. 29–42.Google Scholar
- for Internet Data Analysis, C. T. C. A. (2015). http://www.caida.org/.
- Davydow, A., Chuprikov, P., Nikolenko, S. I., & Kogan, K. (2017) Throughput optimization with latency constraints. In INFOCOM, pp. 1–9.Google Scholar
- 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–July 3, 2014, pp. 471–480.Google Scholar
- Kogan, K., López-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–304). IEEE Press.Google Scholar
- Kogan, K., López-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–260). IEEE Press.Google Scholar
- Kogan, K., Nikolenko, S. I., Keshav, S., & López-Ortiz, A. (2013). Efficient demand assignment in multi-connected microgrids with a shared central grid. In SustainIT, pp. 1–5.Google Scholar
- Nikolenko, S. I., & Kogan, K. (2015). Single and multiple buffer processing. In Encyclopedia of algorithms. Springer.Google Scholar
- 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–14 June 2007, pp. 1029–1040.Google Scholar
- Yu, Y., Gunda, P. K., & Isard, M. (2009). Distributed aggregation for data-parallel computing: Interfaces and implementations. In SOSP, pp. 247–260.Google Scholar