VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE/ACM Transactions on Networking (TON)
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Delay guarantee of virtual clock server
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
SRP: a Scalable Resource Reservation Protocol for the Internet
Workshop on Wide Area Networks and High Performance Computing
An In-Depth Look at Flow Aggregation for Efficient Quality of Service
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
Stabilization of Max-Min Fair Networks without Per-flow State
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Intra-flow fairness in work-conserving flow aggregation
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Stabilization of max-min fair networks without per-flow state
Theoretical Computer Science
Hi-index | 0.25 |
Several state-less scheduling protocols have been proposed in the literature that achieve the same level of quality of service as state-full protocols. Thus, the scheduling accuracy of state-full protocols is combined with the scalability of state-less protocols. However, these new protocols treat each flow as an independent unit. In this paper, we present a state-less scheduling protocol that aggregates flows together in order to increase the number of flows that can be accepted into the network without violating their delay requirements. In addition, we present a state-less signaling protocol that may be used in combination with our state-less scheduling protocol. Contrary to sampling techniques, our signaling protocol is accurate yet requires only a constant amount of state at each node. Finally, our protocols can be used across multiple core networks.