Skip to main content

Simulating Session Distribution Algorithms for Switch with Multiple Outputs Having Finite Size Queues

  • Conference paper
  • 2376 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3398))

Abstract

We propose and simulate session distribution algorithms for switch with multiple output links. The proposed algorithms try to allocate a new session to an output link in a fashion that output link utilization can be maximized but packet delay difference between sessions in a service class be minimized. The simulation proves that SCDF (Shortest Class Delay First) shows the best performance in terms of maximizing link utilization and balancing packet delay difference between sessions.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Siripongwutikorn, P., Banerjee, S., Tipper, D.: A Survey of Adaptive Bandwidth Control Algorithms. IEEE Communication Survey & Tutorials 5(1), 14–26 (2003)

    Article  Google Scholar 

  2. Ni, N., Bhuyan, L.N.: Fair Scheduling and Buffer Management in Internet Routers. In: Proc. of IEEE INFOCOM 2002, New York (2002)

    Google Scholar 

  3. Stiliadis, D., Varma, A.: Rate-Proportional Servers: A Design Methodology for Fair Queueing Algorithms. IEEE/ACM Transactions on Networking 6(2), 164–174 (1998)

    Article  Google Scholar 

  4. Stiliadis, D., Varma, A.: Efficient Fair Queueing Algorithms for Packet Switched Networks. IEEE/ACM Transactions on Networking 6(2), 175–185 (1998)

    Article  Google Scholar 

  5. Chiussi, F.M., Francini, A.: A Distributed Scheduling Architecture for Scalable Packet Switches. IEEE Journal on Selected Areas in Communication 18(12), 2665–2683 (2000)

    Article  Google Scholar 

  6. Parekh, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. IEEE/ACM Transactions on Networking 1(3), 344–357 (1993)

    Article  Google Scholar 

  7. Demmers, A., Keshav, S., Shenker, S.: Analysis and Simulation of a Fair Queueing Algorithm. Journal of Internetworking Research and Experience 1(1), 3–26 (1990)

    Google Scholar 

  8. Bennett, J.C.R., Zang, H.: WF2Q: Worst-Case Fair Weighted Fair Queueing. In: Proc. Of IEEE INFOCOM 1996, San Francisco, California, pp. 120–128 (1996)

    Google Scholar 

  9. Bennett, J.C.R., Zang, H.: Hierarchical Packet Fair Queueing Algorithms. IEEE/ACM Transactions on Networking 5(5), 675–689 (1997)

    Article  Google Scholar 

  10. Stallings, W.: Operating Systems: Internals and Design Principles, 4th edn., pp. 408–411. Prentice-Hall, Englewood Cliffs (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shim, J., Jung, G., Choi, K. (2005). Simulating Session Distribution Algorithms for Switch with Multiple Outputs Having Finite Size Queues. In: Baik, DK. (eds) Systems Modeling and Simulation: Theory and Applications. AsiaSim 2004. Lecture Notes in Computer Science(), vol 3398. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30585-9_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30585-9_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24477-6

  • Online ISBN: 978-3-540-30585-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics