Skip to main content
SpringerLink
Log in

A Self-adversarial Approach to Delay Analysis under Arbitrary Scheduling

  • Conference paper
Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6415))

  • 1961 Accesses

Abstract

Non-FIFO processing of flows by network nodes is a frequent phenomenon. Unfortunately, the state-of-the-art analytical tool for the computation of performance bounds in packet-switched networks, network calculus, cannot deal well with non-FIFO systems. The problem lies in its conventional service curve definitions. Either the definition is too strict to allow for a concatenation and consequent beneficial end-to-end analysis, or it is too loose and results in infinite delay bounds. Hence, in this paper, we propose a new approach to derive tight bounds in tandems of non-FIFO nodes, the so-called self-adversarial approach. The self-adversarial approach is based on a previously proposed method for calculating performance bounds in feedforward networks [30]. By numerical examples we demonstrate the superiority of the self-adversarial approach over existing methods for the analysis of non-FIFO tandems as well as that for low to medium utilizations it even stays close to corresponding FIFO performance bounds.

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. Raghavan, P., Sudan, M., Borodin, A., Kleinberg, J.M., Williamson, D.P.: Adversarial queuing theory. Journal of the ACM 48(1) (2001)

    Google Scholar 

  2. Agrawal, R., Cruz, R.L., Okino, C., Rajan, R.: Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking 7(3), 310–323 (1999)

    Article  Google Scholar 

  3. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.-P.: Synchronization and Linearity: An Algebra for Discrete Event Systems. Probability and Mathematical Statistics. John Wiley & Sons Ltd., Chichester (1992)

    MATH  Google Scholar 

  4. Bennett, J.C.R., Partridge, C., Shectman, N.: Packet reordering is not pathological network behavior. IEEE/ACM Trans. Netw. 7(6), 789–798 (1999)

    Article  Google Scholar 

  5. Bennett, J.C.R., Zhang, H.: WF2Q: Worst-case fair weighted fair queueing. In: Proc. IEEE INFOCOM, pp. 120–128 (March 1996)

    Google Scholar 

  6. Blanquer, J.M., Özden, B.: Fair queuing for aggregated multiple links. SIGCOMM Comput. Commun. Rev. 31(4), 189–197 (2001)

    Article  Google Scholar 

  7. Bouillard, A., Jouhet, L., Thierry, E.: Tight performance bounds in the worst-case analysis of feed-forward networks. In: Proc. IEEE INFOCOM, pp. 1–9 (March 2010)

    Google Scholar 

  8. Chakraborty, S., Kuenzli, S., Thiele, L., Herkersdorf, A., Sagmeister, P.: Performance evaluation of network processor architectures: Combining simulation with analytical estimation. Computer Networks 42(5), 641–665 (2003)

    Article  MATH  Google Scholar 

  9. Chang, C.-S.: On deterministic traffic regulation and service guarantees: A systematic approach by filtering. IEEE Transactions on Information Theory 44(3), 1097–1110 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chang, C.-S.: Performance Guarantees in Communication Networks. In: Telecommunication Networks and Computer Systems. Springer, Heidelberg (2000)

    Google Scholar 

  11. Ciucu, F., Burchard, A., Liebeherr, J.: A network service curve approach for the stochastic analysis of networks. In: Proc. ACM SIGMETRICS, pp. 279–290 (June 2005)

    Google Scholar 

  12. Cruz, R.L.: A calculus for network delay, Part I: Network elements in isolation. IEEE Transactions on Information Theory 37(1), 114–131 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. Cruz, R.L.: A calculus for network delay, Part II: Network analysis. IEEE Transactions on Information Theory 37(1), 132–141 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Cruz, R.L.: Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications 13(6), 1048–1056 (1995)

    Article  Google Scholar 

  15. Cruz, R.L., Okino, C.M.: Service guarantees for window flow control. In: Proc. 34th Allerton Conf. Communications, Control, and Computing (October 1996)

    Google Scholar 

  16. Fidler, M.: An end-to-end probabilistic network calculus with moment generating functions. In: Proc. of IEEE IWQoS, pp. 261–270 (June 2006)

    Google Scholar 

  17. Goyal, P., Lam, S.S., Vin, H.M.: Determining end-to-end delay bounds in heterogeneous networks. Multimedia Syst. 5(3), 157–163 (1997)

    Article  Google Scholar 

  18. Guo, C.: SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks. IEEE/ACM Transactions on Networking 12(6), 1144–1155 (2004)

    Article  Google Scholar 

  19. Jaiswal, S., Iannaccone, G., Diot, C., Kurose, J., Towsley, D.: Measurement and classification of out-of-sequence packets in a tier-1 IP backbone. IEEE/ACM Trans. Netw. 15(1), 54–66 (2007)

    Article  Google Scholar 

  20. Jiang, Y.: A basic stochastic network calculus. In: Proc. ACM SIGCOMM, pp. 123–134 (September 2006)

    Google Scholar 

  21. Kim, H., Hou, J.C.: Network calculus based simulation: theorems, implementation, and evaluation. In: Proc. IEEE INFOCOM (March 2004)

    Google Scholar 

  22. Koubaa, A., Alves, M., Tovar, E.: Modeling and worst-case dimensioning of cluster-tree wireless sensor networks. In: Proc. of RTSS 2006, Rio de Janeiro, Brazil, pp. 412–421. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  23. Le Boudec, J.-Y.: Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory 44(3), 1087–1096 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  24. Le Boudec, J.-Y., Charny, A.: Packet scale rate guarantee for non-fifo nodes. In: Proc. IEEE INFOCOM, pp. 23–26 (June 2002)

    Google Scholar 

  25. Le Boudec, J.-Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  26. Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking 1(3), 344–357 (1993)

    Article  Google Scholar 

  27. Rizzo, G., Le Boudec, J.-Y.: Pay bursts only once does not hold for non-fifo guaranteed rate nodes. Performance Evaluation 62(1-4), 366–381 (2005)

    Article  Google Scholar 

  28. Sariowan, H., Cruz, R.L., Polyzos, G.C.: Scheduling for quality of service guarantees via service curves. In: Proc. IEEE ICCCN, pp. 512–520 (September 1995)

    Google Scholar 

  29. Schmitt, J.B., Roedig, U.: Sensor network calculus - a framework for worst case analysis. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, pp. 141–154. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  30. Schmitt, J., Zdarsky, F., Fidler, M.: Delay bounds under arbitrary aggregate multiplexing: When network calculus leaves you in the lurch... In: Proc. IEEE INFOCOM (April 2008)

    Google Scholar 

  31. Skeie, T., Johannessen, S., Holmeide, O.: Timeliness of real-time IP communication in switched industrial ethernet networks. IEEE Transactions on Industrial Informatics 2(1), 25–39 (2006)

    Article  Google Scholar 

Download references

Authors
  1. Jens B. Schmitt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ivan Martinovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Informatics, University of Potsdam, August-Bebel-Str. 89, 14482, Potsdam, Germany

    Tiziana Margaria

  2. Technical University of Dortmund, Otto-Hahn-Str. 14, 44227, Dortmund, Germany

    Bernhard Steffen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmitt, J.B., Wang, H., Martinovic, I. (2010). A Self-adversarial Approach to Delay Analysis under Arbitrary Scheduling. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification, and Validation. ISoLA 2010. Lecture Notes in Computer Science, vol 6415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16558-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16558-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16557-3

  • Online ISBN: 978-3-642-16558-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation