Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE/ACM Transactions on Networking (TON)
The uniprocessor scheduling of sporadic real-time tasks
The uniprocessor scheduling of sporadic real-time tasks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
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
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
A network architecture for providing per-flow delay guarantees with scalable core
Journal of High Speed Networks
Rd network services: differentiation through performance incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Hi-index | 0.00 |
A general model for trafic flows on packet-switched, virtual-circuit based, fixed-packet networks is intro- duced, and an exact schedulability test is obtained for systems of such flows. Rules are derived that make the evaluation of this schedulability test feasible and eficient under certain circumstances. The practical relevance of this approach is demonstrated by applying it to a number of standard trafic models.