IEEE/ACM Transactions on Networking (TON)
Performance bounds in communication networks with variable-rate links
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Determining end-to-end delay bounds in heterogeneous networks
Multimedia Systems - Special issue on the fifth workshop on network and operating system support for digital audio and video 1995 (NOSSDAV)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Delay jitter bounds and packet scale rate guarantee for expedited forwarding
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
Analysis on Generalized Stochastically Bounded Bursty Traffic for Communication Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Relationship between guaranteed rate server and latency rate server
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay bound and packet scale rate guarantee for some expedited forwarding networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An addressing independent networking structure favorable for all-optical packet switching
ACM SIGCOMM Computer Communication Review
End-to-end QoS guarantees for a network based on Latency-Rate Max-Min service curve
Computer Communications
Delay bound and packet scale rate guarantee for some expedited forwarding networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The Expedited Forwarding Per-hop Behavior (EF PHB) was recently replaced by a new definition, called Packet Scale Rate Guarantee (PSRG), under the Differentiated Services (DiffServ) framework. This replacement raises two challenges. One is the implementation of PSRG server. Another is the provision of per-domain PSRG. To address the first challenge, we introduce a new concept called Latency-Rate Worst-case Service Guarantee (LR-WSG). We prove that if a server provides LR-WSG, it also provides PSRG. We show that many well-known schedulers support LR-WSG, which include not only one-level schedulers but also their hierarchical versions. To address the second challenge, we first prove that PSRG can be extended from per-node to per-domain if no flow aggregation is performed. The proof is notable in that it depends solely on the concept of PSRG itself. We then investigate the provision of per-domain PSRG in presence of flow aggregation. We propose to use Packet Scale Fair Aggregator (PSFA) to aggregate flows. We show that with PSFA, per-domain PSRG can be provided in spite of flow aggregation. We finally provide a brief discuss on the viability of using PSFA in DiffServ networks and define an Expedited Forwarding Perdomain Behavior (EF PDB).