Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Traffic scheduling in packet-switched networks: analysis, design, and implementation
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
RSVP and integrated services in the Internet: a tutorial
IEEE Communications Magazine
Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Feasibility of Supporting Real-Time Traffic in DiffServ Architecture
WWIC '07 Proceedings of the 5th international conference on Wired/Wireless Internet Communications
Delay bounds in tree networks with DiffServ architecture
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
| Hi-index | 0.00 |
We investigate the effect of flow aggregation on the end-to-end delay in large scale networks. We show that networks with Differentiated services (DiffServ) architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, which are queued and scheduled with a strict priority, but without preemption. We then analyze the network with arbitrary flow aggregation and deaggregation, and again derive an upper bound on the end-to-end delay. Throughout the paper we use Latency-Rate (${\mathcal{LR}}$) server model, and prove that FIFO, Strict Priority, and other rate-guaranteeing servers with aggregated flows are all ${\mathcal{LR}}$ servers to individual flows in certain conditions. We show that the delay bound of a flow that experiences aggregation and deaggregation, including the flows in DiffServ, depends on, among others, the burst sizes of the other flows within the aggregated flow and the number of the aggregations and the deaggregations.