The queueing model of a packet switch subject to routing in computer networks
By: Jin-Fu Chang
Contributors: Naval Postgraduate School (U.S.). Dept. of Electrical and Computer Engineering
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1985
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Subjects: SWITCHES; MATHEMATICAL MODELS
Other titles: NPS-62-85-027.
Description: In a previous paper, the steady-state behavior of a finite queue which accepts batch poisson      inputs and received service from servers operating in synchronous mode was studied. An      analysis was successfully completed via the application of the Residue theorem in complex      variables. This document extends the study in that paper to include the effect of routing and      buffer sharing. Upon the arrival of a batch each customer determines its route independently      according to certain probability distribution. Buffer sharing with minimum allocation studied in      another paper is also considered. Results obtained include state probability, blocking      probability, delay, and throughput. Validity of analysis has been verified by computer      simulations. The system considered is a good approximate model of a packet switch in a      computer network. Keywords: Systems analysis; and Computer communication networks.
Notes: Title from cover.

"NPS-62-85-027."

"September 1985."

AD A161 638.

Includes bibliographical references.

aq/aq cc:9116 04/23/98