Skip to main content

A Novel Core Stateless Virtual Clock Scheduling Algorithm

  • Conference paper
  • 491 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3619))

Abstract

In this paper, a core-stateless virtual clock-based scheduling algorithm is developed, which combines the simplicity and high performance of FCFS and the fair resource allocation of Fair Queue. The basic idea of this algorithm is using virtual clock to calculate the expected depart time of every packet, and construct a packet queue according to the expected depart time. The algorithm uses only one queue to approximate the multi queue in fair queue algorithm. Because of using the only one packet queue, it is unnecessary for routers to perform per flow state management and the algorithm has good performance in scalability.

This work is supported by the Major Research Plan of National Natural Science Foundation of China, Grant No.90304010.

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   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queuing algorithm. In: Proceedings of ACM SIGCOMM 1989, Austin, TX, pp. 1–12 (1989)

    Google Scholar 

  2. Shreedhar, M., Varghese, G.: Efficient fair queuing using deficit round-robin. IEEE/ACM Transactions on Networking 4(3), 375–385 (1996)

    Article  Google Scholar 

  3. Zhang, L.: Virtual Clock: A new traffic control algorithm for packet switching networks. In: Proceedings of ACM SIGCOMM 1990, Philadelphia, PA, September 1990, pp. 19–29 (1990)

    Google Scholar 

  4. Stoica, I., Zhang, H.: Providing guaranteed services without per flow management[A]. In: ACM SIGCOMM 1999[C] (1999)

    Google Scholar 

  5. Verma, D., Zhang, H., Ferrari, D.: Guaranteeing delay jitter bounds in packet switching networks. In: Proceedings of Tricomm 1991, Chapel Hill, North Carolina, April 1991, pp. 35–46 (1991)

    Google Scholar 

  6. Zhang, H., Ferrari, D.: Rate-controlled service disciplines. Journal of high speed networks 3(4), 389–412 (1994)

    Google Scholar 

  7. Zhang, Z., Duan, Z., Hou, Y.: Virtual time reference system: A unifying scheduling framework for scalable support of guaranteed services. IEEE Journal on Selected Areas in Communications 18(12), 2684–2695 (2000)

    Article  Google Scholar 

  8. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated services. IETF, RFC 2475 (December 1998)

    Google Scholar 

  9. Network simulator (NS2-2.27)[EB/OL] (2004), http://www.isi.edu/nsnam/ns

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

Gao, W., Wang, J., Chen, S. (2005). A Novel Core Stateless Virtual Clock Scheduling Algorithm. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_70

Download citation

  • DOI: https://doi.org/10.1007/11534310_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28102-3

  • Online ISBN: 978-3-540-31868-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics