IEEE/ACM Transactions on Networking (TON)
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)
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Delay bounds for a network of guaranteed rate servers with FIFO aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling and Simulation of Traffic Aggregation Based SIP over MPLS Network Architecture
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Effect of flow aggregation on the maximum end-to-end delay
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
RSVP and integrated services in the Internet: a tutorial
IEEE Communications Magazine
| Hi-index | 0.00 |
We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It has been generally believed that networks with DiffServ architectures can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks with DiffServ architecture and obtain a closed formula for delay bounds for such networks. We further show that, in tree networks with DiffServ architecture, the delay bounds for highest priority packets exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. We argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large tree network. Considering that tree networks, especially the Ethernet networks, are being adopted more than ever for access networks and for provider networks as well, this conclusion is quite encouraging for real-time applications. Throughout the paper we use Latency-Rate (LR) server model, with which it has been proved that First In First Out (FIFO) and Strict Priority schedulers are LR servers to each flows in certain conditions.