Skip to main content
SpringerLink
Log in

QoS-aware placement of stream processing service

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Many emerging online stream processing services require the consideration of quality of service (QoS), which is highly dependent on the placement of services at various hosts. This paper investigates the QoS-aware placement problems of stream processing services under different contexts. On condition that the client demands are stable, the QoS-aware placement problem aiming to minimize the cost when servers are CPU-uncapacitated, is equivalent to the set cover problem, and can be solved by a greedy algorithm with approximation factor O(log n), where n is the number of clients. However, when CPU capacity constraints on servers are taken into account, the QoS-aware placement problem cannot be approximated unless P=NP. Therefore, we propose two heuristic algorithms: (1) ISCA (Iterated Set Cover-based Algorithm) and (2) KBA (Knapsack-Based Algorithm). We also consider the placement problem of client demands increasing over time. Two objectives, called extension factor and system lifetime, are proposed for demand increment-blind and increment-aware models respectively. Both of them can be solved by extending ISCA and KBA. The experimental results show that ISCA and KBA have distinct effects on different demand sizes. ISCA is more efficient when client demands are relatively small, while KBA performs better for larger demands.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrams Z, Liu J (2006) Greedy is good: on service tree placement for in-network stream processing. In: Proceedings of IEEE ICDCS

    Google Scholar 

  2. Al-Qudah Z, Alzoubi HA, Allman M, Rabinovich M, Liberatore V (2009) Efficient application placement in a dynamic hosting platform. In: Proceedings of the 18th international conference on world wide web, pp 281–290

    Chapter  Google Scholar 

  3. Arasu A, Babcock B, Babu S, Cieslewicz J, Datar M, Ito K, Motwani R, Srivastava U, Widom J (2005) STREAM: the Stanford data stream management system

  4. Arya V, Garg N, Khandekar R, Munagala K, Pandit V (2001) Local search heuristics for k-median and facility location problems. In: Proceedings of the 33rd ACM symposium on theory of computing (STOC), pp 21–29

    Chapter  Google Scholar 

  5. Byrka J (2007) An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of the 10th international workshop on approximation algorithms for combinatorial optimization problems (APPROX), pp 29–43

    Chapter  Google Scholar 

  6. Calvert KL, Doar MB, Zegura EW (1997) Modeling Internet topology. IEEE Commun Mag 35(6):160–163

    Article  Google Scholar 

  7. Chen L, Reddy K, Agrawal G (2004) GATES: a grid-based middleware for processing distributed data streams. In: Proceedings of HPDC, Honolulu, HI, June 2004

    Google Scholar 

  8. Cronin E, Jamin S, Jin C, Kurc AR, Raz D, Shavitt Y (2002) Constrained mirror placement on the internet. IEEE J Sel Areas Commun 20(7):1369–1382

    Article  Google Scholar 

  9. Famaey J, Wauters T, Turck FD, Dhoedt B, Demeester P (2008) Towards efficient service placement and server selection for large-scale deployments. In: Proceedings of the 2008 fourth advanced international conference on telecommunications, June 08–13, 2008, pp 13–18

    Chapter  Google Scholar 

  10. Frank C, Römer K (2007) Distributed facility location algorithms for flexible configuration of wireless sensor networks. In: 3rd IEEE intl conf on distributed computing in sensor systems, Santa Fe, USA, June 2007

    Google Scholar 

  11. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  12. GT-ITM (2011) Georgia Tech Internetwork Topology Models. http://www.cc.gatech.edu/projects/gtitm/

  13. Han J, Kamber M (2006) Data mining: concepts and techniques, 2nd edn. Morgan Kaufmann, San Mateo (1st edn, 2000)

    MATH  Google Scholar 

  14. Henderson RL (1995) Job scheduling under the portable batch system. In: Job scheduling strategies for parallel processing. Lecture notes in computer science, vol 949. Springer, Berlin

    Chapter  Google Scholar 

  15. Jackson D, Snell Q, Clement M (2001) Core algorithms of the MAUI scheduler. In: Proceedings of the 7th workshop on job scheduling strategies for parallel processing

    Google Scholar 

  16. Jeon WJ, Gupta I, Nahrstedt K (2006) QoS-aware object replication in overlay networks. In: Proceedings of IEEE GLOBECOM

    Google Scholar 

  17. Karlsson M, Karamanolis C (2004) Choosing replica placement heuristics for wide-area systems. In: Proceedings of IEEE ICDCS, Mar. 2004, pp 350–359

    Google Scholar 

  18. Karve A, Kimbrel T, Pacifici G, Spreitzer M, Steinder M, Sviridenko M, Tantawi A (2006) Dynamic placement for clustered web applications. In: Proceedings of the 15th international conference on world wide web, pp 595–604

    Chapter  Google Scholar 

  19. Laoutaris N, Smaragdakis G, Oikonomou K, Stavrakakis I, Bestavros A (2007) Distributed placement of service facilities in large-scale networks. In: Proceedings of IEEE INFOCOM, Anchorage, Alaska, May 6–12, 2007

    Google Scholar 

  20. Lawler EL (1979) Fast approximation algorithms for Knapsack problems. Math Oper Res 4(4)

  21. Lingo (2010) Programming Language for Integer Programming. version 11.0 http://www.lindo.com/

  22. Mahdian M, Ye Y, Zhang J (2002) Improved approximation algorithms for metric facility location problems. In: Proceedings of the 5th international workshop on approximation algorithms for combinatorial optimization (APPROX), pp 229–242

    Chapter  Google Scholar 

  23. Oikonomou K, Stavrakakis I (2010) Scalable service migration in autonomic network environments. IEEE J Sel Areas Commun 28(1):84–94

    Article  Google Scholar 

  24. Qiu L, Padmanabhan VN, Voelker GM (2001) On the placement of web server replicas. In: Proceedings of IEEE INFOCOM, Anchorage, AK, April 22–26, 2001

    Google Scholar 

  25. Tang X, Xu J (2005) QoS-aware replica placement for content distribution. IEEE Trans Parallel Distrib Syst 16(10):921–932

    Article  Google Scholar 

  26. Tang C, Steinder M, Spreitzer M, Pacifici G (2007) A scalable application placement controller for enterprise data centers. In: Proceedings of the 16th international conference on world wide web, pp 331–340

    Chapter  Google Scholar 

  27. Tatbul N, Cetintemel U, Zdonik SB, Cherniack M, Stonebraker M (2003) Load shedding in a data stream manager. In: Proceedings of the international conference on very large data bases, Berlin, Germany, 2003, pp 309–320

    Google Scholar 

  28. Vazirani VV (2001) Approximation algorithms. Springer, Berlin

    Google Scholar 

  29. Wang H, Liu P, Wu J (2006) A QoS-aware heuristic algorithm for replica placement. In: Proceedings of the 7th IEEE/ACM international conference on grid computing, pp 96–103

    Google Scholar 

  30. Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6(9):1617–1622

    Article  Google Scholar 

  31. Wittenburg G, Schiller J (2008) A survey of current directions in service placement in mobile ad hoc networks. In: Proceedings of the sixth annual IEEE international conference on pervasive computing and communications (PerCom’08), Hong Kong, March 17–21, 2008

    Google Scholar 

  32. Ying L, Liu Z, Towsley D, Xia C (2008) Distributed operator placement and data caching in large-scale sensor networks. In: Proceedings of IEEE INFOCOM

    Google Scholar 

  33. Zhang J, Chen B, Ye Y (2004) A multi-exchange local search algorithm for the capacitated facility location problem. In: Proceedings of integer programming and combinatorial optimization (IPCO), pp 219–233

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Nanjing University, 22 Hankou Road, Nanjing, Jiangsu, 210093, P.R. China

    Kun You, Bin Tang, Zhuzhong Qian, Sanglu Lu & Daoxu Chen

Authors
  1. Kun You
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bin Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhuzhong Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sanglu Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Daoxu Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kun You.

Rights and permissions

Reprints and permissions

About this article

Cite this article

You, K., Tang, B., Qian, Z. et al. QoS-aware placement of stream processing service. J Supercomput 64, 919–941 (2013). https://doi.org/10.1007/s11227-010-0548-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0548-2

Keywords

Search

Navigation