Skip to main content
Springer Nature Link
Log in

A Comparison of Multicast Pull Models

  • Conference paper
  • First Online:
Algorithms — ESA 2002 (ESA 2002)

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

Included in the following conference series:

  • 1818 Accesses

Abstract

We consider the setting of a web server that receives requests for documents from clients, and returns the requested documents over a multicast/broadcast channel. We compare the quality of service (QoS) obtainable by optimal schedules under various models of the capabilities of the server and the clients to send and receive segments of a document out of order. We show that allowing the server to send segments out of order does not improve any reasonable QoS measure. However, the ability of the clients to receive data out of order can drastically improve the achievable QoS under some, but not all, reasonable/common QoS measures.

Supported in part by NSF grant CCR-0098752, NSF grant ANIR-0123705, and by a grant from the US Air Force.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Aacharya, and S. Muthukrishnan, “Scheduling on-demand broadcasts: new metrics and algorithms”, ACM/IEEE International Conference on Mobile Computing and Networking, 1998.

    Google Scholar 

  2. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber, “Minimizing service and operation costs of periodic scheduling”, 11–20, SODA 1998.

    Google Scholar 

  3. Y. Bartal, and S. Muthukrishnan, “Minimizing maximum response time in scheduling broadcasts”, 558–559, SODA, 2000.

    Google Scholar 

  4. Digital Fountain website, http://www.digitalfountain.com.

  5. DirecPC website, http://www.direcpc.com.

  6. J. Edmonds and K. Pruhs, “Broadcast scheduling: when fairness is fine”, SODA,2002.

    Google Scholar 

  7. T. Erlebach and A. Hall, “Hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow”, SODA, 2002.

    Google Scholar 

  8. R. Gandhi, S. Khuller, Y.A. Kim, and Y.C. Wan, “Algorithms for Minimimzing Response Time in Broadcast Scheduling”, To appear in IPCO, 2002.

    Google Scholar 

  9. B. Kalyanasundaram, and K. Pruhs, “Speed is as powerful as clairvoyance”, JACM, 2000.

    Google Scholar 

  10. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, “Scheduling broadcasts in wireless networks”, European Symposium on Algorithms (ESA), 2000.

    Google Scholar 

  11. C. Kenyon, N. Schabanel and N. Young, “Polynomial-time approximation schemes for data broadcast”, 659–666, STOC 2000.

    Google Scholar 

  12. J. Kurose and K. Ross, Computer Networking: A Top Down Approach Featuring the Internet, Addison Wesley Longman, 2001.

    Google Scholar 

  13. C. Phillips, C. Stein, E. Torng, and J. Wein “Optimal time-critical scheduling via resource augmentation”, ACM Symposium on Theory of Computing, 140–149, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Pittsburgh, USA

    Kirk Pruhs & Patchrawat Uthaisombut

Authors
  1. Kirk Pruhs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patchrawat Uthaisombut
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany

    Rolf Möhring

  2. Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Rajeev Raman

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pruhs, K., Uthaisombut, P. (2002). A Comparison of Multicast Pull Models. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-45749-6_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44180-9

  • Online ISBN: 978-3-540-45749-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics