The queueing model of a packet switch subject to routing in computer networks
MetadataShow full item record
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
NPS Report NumberNPS-62-85-027
Showing items related by title, author, creator and subject.
Le, F.; Zhang, H.; Xie, Geoffrey (2011-12);Route Aggregation (RA), the method to supersede a set of routes by a single, more general route, is a fundamental mechanism to the Internet scalability. Yet, despite its importance, it is poorly understood. We present the ...
McManus, Stephen C. (Monterey, California. Naval Postgraduate School, 2007-09);Static analysis refers to techniques that extract and check the semantics of a program entirely from examining its source code. In this case, router configuration files can be thought of as the source code of a distributed ...
Sun, X.; S. Rao; Xie, Geoffrey (2012-12);Enterprise networks often have complex routing designs given the need to meet a wide set of resiliency, security and routing policies. In this paper, we take the position that minimizing design complexity must be an explicit ...