The queueing model of a packet switch subject to routing in computer networks - Info and Reading Options

The Open Library:

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.

Search for “The queueing model of a packet switch subject to routing in computer networks” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "The queueing model of a packet switch subject to routing in computer networks" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

• Is Online Borrowing Available: Yes
• Preview Status: full
• Check if available: The Open Library & The Internet Archive

Find “The queueing model of a packet switch subject to routing in computer networks” in Libraries Near You:

Read or borrow “The queueing model of a packet switch subject to routing in computer networks” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “The queueing model of a packet switch subject to routing in computer networks” at a library near you.