Skip to main content

A Scheduling Algorithm for a QoS Based Satellite Network

  • Conference paper
Wired/Wireless Internet Communications (WWIC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2957))

Included in the following conference series:

  • 359 Accesses

Abstract

This paper describes a new scheduling algorithm for multimedia applications on wireless networks. The scheduling algorithm is based on standard GPS class scheduling algorithms; however instead of operating on a single QoS attribute, it can use as input two variables, one governing the minimum committed rate and the other governing the access to surplus bandwidth. The scheduling algorithm also does not assume full control over the transmission because of optimizations made by the transmission modules to maximize achieved capacity.

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

Access this chapter

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. Ng, T.S.E., Stoica, I., Zhang, H.: Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors. In: Proc. of the INFOCOM (1998)

    Google Scholar 

  2. Parekh, A., Gallagher, R.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Network: The Single Node Case. IEEE/ACM Transactions on Networking (April 1994)

    Google Scholar 

  3. Zang, Z.-L., Towsley, J., Kurose, J.: Statistical analysis of the Generalized Processor Sharing Scheduling Discipline. In: Proceedings of the ACM Sigcomm (1994)

    Google Scholar 

  4. Golestani, J.: A Self Clocked Fair Queueing Scheme for Broadband applications. IEEE Infocom (1994)

    Google Scholar 

  5. Bennett, J.C.R., Zhang, H.: WF2Q: Worst Case Fair, Weighted Fair Queueing. In: Proceedings of the IEEE Infocom (March 1996)

    Google Scholar 

  6. Ng, T.S.E., Stoica, I., Zhang, H.: A Hierarchical Fair Service Curve Algorithm for Link-sharing, Realtime and Priority services. In: Proceedings of the ACM Sigcomm (August 1997)

    Google Scholar 

  7. Shenker, S.: Making Greed work in Networks: A Game theoretic analysis of Switch Service Disciplines. ACM/IEEE Transactions on Networking (1995)

    Google Scholar 

  8. Shenker, S.: Fundamental Design Issues for the Future Internet. IEEE Journal on Selected Areas of Communication 13(7) (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saha, A. (2004). A Scheduling Algorithm for a QoS Based Satellite Network. In: Langendoerfer, P., Liu, M., Matta, I., Tsaoussidis, V. (eds) Wired/Wireless Internet Communications. WWIC 2004. Lecture Notes in Computer Science, vol 2957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24643-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24643-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24643-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics