Skip to main content
SpringerLink
Log in

A Formal Basis for Reasoning on Programmable QoS

  • Chapter
Verification: Theory and Practice

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

Abstract

The explicit management of Quality of Service (QoS) of network connectivity, such as, e. g., working cost, transaction support, and security, is a key requirement for the development of the novel wide area network applications. In this paper, we introduce a foundational model for specification of QoS attributes at application level. The model handles QoS attributes as semantic constraints within a graphical calculus for mobility. In our approach QoS attributes are related to the programming abstractions and are exploited to select, configure and dynamically modify the underlying system oriented QoS mechanisms.

R. De Nicola has been supported by MIUR project NAPOLI and EU-FET project MIKADO IST-2001-32222. G. Ferrari has been supported by MIUR project NAPOLI and EU-FET project PROFUNDIS IST-2001-33100. U. Montanari has been supported by MIUR project COMETA and EU-FET project AGILE IST-2001-32747. R. Pugliese has been supported by MIUR project NAPOLI and EU-FET project AGILE IST-2001-32747. E. Tuosto has been supported by MIUR project NAPOLI and EU-FET project PROFUNDIS IST-2001-33100. All authors have been supported by the MIUR project SP4 “Architetture Software ad Alta Qualità di Servizio per Global Computing su Cooperative Wide Area Networks”.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. O. Angin, A. Campbell, M. Kounavis, and R. Liao. The Mobiware Toolkit: Programmable Support for Adaptive Mobile Networking. IEEE Personal Communications Magazine, August 1998.

    Google Scholar 

  2. L. Bettini, M. Loreti, and R. Pugliese. An infrastructure language for open nets. In Proc. of the 2002 ACM Symposium on Applied Computing (SAC’02), Special Track on Coordination Models, Languages and Applications. ACM Press, 2002.

    Google Scholar 

  3. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201–236, March 1997.

    Article  MATH  MathSciNet  Google Scholar 

  4. S. Bistarelli, U. Montanari, and F. Rossi. Soft constraint logic programming and generalized shortest path problems. Journal of Heuristics, 8:25–41, 2002.

    Article  MATH  Google Scholar 

  5. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wand, and W. Weiss. An architecture for differentiated services. Technical Report RFC 2475, The Internet Engineering Task Force (IETF), 1998.

    Google Scholar 

  6. R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin. Resource reservation protocol (rsvp) — version 1 functional specification.

    Google Scholar 

  7. L. Cardelli and R. Davies. Service combinators for web computing. Software Engineering, 25(3):309–316, 1999.

    Article  Google Scholar 

  8. I. Castellani and U. Montanari. Graph Grammars for Distributed Systems. In H. Ehrig, M. Nagl, and G. Rozenberg, editors, Proc. 2nd Int. Workshop on Graph-Grammars and Their Application to Computer Science, volume 153 of Lecture Notes in Computer Science, pages 20-38. Springer-Verlag, 1983.

    Google Scholar 

  9. R. De Nicola, G. Ferrari, and R. Pugliese. KLAIM: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering, 24(5):315–330, 1998.

    Article  Google Scholar 

  10. R. De Nicola, G. Ferrari, R. Pugliese, and B. Venneri. Types for access control. Theoretical Computer Science, 240(1):215–254, June 2000.

    Article  MATH  MathSciNet  Google Scholar 

  11. P. Degano and U. Montanari. A model of distributed systems based of graph rewriting. Journal of the ACM, 34:411–449, 1987.

    Article  MathSciNet  Google Scholar 

  12. R. Floyd. Algorithm97 (shortestpath). Communication of the ACM, 5(6):345, 1962.

    Article  Google Scholar 

  13. I. Foster, C. Kesselman, C. Lee, R. Lindell, K. Nahrstedt, and A. Roy. A distributed resource management architecture that supports advance reservations and co-allocation. In Proceedings of the International Workshop on Quality of Service, 1999.

    Google Scholar 

  14. D. Hirsch, P. Inverardi, and U. Montanari. Reconfiguration of software architecture styles with name mobility. In A. Porto and G.-C. Roman, editors, Coordination 2000, volume 1906 of LNCS, pages 148-163. Springer Verlag, 2000.

    Google Scholar 

  15. D. Hirsch and U. Montanari. Synchronized hyperedge replacement with name mobility: A graphical calculus for name mobility. In 12th International Conference in Concurrency Theory (CONCUR 2001), volume 2154 of LNCS, pages 121-136, Aalborg, Denmark, 2001. Springer Verlag.

    Google Scholar 

  16. C. Hoare. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, NJ, 1985. & 0-13-153289-8.

    Google Scholar 

  17. IBM Software Group. Web services conceptual architecture. In IBM White Papers, 2000.

    Google Scholar 

  18. M. Koch, L. Mancini, and F. Parisi-Presicce. A formal model for role-based access control using graph transformation. In F. Cuppens, Y. Deswarte, D. Gollmann, and M. Waidner, editors, ESORICS, volume 1895 of LNCS, pages 122-139, 6th European Symposium on Research in Computer Security, 2000. Springer Verlag.

    Google Scholar 

  19. M. Koch, L. Mancini, and F. Parisi-Presicce. Foundations for a graph-based approach to the specification of access control policies. In F. Honsell and M. Lenisa, editors, FoSSaCS, LNCS, Foundations of Software Science and Computation Structures, 2001. Springer Verlag.

    Google Scholar 

  20. M. Koch and F. Parise-Presicce. Describing policies with graph constraints and rules. In A. Corradini, H. Ehrig, H. Kreowski, and G. Rozenberg, editors, Graph Transformation, volume 2505 of LNCS, pages 223-238, First International Conference on Graph Transformation, Barcelona, Spain, October 2002. Springer Verlag.

    Google Scholar 

  21. B. Koenig and U. Montanari. Observational equivalence for synchronized graph rewriting. In Proc. TACS’01, LNCS. Springer Verlag, 2001. To appear.

    Google Scholar 

  22. B. Li. Agilos: A Middleware Control Architecture for Application-Aware Quality of Service Adaptations. PhD thesis, University of Illinois, 2000.

    Google Scholar 

  23. R. Milner. Communication and Concurrency. Printice Hall, 1989.

    Google Scholar 

  24. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1–40, 41-77, September 1992.

    Article  MATH  MathSciNet  Google Scholar 

  25. U. Montanari and F. Rossi. Graph rewriting and constraint solving for modelling distributed systems with synchronization. In P. Ciancarini and C. Hankin, editors, Proceedings of the First International Conference COORDINATION’ 96, Cesena, Italy, volume 1061 of LNCS. Springer Verlag, April 1996.

    Google Scholar 

  26. J. Sobrinho. Algebra and algorithms for qos path computation and hop-by-hop routing in the internet. IEEE Transactions on Networking, 10(4):541–550, August 2002.

    Article  Google Scholar 

  27. G. Winskel. Synchronization trees. Theoretical Computer Science, May 1985.

    Google Scholar 

  28. X. Xiao and L. M. Ni. Internet qos: A big picture. IEEE Network, 13(2):8–18, Mar 1999.

    Article  Google Scholar 

  29. M. Yokoo and K. Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185–207, 2000.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Università di Firenze, Via C. Lombroso 6/17, 50134, Firenze, Italy

    Rocco De Nicola & Rosario Pugliese

  2. Dipartimento di Informatica, Università di Pisa, Via M. Buonarroti 2, 56100, Pisa, Italy

    Gianluigi Ferrari, Ugo Montanari & Emilio Tuosto

Authors
  1. Rocco De Nicola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gianluigi Ferrari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rosario Pugliese
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Emilio Tuosto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Tel Aviv University, Ramat Aviv, Tel Aviv, 69978, Israel

    Nachum Dershowitz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

De Nicola, R., Ferrari, G., Montanari, U., Pugliese, R., Tuosto, E. (2003). A Formal Basis for Reasoning on Programmable QoS. In: Dershowitz, N. (eds) Verification: Theory and Practice. Lecture Notes in Computer Science, vol 2772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39910-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39910-0_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21002-3

  • Online ISBN: 978-3-540-39910-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation