Multipriority packet switching with hybrid scheduling and queue tail management

Research output: Contribution to journalArticle

Abstract

This paper develops an efficient buffer management scheme that makes generic ATM switches capable of supporting delay-sensitive as well as loss-sensitive traffic. The proposed scheme aims at enhancing the performance of ATM switches by maintaining the head cells of output queues in relatively short dedicated output buffers, while maintaining the long tails of overflowing queues in a shared-memory pool where various memory-space management schemes can be applied. Under this scheme, higher priority (delay-sensitive) cells can be forwarded immediately to the output buffers, where priority-based cell scheduling is exercised. Low-priority (but loss-sensitive) cells are pushed into the shared-memory only if their output buffers are full. If the shared memory is full, then a suitable push-out scheme must be employed to provide fairness. Detailed analysis of the buffer management scheme is provided by decomposing the complex partial sharing buffer analysis into an equivalent queuing problem. Also, extensive simulation is used to elucidate the impact of buffer management policies on the dynamics of interaction among the two traffic classes. The results demonstrate the effectiveness of the proposed scheme in providing each traffic class with the required quality-of-service performance over a wide range of traffic loads and buffer sizes.

Original languageEnglish
Pages (from-to)205-216
Number of pages12
JournalInternational Journal of Parallel and Distributed Systems and Networks
Volume2
Issue number4
Publication statusPublished - 1 Dec 1999
Externally publishedYes

Fingerprint

Packet switching
Scheduling
Data storage equipment
Automatic teller machines
Switches
Telecommunication traffic
Quality of service

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

@article{3d5aa1e11fa143528679742f0ff3562e,
title = "Multipriority packet switching with hybrid scheduling and queue tail management",
abstract = "This paper develops an efficient buffer management scheme that makes generic ATM switches capable of supporting delay-sensitive as well as loss-sensitive traffic. The proposed scheme aims at enhancing the performance of ATM switches by maintaining the head cells of output queues in relatively short dedicated output buffers, while maintaining the long tails of overflowing queues in a shared-memory pool where various memory-space management schemes can be applied. Under this scheme, higher priority (delay-sensitive) cells can be forwarded immediately to the output buffers, where priority-based cell scheduling is exercised. Low-priority (but loss-sensitive) cells are pushed into the shared-memory only if their output buffers are full. If the shared memory is full, then a suitable push-out scheme must be employed to provide fairness. Detailed analysis of the buffer management scheme is provided by decomposing the complex partial sharing buffer analysis into an equivalent queuing problem. Also, extensive simulation is used to elucidate the impact of buffer management policies on the dynamics of interaction among the two traffic classes. The results demonstrate the effectiveness of the proposed scheme in providing each traffic class with the required quality-of-service performance over a wide range of traffic loads and buffer sizes.",
author = "Hussein Alnuweiri and Yue He",
year = "1999",
month = "12",
day = "1",
language = "English",
volume = "2",
pages = "205--216",
journal = "International Journal of Parallel and Distributed Systems and Networks",
issn = "1206-2138",
publisher = "A C T Press",
number = "4",

}

TY - JOUR

T1 - Multipriority packet switching with hybrid scheduling and queue tail management

AU - Alnuweiri, Hussein

AU - He, Yue

PY - 1999/12/1

Y1 - 1999/12/1

N2 - This paper develops an efficient buffer management scheme that makes generic ATM switches capable of supporting delay-sensitive as well as loss-sensitive traffic. The proposed scheme aims at enhancing the performance of ATM switches by maintaining the head cells of output queues in relatively short dedicated output buffers, while maintaining the long tails of overflowing queues in a shared-memory pool where various memory-space management schemes can be applied. Under this scheme, higher priority (delay-sensitive) cells can be forwarded immediately to the output buffers, where priority-based cell scheduling is exercised. Low-priority (but loss-sensitive) cells are pushed into the shared-memory only if their output buffers are full. If the shared memory is full, then a suitable push-out scheme must be employed to provide fairness. Detailed analysis of the buffer management scheme is provided by decomposing the complex partial sharing buffer analysis into an equivalent queuing problem. Also, extensive simulation is used to elucidate the impact of buffer management policies on the dynamics of interaction among the two traffic classes. The results demonstrate the effectiveness of the proposed scheme in providing each traffic class with the required quality-of-service performance over a wide range of traffic loads and buffer sizes.

AB - This paper develops an efficient buffer management scheme that makes generic ATM switches capable of supporting delay-sensitive as well as loss-sensitive traffic. The proposed scheme aims at enhancing the performance of ATM switches by maintaining the head cells of output queues in relatively short dedicated output buffers, while maintaining the long tails of overflowing queues in a shared-memory pool where various memory-space management schemes can be applied. Under this scheme, higher priority (delay-sensitive) cells can be forwarded immediately to the output buffers, where priority-based cell scheduling is exercised. Low-priority (but loss-sensitive) cells are pushed into the shared-memory only if their output buffers are full. If the shared memory is full, then a suitable push-out scheme must be employed to provide fairness. Detailed analysis of the buffer management scheme is provided by decomposing the complex partial sharing buffer analysis into an equivalent queuing problem. Also, extensive simulation is used to elucidate the impact of buffer management policies on the dynamics of interaction among the two traffic classes. The results demonstrate the effectiveness of the proposed scheme in providing each traffic class with the required quality-of-service performance over a wide range of traffic loads and buffer sizes.

UR - http://www.scopus.com/inward/record.url?scp=0033321637&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033321637&partnerID=8YFLogxK

M3 - Article

VL - 2

SP - 205

EP - 216

JO - International Journal of Parallel and Distributed Systems and Networks

JF - International Journal of Parallel and Distributed Systems and Networks

SN - 1206-2138

IS - 4

ER -