A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems

Performance Evaluation

Volumn 65, Issue 11-12, 2008, Pages 922-943

  Lenzini, Luciano ^a   Mingozzi, Enzo ^a   Stea, Giovanni ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Delay bound; FIFO multiplexing; Network calculus

Indexed keywords

MULTIPLEXING; NETWORK PROTOCOLS; SENSOR NETWORKS;

DELAY BOUND; DELAY BOUNDS; END-TO-END DELAY BOUNDS; FIFO-MULTIPLEXING; LEAKY BUCKETS; NETWORK CALCULUS;

QUALITY OF SERVICE;

EID: 53449093224     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2008.04.002     Document Type: Article

References (27)

1. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, An architecture for differentiated services, IETF RFC 2475, 1998
2. Le Boudec J.-Y., and Thiran P. Network Calculus. LNCS vol. 2050 (2001), Springer-Verlag
3. E. Rosen, A. Viswanathan, R. Callon, Multiprotocol label switching architecture, IETF RFC 3031, January 2001
4. H. Saito, Y. Miyao, M. Yoshisda, Traffic engineering using multiple multipoint-to-point LSPs, in: Proc. of IEEE Infocom 2000, Tel Aviv, Israel, 26-30 March 2000, pp. 894-902
5. S. Bhatnagar, S. Ganguly, B. Nath, Creating multipoint-to-point LSPs for traffic engineering, in: Proceedings of HPSR'03, Torino, Italy, 24-27 June 2003, pp. 201-207
6. T. Li, Y. Rekhter, A provider architecure for differentiated services and traffic engineering (PASTE), IETF RFC 2430, October 1998
7. Cruz R.L. A calculus for network delay, part i: Network elements in isolation. IEEE Transactions on Information Theory 37 1 (1991) 114-131
8. Cruz R.L. A calculus for network delay, part ii: Network analysis. IEEE Transactions on Information Theory 37 1 (1991) 132-141
9. Agrawal R., Cruz R.L., Okino C., and Rajan R. Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking 7 3 (1999) 310-323
10. Chang C.S. Performance Guarantees in Communication Networks (2000), Springer-Verlag, New York
11. Lenzini L., Mingozzi E., and Stea G. Delay bounds for FIFO aggregates: A case study. Elsevier Computer Communications 28 3 (2005) 287-299
12. Lenzini L., Martorini L., Mingozzi E., and Stea G. Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks. Performance Evaluation 63 October (2006) 956-987
13. L. Lenzini, E. Mingozzi, G. Stea, End-to-end delay bounds in FIFO-multiplexing tandems, in VALUETOOLS'07, Nantes, FR, 23-25 October 2007
14. M. Fidler, Extending the network calculus pay bursts only once principle to aggregate scheduling, in: Proc. of QoS-IP'03, Milan, Italy, 24-26 February 2003, pp. 19-34
15. Fidler M., and Sander V. A parameter based admission control for differentiated services networks. Elsevier Computer Networks 44 1 (2004) 463-479
16. M. Fidler, Providing Internet quality of service based on differentiated services traffic engineering, Ph.D. Thesis, Aachen University, 2003
17. Bennett J.C.R., Benson K., Charny A., Courtney W.F., and Le Boudec J.-Y. Delay jitter bounds and packet scale rate guarantee for expedited forwarding. IEEE/ACM Trans. on Networking 10 4 (2002) 529-540
18. A. Charny, J.-Y. Le Boudec, Delay bounds in a network with aggregate scheduling, in: Proc. of QoFIS'00, Berlin, Germany, 25-26 September 2000, pp. 1-13
19. Jiang Y. Delay bounds for a network of guaranteed rate servers with FIFO aggregation. Computer Networks 40 6 (2002) 683-694
20. Z.-L. Zhang, Z. Duan, T.Y. Hou, Fundamental trade-offs in aggregate packet scheduling, in: Proceedings of ICNP'01, Riverside, USA, 11-14 November 2001, pp. 129-137
21. Schmitt J.B., and Zdarsky F.A. The DISCO network calculator - A toolbox for worst case analysis. Proc. of VALUETOOLS'06 (2006), ACM, Pisa, Italy October
22. Cobb J.A. Preserving quality of service guarantees in spite of flow aggregation. IEEE/ACM Transactions on Networking 10 1 (2002) 43-53
23. Fourer R., and Marsten R.E. Solving piecewise linear programs: Experiments with a simplex approach. ORSA Journal on Computing 4 (1992) 16-31
24. A. Bouillard, B. Gaujal, S. Lagrange, E. Thierry, Optimal routing for end-to-end guarantees: The price of multiplexing, in: Proceedings of VALUETOOLS'07, Nantes, France, 23-25 October 2007
25. Starobinski D., Karpovsky M., and Zakrevski L. Application of network calculus to general topologies using turn-prohibition. IEEE/ACM Transactions on Networking 11 3 (2003) 411-421
26. Shoreder M., Birrell A.D., Burrows M., Murray H., Needham R.M., and Rodeheffer T.L. Autonet: A high-speed, self-configuring local area network using point-to-point links. IEEE JSAC 9 8 (1991) 1318-1335
27. M. Fidler, O. Heckmann, R. Steinmetz, Preserving the independence of flows in general topologies using turn-prohibition, in: Proc. of IWQOS 2005, Passau, Germany, pp. 193-205