Performance analysis of integrated broadband packet switching.
Item
-
Title
-
Performance analysis of integrated broadband packet switching.
-
Identifier
-
AAI9119655
-
identifier
-
9119655
-
Creator
-
Mathew, Johny.
-
Contributor
-
Adviser: Tarek N. Saadawi
-
Date
-
1991
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Engineering, Electronics and Electrical
-
Abstract
-
Two broadband packet switches have been proposed and analyzed. A packet switch based on the idea of assignment on demand has been proposed and analyzed in Part I. The switch model assumes that switch connection can be reconfigured by a control unit according to a switching schedule. The switching schedule may either be provided by an algorithm which will optimize performance or can be a sequence of fixed switching configurations. In both cases, queueing analysis has been carried out. In the analysis, we have assumed that buffer capacity is limited and that the transmission period (frame length) is variable. The analysis is based on a discrete time Markov chain from which state probabilities of the transmission period have been derived. Also, buffer overflow probabilities have been obtained. Delay versus traffic characteristics with different buffer sizes have been presented and compared for each of the above cases. The main advantage of this switch model in comparison with other architecture is that in our model the switch connections are software driven and thus can optimize one parameter or another of switch performance.;In Part II an N x N nonblocking time multiplex switch handling both circuit switched and packet switched traffic is proposed and analyzed. We consider a system in which the incoming circuit traffic that can not be routed within a frame size is blocked and the incoming packet traffic which can not be served immediately is queued at the end of the existing input queue. Circuit switched traffic performance of the proposed switch is analyzed in terms of call blocking probability. Packet switched traffic performance is analyzed in terms of mean packet delay. A two dimensional Markov chain is used to model the system. It has been shown, through a special case, that the mean packet queueing delay can be reduced considerably by using movable boundary strategy as compared to fixed boundary strategy. A comparison between the performance of integrated switching strategy and circuit switching strategy has also been provided. It is shown that the circuit blocking probability has improved when integrated with packet traffic.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
