Persistent Link:
http://hdl.handle.net/10150/186408
Title:
Some traffic shaping procedures for ATM networks.
Author:
Liu, Dan.
Issue Date:
1993
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
The most promising switching technique for B-ISDN (broadband integrated service digital network) is the ATM (asynchronous transfer mode). In an ATM network, all information, data, voice and video, is packetized and divided into fixed length data blocks called cells. The cells from different connections are carried through a multiplexer, and asynchronously transmitted through the network. Statistical multiplexing of cells allows the possible reduction of the bandwidth assigned to each single source. That increased flexibility with respect to the bandwidth requirement provides a chance for better, more economical utilization of the network resources. On the other hand, severe network congestion can occur when a large number of traffic sources become active simultaneously. Since most traffic sources in ATM networks are bursty, some congestion control must be applied to each source in order to maintain the required GOS (grade of service) and provide fairness among the users. We introduce the discrete batch Markovian arrival process, which is a versatile and tractable class of Markov renewal processes. This class of processes provides a very powerful modeling tool. The Palm measure, variance time curve, asymptotic normality of the counts are derived. The interarrival time distribution for the single arrivals case are discussed. We also address some issues related to the simulation of this class of processes. Two traffic shaping, or smoothing schemes are investigated in this dissertation: jumping windows with regular placement and an input rate control model, introduced by Ohta et al. (21). The discrete Markovian arrival process with single arrivals serves as the model for the arrival process. In the first model, analytical expressions for the loss probability, packet delay and the interarrival times for the shaped process in steady state are derived. The second model leads to a highly degenerate partitioned Markov chain of QBD (Quasi-Birth-and-Death) type. Special algorithms involving matrices of lower order are obtained by exploiting the special structure of the Markov chain. Some performance measurements are derived. The algorithmic implementation of these results is also discussed. Finally, we examine some specific examples, applying both the analytical results and simulation, to demonstrate the effectiveness of the two traffic shaping schemes.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Dissertations, Academic.; Industrial engineering.; Operations research.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Systems and Industrial Engineering; Graduate College
Degree Grantor:
University of Arizona
Committee Chair:
Neuts, Marcel

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleSome traffic shaping procedures for ATM networks.en_US
dc.creatorLiu, Dan.en_US
dc.contributor.authorLiu, Dan.en_US
dc.date.issued1993en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThe most promising switching technique for B-ISDN (broadband integrated service digital network) is the ATM (asynchronous transfer mode). In an ATM network, all information, data, voice and video, is packetized and divided into fixed length data blocks called cells. The cells from different connections are carried through a multiplexer, and asynchronously transmitted through the network. Statistical multiplexing of cells allows the possible reduction of the bandwidth assigned to each single source. That increased flexibility with respect to the bandwidth requirement provides a chance for better, more economical utilization of the network resources. On the other hand, severe network congestion can occur when a large number of traffic sources become active simultaneously. Since most traffic sources in ATM networks are bursty, some congestion control must be applied to each source in order to maintain the required GOS (grade of service) and provide fairness among the users. We introduce the discrete batch Markovian arrival process, which is a versatile and tractable class of Markov renewal processes. This class of processes provides a very powerful modeling tool. The Palm measure, variance time curve, asymptotic normality of the counts are derived. The interarrival time distribution for the single arrivals case are discussed. We also address some issues related to the simulation of this class of processes. Two traffic shaping, or smoothing schemes are investigated in this dissertation: jumping windows with regular placement and an input rate control model, introduced by Ohta et al. (21). The discrete Markovian arrival process with single arrivals serves as the model for the arrival process. In the first model, analytical expressions for the loss probability, packet delay and the interarrival times for the shaped process in steady state are derived. The second model leads to a highly degenerate partitioned Markov chain of QBD (Quasi-Birth-and-Death) type. Special algorithms involving matrices of lower order are obtained by exploiting the special structure of the Markov chain. Some performance measurements are derived. The algorithmic implementation of these results is also discussed. Finally, we examine some specific examples, applying both the analytical results and simulation, to demonstrate the effectiveness of the two traffic shaping schemes.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectDissertations, Academic.en_US
dc.subjectIndustrial engineering.en_US
dc.subjectOperations research.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.chairNeuts, Marcelen_US
dc.contributor.committeememberMirchandani, Pituen_US
dc.contributor.committeememberFernandez, Emmanuelen_US
dc.identifier.proquest9408483en_US
dc.identifier.oclc720651370en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.