A novel approach to scalable CAC for real-time traffic in sink-tree networks with aggregate scheduling

ACM International Conference Proceeding Series

Volumn 180, Issue , 2006, Pages

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

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Deficit round robin; Latency; Performance evaluation

Indexed keywords

COMPUTATIONAL COMPLEXITY; REAL TIME SYSTEMS; RESOURCE ALLOCATION; SCALABILITY; SCHEDULING ALGORITHMS; TREES (MATHEMATICS);

DEFICIT ROUND ROBIN; LATENCY; PERFORMANCE EVALUATION; TRAFFIC FLOW;

TELECOMMUNICATION TRAFFIC;

EID: 34748884338     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1190095.1190106     Document Type: Conference Paper

References (22)

1. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z. and Weiss, W. An Architecture for Differentiated Services. IETF RFC 2475, 1998.
2. Rosen, E., Viswanathan, A. and Callon, R. Multi Protocol Label Switching Architecture. IETF RFC 3031, 2001.
3. Choi, B.K. and Bettati, R. Endpoint admission control: Network-based approach. In Proceedings of IEEE Int. Conf. Distributed Computing Systems (ICDCS), (Phoenix, Arizona, April 16-19, 2001), IEEE, 227-235.
4. Choi, R. and Bettati, R. Efficient Resource Management for Hard Real-Time Communication over Differentiated Services Architectures. In Proceedings of the 7th IEEE International Conference on Real Time Computing Systems and Applications, (Cheju, Korea, December 12-14 2000), IEEE, 119-126.
5. Li, T. and Rekhter, Y. A provider Architecture for differentiated Services and Traffic Engineering (PASTE), IETF RFC 2430, 1998.
6. Urvoy-Keller, G., Hébouterne, G. and Dallery, Y. Traffic Engineering in a Multipoint-to-Point Network, in IEEE Journal on Selected Areas in Communications (JSAC), 20, 4 (May 2002), 834-849.
7. Saito, H., Miyao, Y. and Yoshisda, M. Traffic Engineering using Multiple Multipoint-to-point LSPs. In Proceedings of IEEE Infocom 2000, 2 (March 26-30, 2000), IEEE, 894-902.
8. Bhatnagar, S., Ganguly, S. and Nath, B. Creating Multipointto-Point LSPs for Traffic Engineering. In Proceedings of HPSR 2003, (Torino, Italy, June 24-27 2003), IEEE, 95-100.
9. Lenzini, L., Martorini, L., Mingozzi, E. and Stea, G. A methodology for deriving per-flow end-to-end delay bounds in sink-tree DiffServ domains with FIFO multiplexing. In Proceedings of ISCIS '04, (Antalya, Turkey, October 27-29, 2004), Springer-Verlag LNCS 3280, New York, NY, 2004, 604-614.
10. Lenzini, L., Martorini, L., Mingozzi, E. and Stea, G. Tight end-to-end delay bounds in FIFO multiplexing sink-tree networks. In Elsevier Performance Evaluation, 63, 9-10, (Oct. 2006), 956-987.
11. Le Boudec, J.-Y. and Thiran, P. Network Calculus, SpringerVerlag LNCS 2050, New York, NY, 2001.
12. Chang, C. S. Performance Guarantees in Communication Networks, Springer-Verlag, New York, NY, 2000.
13. Cruz R. L. A calculus for network delay, part i: Network elements in isolation. In IEEE Transactions on Information Theory, 37, 1 (Jan. 1991), 114-131.
14. Cruz R. L. A calculus for network delay, part ii: Network analysis. In IEEE Transactions on Information Theory, 37-1 (Jan. 1991), 132-141.
15. Parekh, K. and Gallager, R. G. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: the Single Node Case. In IEEE/ACM Trans. on Networking, 1, (Jun. 1993), 344-357.
16. Shreedhar, M. and Varghese, G. Efficient Fair Queueing Using Deficit Round Robin. In IEEE/ACM Trans. on Networking, 4, (Jun. 1996), 375-385.
17. Fidler, M. and Sander, V. A Parameter Based Admission Control for Differentiated Services Networks. In Elsevier Computer Networks, 44 (Mar. 2004), 463-479.
18. Charny, A. and Le Boudec, J.-Y. Delay Bounds in a Network with Aggregate Scheduling. In Proceedings of QoFIS'00, (Berlin, Germany, September 25.26, 2000), Springer-Verlag LNCS 1922, London, United Kingdom, 1-13.
19. Lenzini, L., Mingozzi, E. and Stea, G. Delay Bounds for FIFO Aggregates: a Case Study. In Elsevier Computer Communications, 28, 3, (Feb. 2005), 287-299.
20. Lenzini, L., Martorini, L., Mingozzi, E. and Stea, G. Exploiting Network Calculus for Delay-based Admission Control in a Sink-Tree Network. In Proceedings of the Workshop on Performance Evaluation of Complex Systems: Techniques, Methodologies and Tools, (Torino, Italy, September 19, 2005), IEEE, 126-135.
21. Gormen, T. H., Leiserson, C E., Rivest, R. L. and Stein, C Chapter 13: Red-Black Trees. In Introduction to Algorithms Second Edition. MIT Press and McGraw-Hill, 2001, Boston, MA, 273-301.
22. Lenzini, L., Martorini, L., Mingozzi, E. and Stea, G. A scalable CAC Algorithm for Real-Time traffic in Sink-Tree Networks based on Network Calculus, Technical Report, University of Pisa, Pisa, Italy, 2006.