ATM traffic management with diversified loss and delay requirements

Authors:
Geping Chen;Ioannis Stavrakakis
Affiliations:
BBN Systems & Technologies, Cambridge, MA;Electrical & Computer Engineering, Northeastern University, Boston, MA
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Year:
1996

Citing 2
Cited 3

Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service

Journal of the ACM (JACM)
Queueing study of a 3-priority policy with distinct service strategies

IEEE/ACM Transactions on Networking (TON)

Delivering diverse delay/dropping QoS requirements in a TDMA environment

MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Delivering QoS requirements to traffic with diverse delay tolerances in a TDMA environment

IEEE/ACM Transactions on Networking (TON)
Dynamic resource-allocation for congestion-control in high-speed LAN Interconnection

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most challenging problems in ATM network design is providing diversified Quality of Service (QoS) to applications with distinct characteristics. A flexible priority service policy for two applications (classes) with strict - and in general distinct - deadlines and different deadline violation rates (loss rates) is studied in this paper. The proposed policy is a generalization of the Shortest Time to Extinction (STE) policy (or the Early-Due-Date policy which discards expired cells). The relationship of this policy to other standard ones is also discussed. Performance measures such as cell loss, mean cell-delay and the tail of the cell-delay probability distribution are derived for each class. Numerical results illustrate the effectiveness of the studied priority scheme. Finally, a low-complexity implementation scheme is proposed, which does not require time-stamp-based sorting.