Title

Approximate Analysis Of Coupled Queueing In Atm Networks

Abstract

We discuss a scheduling discipline for multiclass traffic in asynchronous transfer mode network nodes. The scheduler provides minimum bandwidth guarantees for each class of traffic and is well suited for high-speed implementation. The scheme is a modification of static head-of-line priority queueing, and was originally presented in a slightly different form by Huang and Wu. We begin by considering a system with two queues which is analyzed by decoupling the system into separate M/G/1 queues. The analysis provides a very good estimate for the mean response time of customers in each queue. We also demonstrate the applicability of the analysis to a system with n≥2 queue.

Publication Date

2-1-1999

Publication Title

IEEE Communications Letters

Volume

3

Issue

2

Number of Pages

31-33

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/4234.749353

Socpus ID

0033361435 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0033361435

This document is currently not available here.

Share

COinS