Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks
Journal of VLSI Signal Processing Systems
Relationship between guaranteed rate server and latency rate server
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 35th conference on Winter simulation: driving innovation
Schedulability criterion and performance analysis of coordinated schedulers
IEEE/ACM Transactions on Networking (TON)
Per-domain packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
Theoretical Computer Science
Providing deterministic end-to-end fairness guarantees in core-stateless networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
A novel core stateless virtual clock scheduling algorithm
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.07 |
We propose and develop a novel virtual time reference system as a unifying scheduling framework to provide scalable support for guaranteed services. This virtual time reference system is designed as a conceptual framework upon which guaranteed services can be implemented in a scalable manner using the DiffServ paradigm. The key construct in the proposed virtual time reference system is the notion of packet virtual time stamps, whose computation is core stateless, i.e., no per-flow states are required for its computation. We lay the theoretical foundation for the definition and construction of packet virtual time stamps. We describe how per-hop behavior of a core router (or rather its scheduling mechanism) can be characterized via packet virtual time stamps, and based on this characterization establish end-to-end per-flow delay bounds. Consequently, we demonstrate that, in terms of its ability to support guaranteed services, the proposed virtual time reference system has the same expressive power and generality as the IntServ model. Furthermore, we show that the notion of packet virtual time stamps leads to the design of new core stateless scheduling algorithms, especially work-conserving ones. In addition, our framework does not exclude the use of existing scheduling algorithms such as stateful fair queuing algorithms to support guaranteed services