Thesis--PlanB (M.S.)--University of Wisconsin--Stout, 1998. / Field project. Includes bibliographical references.

139 leaves : ill., graphs ; 26 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Applied Mathematics, 1975

Thesis (Ph.D.)-- University of Adelaide, Dept. of Electrical Engineering, 1980.

Thesis (Ph.D.) -- University of Adelaide, Department of Applied Mathematics, 1975.

Thesis (Ph.D.)-- University of Adelaide, School of Economics, 1998. / Corrections pasted onto front end paper. Bibliography: leaves 213-224.

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

Thesis (M.A.)--West Virginia University, 1999. / Title from document title page. Document formatted into pages; contains vii, 85 p. : ill. (some col.) Vita. Includes abstract. Includes bibliographical references (p. 74-81).

Thesis (M.A.)--Indiana University, 2007. / Title from screen (viewed on June 27, 2007) Department of Communication Studies, Indiana University-Purdue University Indianapolis (IUPUI) Includes vita. Includes bibliographical references (leaves 160-167)

This thesis reports on an investigation into the teletraffic modelling and performance of layered cellular networks that use overflow for new call and handover attempts in order to improve system performance It addresses the important problems how to model and analyse overflow in large cellular networks so that the overall impact across the network can be evaluated, the overflow policies that can be used with new calls and handovers to improve network performance and how these policies perform under a range of conditions. The general problem of modelling overflow in cellular networks is considered at length and from this it is concluded that the use of overflow in existing schemes such as directed retry, reuse partitioning and overlaid cells can also be described by the simple concepts of intra and inter layer overflow Using these concepts the author formulates the problem of overflow in layered networks as a subset of the general problem of overflow with multiple overflow routes and restricted overflow. This leads to the derivation of the mean and variance of the overflow traffic from a cell with multiple handover routes and restricted handover from the two-dimensional birth death model of the system. These expressions for the mean and variance are used in conjunction with the Equivalent Random Theory and splitting formulae in the development of the Splitting Formula Method or SF Method. The accuracy of three splitting formulae and a simple Poisson approximation are investigated and compared with simulation. From this we conclude that the splitting formulae of Akimaru and Takahashi and Wallstrom provide the best overall result. This method is used to solve the general problem of multiple user classes for an example two layer network. This leads to conclusions on the complex relationship between cell capacity, the proportion of uses that can access the microcells and the proportion of users that can overflow from the microcell to the macrocell. The Modified Splitting Formula Method is an extension of the SF Method that includes handovers and overflow for handovers. A user perceived measure of the effect of new call and handover blocking described by the probability of call failure augments the Modified SF method. This is then used to analyse five new call overflow policies for a three layer network under conditions of extended handover, restrictions on handover for calls in cells at the edge of layers and spatial offset between the peak of the traffic demand and the cell layout. The results give new and valuable insight into the behaviour of layered cellular networks with overflow and the trade-offs in performance that exist when designing and operating these networks.

Not available / text