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
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
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)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services
IEEE/ACM Transactions on Networking (TON)
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Fundamental Trade-offs in Aggregate Packet Scheduling
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Packet scheduling algorithms for integrated services networks
Packet scheduling algorithms for integrated services networks
Packet scale rate guarantee for non-FIFO nodes
IEEE/ACM Transactions on Networking (TON)
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
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
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
IEEE Journal on Selected Areas in Communications
A basic stochastic network calculus
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Essay on teletraffic models (I)
ACACOS'10 Proceedings of the 9th WSEAS international conference on Applied computer and applied computational science
FGN based telecommunication traffic models
WSEAS Transactions on Computers
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 a PSRG server. Another is the provision of per-domain PSRG. Specifically, for the former, an open issue is whether hierarchical schedulers can provide PSRG; for the latter, it is not clear whether and how per-domain PSRG can be provided in the presence of flow aggregation. Since, in DiffServ networks, flow aggregation is a natural phenomenon and hierarchical scheduling is high-likely desired, these two challenges become even more critical. 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 per-domain behavior (EF PDB).