VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE/ACM Transactions on Networking (TON)
Delay guarantee of virtual clock server
IEEE/ACM Transactions on Networking (TON)
An upper bound on delay for the VirtualClock service discipline
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Multiaccess, mobility and teletraffic for wireless communications
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
A service-curve approach to performance guarantees in integrated-service networks
A service-curve approach to performance guarantees in integrated-service networks
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
Efficient call admission control for heterogeneous services in wireless mobile ATM networks
IEEE Communications Magazine
Guaranteed quality-of-service wireless access to ATM networks
IEEE Journal on Selected Areas in Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
A self-extracting accurate modeling for bounded-delay video services
Computer Communications
Hi-index | 0.00 |
In this paper, we consider the problem of providing delay guarantees in a distributed environment, e.g., a wireless network or a cable network. In a distributed environment, the information of the arrival process is, in general, not available to the network. Due to the lack of such information, traffic regulators and scheduling policies discussed in the literature cannot be directly applied. To cope with the problem, we propose a distributed traffic regulator (DTR) that uses the information of the departure process. Based on such DTRs, we propose the distributed earliest deadline first (DEDF) scheduling policy. For the DEDF scheme, we derive an admission-control criterion and show that the maximum delay can be guaranteed if the criterion is satisfied.