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
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
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
Flow Oriented Approaches to QoS Assurance
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Since Integrated Services architecture is not scalable, it seems the only solutions for Quality of Service (QoS) architecture in the Internet are Differentiated Services (DiffServ) or its variations. It is generally understood that networks with DiffServ architectures can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized networks. We show that, in networks without loops, the delay bounds for highest priority packets exist regardless of the level of network utilization with DiffServ architecture. 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 the analysis of these delay bounds in realistic situations, DiffServ architecture is able to support real time applications even in large networks. Considering that loop-free 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. Throughout the paper we use Latency-Rate ($\mathcal{LR}$) server model, with which it has been proved that FIFO and Strict Priority schedulers are $\mathcal{LR}$ servers to each flowsin certain conditions.