Thesis (M.S.) -- University of Texas at Dallas, 2006 / Includes vita. Includes bibliographical references (leaves 68-71)

Thesis (M.E.)--University of Florida, 2003. / Title from title page of source document. Includes vita. Includes bibliographical references.

Thesis (MScIng)--University of Stellenbosch, 2005. / Bibliography. Also available via the Internet.

published_or_final_version / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002. / Includes bibliographical references (leaves 47-48). Also available in electronic version. Access restricted to campus users.

Thesis (Ph. D.)--University of Hong Kong, 2010. / Includes bibliographical references (leaves 147-156). Also available in print.

No description available.

This thesis has to do with certain fundamental queues that are well established as models for delay in simple packet-switching concentrators and networks. We first revisit the single server queue with Poisson arrivals and general independent service times. We then work out a complete delay analysis for a traffic concentrating tandem network of queues with deterministic service and batch Poisson sources connected to every node; this is the most comprehensive analysis available for a network which is not of Jackson type. We also show how to (partially) extend the analysis to a concentrating tree network, and to an arrival process somewhat more general that batch Poisson. / The two parts of the thesis have a close methodological relationship. Our contribution in both cases is to rederive certain known results, and to produce a variety of new ones, using techniques that are essentially qualitative. Our particular view of the stochastic processes in question is guided by a very special queue discipline, namely Last Come First Served preemptive resume; by identifying certain structural features of the sample paths, one can read, almost without calculation, a host of statistics of common interest. The LCFS preemptive resume discipline also enables us: (i) to strengthen the connection between the single server queue with general independent service times and interarrival times, and the fluctuation theory of random walks; (ii) to strengthen the connection between the queue with Poisson arrivals and branching processes.

Not available / text

published_or_final_version / Computer Science / Master / Master of Philosophy