z-logo
open-access-imgOpen Access
Asymptotic expansions for large closed and loss queueing networks
Author(s) -
Yaakov Kogan
Publication year - 2002
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1080/10241230306726
Subject(s) - queueing theory , saddle point , partition function (quantum field theory) , saddle , computer science , layered queueing network , partition (number theory) , normalization (sociology) , mathematical optimization , mathematics , computer network , physics , geometry , quantum mechanics , combinatorics , sociology , anthropology
Loss and closed queueing network models have long been of interest to telephone and computer engineers and becoming increasingly important as models of data transmission networks. This paper describes a uniform approach that has been developed during the last decade for asymptotic analysis of large capacity networks with product form of the stationary probability distribution. Such a distribution has an explicit form up to the normalization constant, or the partition function. The approach is based on representing the partition function as a contour integral in complex space and evaluating the integral using the saddle point method and theory of residues. This paper provides an introduction to the area and a review of recent work

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom