A survey of deterministic and stochastic service curve models in the network calculus

IEEE Communications Surveys and Tutorials

Volumn 12, Issue 1, 2010, Pages 59-86

  Fidler, Markus ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

Min plus systems theory; Network calculus; Network performance analysis; Scheduling; Service curves

Indexed keywords

CONVOLUTION FORMULA; CURVE REPRESENTATIONS; END-TO-END NETWORK; MIN-PLUS ALGEBRA; NETWORK CALCULUS; NETWORK ELEMENT; NETWORK PATHS; NETWORK PERFORMANCE ANALYSIS; NETWORK SERVICES; ON TIME; PERFORMANCE ANALYSIS; PROBABILISTIC NETWORK; SCHEDULING SERVICE; STATISTICAL MULTIPLEXING; TANDEM SYSTEM;

ALGEBRA; CALCULATIONS; CONVOLUTION; ELECTRIC NETWORK ANALYSIS; INTERNET; NETWORK PERFORMANCE; SCHEDULING; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; SURVEYS; SYSTEM THEORY; TELECOMMUNICATION SERVICES;

ARTS COMPUTING;

EID: 77249130718     PISSN: None     EISSN: 1553877X     Source Type: Journal    
DOI: 10.1109/SURV.2010.020110.00019     Document Type: Article

References (212)

1. R. L. Cruz, "A calculus for network delay, part I: Network elements in isolation," IEEE Trans. Inf. Theory, vol.37, no.1, pp. 114-131, Jan. 1991.
2. R. L. Cruz, "A calculus for network delay, part II: Network analysis," IEEE Trans. Inf. Theory, vol.37, no.1, pp. 132-141, Jan. 1991.
3. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The singlenode case," IEEE/ACM Trans. Netw., vol.1, no.3, pp. 344-357, June 1993.
4. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiplenode case," IEEE/ACM Trans. Netw., vol.2, no.2, pp. 137-150, Apr. 1994.
5. R. L. Cruz, "Quality of service guarantees in virtual circuit switched networks," IEEE J. Sel. Areas Commun., vol.13, no.6, pp. 1048-1056, Aug. 1995.
6. R. L. Cruz, "SCED+: Efficient management of quality of service guarantees," in Proc. IEEE INFOCOM, Mar. 1998, pp. 625-634.
7. H. Sariowan, R. L. Cruz, and G. C. Polyzos, "Scheduling for quality of service guarantees via service curves," in Proc. IEEE ICCCN, Sept. 1995, pp. 512-520.
8. R. Agrawal and R. Rajan, "Performance bounds for guaranteed and adaptive services," Tech. Rep. RC 20649, IBM, May 1996.
9. C.-S. Chang, "On deterministic traffic regulation and service guarantees: A systematic approach by filtering," IEEE Trans. Inf. Theory, vol.44, no.3, pp. 1097-1110, May 1998.
10. J.-Y. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE Trans. Inf. Theory, vol.44, no.3, pp. 1087- 1096, May 1998.
11. R. Agrawal, R. L. Cruz, C. M. Okino, and R. Rajan, "Performance bounds for flow control protocols," IEEE/ACM Trans. Netw., vol.7, no.3, pp. 310-323, June 1999.
12. F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat, Synchronization and Linearity: An Algebra for Discrete Event Systems, Wiley, 1992.
13. R. T. Rockafellar, Convex Analysis, Princeton University Press, 1972.
14. J.-Y. Le Boudec, "Network calculus made easy," Tech. Rep. EPFL-DI 96/218, EPFL, Dec. 1996.
15. J.-Y. Le Boudec and P. Thiran, Network Calculus A Theory of Deterministic Queuing Systems for the Internet, Number 2050 in LNCS. Springer-Verlag, 2001.
16. J.-Y. Le Boudec and P. Thiran, "Network calculus a theory of deterministic queuing systems for the Internet," http://ica1www.epfl. ch/PS files/netCalBookv4.pdf, May 2004, extended and revised online version of [15].
17. C.-S. Chang, Performance Guarantees in Communication Networks, Springer-Verlag, 2000.
18. Y. Jiang and Y. Liu, Stochastic Network Calculus, Springer-Verlag, Sept. 2008.
19. S. Mao and S. S. Panwar, "A survey of envelope processes and their applications in quality of service provisioning," IEEE Commun. Surveys, vol.8, no.3, pp. 2-19, 2006.
20. A. Kumar, D. Manjunath, and J. Kuri, Communication Networking: An Analytical Approach, Elsevier, 2004.
21. S. Shenker, C. Partridge, and R. Guerin, "Specification of guaranteed quality of service," RFC 2212, Sept. 1997.
22. R. Braden, D. Clark, and S. Shenker, "Integrated services in the internet architecture: an overview," RFC 1633, June 1994.
23. B. Davie, A. Charny, J. C. R. Bennett, K. Benson, J. Y. Le Boudec, W. Courtney, S. Davari, V. Firoiu, and D. Stiliadis, "An expedited forwarding PHB (per-hop behavior)," RFC 3246, Mar. 2002.
24. A. Charny, J. C. R. Bennett, K. Benson, J. Y. Le Boudec, A. Chiu, W. Courtney, S. Davari, V. Firoiu, C. Kalmanek, and K. K. Ramakrishnan, "Supplemental information for the new definition of the EF PHB (expedited forwarding per-hop behavior)," RFC 3247, Mar. 2002.
25. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, "An architecture for differentiated services," RFC 2475, Dec. 1998.
26. K. Nichols, V. Jacobson, and L. Zhang, "A two-bit differentiated services architecture for the internet," RFC 2638, July 1999.
27. J. Liebeherr, D. E. Wrege, and D. Ferrari, "Exact admission control for networks with a bounded delay service," IEEE/ACM Trans. Netw., vol.4, no.6, pp. 885-901, Dec. 1996.
28. E. Knightly and N. Shroff, "Admission control for statistical QoS: Theory and practice," IEEE Network, vol.13, no.2, pp. 20-29, Mar. 1999.
29. G. Urvoy-Keller, G. H́ebuterne, and Y. Dallery, "Traffic engineering in a multipoint-to-point network," IEEE J. Sel. Areas Commun., vol.20, no.4, pp. 834-849, May 2002.
30. M. Fidler and V. Sander, "A parameter based admission control for differentiated services networks," Computer Networks, vol.44, no.4, pp. 463-479, Mar. 2004.
31. S. Wang, D. Xuan, R. Bettati, and W. Zhao, "Providing absolute differentiated services for real-time applications in static-priority scheduling networks," IEEE/ACM Trans. Netw., vol.12, no.2, pp. 326-339, Apr. 2004.
32. L. Lenzini, L. Martorini, E. Mingozzi, and G. Stea, "Exploiting network calculus for delay-based admission control in a sink-tree network," in Proc. FIRB-Perf, Sept. 2005, pp. 126-135.
33. L. Lenzini, L. Martorini, E. Mingozzi, and G. Stea, "A novel approach to scalable CAC for real-time traffic in sink-tree networks with aggregate scheduling," in Proc. Valuetools, Oct. 2006.
34. C. Cetinkaya, V. Kanodia, and E. W. Knightly, "Egress admission control," in Proc. IEEE INFOCOM, Mar. 2000, pp. 1471-1480.
35. C. Cetinkaya, V. Kanodia, and E. W. Knightly, "Scalable services via egress admission control," IEEE Trans. Multimedia, vol.3, no.1, pp. 69-81, Mar. 2001.
36. S. Valaee and B. Li, "Distributed call admission control for ad hoc networks," in Proc. IEEE VTC, Sept. 2002, pp. 1244-1248.
37. Y. Jiang, P.J. Emstad, A. Nevin, V. Nicola, and M. Fidler, "Measurement-based admission control for a flow-aware network," in Proc. NGI, Apr. 2005, pp. 318-325.
38. Y. Liu, C.-K. Tham, and Y. Jiang, "Conformance analysis in networks with service level agreements," Computer Networks, vol.47, no.6, pp. 885-906, Apr. 2005.
39. V. Firoiu, J.-Y. Le Boudec, D. Towsley, and Z.-L. Zhang, "Theories and models for Internet quality of service," Proc. IEEE, vol.90, no.9, pp. 1565-1591, May 2002.
40. S. Wright, "Admission control in multi-service IP networks: A tutorial," IEEE Commun. Surveys, vol.9, no.2, pp. 72-87, 2007.
41. J. Soldatos, E. Vayias, and G. Kormentzas, "On the building blocks of quality of service in heterogeneous IP networks," IEEE Commun. Surveys, vol.7, no.1, pp. 70-89, 2005.
42. J. B. Schmitt and U. Roedig, "Sensor network calculus - a framework for worst case analysis," in Proc. DCOSS, June 2005, pp. 141-154.
43. A. Koubaa, M. Alves, and E. Tovar, "Modeling and worst-case dimensioning of cluster-tree wireless sensor networks," in Proc. IEEE RTSS, Dec. 2006, pp. 412-421.
44. T. Skeie, S. Johannessen, and O. Holmeide, "Timeliness of real-time IP communication in switched industrial Ethernet networks," IEEE Trans. Ind. Informat., vol.2, no.1, pp. 25-39, Feb. 2006.
45. S. Chakraborty, S. Künzli, L. Thiele, A. Herkersdorf, and P. Sagmeister, "Performance evaluation of network processor architectures: Combining simulation with analytical estimation," Computer Networks, vol.42, no.5, pp. 641-665, 2003.
46. L. Thiele, S. Chakraborty, M. Gries, A. Maxiaguine, and J. Greutert, "Embedded software in network processors - models and algorithms," in Proc. EMSOFT, Oct. 2001, vol.2211 of LNCS, pp. 416-434.
47. H. Kim and J.C. Hou, "Network calculus based simulation for TCP congestion control: Theorems, implementation, and evaluation," in Proc. IEEE INFOCOM, Mar. 2004, pp. 2844-2855.
48. H. Kim, "Integrating network-calculus-based simulation with packetlevel simulation for TCP-operated networks," Computer Networks, vol.50, no.12, pp. 1995-2012, Aug. 2006.
49. J. Liebeherr, M. Fidler, and S. Valaee, "A min-plus system interpretation of bandwidth estimation," in Proc. IEEE INFOCOM, May 2007, pp. 1127-1135.
50. J. Liebeherr, M. Fidler, and S. Valaee, "A system theoretic approach to bandwidth estimation," Tech. Rep. arXiv:0801.0455v1, arXiv, Jan. 2008, extended version of [49].
51. A. Bose, X. Jiang, B. Liu, and G. Li, "Analysis of manufactoring blocking systems with network calculus," Performance Evaluation, vol.63, no.12, pp. 1216-1234, Dec. 2006.
52. H. Schioler, H. Schwefel, and M. Hansen, "CyNC - a Matlab/Simulink toolbox for network calculus," in Proc. Valuetools, Oct. 2007.
53. H. Schioler, J. Jessen, J. Dalsgaard Nielsen, and K. G. Larsen, "Network calculus for real time analysis of embedded systems with cyclic task dependencies," in Proc. CATA, Mar. 2005, pp. 326-332.
54. E. Wandeler and L. Thiele, "Real-Time Calculus (RTC) Toolbox," http://www.mpa.ethz.ch/, 2006.
55. J. Schmitt and F. Zdarsky, "The DISCO Network Calculator - a toolbox for worst case analysis," in Proc. Valuetools, Nov. 2006.
56. N. Gollan, F. A. Zdarsky, I. Martinovic, and J. B. Schmitt, "The DISCO Network Calculator," in Proc. MMB, Mar. 2008.
57. A. Bouillard and E. Thierry, "An algorithmic toolbox for network calculus," Discrete Event Dynamic Systems, vol.18, no.1, pp. 3-49, Mar. 2008.
58. R. Henia, A. Hamann, M. Jersak, R. Racu, K. Richter, and R. Ernst, "System level performance analysis - the SymTA/S approach," IEE Proc. Computers and Digital Techniques, vol.152, no.2, pp. 148- 166, Mar. 2005.
59. M. Fidler, Deterministic and Stochastic Service Curve Models in the Network Calculus, Habilitation thesis, TU Darmstadt, Oct. 2008.
60. D. Stiliadis and A. Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," IEEE/ACM Trans. Netw., vol.6, no.5, pp. 611-624, Oct. 1998.
61. R. Agrawal, R. L. Cruz, C. M. Okino, and R. Rajan, "A framework for adaptive service guarantees," in Proc. Allerton Conference on Communication, Control, and Computing, Sept. 1998.
62. H. Sariowan, A Service-Curve Approach to Performance Guarantees in Integrated-Service Networks, Ph.D. thesis, Univ. of California, San Diego, 1996.
63. C.-S. Chang, "A filtering theory for deterministic traffic regulation," in Proc. IEEE INFOCOM, Apr. 1997, pp. 436-443.
64. F. Ciucu, A. Burchard, and J. Liebeherr, "A network service curve approach for the stochastic analysis of networks," in Proc. ACM SIGMETRICS, June 2005, pp. 279-290.
65. F. Ciucu, A. Burchard, and J. Liebeherr, "Scaling properties of statistical end-to-end bounds in the network calculus," IEEE/ACM Trans. Netw., vol.14, no.6, pp. 2300-2312, June 2006.
66. F. Ciucu, Scaling Properties in the Stochastic Network Calculus, Ph.D. thesis, Univ. of Virginia, Aug. 2007.
67. G. Rizzo and J.-Y. Le Boudec, "Pay bursts only once does not hold for non-FIFO guaranteed rate nodes," Performance Evaluation, vol.62, no.1-4, pp. 366-381, Oct. 2005.
68. L. Georgiadis, R. Gúerin, V. Peris, and K.M. Sivarajan, "Efficient network QoS provisioning based on per node traffic shaping," IEEE/ACM Trans. Netw., vol.4, no.4, pp. 482-501, Aug. 1996.
69. R. Agrawal and R. Rajan, "A general framework for analyzing schedulers and regulators in Integrated Services networks," in Proc. Allerton Conference on Communication, Control, and Computing, Oct. 1996, pp. 239-248.
70. J.-Y. Le Boudec, "Some properties of variable length packet shapers," IEEE/ACM Trans. Netw., vol.10, no.3, pp. 329-337, June 2002.
71. C. S. Chang and Y. H. Lin, "A general framework for deterministic service guarantees in telecommunication networks with variable length packets," IEEE Trans. Autom. Control, vol.46, no.2, pp. 210-221, Feb. 2001.
72. R. Cruz and M. Taneja, "An analysis of traffic clipping," in Proc. Conference on Information Science and Systems, Princeton University, 1998.
73. J.-Y. Le Boudec and P. Thiran, "Network calculus viewed as a minplus system theory applied to communication networks," Tech. Rep. SSC/1998/016, EPFL, Apr. 1998.
74. C.-S. Chang and R. L. Cruz, "A time varying filtering theory for constrained traffic regulation and dynamic service guarantees," in Proc. IEEE INFOCOM, Mar. 1999, pp. 63-70.
75. C.-S. Chang, R. L. Cruz, J.-Y. Le Boudec, and P. Thiran, "A min-plus system theory for constrained traffic regulation and dynamic service guarantees," Tech. Rep. SSC/1999/024, EPFL, July 1999.
76. C.-S. Chang, R. L. Cruz, J.-Y. Le Boudec, and P. Thiran, "A min, + system theory for constrained traffic regulation and dynamic service guarantees," IEEE/ACM Trans. Netw., vol.10, no.6, pp. 805-817, Dec. 2002, extended version of [75].
77. S. Ayyorgun and R. L. Cruz, "A service curve model with loss," Tech. Rep. LA-UR-03-3939, Los Alamos National Laboratory, 2003.
78. S. Ayyorgun and R. L. Cruz, "A composable service model with loss and a scheduling algorithm," in Proc. IEEE INFOCOM, Mar. 2004, pp. 1950-1961.
79. S. Ayyorgun and R. L. Cruz, "A service curve model with loss and a multiplexing problem," in Proc. IEEE ICDCS, Mar. 2004, pp. 756-765.
80. C.-M. Chuang and J.-F. Chang, "Deterministic loss ratio quality of service guarantees for high speed networks," IEEE Commun. Lett., vol.4, no.7, pp. 236-238, July 2000.
81. T. Chahed, G. H́ebuterne, and C. Fayet, "Mapping of loss and delay between IP and ATM using network calculus," in Proc. IFIP Networking, May 2000, vol.1815 of LNCS, pp. 240-251.
82. R. L. Cruz and C. M. Okino, "Service guarantees for window flow control," in Proc. Allerton Conference on Communication, Control, and Computing, Oct. 1996.
83. F. Baccelli and D. Hong, "TCP is max-plus linear and what it tells us on its throughput," in Proc. ACM SIGCOMM, Oct. 2000, pp. 219-230.
84. M. Fidler and J. B. Schmitt, "On the way to a distributed systems calculus: A network calculus with data scaling," in Proc. ACM SIGMETRICS, June 2006, pp. 287-298.
85. J. Naudts, "Towards real-time measurement of traffic control parameters," Computer Networks, vol.34, no.1, pp. 157-167, July 2000.
86. T. Hisakado, K. Okumura, V. Vukadinovic, and L. Trajkovic, "Characterization of a simple communication network using Legendre transform," in Proc. IEEE ISCAS, May 2003, pp. 738-741.
87. M. Fidler and S. Recker, "Conjugate network calculus: A dual approach applying the Legendre transform," Computer Networks, vol.50, no.8, pp. 1026-1039, June 2006.
88. K. Pandit, J. Schmitt, C. Kirchner, and R. Steinmetz, "A transform for network calculus and its application to multimedia networking," in Proc. SPIE MMCN, Jan. 2006.
89. F. Agharebparast and V. C. M. Leung, "Slope domain modeling and analysis of data communication networks: A network calculus complement," in Proc. IEEE ICC, June 2006, pp. 591-596.
90. D. E. Wrege, E. W. Knightly, H. Zhang, and J. Liebeherr, "Deterministic delay bounds for VBR video in packet-switching networks: Fundamental limits and practical trade-offs," IEEE/ACM Trans. Netw., vol.4, no.3, pp. 352-362, 1996.
91. J. B. Schmitt, "On average and worst case behaviour in non-preemptive priority queueing," in Proc. SPECTS, July 2003, pp. 197-204.
92. C. Li, A. Burchard, and J. Liebeherr, "A network calculus with effective bandwidth," IEEE/ACM Trans. Netw., vol.15, no.6, pp. 1442-1453, Dec. 2007, also [100].
93. J. Echagüe and V. Cholvi, "Worst case burstiness increase due to arbitrary aggregate multiplexing," in Prof. of Valuetools, Oct. 2006.
94. V. Cholvi, J. Echagüe, and J.-Y. Le Boudec, "Worst case burstiness increase due to FIFO multiplexing," Performance Evaluation, vol. 49, no. 1/4, pp. 491-506, Sept. 2002.
95. M. Fidler, V. Sander, and W. Klimala, "Traffic shaping in aggregatebased networks: Implementation and analysis," Computer Communications, vol.28, no.3, pp. 274-286, Feb. 2005.
96. L. Lenzini, E. Mingozzi, and G. Stea, "Delay bounds for FIFO aggregates: a case study," Computer Communications, vol.28, no.3, pp. 287-299, Feb. 2005.
97. M. Fidler, Providing Internet Quality of Service based on Differentiated Services Traffic Engineering, Ph.D. thesis, RWTH Aachen University, Jan. 2004.
98. J. Qiu and E. W. Knightly, "Inter-class resource sharing using statistical service envelopes," in Proc. IEEE INFOCOM, Mar. 1999, pp. 1404- 1411.
99. J. Qiu, C. Cetinkaya, C. Li, and E. W. Knightly, "Inter-class resource sharing using statistical service envelopes," http://www.ece.rice. edu/ networks/papers/QCLK00.ps, 2000, extended online version of [98].
100. C. Li, A. Burchard, and J. Liebeherr, "A network calculus with effective bandwidth," Tech. Rep. CS-2003-2020, University of Virginia, Nov. 2003.
101. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," in Proc. ACM SIGCOMM, Sept. 1989, pp. 1-12.
102. H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. IEEE, vol.83, no.10, pp. 1374- 1396, Oct. 1995.
103. P. Goyal, S. S. Lam, and H. M. Vin, "Determining end-to-end delay bounds in heterogeneous networks," Multimedia Systems, vol.5, no.3, pp. 157-163, May 1997.
104. M. Vojnovíc and J.-Y. Le Boudec, "Stochastic bound on delay for guaranteed rate nodes," IEEE Commun. Lett., vol.6, no.10, pp. 449- 451, 2002.
105. Y. Jiang, "Relationship between guaranteed rate server and lateny rate server," Computer Networks, vol.43, no.3, pp. 307-315, Oct. 2003.
106. Q. Z. Zheng and K. G. Shin, "On the ability of establishing real-time channels in point-to-point packet switched networks," IEEE Trans. Commun., vol.42, no.3, pp. 1096-1105, Mar. 1994.
107. L. Georgiadis, R. Gúerin, and A. Parekh, "Optimal multiplexing on a single link: Delay and buffer requirements," IEEE Trans. Inf. Theory, vol.43, no.5, pp. 1518-1535, Sept. 1997.
108. H. Sariowan, R. L. Cruz, and G. C. Polyzos, "SCED: A generalized scheduling policy for guaranteeing quality-of-service," IEEE/ACM Trans. Netw., vol.7, no.5, pp. 669-684, Oct. 1999.
109. R. L. Cruz and S. Al-Harthi, "A service-curve framework for packet scheduling with switch configuration delays," IEEE/ACM Trans. Netw., vol.16, no.1, pp. 196-205, Feb. 2008.
110. P. Goyal and H. M. Vin, "Generalized guaranteed rate scheduling algorithms: A framework," IEEE/ACM Trans. Netw., vol.5, no.4, pp. 561-571, Aug. 1997.
111. G. G. Xie and S. S. Lam, "Delay guarantee of virtual clock server," IEEE/ACM Trans. Netw., vol.3, no.6, pp. 683-689, Dec. 1995.
112. W. Sun and K. G. Shin, "End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms," IEEE/ACM Trans. Netw., vol.13, no.5, pp. 1188-1201, Oct. 2005.
113. J. C. R. Bennett, K. Benson, W. F. Courtney, and J.-Y. Le Boudec, "Delay jitter bounds and packet scale rate guarantee for expedited forwarding," IEEE/ACM Trans. Netw., vol.10, no.4, pp. 529-540, Aug. 2002.
114. Y. Jiang, "Per-domain packet scale rate guarantee for expedited forwarding," IEEE/ACM Trans. Netw., vol.14, pp. 630-643, June 2006.
115. Y. Jiang, "Delay bound and packet scale rate guarantees for some expedited forwarding networks," Computer Networks, vol.50, no.1, pp. 15-28, Jan. 2006.
116. J.-Y. Le Boudec and A. Charny, "Packet scale rate guarantee for non- FIFO nodes," in Proc. IEEE INFOCOM, June 2002, pp. 23-26.
117. L. Georgiadis, R. Gúerin, V. Peris, and R. Rajan, "Efficient support of delay and rate guarantees in an Internet," in Proc. ACM SIGCOMM, Oct. 1996, pp. 106-116.
118. Z.-L. Zhang, Z. Liu, and D. F. Towsley, "Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline," J. Combinatorial Optimization, vol.1, no.4, pp. 457-481, 1998.
119. J. A. Cobb, "Preserving quality of service guarantees in spite of flow aggregation," IEEE/ACM Trans. Netw., vol.10, no.1, pp. 43-53, Feb. 2002.
120. E. Rosen, A. Viswanathan, and R. Callon, "Multiprotocol label switching architecture," RFC 3031, Jan. 2001.
121. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson, "Adversarial queueing theory," in Proc. ACM STOC, May 1996, pp. 376-385.
122. M. Andrews, B. Awerbuch, A. Fernandez, J. Kleinberg, T. Leighton, and Z. Liu, "Universal stability results for greedy contention-resolution protocols," in Proc. IEEE FOCS, Oct. 1996, pp. 380-389.
123. B. R. Haverkort, Performance of Computer Communication Systems: A Model-Based Approach, Wiley, 1998.
124. M. D. Schroeder, A. D. Birrell, M. Burrows, H. Murray, R. M. Needham, and T. L. Rodeheffer, "Autonet: A high-speed, self-configuring local area network using point-to-point links," IEEE J. Sel. Areas Commun., vol.9, no.8, pp. 1318-1335, Oct. 1991.
125. D. Starobinski, M. Karpovsky, and L. Zakrevski, "Application of network calculus to general topologies using turn-prohibition," IEEE/ACM Trans. Netw., vol.11, no.3, pp. 411-421, June 2003.
126. M. Fidler and G. Einhoff, "Routing in turn-prohibition based feedforward networks," in Proc. IFIP Networking, May 2004, vol.3042 of LNCS, pp. 1168-1179.
127. M. Fidler, "Extending the network calculus pay bursts only once principle to aggregate scheduling," in Proc. QoS-IP, Feb. 2003, pp. 19-34.
128. L. Lenzini, L. Martorini, E. Mingozzi, and G. Stea, "Tight end-toend per-flow delay bounds in FIFO multiplexing sink-tree networks," Performance Evaluation, vol.63, no.9-10, pp. 956-987, Oct. 2006.
129. L. Lenzini, E. Mingozzi, and G. Stea, "A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems," Performance Evaluation, vol.65, no.11-12, pp. 922-943, Nov. 2008.
130. G. Kim and C. Kim, "Deterministic edge-to-edge delay bounds for a flow under latency rate scheduling in a diffserv network," IEICE Trans. Commun., vol.88-B, no.7, pp. 2887-2895, July 2005.
131. J. B. Schmitt, F. A. Zdarsky, and I. Martinovic, "Improving performance bounds in feed-forward networks by paying multiplexing only once," in Proc. GI/ITG MMB, Mar. 2008.
132. A. Bouillard, B. Gaujal, S. Lagrange, and E. Thierry, "Optimal routing for end-to-end guarantees: The price of multiplexing," in Proc. Valuetools, Oct. 2007.
133. J. B. Schmitt, F. A. Zdarsky, and M. Fidler, "Delay bounds under arbitrary multiplexing: When network calculus leaves you in the lurch ...," in Proc. IEEE INFOCOM, Apr. 2008, pp. 1669-1677.
134. G. I. Winograd and P. R. Kumar, "The FCFS service discipline: Stable network topologies, bounds on traffic burstiness and delay, and control by regulators," Mathematical and Computer Modeling, vol.23, no.11-12, pp. 115-129, 1996.
135. C.-S. Chang, "Stability, queue length and delay of deterministic and stochastic queueing networks," IEEE Trans. Autom. Control, vol.39, no.5, pp. 913-931, May 1994.
136. L. Tassiulas and L. Georgiadis, "Any work-conserving policy stabilizes the ring with spatial re-use," IEEE/ACM Trans. Netw., vol.4, no.2, pp. 205-208, Apr. 1996.
137. G. Rizzo and J.-Y. Le Boudec, "Stability and delay bounds in heterogeneous networks of aggregate schedulers," in Proc. IEEE INFOCOM, Apr. 2008, pp. 2162-2170.
138. V. Cholvi and J. Echagüe, "Stability of FIFO networks under adversarial models: State of the art," Computer Networks, vol.51, no.15, pp. 4460-4474, Oct. 2007.
139. J.-Y. Le Boudec and F. Farkas, "A delay bound for a network with aggregate scheduling," in Proc. UK Teletraffic Symposium on Management of Quality of Service, May 2000.
140. A. Charny and J.-Y. Le Boudec, "Delay bounds in a network with aggregate scheduling," in Proc. QoFIS, Sept. 2000, vol.1922 of LNCS, pp. 1-13.
141. Z.-L. Zhang, Z. Duan, and Y. T. Hou, "Fundamental trade-offs in aggregate packet scheduling," in Proc. IEEE ICNP, Nov. 2001, pp. 129-137. (Pubitemid 34099977)
142. Y. Jiang, "Delay bounds for a network of guaranteed rate servers with FIFO aggregation," Computer Networks, vol.40, no.6, pp. 683-694, Dec. 2002. (Pubitemid 35433138)
143. I. Chlamtac, A. Faraǵ o, H. Zhang, and A. Fumagalli, "A deterministic approach to the end-to-end analysis of packet flows in connectionoriented networks," IEEE/ACM Trans. Netw., vol.6, no.4, pp. 422- 431, Aug. 1998.
144. H. Zhang, "A note on deterministic end-to-end delay analysis in connection oriented networks," in Proc. IEEE ICC, 1999, pp. 1223- 1227.
145. J.-Y. Le Boudec and G. H́ebuterne, "Comments on a deterministic approach to the end-to-end analysis of packet flows in connectionoriented networks," IEEE/ACM Trans. Netw., vol.8, no.1, pp. 121- 124, Feb. 2000.
146. F.-D. Otel and J.-Y. Le Boudec, "Deterministic end-to-end delay guarantees in a heterogeneous route interference environment," in Proc. QoFIS, Oct. 2003, vol.2811 of LNCS, pp. 21-30.
147. Y. Yin and G.-S. Poo, "End-to-end QoS guarantees for a network based on latency-rate max-min service curve," Computer Communications, vol.29, no.18, pp. 3833-3843, Nov. 2006.
148. G. Rizzo and J.-Y. Le Boudec, "Generalization of the RIN result to heterogeneous networks of aggregate schedulers and leaky bucket constrained flows," in Proc. IEEE ICON, Nov. 2007, pp. 388-393.
149. A. Rizk and M. Fidler, "On the identifiability of link service curves from end-host measurements," in Proc. Euro-NF NET-COOP, Sept. 2008, vol.5425 of LNCS, pp. 53-61.
150. A. Kuzmanovic and E. W. Knightly, "Measuring service in multi-class networks," in Proc. IEEE INFOCOM, Apr. 2001, pp. 1281-1289.
151. A. Kuzmanovic and E.W. Knightly, "Measurement-based characterization and classification of QoS-enhanced systems," IEEE Trans. Parallel Distrib. Syst., vol.14, no.4, pp. 1-15, Apr. 2003.
152. A. Undheim, Y. Jiang, and P. J. Emstad, "Network calculus approach to router modeling with external measurements," in Proc. CHINACOM, Aug. 2007, pp. 276-280.
153. L. Alcuri, G. Barbera, and G. D'Acquisto, "Service curve estimation by measurement: An input output analysis of a softswitch model," in Proc. QoS-IP, Feb. 2005, pp. 49-60.
154. R. Agrawal, F. Baccelli, and R. Rajan, "An algebra for queueing networks with time-varying service and its application to the analysis of Integrated Service networks," Mathematics of Operation Research, vol.29, no.3, pp. 559-591, Aug. 2004.
155. C.-S. Chang, "On the exponentiality of stochastic linear systems under the max-plus algebra," IEEE Trans. Autom. Control, vol.41, no.8, pp. 1182-1188, Aug. 1996.
156. R. L. Cruz, "Quality of service management in Integrated Services networks," in Proc. Semi-Annual Research Review, Center of Wireless Communication, UCSD, June 1996.
157. M. Fidler, "An end-to-end probabilistic network calculus with moment generating functions," in Proc. IWQoS, June 2006, pp. 261-270.
158. D. Ferrari, "Client requirements for real-time communication services," IEEE Commun. Mag., vol.28, no.11, pp. 65-72, Nov. 1990.
159. F. Ciucu, B. Mark, and R. Simon, "On multiplexing gain for networks with deterministic delay guarantees," in Proc. IEEE Globecom, Dec. 2003, pp. 2977-2981.
160. J. Liebeherr, S. D. Patek, and E. Yilmaz, "Tradeoffs in designing networks with end-to-end statistical QoS guarantees," Tech. Rep. CS- 2001-11, University of Virginia, July 2001, also in Proc. IEEE IWQoS, pp. 221-230, June 2000.
161. R.-R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn, "Statistical service assurances for traffic scheduling algorithms," IEEE J. Sel. Areas Commun., vol.18, no.12, pp. 2651-2664, Dec. 2000.
162. J. Kurose, "On computing per-session performance bounds in highspeed multi-hop computer networks," in Proc. ACM SIGMETRICS, June 1992, pp. 128-139.
163. N. Fonseca, G. Mayor, and C. Neto, "On the equivalent bandwidth of self-similar sources," ACM Trans. Model. Comput. Simul., vol.10, no.2, pp. 104-124, Apr. 2000.
164. C. A. V. Melo and N. L. S. Fonseca, "Envelope process and computation of the equivalent bandwidth of multifractal flows," Computer Networks, vol.48, no.3, pp. 351-375, 2005.
165. H. Zhang and E. Knightly, "Providing end-to-end statistical performance guarantees with interval dependent stochastic models," in Proc. ACM SIGMETRICS, May 1994, pp. 211-220.
166. O. Yaron and M. Sidi, "Performance and stability of communication networks via robust exponential bounds," IEEE/ACM Trans. Netw., vol.1, no.3, pp. 372-385, June 1993.
167. O. Yaron and M. Sidi, "Generalized processor sharing networks with exponentially bounded burstiness arrivals," J. High Speed Networks, vol.3, pp. 375-387, 1994.
168. D. Starobinski and M. Sidi, "Stochastically bounded burstiness for communication networks," IEEE Trans. Inf. Theory, vol.46, no.1, pp. 206-212, Jan. 2000.
169. A. Papoulis and S. U. Pillai, Probability, Random Variables and Stochastic Processes, McGraw-Hill, forth edition, 2002.
170. C.-S. Chang, "Stability, queue length and delay. i. deterministic queueing networks. ii. stochastic queueing networks," in Proc. IEEE CDC, Dec. 1992, pp. 999-1010.
171. G. Kesidis and T. Konstantopoulos, "Extremal shape-controlled traffic patterns in high-speed networks," IEEE Trans. Commun., vol.48, no.5, pp. 813-819, May 2000.
172. G. Kesidis and T. Konstantopoulos, "Worst-case performance of a buffer with independent shaped arrival processes," IEEE Commun. Lett., vol.4, no.1, pp. 26-28, Jan. 2000.
173. E. W. Knightly, "H-BIND: A new approach to providing statistical performance guarantees to VBR traffic," in Proc. IEEE INFOCOM, Mar. 1996, pp. 1091-1099.
174. E. W. Knightly, "Enforceable quality of service guarantees for bursty traffic streams," in Proc. IEEE INFOCOM, Mar. 1998, pp. 635-642.
175. T. Wu and E. Knightly, "Enforceable and efficient service provisioning," Computer Communications Journal, vol.23, no.14-15, pp. 1377- 1388, Aug. 2000.
176. S. Rajagopal, M. Reisslein, and K. W. Ross, "Packet multiplexers with adversarial regulated traffic," in Proc. IEEE INFOCOM, Mar. 1998, pp. 347-355.
177. M. Reisslein, K. W. Ross, and S. Rajagopal, "A framework for guaranteeing statistical QoS," IEEE/ACM Trans. Netw., vol.10, no.1, pp. 27-42, Feb. 2002.
178. M. Reisslein, K. W. Ross, and S. Rajagopal, "Guaranteeing statistical QoS to regulated traffic: The single node case," in Proc. IEEE INFOCOM, Mar. 1999, pp. 1060-1071.
179. M. Reisslein, K. W. Ross, and S. Rajagopal, "Guaranteeing statistical QoS to regulated traffic: The multiple node case," in Proc. IEEE CDC, Dec. 1998, pp. 531-538.
180. M. Vojnovíc and J.-Y. Le Boudec, "Bounds for independent regulated inputs multiplexed in a service curve network element," IEEE Trans. Commun., vol.51, no.5, pp. 735-740, May 2003.
181. E. W. Knightly, "Second moment resource allocation in multi-service networks," in Proc. ACM SIGMETRICS, June 1997, pp. 181-191.
182. E. Knightly, "Resource allocation for multimedia traffic flows using rate-variance envelopes," ACM Multimedia Systems Journal, vol.7, no.6, pp. 477-485, Nov. 1999.
183. J. Choe and N. B. Shroff, "A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks," IEEE/ACM Trans. Netw., vol.6, no.5, pp. 659-671, Oct. 1998.
184. F. P. Kelly, "Notes on effective bandwidths," Number 4 in Royal Statistical Society Lecture Notes, pp. 141-168. Oxford University, 1996.
185. G. Kesidis, J. Walrand, and C.-S. Chang, "Effective bandwidths for multiclass markov fluids and other ATM sources," IEEE/ACM Trans. Netw., vol.1, no.4, pp. 424-428, Aug. 1993.
186. A. I. Elwalid and D. Mitra, "Effective bandwidth of general markovian traffic sources and admission control of high speed networks," IEEE/ACM Trans. Netw., vol.1, no.3, pp. 329-343, June 1993.
187. R. J. Gibbens, "Traffic characterisation and effective bandwidths for broadband network traces," Number 4 in Royal Statistical Society Lecture Notes, pp. 169-179. Oxford University Press, 1996.
188. J. Liebeherr, S. D. Patek, and A. Burchard, "Statistical per-flow service bounds in a network with aggregate provisioning," in Proc. IEEE INFOCOM, Mar. 2003, pp. 1680-1690.
189. J.-Y. Le Boudec and M. Vojnovíc, "Elements of probabilistic network calculus for packet scale rate guarantee nodes," in Proc. MTNS, 2002.
190. K. Angrishi and U. Killat, "Analysis of a real-time network using statistical network calculus with effective bandwidth and effective capacity," in Proc. GI/ITG MMB, Mar. 2008.
191. A. Burchard, J. Liebeherr, and S. Patek, "A min-plus calculus for endto- end statistical service guarantees," IEEE Trans. Inf. Theory, vol.52, no.9, pp. 4105-4114, Aug. 2006.
192. S. Ayyorgun and W.-C. Feng, "A systematic approach for providing end-to-end probabilistic QoS gurantees," in Proc. IEEE ICCCN, Oct. 2004, pp. 115-122.
193. Q. Yin, Y. Jiang, S. Jiang, and P. Y. Kong, "Analysis of generalized stochastically bounded bursty traffic for communication networks," in Proc. IEEE LCN, Nov. 2002, pp. 141-149.
194. Y. Jiang, "A basic stochastic network calculus," in Proc. ACM SIGCOMM, Oct. 2006, pp. 123-134.
195. Y. Liu, C.-K. Tham, and Y. Jiang, "A calculus for stochastic QoS analysis," Performance Evaluation, vol.64, no.6, pp. 547-572, 2007.
196. Y. Jiang and P. J. Emstad, "Analysis of stochastic service guarantees in communication networks: A server model," in Proc. IWQoS, June 2005, pp. 233-245.
197. D. Wu and R. Negi, "Effective capacity: A wireless link model for support of quality of service," IEEE Trans. Wireless Commun., vol.2, no.4, pp. 630-643, July 2003.
198. M. Fidler, "A network calculus approach to probabilistic quality of service analysis of fading channels," in Proc. IEEE Globecom, Nov. 2006.
199. M. Bredel and M. Fidler, "Understanding fairness and its impact on quality of service in IEEE 802.11," in Proc. IEEE INFOCOM, Apr. 2009, pp. 1098-1106.
200. F. Ciucu, "Network calculus delay bounds in queueing networks with exact solutions," in Proc. ITC-20. June 2007, vol.4516 of LNCS, pp. 495-506, Springer.
201. F. Ciucu, "Exponential supermartingales for evaluating end-to-end
202. F. Ciucu and J. Liebeherr, "A case for decomposition in FIFO networks," in Proc. IEEE INFOCOM, Apr. 2009, pp. 1071-1079.
203. K. Angrishi, S. Zhang, and U. Killat, "Analysis of a real-time network using statistical network calculus with approximate invariance of effective bandwidth," in Proc. GI/ITG KiVS, Feb. 2007, pp. 189- 200.
204. K. Angrishi and U. Killat, "Analysis of a real-time network using statistical network calculus with effective bandwidth and effective capacity," in Proc. GI/ITG MMBnet, Sept. 2007, pp. 12-26.
205. K. Lee, "Performance bounds in communication networks with variable-rate links," in Proc. ACM SIGCOMM, 1995, pp. 126-136.
206. Y. Jiang, Q. Yin, Y. Liu, and S. Jiang, "Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks," Computer Networks, vol.53, no.12, pp. 2011-2021, Aug. 2009.
207. A. Burchard, J. Liebeherr, and F. Ciucu, "On Theta (H log H) scaling of network delays," in Proc. IEEE INFOCOM, May 2007, pp. 1866- 1874.
208. C.-S. Chang and J. Cheng, "Computable exponential bounds for intree networks with routing," in Proc. IEEE INFOCOM, Apr. 1995, pp. 197-204.
209. S. Shioda, "Performance bounds for feedforward queueing networks with upper-constrained inputs," Performance Evaluation, vol.64, no.7-8, pp. 782-801, Aug. 2007.
210. A. Gulyas, F. Nemeth, and J. Biro, "A time adaptive stochastic network calculus for long-run network analysis," Tech. Rep. 03-10- 2008, Budapest University of Technology and Economics, Mar. 2008.
211. A. Gulyas and J. Biro, "A stochastic extension of network calculus for workload loss examinations," IEEE Communications Letters, vol.10, no.5, pp. 399-401, May 2006. (Pubitemid 43805539)
212. F. Agharebparast and V. C. M. Leung, "A novel stochastic minplus system theory approach for performance modeling and cross-layer design of wireless fading channels," in Proc. Het-Nets, Sept. 2006.