ASYMPTOTIC EXPANSIONS FOR A CLOSED MULTIPLE ACCESS SYSTEM.

C. Knessl; B. J. Matkowsky; Z. Schuss; C. Tier

doi:10.1137/0216028

ASYMPTOTIC EXPANSIONS FOR A CLOSED MULTIPLE ACCESS SYSTEM.

C. Knessl^*, B. J. Matkowsky, Z. Schuss, C. Tier

^*Corresponding author for this work

Northwestern University

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

A closed multiple-access system composed of M sources and a single service facility is analyzed. The closed network is modeled as a finite source M/G/1 queueing system. We consider systems with a large number of sources (i. e. M greater than 1) and we assume that the mean time required to process an individual request is short (O(1/M)). We then construct asymptotic approximations to the stationary distribution of the number of requests in the service facility by using the method of matched asymptotic expansions. We give formulas for the first and second moments of the number of requests, for all traffic intensities.

Original language	English
Pages (from-to)	378-398
Number of pages	21
Journal	SIAM Journal on Computing
Volume	16
Issue number	2
DOIs	https://doi.org/10.1137/0216028
State	Published - 1987
Externally published	Yes

Access to Document

10.1137/0216028

Cite this

@article{0c8a85f26cfe4c2dbf59eea74edc6250,

title = "ASYMPTOTIC EXPANSIONS FOR A CLOSED MULTIPLE ACCESS SYSTEM.",

abstract = "A closed multiple-access system composed of M sources and a single service facility is analyzed. The closed network is modeled as a finite source M/G/1 queueing system. We consider systems with a large number of sources (i. e. M greater than 1) and we assume that the mean time required to process an individual request is short (O(1/M)). We then construct asymptotic approximations to the stationary distribution of the number of requests in the service facility by using the method of matched asymptotic expansions. We give formulas for the first and second moments of the number of requests, for all traffic intensities.",

author = "C. Knessl and Matkowsky, {B. J.} and Z. Schuss and C. Tier",

year = "1987",

doi = "10.1137/0216028",

language = "אנגלית",

volume = "16",

pages = "378--398",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "2",

}

TY - JOUR

T1 - ASYMPTOTIC EXPANSIONS FOR A CLOSED MULTIPLE ACCESS SYSTEM.

AU - Knessl, C.

AU - Matkowsky, B. J.

AU - Schuss, Z.

AU - Tier, C.

PY - 1987

Y1 - 1987

N2 - A closed multiple-access system composed of M sources and a single service facility is analyzed. The closed network is modeled as a finite source M/G/1 queueing system. We consider systems with a large number of sources (i. e. M greater than 1) and we assume that the mean time required to process an individual request is short (O(1/M)). We then construct asymptotic approximations to the stationary distribution of the number of requests in the service facility by using the method of matched asymptotic expansions. We give formulas for the first and second moments of the number of requests, for all traffic intensities.

AB - A closed multiple-access system composed of M sources and a single service facility is analyzed. The closed network is modeled as a finite source M/G/1 queueing system. We consider systems with a large number of sources (i. e. M greater than 1) and we assume that the mean time required to process an individual request is short (O(1/M)). We then construct asymptotic approximations to the stationary distribution of the number of requests in the service facility by using the method of matched asymptotic expansions. We give formulas for the first and second moments of the number of requests, for all traffic intensities.

UR - http://www.scopus.com/inward/record.url?scp=0023328259&partnerID=8YFLogxK

U2 - 10.1137/0216028

DO - 10.1137/0216028

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0023328259

SN - 0097-5397

VL - 16

SP - 378

EP - 398

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

ASYMPTOTIC EXPANSIONS FOR A CLOSED MULTIPLE ACCESS SYSTEM.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this