References

  1. [AGR 96] AGRAWAL R., RAJAN R., Performance bounds for guaranteed and adaptive services, Report no. RC 20649, IBM, May 1996.
  2. [AGR 99] AGRAWAL R., CRUZ R.L., OKINO C. et al., “Performance bonds for flow control protocols”, IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 310–323, 1999.
  3. [ALT 11] ALTISEN K., MOY M., “Causality closure for a new class of curves in real-time calculus”, Proceedings of the 1st International Workshop on Worst-Case Traversal Time, pp. 3–10, ACM, 2011.
  4. [ÀLV 04] ÀLVAREZ C., BLESA M.J., SERNA M.J., “A characterization of universal stability in the adversarial queuing model”, SIAM Journal on Computing, vol. 34, no. 1, pp. 41–66, 2004.
  5. [AND 00] ANDREWS M., “Instability of FIFO in session-oriented networks”, Proceedings of SODA’00, 2000.
  6. [AND 01] ANDREWS M., AWERBUCH B., FERNÁNDEZ A. et al., “Universal-stability results and performance bounds for greedy contention-resolution protocols”, Journal ACM, vol. 48, no. 1, pp. 39–69, 2001.
  7. [AND 07] ANDREWS M., “Instability of FIFO in the permanent sessions model at arbitrarily small network loads”, Proceedings of SODA’07, 2007.
  8. [BAC 92] BACCELLI F., COHEN G., OLSDER G.J. et al., Synchronisation and Linearity: An Algebra for Discrete Event Systems, Wiley, 1992.
  9. [BAC 02] BACCELLI F., MCDONALD D., REYNIER J., “A mean-field model for multiple TCP connections through a buffer implementing RED”, Performance Evaluation, vol. 49, nos 1–4, pp. 77–97, 2002.
  10. [BAC 09a] BACCELLI F., BLASZCZYSZYN B., “Stochastic geometry and wireless networks, volume I - theory”, Foundations and Trends in Networking, vol. 3, nos 3–4, pp. 249–449, NoW Publishers, 2009.
  11. [BAC 09b] BACCELLI F., BLASZCZYSZYN B., “Stochastic geometry and wireless networks, volume II - applications”, Foundations and Trends in Networking, vol. 4, nos 1–2, pp. 1–312, NoW Publishers, 2009.
  12. [BAR 90] BARUAH S.K., MOK A.K., ROSIER L.E., “Preemptively scheduling hard-teal-time sporadic tasks on one processor”, Proceedings of the 11th Real-Time Systems Symposium, pp. 182–190, IEEE Computer Society Press, 1990.
  13. [BAR 99] BARUAH S., CHEN D., GORINSKY S. et al., “Generalized multiframe tasks”, Real-Time Systems, vol. 17, pp. 5–22, 1999.
  14. [BAR 01] BARTA P., NEMETH F., SZABO R. et al., “End-to-end delay bound calculation in generalized processor sharing networks”, ISCC’01, 2001.
  15. [BIS 08] BISTI L., LENZINI L., MINGOZZI E. et al., “Estimating the worst-case delay in FIFO tandems using network calculus”, Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools, pp. 67:1–67:10, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 2008.
  16. [BIS 10] BISTI L., LENZINI L., MINGOZZI E. et al., “DEBORAH: A tool for worst-case analysis of FIFO tandems”, in MARGARIA T., STEFFEN B. (eds), Proceedings of the 4th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, LNCS, Springer, 2010.
  17. [BLY 05] BLYTH T.S., Lattices and Ordered Algebraic Structures, Springer Verlag, 2005.
  18. [BOL 01] BOLLOBÁS B., Random Graphs, Cambridge University Press, 2001.
  19. [BON 14] BONDORF S., SCHMITT J.B., “The DiscoDNC v2 – A Comprehensive Tool for Deterministic Network Calculus”, Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools, December 2014.
  20. [BON 16a] BONDORF S., SCHMITT J.B., “Calculating accurate end-to-end delay bounds – you better know your cross-traffic”, Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, pp. 17–24, 2016.
  21. [BON 16b] BONDORF S., SCHMITT J.B., “Improving cross-traffic bounds in feed-forward networks - there is a job for everyone”, Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems – 18th International GI/ITG Conference, pp. 9–24, 2016.
  22. [BON 16c] BONDORF S., SCHMITT J.B., “Should network calculus relocate? An assessment of current algebraic and optimization-based analyses”, Proceedings of the International Conference on Quantitative Evaluation of Systems, August 2016.
  23. [BON 17a] BONDORF S., “Better bounds by worse assumptions: Improving network calculus accuracy by adding pessimism to the network model”, 2017 IEEE International Conference on Communications (ICC), pp. 1–7, 2017.
  24. [BON 17b] BONDORF S., NIKOLAUS P., SCHMITT J.B., “Quality and cost of deterministic network calculus – design and evaluation of an accurate and fast analysis”, Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 1, no. 1, p. 34, ACM, 2017.
  25. [BOR 01] BORODIN A., KLEINBERG J.M., RAGHAVAN P. et al., “Adversarial queuing theory”, Journal ACM, vol. 48, no. 1, pp. 13–38, 2001.
  26. [BOU 07a] BOUILLARD A., THIERRY E., Some examples and counterexamples for (min,+) filtering operations, Report no. RR 6095, Inria, 2007.
  27. [BOU 07b] BOUILLARD A., THIERRY E., An algorithmic toolbox for network calculus, Report no. 6094, Inria, January 2007.
  28. [BOU 08a] BOUILLARD A., GAUJAL B., LAGRANGE S. et al., “Optimal routing for end-to-end guarantees using Network Calculus”, Performance Evaluation, vol. 65, nos 11–12, pp. 883–906, 2008.
  29. [BOU 08b] BOUILLARD A., JOUHET L., THIERRY E., “Computation of a (min, +) multidimensional convolution for end-to-end performance analysis”, 3rd International ICST Conference on Performance Evaluation Methodologies and Tools, p. 68, Athens, October 2008.
  30. [BOU 08c] BOUILLARD A., THIERRY E., “An algorithmic toolbox for network calculus”, Discrete Event Dynamic Systems, vol. 18, no. 1, pp. 3–49, available at: http://www.springerlink.com/content/ 876x51r6647r8g68/, October 2008.
  31. [BOU 09] BOUILLARD A., JOUHET L., THIERRY E., Service curves in Network Calculus: Dos and don’ts, Report no. RR-7094, Inria, 2009.
  32. [BOU 10a] BOUILLARD A., JOUHET L., THIERRY E., “Comparison of different classes of service curves in Network Calculus”, Proceedings of the 10th International Workshop on Discrete Event Systems (WODES 2010), Technische Universität Berlin, 2010.
  33. [BOU 10b] BOUILLARD A., JOUHET L., THIERRY E., “Tight performance bounds in the worst-case analysis of feed-forward networks”, 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, pp. 1316–1324, San Diego, March 2010.
  34. [BOU 11a] BOUILLARD A., “Composition of service curves in network calculus”, Proceedings of the 1st International Workshop on Worst-Case Traversal Time, pp. 35–42, 2011.
  35. [BOU 11b] BOUILLARD A., FARHI N., GAUJAL B., Packetization and aggregate scheduling, Report no. 7685, Inria, 2011.
  36. [BOU 11c] BOUILLARD A., JUNIER A., “Worst-case delay bounds with fixed priorities using network calculus”, 5th International ICST Conference on Performance Evaluation Methodologies and Tools Communications, pp. 381–390, Paris, May 2011.
  37. [BOU 12a] BOUILLARD A., FARHI N., GAUJAL B., “Packetization and packet curves in network calculus”, Proceedings of the 6th International Conference on Performance Evaluation Methodologies and Tools, Cargese, October 2012.
  38. [BOU 12b] BOUILLARD A., STEA G., “Exact worst-case delay for FIFO-multiplexing tandems”, 6th International ICST Conference on Performance Evaluation Methodologies and Tools, pp. 158–167, Cargese, October 2012.
  39. [BOU 15] BOUILLARD A., NOWAK T., “Fast symbolic computation of the worst-case delay in tandem networks and applications”, Performance Evaluation, vol. 91, pp. 270–285, 2015.
  40. [BOU 16a] BOUILLARD A., FAOU E., ZAVIDOVIQUE M., “Fast weak-KAM integrators for separable Hamiltonian systems”, Mathematics of Computation, vol. 85, no. 297, pp. 85–117, 2016.
  41. [BOU 16b] BOUILLARD A., STEA G., “Exact worst-case delay in FIFO-multiplexing feed-forward networks”, IEEE/ACM Transactions on Networking, vol. 23, no. 5, pp. 1387–1400, 2016.
  42. [BOU 16c] BOUILLARD A., THIERRY E., “Tight performance bounds in the worst-case analysis of feed-forward networks”, Discrete Event Dynamic Systems, vol. 26, no. 3, pp. 383–411, 2016.
  43. [BOY 08] BOYER M., FRABOUL C., “Tightening end to end delay upper bound for AFDX network with rate latency FCFS servers using network calculus”, Proceedings of the 7th IEEE International Workshop on Factory Communication Systems Communication in Automation (WFCS 2008), IEEE, pp. 11–20, May 2008.
  44. [BOY 10a] BOYER M., “Half-modeling of shaping in FIFO net with network calculus”, 18th International Conference on Real-Time and Network Systems, pp. 59–68, Toulouse, November 2010.
  45. [BOY 10b] BOYER M., “NC-maude: A rewriting tool to play with network calculus”, in MARGARIA T., STEFFEN B. (eds), Proceedings of the 4th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, LNCS, Springer, 2010.
  46. [BOY 10c] BOYER M., NAVET N., OLIVE X. et al., “The PEGASE project: Precise and scalable temporal analysis for aerospace communication systems with Network Calculus”, in MARGARIA T., STEFFEN B. (eds), Proceedings of the 4th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, LNCS, Springer, 2010.
  47. [BOY 11a] BOYER M., MIGGE J., FUMEY M., “PEGASE, a robust and efficient tool for worst case network traversal time”, Proceedings of the SAE 2011 AeroTech Congress & Exhibition, SAE International, Toulouse, 2011.
  48. [BOY 11b] BOYER M., MIGGE J., NAVET N., “An efficient and simple class of functions to model arrival curve of packetised flows”, Proceedings of the 1st International Workshop on Worst-Case Traversal Time, pp. 43–50, ACM, New York, November 2011.
  49. [BOY 12a] BOYER M., DOOSE D., “Combining network calculus and scheduling theory to improve delay bound”, Proceedings of the 20th International Conference on Real-Time and Network Systems, Pont-à-Mousson, November 2012.
  50. [BOY 12b] BOYER M., NAVET N., FUMEY M., “Experimental assessment of timing verification techniques for AFDX”, 6th European Congress on Embedded Real Time Software and Systems, Toulouse, February 2012.
  51. [BOY 13a] BOYER M., DUFOUR G., SANTINELLI L., “Continuity for network calculus”, Proceeding of the 21th International Conference on Real-Time and Network Systems, pp. 235–244, ACM, Sophia Antipolis, October 2013.
  52. [BOY 13b] BOYER M., NAVET N., FUMEY M. et al., “Combining static priority and weighted round-robin like packet scheduling in AFDX for incremental certification and mixed-criticality support”, Proceedings of the 5th European Conference for Aeronautics and Space Sciences – Real Time Avionics and Networks Session, Munich, July 2013.
  53. [BOY 15] BOYER M., NC-maude home page, available at: https://www.onera.fr/sites/default/files/323/NC-maude-dev.zip, 2015.
  54. [BOY 16] BOYER M., ROUX P., “Embedding network calculus and event stream theory in a common model”, Proceedings of the 21st IEEE International Conference on Emerging Technologies and Factory Automation, Berlin, September 2016.
  55. [BRO 07] BRONSHTEIN I.N., SEMENDYAYEV K.A., MUSIOL G. et al., Handbook of Mathematics, 5th edition, Springer, 2007.
  56. [BUR 03] BURKARD R.E., BUTKOVIC P., “Finding all essential terms of a characteristic maxpolynomial”, Discrete Applied Mathematics, vol. 130, no. 3, pp. 367–380, 2003.
  57. [CHA 94] CHANG C.-S., “Stability, queue length, and delay of deterministic and stochastic queueing networks”, IEEE Transactions on Automatic Control, vol. 39, no. 5, pp. 913–931, May 1994.
  58. [CHA 97] CHANG C.-S., “A filtering theory for deterministic traffic regulation”, 16th Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, vol. 2, pp. 436–443, April 1997.
  59. [CHA 98] CHANG C.-S., “Matrix extensions of the filtering theory for deterministic traffic regulation and service guarantees”, IEEE Journal on Selected Areas in Communications, vol. 16, no. 5, pp. 708–718, June 1998.
  60. [CHA 00] CHANG C.-S., Performance Guarantees in Communication Networks, Springer Verlag, 2000.
  61. [CHA 01] CHANG C.-S., LEE D.-S., JOU Y.-S., “Load balanced Birkhoff–von Neumann switches”, IEEE Workshop on High Performance Switching and Routing, pp. 276–280, 2001.
  62. [CHA 02a] CHANG C.-S., LEE D.-S., JOU Y.-S., “Load balanced Birkhoff–von Neumann switches, Part I: One-stage buffering”, Computer Communications, vol. 25, no. 6, pp. 611–622, 2002.
  63. [CHA 02b] CHANG C.-S., LEE D.-S., LIEN C.-M., “Load balanced Birkhoff–von Neumann switches, Part II: Multi-stage buffering”, Computer Communications, vol. 25, no. 6, pp. 623–634, 2002.
  64. [CHA 03] CHAKRABORTY S., KÜNZLI S., THIELE L. et al., “Performance evaluation of network processor architectures: Combining simulation with analytical estimation”, Computer Networks, vol. 41, no. 5, pp. 641–665, 2003.
  65. [CHA 05] CHAKRABORTY S., PHAN L., THIAGARAJAN P., “Event count automata: A state-based model for stream processing systems”, RTSS, pp. 87–98, 2005.
  66. [CHO 02] CHOLVI V., ECHAGÜE J., BOUDEC J.-Y.L., “Worst case burstiness increase due to FIFO multiplexing”, Performance Evaluation, vol. 49, nos 1–4, pp. 491–506, 2002.
  67. [CHO 08] CHOKSHI D.B., BHADURI P., “Modeling fixed priority non-preemptive scheduling with real-time calculus”, Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE Computer Society, Washington, DC, 2008.
  68. [CHO 10] CHOKSHI D.B., BHADURI P., “Performance analysis of FlexRay-based systems using real-time calculus, revisited”, Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 351–356, ACM, New York, 2010.
  69. [CLA 99] CLARKE E., GRUMBERG O., PELED D., Model Checking, MIT Press, Cambridge, 1999.
  70. [COH 89] COHEN G., GAUBERT S., NIKOUKHAH R. et al., “Convex analysis and spectral analysis of timed event graphs”, Proceedings of the 28th IEEE Conference on Decision and Control, vol. 2, pp. 1515–1520, 1989.
  71. [COI 07] COINC home page, available at: http://perso-laris.univ-angers.fr/~lagrange/software.php, 2007.
  72. [CON 09] ContainerMinMaxGD home page, available at: http://homepages.laas.fr/elecorro/Recherche/softwares.php, 2009.
  73. [COR 09] CORMEN T.H., LEISERSON C.E., RIVEST R.L. et al., Introduction to Algorithms, 3rd edition, MIT Press, 2009.
  74. [CRU 91a] CRUZ R.L., “A calculus for network delay, Part I: Network elements in isolation”, IEEE Transactions on Information Theory, vol. 37, no. 1, pp. 114–131, January 1991.
  75. [CRU 91b] CRUZ R.L., “A calculus for network delay, Part II: Network analysis”, IEEE Transactions on Information Theory, vol. 37, no. 1, pp. 132–141, January 1991.
  76. [CRU 95] CRUZ R.L., “Quality of service guarantees in virtual circuit switched networks”, IEEE Journal on Selected Areas in Communications, vol. 13, no. 6, pp. 1048–1056, August 1995.
  77. [CRU 96] CRUZ R.L., OKINO C., “Service guarantees for window flow control”, Proceedings of the Annual Allerton Conference on Communication Control and Computing, vol. 34, pp. 10–21, 1996.
  78. [CRU 98] CRUZ R.L., “SCED+: Efficient management of quality of service guarantees”, Proceedings of the 7th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 625–634, March 1998.
  79. [DAN 14] DANG D.-K., MIFDAOUI A., “Timing analysis of TDMA-based networks using network calculus and integer linear programming”, IEEE 22nd International Symposium on Modeling Analysis and Simulation of Computer and Telecommunication Systems, Paris, 2014.
  80. [DAV 07] DAVIS R., BURNS A., BRIL R. et al., “Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised”, Real-Time Systems, vol. 35, pp. 239–272, 2007.
  81. [DIS 18] The DISCO Network Calculator home page, available at: http://discodnc.cs.uni-kl.de, 2018.
  82. [DRA 10] DRAIEF M., MASSOULIÉ L., Epidemics and Rumours in Complex Networks, Cambridge, 2010.
  83. [DUF 98] DUFFIELD N., RAMAKRISHNAN K., REIBMAN A., “SAVE: An algorithm for smoothed adaptive video over explicit rate networks”, IEEE/ACM Transactions on Networking, vol. 6, pp. 717–728, 1998.
  84. [DUF 10] DUFFY K., “Mean field Markov models of wireless local area networks”, Markov Processes and Related Fields, vol. 16, no. 2, pp. 295–328, 2010.
  85. [FID 04] FIDLER M., SANDER V., “A parameter based admission control for differentiated services networks”, Computer Network, vol. 44, no. 4, pp. 463–479, 2004.
  86. [FID 06a] FIDLER M., RECKER S., “Conjugate network calculus: A dual approach applying the Legendre transform”, Computer Networks, vol. 50, no. 8, pp. 1026–1039, 2006.
  87. [FID 06b] FIDLER M., SCHMITT J.B., “On the way to a distributed systems calculus: A network calculus with data scaling”, Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (ACM SIGMETRICS, Performance Evaluation Review), pp. 287–298, Saint Malo, June 2006.
  88. [FID 10] FIDLER M., “Survey of deterministic and stochastic service curve models in the network calculus”, IEEE Communications Surveys and Tutorials, vol. 12, no. 1, pp. 59–86, 2010.
  89. [FID 15] FIDLER M., RIZK A., “A guide to the stochastic network calculus”, IEEE Communication Surveys and Tutorials, vol. 17, no. 1, pp. 92–105, 2015.
  90. [FRA 06] FRANCES F., FRABOUL C., GRIEU J., “Using Network Calculus to optimize AFDX network”, Proceeding of the 3rd European Congress on Embedded Real Time Software, Toulouse, January 2006.
  91. [FRA 08] FRANCESCHETTI M., MEESTER R., Random Networks for Communication: From Statistical Physics to Information Systems, Cambridge, 2008.
  92. [GAN 11] GANGADHARAN D., PHAN L., CHAKRABORTY S. et al., “Video quality driven buffer sizing via frame drops”, RTCSA, pp. 319–328, 2011.
  93. [GAR 79] GAREY M., JOHNSON D., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.
  94. [GAS 12] GAST N., GAUJAL B., LE BOUDEC J.-Y., “Mean field for Markov decision processes: From discrete to continuous optimization”, IEEE Transactions on Automatic Control, vol. 57, no. 9, pp. 2266–2280, 2012.
  95. [GEO 96] GEORGIADIS L., GUÉRIN R., PERIS V. et al., “Efficient network QoS provisioning based on per node traffic shaping”, IEEE/ACM Transactions on Networking, vol. 4, no. 4, pp. 482–501, August 1996.
  96. [GEO 11] GEORGES J.-P., DIVOUX T., RONDEAU E., “Network calculus: Application to switched real-time networking”, Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, pp. 399–407, ICST, Brussels, 2011.
  97. [GON 02] GONDRAN M., MINOUX M., Graphes, dioïdes et semi-anneaux, Nouveaux modèles et algorithmes, Tec et Doc–Lavoisier, 2002.
  98. [GRI 04] GRIEU J., Analyse et évaluation de techniques de commutation Ethernet pour l’interconnexion des systèmes avioniques, PhD thesis, Institut National Polytechnique de Toulouse, June 2004.
  99. [GUA 13] GUAN N., YI W., “Finitary real-time calculus: Efficient performance analysis of distributed embedded systems”, Proceedings or the IEEE 34th Real-Time Systems Symposium, pp. 330–339, 2013.
  100. [IEC 15] IEC, Communication networks and systems in substations, Report no. IEC 61850, International Electrotechnical Commission’s – Technical Committee 57, 2015.
  101. [ITI 07] ITIER J.-B., A380 Integrated Modular Avionics – The history, objectives and challenges of the deployment of IMA on A380, available at: http://www.artist-embedded.org/docs/Events/2007/IMA/Slides/ARTIST2_IMA_Itier.pdf, November 2007.
  102. [JIA 03] JIANG Y., “Relationship between guaranteed rate server and latency rate server”, Computer Networks, vol. 43, no. 3, pp. 307–315, 2003.
  103. [JIA 08] JIANG Y., LIU Y., Stochastic Network Calculus, Springer, 2008.
  104. [KEM 13a] KEMAYO G., RIDOUARD F., BAUER H. et al., “Optimism due to serialization in the trajectory approach for switched Ethernet networks”, Proceedings of the 7th Junior Researcher Workshop on Real-Time Computing, Sophia Antipolis, October 2013.
  105. [KEM 13b] KEMAYO G., RIDOUARD F., BAUER H. et al., “Optimistic problems in the trajectory approach in FIFO context”, Proceedings of the 18th IEEE International Conference on Emerging Technologies and Factory Automation, 2013.
  106. [KER 14] KERSCHBAUM S., HIELSCHER K.-S., KLEHMET U. et al., “A framework for establishing performance guarantees in industrial automation networks”, in FISCHBACH K., KRIEGER U. (eds), Proceedings of the 17th International GI/ITG Conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2014.
  107. [KER 16] KERSCHBAUM S., HIELSCHER K.S., GERMAN R., “The need for shaping non-time-critical data in PROFINET networks”, Proceedings of the 14th IEEE International Conference on Industrial Informatics, pp. 160–165, July 2016.
  108. [KIM 04] KIM H., HOU J.C., “Network calculus based simulation for TCP congestion control: Theorems, implementation and evaluation”, Proceedings of the 23rd Conference of the IEEE Communications Society, Hong Kong, March 2004.
  109. [KLE 64] KLEINROCK L., “Analysis of a time-shared processor”, Naval Research Logistics Quarterly, vol. 11, no. 1, pp. 59–73, 1964.
  110. [LAM 09] LAMPKA K., PERATHONER S., THIELE L., “Analytic real-time analysis and timed automata: A hybrid method for analyzing embedded real-time systems”, Proceedings of the 7th ACM International Conference on Embedded Software, pp. 107–116, ACM, New York, 2009.
  111. [LAM 16] LAMPKA K., BONDORF S., SCHMITT J., “Achieving efficiency without sacrificing model accuracy: Network calculus on compact domains”, Proceedings of the 24th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 313–318, 2016.
  112. [LEB 96] LE BOUDEC J.-Y., Network calculus made easy, Technical report no. EPFL-DI 96/218, Ecole Polytechnique Fédérale de Lausanne, December 1996.
  113. [LEB 01] LE BOUDEC J.-Y., THIRAN P., Network Calculus, available at: http://lrcwww.epfl.ch/PS_files/NetCal.htm, Springer Verlag, 2001.
  114. [LEB 07] LE BOUDEC J.-Y., MCDONALD D., MUNDINGER J., “A generic mean field convergence result for systems of interacting objects”, QEST’07, pp. 3–18, 2007.
  115. [LEC 14] LE CORRONC E., COTTENCEAU B., HARDOUIN L., “Container of (min, +)-linear systems”, Discrete Event Dynamic Systems, vol. 24, no. 1, pp. 15–52, 2014.
  116. [LEN 04] LENZINI L., MINGOZZI E., STEA G., “Delay bounds for FIFO aggegates: A case study”, Computer Communications, vol. 28, pp. 287–299, 2004.
  117. [LEN 06] LENZINI L., MARTORINI L., MINGOZZI E. et al., “Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks”, Performance Evaluation, vol. 63, no. 9, pp. 956–987, 2006.
  118. [LEN 08] LENZINI L., MINGOZZI E., STEA G., “A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems”, Performance Evaluation, vol. 65, no. 11, pp. 922–943, 2008.
  119. [LI 14] LI X., CROS O., GEORGE L., “The Trajectory approach for AFDX FIFO networks revisited and corrected”, Proceedings of the 20th International Conference on Embedded and Real-Time Computing Systems and Applications, Chongqing, 2014.
  120. [LIE 96] LIEBEHERR J., WREGE D.E., FERRARI D., “Exact admission control for networks with a bounded delay service”, IEEE/ACM Transactions on Networking, vol. 4, no. 6, pp. 885–901, December 1996.
  121. [LIE 11] LIEBEHERR J., GHIASSI-FARROKHFAL Y., BURCHARD A., “On the impact of link scheduling on end-to-end delays in large networks”, IEEE Journal on Selected Areas in Communications, vol. 29, no. 5, pp. 1009–1020, May 2011.
  122. [LIE 17] LIEBEHERR J., “Duality of the max-plus and min-plus network calculus”, Foundations and Trends® in Networking, vol. 11, nos 3–4, pp. 139–282, 2017.
  123. [LIN 52] LINDLEY D., “The theory of queues with a single server”, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 48, pp. 277–289, 1952.
  124. [LIT 61] LITTLE J., “A proof for the queuing formula: L = λ W”, Operations Research, vol. 9, no. 3, pp. 383–387, 1961.
  125. [LOP 08] LOPEZ J., GRIEU J., AFXD network supporting a plurality of service classes, US Patent App. 11/776,792, 2008.
  126. [LOT 04] LOTKER Z., PATT-SHAMIR B., ROSÉN A., “New stability results for adversarial queuing”, SIAM Journal on Computing, vol. 33, no. 2, pp. 286–303, 2004.
  127. [MAN 11] MANGOUA SOFACK W., BOYER M., “Non preemptive static priority with network calculus”, Proceedings of the 16th IEEE Conference on Emerging Technologies Factory Automation, pp. 1–8, September 2011.
  128. [MAN 12] MANGOUA SOFACK W., BOYER M., “Non preemptive static priority with network calculus: Enhancement”, Proceedings of the Workshop on Network Calculus, Kaiserslautern, March 2012.
  129. [MAR 06] MARTIN S., MINET P., “Worst case end-to-end response times of flows scheduled with FP/FIFO”, ICN/ICONS/MCL, p. 54, 2006.
  130. [MAU 15] The Maude System home page, available at: http://maude.cs.uiuc.edu/, 2015.
  131. [MCM 06] MCMANUS J.M., ROSS K.W., “Video-on-demand over ATM: Constant-rate transmission and transport”, IEEE Journal on Selected Areas in Communications, vol. 14, no. 6, pp. 1087–1098, September 2006.
  132. [MIF 10] MIFDAOUI A., AYED H., “WOPANets: A tool for WOrst case Performance Analysis of embedded Networks”, Proceedings of the 15th IEEE International Workshop on Computer Aided Modeling, Analysis and Design of Communication Links and Networks, pp. 91–95, December 2010.
  133. [MOY 09] MOY M., ALTISEN K., Arrival curves for real-time calculus: The causality problem and its solutions, Report no. TR-2009-15, Verimag, 2009.
  134. [MOY 10] MOY M., ALTISEN K., “Arrival curves for real-time calculus: The causality problem and its solutions”, in ESPARZA J., MAJUMDAR R. (eds), Proceedings of the 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’2010), Springer Verlag, Berlin and Heidelberg, pp. 358-372, doi: 10.1007/978-3-642-12002-2_31, 2010.
  135. [NEM 05] NEMETH F., BARTA P., SZABO R. et al., “Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline”, Computer Networks, vol. 48, no. 6, pp. 910–940, 2005.
  136. [PAR 93] PAREKH A., GALLAGER R., “A generalised processor sharing approach to flow control in integrated services networks: the single-node case”, IEEE Transactions on Networking, vol. 1, no. 3, pp. 344–357, 1993.
  137. [PEL 04] PELLEGRINI F.D., STAROBINSKI D., KARPOVSKY M.G. et al., “Scalable cycle-breaking algorithms for gigabit ethernet backbones”, Proceedings of IEEE INFOCOM 2004, Hong Kong, China, IEEE, 7–11 March, pp. 2175–2184, 2004.
  138. [PHA 07] PHAN L., CHAKRABORTY S., THIAGARAJAN P.S. et al., “Composing functional and state-based performance models for analyzing heterogeneous real-time systems”, Proceedings of the 28th IEEE International Real-Time Systems Symposium, pp. 343–352, 2007.
  139. [QUE 12] QUECK R., “Analysis of Ethernet AVB for automotive networks using Network Calculus”, Proceedings of the IEEE International Conference on Vehicular Electronics and Safety, pp. 61–67, July 2012.
  140. [RAM 96] RAMIREZ-ALFONSIN J.L., “Complexity of the Frobenius Problem”, Combinatorica, vol. 16, no. 1, pp. 143–147, 1996.
  141. [RIZ 08] RIZZO G., BOUDEC J.-Y.L., “Stability and delay bounds in heterogeneous networks of aggregate schedulers”, Proceedings of IEEE INFOCOM 2008, Phoenix, USA, IEEE, 13–18 April, pp. 1490–1498, 2008.
  142. [ROC 97] ROCKAFELLAR R.T., Convex Analysis, Princeton University Press, 1997.
  143. [RUI 14] RUIZ DE AZUA J.A., BOYER M., “Complete modelling of AVB in network calculus framework”, Proceedings of the 22nd International Conference on Real-Time Networks and Systems, Versailles, October 2014.
  144. [SAR 99] SARIOWAN H., CRUZ R.L., POLYZOS G.C., “SCED: a generalized scheduling policy for guaranteeing quality-of-service”, IEEE/ACM Transactions on Networking, vol. 7, no. 5, pp. 669–684, 1999.
  145. [SCH 05a] SCHIØLER H., CyNC home page, available at: http://www.control.auc.dk/~henrik/CyNC/ , 2005.
  146. [SCH 05b] SCHIØLER H., JESSEN J.J., DALSGAARD J. et al., “Network calculus for real time analysis of embedded systems with cyclic task dependencies”, Proceedings of the 20th International Conference on Computers and Their Applications, pp. 326–332, 2005.
  147. [SCH 06a] SCHIØLER H., NIELSEN J.D., LARSEN K.G. et al., “CyNC: a method for real time analysis of systems with cyclic data flows”, Journal of Embedded Computing, vol. 2, nos 3–4, pp. 347–360, 2006.
  148. [SCH 06b] SCHMITT J., ZDARSKY F., MARTINOVIC I., Performance Bounds in Feed-Forward Networks under Blind Multiplexing, Report no. 349/06, University of Kaiserslautern, 2006.
  149. [SCH 06c] SCHMITT J.B., ZDARSKY F.A., “The DISCO network calculator – a toolbox for worst case analysis”, Proceedings of the First International Conference on Performance Evaluation Methodologies and Tools, Pisa, ACM, November 2006.
  150. [SCH 07] SCHMITT J., ZDARSKY F., FIDLER M., Delay bounds under arbitrary multiplexing, Report, University of Kaiserslautern, 2007.
  151. [SCH 08a] SCHMITT J., ZDARSKY F., FIDLER M., “Delay bounds under arbitrary multiplexing: when network calculus leaves you in the lurch …”, IEEE INFOCOM Phoenix, IEEE 13–18 April, pp. 1669–1677, doi: 10.1109/INFOCOM.2008. 228, 2008.
  152. [SCH 08b] SCHMITT J., ZDARSKY F., MARTINOVIC I., “Improving performance bounds in feed-forward networks by paying multiplexing only once”, Proceedings of MMB’2008, Dortmund, Germany VDE Verlag, pp. 13–28, 2008.
  153. [SCH 11] SCHMITT J., GOLLAN N., BONDORF S. et al., “Pay bursts only once holds for (some) non-FIFO systems”, IEEE INFOCOM 2011, Shanghai, China IEEE, 10–15 April, pp. 1970–1978, 2011.
  154. [SCH 14] SCHMIDT M., VEITH S., MENTH M. et al., “DelayLyzer: a tool for analyzing delay bounds in industrial ethernet networks”, in FISCHBACH K., KRIEGER U. (eds), Proceedings of the 17th International GI/ITG Conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB & DFT 2014), pp. 260–263, Springer International Publishing, 2014.
  155. [SHE 97] SHENKER S., WROCLAWSKI J., General characterization parameters for integrated service network elements, RFC no. 2215, IETF, 1997.
  156. [SHR 95] SHREEDHAR M., VARGHESE G., “Efficient fair queueing using deficit round robin”, SIGCOMM Computer Communication, vol. 25, pp. 231–242, 1995.
  157. [STA 02] STAROBINSKI D., KARPOVSKY M.G., ZAKREVSKI L., “Application of network calculus to general topologies using turn-prohibition”, Proceedings IEEE INFOCOM 2002, New York, USA, IEEE, 23–27 June, pp. 1151–1159, 2002.
  158. [STI 98] STILIADIS D., VARMA A., “Latency-rate servers: a general model for analysis of traffic scheduling algorithms”, IEEE/ACM Transactions on Networking, vol. 6, no. 5, pp. 611–624, 1998.
  159. [SUP 10] SUPPIGER U., PERATHONER S., LAMPKA K. et al., A simple approximation method for reducing the complexity of modular performance analysis, TIK-Report no. 329, Computer Engineering and Networks Laboratory – Swiss Federal Institute of Technology (ETH), 2010.
  160. [TAS 96] TASSIULAS L., GEORGIADIS L., “Any work-conserving policy stabilizes the ring with spatial re-use”, IEEE/ACM Transactions on Networking, vol. 4, no. 2, pp. 205–208, 1996.
  161. [THI 09] THIELE L., STOIMENOV N., “Modular performance analysis of cyclic dataflow graphs”, Proceedings of the 9th ACM International Conference on Embedded Software (EMSOFT’09), Grenoble, France, 12–16 October, pp. 127–136, 2009.
  162. [UNI 15] UNIVERSITY OF UPPSALA, CATS tool homepage, DARTS, available at: http://www.timestool.com/cats, 2015.
  163. [WAN 06a] WANDELER E., Modular performance analysis and interface-based design for embedded real-time systems, PhD thesis, ETH Zurich, 2006.
  164. [WAN 06b] WANDELER E., THIELE L., “Real-time calculus toolbox”, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, available at: http://www.mpa.ethz.ch/Rtctoolbox, 2006.
  165. [WAN 14] WANG H., SCHMITT J.B., “End-to-end delay bounds for variable length packet transmissions under flow transformations”, Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools, Bratislava, Slovakia, ACM, 9–11 December, pp. 31–38, 2014.
  166. [ZHA 95] ZHANG H., “Service disciplines for guaranteed performance service in packet-switching networks”, Proceedings of the IEEE, vol. 83, no. 10, pp. 1374–1396, 1995.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.17.79.60