Skip to main content
SpringerLink
Log in

Essential Traffic Parameters for Shared Memory Switch Performance

  • Conference paper
  • First Online:
Structural Information and Communication Complexity (SIROCCO 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9439))

Abstract

Cloud applications bring new challenges to the design of network elements, in particular accommodating for the burstiness of traffic workloads. Shared memory switches represent the best candidate architecture to exploit buffer capacity; 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aiello, W., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. ACM Transactions on Algorithms 5(1) (2008)

    Google Scholar 

  2. Aiello, W., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differentiated services. J. Algorithms 55(2), 113–141 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. SIAM Journal on Computing 35(2), 278–304 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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–514 (2014)

    Google Scholar 

  5. Azar, Y., Litichevskey, A.: Maximizing throughput in multi-queue switches. Algorithmica 45(1), 69–90 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Azar, Y., Richter, Y.: An improved algorithm for CIOQ switches. ACM Transactions on Algorithms 2(2), 282–295 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. BBC News. US Watchdog to Propose New Net Neutrality Rules (2014). http://www.bbc.com/news/technology-27141121 .

  8. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)

    Google Scholar 

  9. 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–1529 (2001)

    Google Scholar 

  10. Chowdhury, M., Zhong, Y., Stoica, I.: Efficient coflow scheduling with varys. In: SIGCOMM, pp. 443–454 (2014)

    Google Scholar 

  11. Chuprikov, P., Nikolenko, S.I., Kogan, K.: Priority queueing with multiple packet characteristics. In: INFOCOM, pp. 1–9 (2015)

    Google Scholar 

  12. Costa, P., Donnelly, A., Rowstron, A.I.T., O’Shea, 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–42 (2012)

    Google Scholar 

  13. 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

  14. Englert, M., Westermann, M.: Lower and upper bounds on FIFO buffer management in QoS switches. Algorithmica 53(4), 523–548 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Eugster, P., Kogan, K., Nikolenko, S., Sirotkin, A.: Shared memory buffer management for heterogeneous packet processing. In: ICDCS (2014)

    Google Scholar 

  16. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance, pp. 397–413 (1993)

    Google Scholar 

  17. CAIDA The Cooperative Association for Internet Data Analysis. http://www.caida.org/

  18. Goldwasser, M.: A survey of buffer management policies for packet switches. SIGACT News 41(1), 100–128 (2010)

    Article  Google Scholar 

  19. 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–26 (2013)

    Google Scholar 

  20. Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., Zolla, J., Hölzle, U., Stuart, S., Vahdat, A.: B4: experience with a globally-deployed software defined wan. In: ACM SIGCOMM 2013 Conference, pp. 3–14 (2013)

    Google Scholar 

  21. Keslassy, I., Kogan, K., Scalosub, G., Segal, M.: Providing performance guarantees in multipass network processors. IEEE/ACM Trans. Netw. 20(6), 1895–1909 (2012)

    Article  Google Scholar 

  22. Kesselman, A., Kogan, K., Segal, M.: Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distributed Computing 23(3), 163–175 (2010)

    Article  MATH  Google Scholar 

  23. Kesselman, A., Kogan, K., Segal, M.: Improved competitive performance bounds for CIOQ switches. Algorithmica 63(1-2), 411–424 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  24. Kesselman, A., Kogan, K., Segal, M.: Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. Chicago Journal of Theoretical Computer Science (2012)

    Google Scholar 

  25. Kesselman, A., Kogan, K.: Nonpreemptive Scheduling of Optical Switches. IEEE Transactions on Communications 55(6), 1212–1219 (2007)

    Article  Google Scholar 

  26. Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. SIAM Journal on Computing 33(3), 563–583 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  27. Kesselman, A., Mansour, Y.: Harmonic buffer management policy for shared memory switches. Theor. Comput. Sci. 324(2-3), 161–182 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  28. Kogan, K., López-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)

    Google Scholar 

  29. Kogan, K., López-Ortiz, A., Nikolenko, S., Sirotkin, A.: Multi-queued network processors for packets with heterogeneous processing requirements. In: COMSNETS, pp. 1–10 (2013)

    Google Scholar 

  30. Kogan, K., López-Ortiz, A., Nikolenko, S., Scalosub, G., Segal, M.: Balancing work and size with bounded buffers. In: COMSNETS, pp. 1–8 (2014)

    Google Scholar 

  31. Kogan, K., López-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. 7659, pp. 248–260. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  32. Kogan, K., López-Ortiz, A., Nikolenko, S., Sirotkin, A.: A taxonomy of semi-FIFO policies. In: IPCCC, pp. 295–304 (2012)

    Google Scholar 

  33. Kogan, K., Nikolenko, S., Keshav, S., López-Ortiz, A.: Efficient demand assignment in multi-connected microgrids with a shared central grid. In: SustainIT, pp. 1–5 (2013)

    Google Scholar 

  34. Mansour, Y., Patt-Shamir, B., Lapid, O.: Optimal smoothing schedules for real-time streams. Distributed Computing 17(1), 77–89 (2004)

    Article  MATH  Google Scholar 

  35. Nikolenko, S.I., Kogan, K.: Single and multiple buffer processing. In: Encyclopedia of Algorithms. Springer (2015)

    Google Scholar 

  36. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  37. 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–1040 (2007)

    Google Scholar 

  38. Yu, Y., Gunda, P.K., Isard, M.: Distributed aggregation for data-parallel computing: interfaces and implementations. In: SOSP, pp. 247–260 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Purdue University, Lafayette, IN, USA

    Patrick Eugster

  2. Technical University of Darmstadt, Darmstadt, Germany

    Patrick Eugster

  3. Google Inc., Mountain View, California, USA

    Alex Kesselman

  4. IMDEA Networks Institute, Madrid, Spain

    Kirill Kogan

  5. National Research University Higher School of Economics, St. Petersburg, Russia

    Sergey Nikolenko

  6. Steklov Institute of Mathematics at St.Petersburg, St.Petersburg, Russia

    Sergey Nikolenko

  7. International Laboratory for Applied Network Research, National Research University Higher School of Economics, Moscow, Russia

    Alexander Sirotkin

  8. St. Petersburg Institute for Informatics and Automation of the RAS, St. Petersburg, Russia

    Alexander Sirotkin

Authors
  1. Patrick Eugster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alex Kesselman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kirill Kogan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sergey Nikolenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alexander Sirotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrick Eugster .

Editor information

Editors and Affiliations

  1. Dept of Mathematics and Comp Science, Paderborn University, Paderborn, Nordrhein-Westfalen, Germany

    Christian Scheideler

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Eugster, P., Kesselman, A., Kogan, K., Nikolenko, S., Sirotkin, A. (2015). Essential Traffic Parameters for Shared Memory Switch Performance. In: Scheideler, C. (eds) Structural Information and Communication Complexity. SIROCCO 2015. Lecture Notes in Computer Science(), vol 9439. Springer, Cham. https://doi.org/10.1007/978-3-319-25258-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25258-2_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25257-5

  • Online ISBN: 978-3-319-25258-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation