Skip to main content

Modelling and Guaranteeing Quality of Service over Data Streams

  • Conference paper
  • 436 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4256))

Abstract

In a growing number of web-based applications, massive data takes the form of continuous data streams. Most of these applications have deterministic and sophisticated performance requirements that need to be met under unbounded, high-volume and time-varying data streams. To be different from best-effort service providing, deterministic quality of service is generalized and modelled based on the theory of network calculus in this paper. A simple and efficient admission control mechanism is provided to determine the schedulability of several continuous queries with their QoS requirements satisfied simultaneously. Once the queries are admitted into the DSMS, our proposed QoS-Guaranteed scheduling algorithm assigns priorities to ready tuples that ensure all the QoS requirements. Furthermore, a QoS-Guaranteed batch-processing scheme is extended to reduce the query-scheduling overhead. Experiments are presented to illustrate and validate our strategies.

Supported by the National Natural Science Foundation of China under Grant No.60473073, 60503036, and Fok Ying Tung Education Foundation under No. 104027.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carney, D., Cetintemel, U., et al.: Operator Scheduling in a Data Stream Systems. In: Proc. of the 29th VLDB Conf., Berlin, Germany, pp. 838–849 (September 2003)

    Google Scholar 

  2. Avnur, R., Hellerstein, J.M.: Eddies: Continuously Adaptive Query Processing. In: Proc. of the ACM SIGMOD, Dallas, TX, pp. 261–272 (May 2000)

    Google Scholar 

  3. Babcock, B., Babu, S., Datar, M., Motwani, R.: Chain: Operator Scheduling for Memory Minimization in Data Stream Systems. In: Proc. of the ACM SIGMOD Int. Conf. On Management of Data, San Diego, CA, pp. 253–264 (2003)

    Google Scholar 

  4. Cruz, R.L.: Quality of service guarantees in virtual circuit switched networks. IEEE J. Select. Aareas Commun. (13), 1048–1056 (1995)

    Article  Google Scholar 

  5. Sariowan, H.: A service curve approach to performance guarantees in integrated service networks. Ph.D. dissertation, Univ. Calif. San Diego (1996)

    Google Scholar 

  6. Boudec, L., Yves, J., Thiran, P.: Network Calculus. LNCS, vol. 2050, p. 3. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  7. Abadi, D.J., Carney, D., Cetintemel, U., et al.: Aurora: A New Model and Architecture for Data Stream Management. VLDB Journal 12(2) (2003)

    Google Scholar 

  8. Carney, D., Cetintemel, U., Cherniack, M., et al.: Monitoring streamsCa new class of data management applications. In: Proceeding of VLDB Conference, Hong Kong, China, pp. 215–226 (August 2002)

    Google Scholar 

  9. Chen, J., DeWitt, D., Tian, F., Wang, Y.: NiagaraCQ: A scalable continuous query system for Internet databases. In: Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data, pp. 379–390 (May 2000)

    Google Scholar 

  10. Motwani, R., Widom, J., Arasu, A., et al.: Query Processing, Resource Management, and Approximation in a Data Stream Management System. In: CIDR Conference, Asilomar, CA, pp. 245–256 (January 2003)

    Google Scholar 

  11. Chandrasekaran, S., Cooper, O., Deshpande, A., et al.: TelegraphCQ: Continuous dataflow processing for an uncertain world. In: CIDR Conference, TelegraphCQ: Continuous Dataflow Processing for an Uncertain World, silomar, CA, pp. 269–280 (January 2003)

    Google Scholar 

  12. Kang, K., Son, S.H., Stankovic, J.A., et al.: A QoS-Sensitive Approach for Timeliness and Freshness Guarantees in Real-Time Databases. In: Proc. of the 14th Euromicro Conference on RealTime Systems, pp. 203–212 (2002)

    Google Scholar 

  13. Liu, Y., Liu, X., Xiao, L., et al.: Location-Aware Topology Matching in P2P Systems. In: Proc. of IEEE INFOCOM 2004, Hong Kong (March 2004), http://www.cse.msu.edu/liuyunha/INFOCOM04-yunhao.pdf

  14. Schmidt, S., Berthold, H., Lehner, W.: Qstream: Deterministic querying of data streams (demo). In: Proc. of the 30th VLDB, Toronto, Canada, August 30-September 3, pp. 1365–1368 (2004)

    Google Scholar 

  15. Cruz, R.L.: A calculus for network delay, part I: Network elements in isolation. IEEE Trans. Inform. Theory 37, 114–131 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  16. Cruz, R.L.: A calculus for network delay, part II: Network analysis. IEEE Trans. Inform. Theory 37, 132–141 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, S., Gu, Y., Lv, Y., Yu, G. (2006). Modelling and Guaranteeing Quality of Service over Data Streams. In: Feng, L., Wang, G., Zeng, C., Huang, R. (eds) Web Information Systems – WISE 2006 Workshops. WISE 2006. Lecture Notes in Computer Science, vol 4256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11906070_2

Download citation

  • DOI: https://doi.org/10.1007/11906070_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47663-4

  • Online ISBN: 978-3-540-47664-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics