On asymptotic accuracy in queueing theory

Ronald G. Addie; Timothy D. Neame; Moshe Zukerman

On asymptotic accuracy in queueing theory

Ronald G. Addie, Timothy D. Neame, Moshe Zukerman

Research output: Conference Papers › RGC 32 - Refereed conference paper (without host publication) › peer-review

Abstract

Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from a certain threshold onwards, and the magnitude of this threshold may be very large. We also show that any hyperbolic upper and lower bounds for a tail of the stationary waiting time complementary distribution necessarily become further apart as the rate of the process increases.

Original language	English
Publication status	Published - Dec 2003
Externally published	Yes
Event	2003 Australian Telecommunications, Networks and Applications Conference - Melbourne, Australia Duration: 8 Dec 2003 → 10 Dec 2003

Conference

Conference	2003 Australian Telecommunications, Networks and Applications Conference
Abbreviated title	ATNAC
Place	Australia
City	Melbourne
Period	8/12/03 → 10/12/03

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@conference{cd0dbf92e3e2457589186bd27b6f550f,

title = "On asymptotic accuracy in queueing theory",

abstract = "Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from a certain threshold onwards, and the magnitude of this threshold may be very large. We also show that any hyperbolic upper and lower bounds for a tail of the stationary waiting time complementary distribution necessarily become further apart as the rate of the process increases.",

author = "Addie, {Ronald G.} and Neame, {Timothy D.} and Moshe Zukerman",

year = "2003",

month = dec,

language = "English",

note = "2003 Australian Telecommunications, Networks and Applications Conference, ATNAC ; Conference date: 08-12-2003 Through 10-12-2003",

}

TY - CONF

T1 - On asymptotic accuracy in queueing theory

AU - Addie, Ronald G.

AU - Neame, Timothy D.

AU - Zukerman, Moshe

PY - 2003/12

Y1 - 2003/12

N2 - Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from a certain threshold onwards, and the magnitude of this threshold may be very large. We also show that any hyperbolic upper and lower bounds for a tail of the stationary waiting time complementary distribution necessarily become further apart as the rate of the process increases.

AB - Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from a certain threshold onwards, and the magnitude of this threshold may be very large. We also show that any hyperbolic upper and lower bounds for a tail of the stationary waiting time complementary distribution necessarily become further apart as the rate of the process increases.

M3 - RGC 32 - Refereed conference paper (without host publication)

T2 - 2003 Australian Telecommunications, Networks and Applications Conference

Y2 - 8 December 2003 through 10 December 2003

ER -

On asymptotic accuracy in queueing theory

Abstract

Conference

Other Access Options

Permanent Link

Fingerprint

Cite this