DocumentCode
1671392
Title
Approximate analysis of discrete-time tandem queueing networks with customer loss
Author
Park, Dooyeong ; Perros, Harry G.
Author_Institution
Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA
fYear
1992
Firstpage
1503
Abstract
The departure process of an IBP/Geo/1/K queue by an interrupted Bernoulli process (IBP) is approximated. Several different approximation models are considered, and their accuracy is examined through extensive validation tests. These models are used in a simple decomposition algorithm to analyze a tandem configuration of finite capacity queues with customer loss. Validation tests show that the decomposition algorithm has good accuracy
Keywords
approximation theory; queueing theory; telecommunication networks; IBP/Geo/1/K queue; approximation models; customer loss; decomposition algorithm; discrete-time tandem queueing networks; finite capacity queues; interrupted Bernoulli process; tandem configuration; validation tests; Algorithm design and analysis; Asynchronous transfer mode; Computer science; Moment methods; Network servers; Propagation losses; Queueing analysis; Solid modeling; Switches; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1992. Conference Record., GLOBECOM '92. Communication for Global Users., IEEE
Conference_Location
Orlando, FL
Print_ISBN
0-7803-0608-2
Type
conf
DOI
10.1109/GLOCOM.1992.276640
Filename
276640
Link To Document