Name
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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/MASCOT.1995.378704 | MASCOTS |
Keywords | Field | DocType |
two-chain exponential,large closed bcmp networks,partition function,fcfs single-server station,large number,saddle-point method,asymptotic behavior,multidimensional complex analysis,homologies,computer networks,queueing theory,intelligent networks,steady state,distributed computing,multidimensional systems | Saddle,Exponential function,Computer science,Partition function (statistical mechanics),Queueing theory,Intelligent Network,Steady state,Asymptotic analysis,Multidimensional systems,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-6902-0 | 0 | 0.34 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yaakov Kogan | 1 | 118 | 21.46 |
| Andrei Yakovlev | 2 | 206 | 15.42 |