A delay and loss versatile scheduling discipline in ATM switches
نویسندگان
چکیده
منابع مشابه
A Delay and Loss Versatile Scheduling Discipline in ATM Switches
In this paper, we propose a versatile scheduling discipline, called Precedence with Partial Push–out (PPP), in Asynchronous Transfer Mode (ATM) switches supporting two delay and two loss priorities. By employing a threshold L, PPP provides delay guarantee by allowing a newly–arriving highdelay–priority cell to precede a maximum of L low-delay– priority cells. Through the use of another threshol...
متن کاملFrame Delay Through ATM Switches: MIMO Latency
This paper addresses the problem of measuring frame latency in ATM switches. The frames consisting of several ATM cells may arrive with numerous gaps between cells. It is important that the gaps present in the input stream be not counted towards the switch's contribution to the frame delay. The proposed solution called "MIMO" (Message-In Message-Out) latency improves upon FILO (First-In Last-Ou...
متن کاملCell Delay Modeling and Comparison of 2 Iterative Scheduling Algorithms for Atm Input - Queued Switches
A mathematical cell delay modeling and performance comparison of two iterative scheduling algorithms for ATM input-queued switch are carried out in this paper. The algorithms under consideration are iterative round robin with multiple classes (IRRM-MC) and iterative round robin with slip (iSLIP). By using Bernoulli arrivals a mathematical model is proposed for both algorithms. The developed mod...
متن کاملDesign and Evaluation of Cell Scheduling Algorithms for Atm Switches
An ATM switch is a high speed xed-size packet switching architecture; it is a basic element for the ATM protocol which has been widely accepted as the ultimate solution for the BISDN. In this paper, we rst successfully transform the cell scheduling problem of a window-based input queueing ATM switch to the maximum matching problem on a bipartite graph. An optimal solution can thus be found in O...
متن کاملAn Efficient Scheduling Algorithm for Input-queuing ATM Switches
In this paper, we propose and evaluate a three-phase scheduling algorithm for input-queuing ATMswitches, and we term it WRRLA algorithm. The WRRLA algorithm is an improvement over the conventional Weighted Round Robin (w . ) algorithm by simply combining it together with the Look Ahead (LA) technique. In a WRRLA scheduling operation, the WRR algorithm is first applied to schedule the timesensit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1998
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(98)00008-x