Towards Self-Managing QoS-Enabled Peer-to-Peer Systems

  • Vana Kalogeraki
  • Fang Chen
  • Thomas Repantis
  • Demetris Zeinalipour-Yazti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3460)

Abstract

Peer-to-peer systems that dynamically interact, collaborate and share resources are increasingly being deployed in wide-area environments. The inherent ad-hoc nature of these systems makes it difficult to meet the Quality of Service (QoS) requirements of the distributed applications, thus having a direct impact on their scalability, efficiency and performance. In this paper we propose adaptive algorithms to meet applications QoS demands and balance the load across multiple peers. These comprise (a) resource management mechanisms to monitor resource loads and application latencies and (b) self-organization algorithms to dynamically select peers that maximize the probability of meeting the applications’ soft real-time and QoS requirements. Our algorithms use only local knowledge and therefore scale well with respect to the size of the network and the number of executing applications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Napster, Napster home page, http://www.napster.com
  2. 2.
    Gnutella, Gnutella home page, http://www.gnutella.com
  3. 3.
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An Architecture for Global-Scale Persistent Storage. In: Proceedings of ASPLOS, Cambridge, MA (2000)Google Scholar
  4. 4.
    Rowstron, A., Druschel, P.: Storage Management and Caching in PAST, a Large-scale Persistent Peer-To-Peer Storage Utility. In: Proceedings of the 18th SOSP, Toronto, Canada (2001)Google Scholar
  5. 5.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM Conference, San Diego, CA (August 2001)Google Scholar
  6. 6.
    Xiao, L., Zhang, X., Xu, Z.: On reliable and scalable peer-to-peer web document sharing. In: Proceedings of the International Parallel and Distributed Computing Symposium, Fort Lauderdale, Florida (April 2002)Google Scholar
  7. 7.
    SETI Project Home Page, SETI@home, http://sethiathome.ssl.berkeley.edu
  8. 8.
    Entropia, Entropia home page, http://www.entropia.com
  9. 9.
    Jain, S., Mahajan, R., Wetherall, D., Borriello, G.: Scalable self-organizing overlays. Technical report UW-CSE 02-02-02, University of Washington (2002)Google Scholar
  10. 10.
    Chu, Y.-H., Rao, S.G., Zhang, H.: A case for end system multicast. In: ACM SIGMETRICS 2000, Santa Clara, CA (2000)Google Scholar
  11. 11.
    Zeinalipour-Yazti, D., Kalogeraki, V., Gunopulos, D.: Exploiting locality for scalable information retrieval in peer-to-peer systems. Information Systems Journal (2004)Google Scholar
  12. 12.
    Gill, C., Loyall, J.P., Schantz, R.E., Atighetchi, M., Gossett, J.M., Corman, D., Schmidt, D.C.: Integrated Adaptive QoS Management in Middleware: A Case Study. In: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium, Toronto, Canada (May 2004)Google Scholar
  13. 13.
    Object Management Group: The Common Object Request Broker: Architecture and Specification, Edition 2.4, formal/00-10-01 (October 2000)Google Scholar
  14. 14.
    Box, D.: Essential COM. Addison-Wesley, Reading (1998)MATHGoogle Scholar
  15. 15.
    Wollrath, A., Riggs, R., Waldo, J.: A distributed object model for the Java system. Computing Systems 9(4), 265–290 (Fall 1996)Google Scholar
  16. 16.
    SOAP, Soap home page, http://www.soap.org
  17. 17.
    Kalogeraki, V., Melliar-Smith, P.M., Moser, L.E.: Dynamic scheduling for soft real-time distributed object systems. In: Proceedings of the IEEE Third International Symposium on Object-Oriented Real-Time Distributed Computing, Newport, CA, March 2000, pp. 114–121 (2000)Google Scholar
  18. 18.
    Chu, H.-H., Nahrstedt, K.: A soft real-time scheduling server in unix operating system, pp. 381–406. Auerbach Publications (1995)Google Scholar
  19. 19.
    Object Management Group, Real-time CORBA, Edition 1.0, formal/00-10-60 (May 1998)Google Scholar
  20. 20.
    Object Management Group, Dynamic Scheduling, Revised Submission, orbos/00-08-12 (August 2000)Google Scholar
  21. 21.
    Tannenbaum, T., Wright, D., Miller, K., Livny, M.: Condor – a distributed job scheduler. In: Sterling, T. (ed.) Beowulf Cluster Computing with Linux, October 2001. MIT Press, Cambridge (2001)Google Scholar
  22. 22.
    Kalogeraki, V.: Resource Management for Real-Time Fault-Tolerant Distributed Systems, Ph.D. thesis, University of California, Santa Barbara (December 2000)Google Scholar
  23. 23.
    Kalogeraki, V., Melliar-Smith, P.M., Moser, L.E.: Dynamic scheduling of distributed method invocations. In: Proceedings of the 21st IEEE Real-Time Systems Symposium, Orlando, Florida, November 2000, pp. 57–66 (2000)Google Scholar
  24. 24.
    Dertouzos, M.L., Mok, A.K.-L.: Multiprocessor on-line scheduling of hard real-time tasks. IEEE Transactions on Software Engineering 15(12), 1497–1506 (1989)CrossRefGoogle Scholar
  25. 25.
    The FFMPEG Homepage, http://ffmpeg.sourceforge.net/
  26. 26.
    Mohan, A., Kalogeraki, V.: Speculative Routing and Update Propagation: A Kundali Centric Approach. In: International Conference on Communications, Anchorage, Alaska (May 2003)Google Scholar
  27. 27.
    Aberer, K., Punceva, M., Hauswirth, M., Schmidt, R.: Improving Data Access in P2P Systems. IEEE Internet Computing 6(1), 58–67 (2002)CrossRefGoogle Scholar
  28. 28.
    Kalogeraki, V., Delis, A., Gunopulos, D.: Peer-to-Peer Architectures for Scalable, Efficient and Reliable Media Services. In: Proceedings of the International Parallel and Distributed Computing Symposium, Nice, France (April 2003)Google Scholar
  29. 29.
    Waterhouse, S., Doolin, D.M., Kan, G., Faybishenko, Y.: Distributed Search in P2P Networks. IEEE Internet Computing 6(1), 68–72 (2002)CrossRefGoogle Scholar
  30. 30.
    Lienhart, R., Holliman, M., Chen, Y.-K., Kozintsev, I., Yeung, M.: Improving Media Services on P2P Networks. IEEE Internet Computing 6(1), 73–77 (2002)CrossRefGoogle Scholar
  31. 31.
    Kalogeraki, V., Chen, F.: Managing distributed objects in peer-to-peer networks. IEEE Network, special issue on Middleware Technologies for future Communication Netowkrs 18(1), 22–29 (2004)Google Scholar
  32. 32.
    Morpheus, Morpheus home page, http://www.musiccity.com
  33. 33.
    Freenet, Freenet home page, http://freenet.sourceforge.com
  34. 34.
    Kazaa, Kazaa home page, http://www.kazaa.com
  35. 35.
    Limewire, Limewire home page, http://www.limewire.com
  36. 36.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A Scalable Content-Addressable Network. In: Proceedings of the SIGCOMM 2001, San Diego, CA (August 2001)Google Scholar
  37. 37.
    Saito, Y., Karamanolis, C., Karlsson, M., Mahalingam, M.: Taming Aggressive Replication in the Pangaea Wide-Area File System. In: Proceedings of OSDI 2002, Boston, CA (2002)Google Scholar
  38. 38.
    Adya, A., Bolosky, W.J., Castro, M., Cermak, G., Chaiken, R., Douceur, J.R., Howell, J., Lorch, J.R., Theimer, M., Wattenhofer, R.P.: FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In: Proceedings of OSDI 2002, Boston, CA (2002)Google Scholar
  39. 39.
    Muthitacharoen, A., Morris, R., Gil, T.M., Chen, B.: Ivy: A Read/Write Peer-to-Peer File System. In: Proceedings of OSDI 2002, Boston, CA (2002)Google Scholar
  40. 40.
    Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proceedings of IEEE INFOCOM Conference (June 2002)Google Scholar
  41. 41.
    Xu, Z., Mahalingam, M., Karlsson, M.: Turning heterogeneity into an advantage in overlay routing. In: Proceedings of IEEE INFOCOM Conference (April 2003)Google Scholar
  42. 42.
    Eugene, T.S., Zhang, H.: Predicting Internet Network Distance with Coordinates-based Approaches. In: Proceedings of IEEE INFOCOM Conference (2002)Google Scholar
  43. 43.
    Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location using Interest-based Locality in Peer-to-Peer Systems. In: Proceedings of IEEE INFOCOM Conference (April 2003)Google Scholar
  44. 44.
    Zhang, H., Goel, A., Govindan, R.: Incrementally improving lookup latency in distributed hash table systems. In: Proceedings of ACM SIGMETRICS Conference (2003)Google Scholar
  45. 45.
    Manimaran, G., Murthy, C.R.R.: An efficient dynamic scheduling algorithm for multiprocessor real-time systems. IEEE Transactions on Parallel and Distributed Systems 9(3), 312–319 (1998)CrossRefGoogle Scholar
  46. 46.
    Sandrini, F., Giandomenico, F.D., Bondavalli, A., Nett, E.: Scheduling solutions for supporting dependable real-time applications. In: Proceedings of the IEEE Third International Symposium on Object-Oriented Real-Time Distributed Computing (2000)Google Scholar
  47. 47.
    Hildebrandt, J., Golatowski, F., Timmermann, D.: Scheduling coprocessor for enhanced least-laxity-first scheduling in hard real-time systems. In: Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS 1999 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Vana Kalogeraki
    • 1
  • Fang Chen
    • 1
  • Thomas Repantis
    • 1
  • Demetris Zeinalipour-Yazti
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of CaliforniaRiversideUSA

Personalised recommendations