IEEE/ACM Transactions on Networking (TON)
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks
IEEE/ACM Transactions on Networking (TON)
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Universal stability results for greedy contention-resolution protocols
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Multidomain End to End IP QoS and SLA
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Extending the Network Calculus Pay Bursts Only Once Principle to Aggregate Scheduling
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
DSS: A Deterministic and Scalable QoS Provisioning Scheme
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Performance Evaluation of Integrated Services in Local Area Networks
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Feasibility of Supporting Real-Time Traffic in DiffServ Architecture
WWIC '07 Proceedings of the 5th international conference on Wired/Wireless Internet Communications
Bounds on stability and latency in wireless communication
IEEE Communications Letters
Flow aggregation using dynamic packet state
EUNICE'10 Proceedings of the 16th EUNICE/IFIP WG 6.6 conference on Networked services and applications: engineering, control and management
Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
FIFO Service with Differentiated Queueing
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Scalable quantitative delay guarantee support in diffserv networks through NSIS
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Performance of a software router using AltQ/CBQ – a measurement-based analysis
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Impact of burst control packet congestion on burst loss rate in optical burst switched networks
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
Searching for tight performance bounds in feed-forward networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
SLA-based QoS pricing in DiffServ networks
Computer Communications
| Hi-index | 0.00 |
A large number of products implementing aggregate buffering and scheduling mechanisms have been developed and deployed, and still more are under development. With the rapid increase in the demand for reliable end-to-end QoS solutions, it becomes increasingly important to understand the implications of aggregate scheduling on the resulting QoS capabilities. This paper studies the bounds on the worst case delay in a network implementing aggregate scheduling. We derive an upper bound on the queuing delay as a function of priority traffic utilization and the maximum hop count of any flow, and the shaping parameters at the network ingress. Our bound explodes at a certain utilization level which is a function of the hop count. We show that for a general network configuration and larger utilization utilization an upper bound on delay, if it exists, must be a function of the number of nodes and/or the number of flows in the network.