Asymptotics of the partition function in large closed BCMP networks with bottlenecks

Author

Kogan, Yaakov ; Yakovlev, Andrei

Author_Institution

AT&T Bell Labs., Holmdel, NJ, USA

fYear

1995

fDate

18-20 Jan 1995

Firstpage

89

Lastpage

93

Abstract

We consider a two-chain exponential queueing network with a large number of customers, which consists of one infinite-server (lS) station and two processor-sharing (PS) or FCFS single-server stations. Asymptotic behavior of the partition function is studied for such a network when one or both PS (FCFS) nodes are heavily loaded. The results are derived using methods of multidimensional complex analysis (the theory of homologies and residues) and the saddle-point method

Keywords

network servers; performance evaluation; queueing theory; asymptotic behavior; bottlenecks; homologies; infinite-server station; large closed BCMP networks; multidimensional complex analysis; partition function; residues; saddle-point method; two-chain exponential queueing network; Computer networks; Distributed computing; Intelligent networks; Multidimensional systems; Network servers; Steady-state;

fLanguage

English

Publisher

ieee

Conference_Titel

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1995. MASCOTS '95., Proceedings of the Third International Workshop on

Conference_Location

Durham, NC

Print_ISBN

0-8186-6902-0

Type

conf

DOI

10.1109/MASCOT.1995.378704

Filename

378704