Show simple item record

dc.contributor.advisorSanders, William H.en_US
dc.contributor.authorKant, Latha Arun
dc.creatorKant, Latha Arunen_US
dc.date.accessioned2013-04-18T09:36:15Z
dc.date.available2013-04-18T09:36:15Z
dc.date.issued1996en_US
dc.identifier.urihttp://hdl.handle.net/10150/282222
dc.description.abstractThe success of the emerging ATM networks depends both on switch performance at the cell level and routing strategies at the call level. In this dissertation, we address both issues. At the cell level, we propose a measure that captures cell loss behavior and analyze ATM switch performance by computing the distribution of consecutive cell losses. The extremely low loss probability requirements of an ATM switch preclude the use of simulation, calling for the use of analytic and numerical methods. The latter methods involve the construction and solution of the underlying stochastic processes associated with the switch and workload. Since the detailed stochastic process representations of the above are on the order of tens to hundreds of thousands of states, we use a tool called UltraSAN, which allows for the automatic construction and solution of these detailed stochastic processes. We also compute the distribution of the queue length rather than just the average queue length. At the call level, we propose two restoration schemes and a method to analyze their performance in the case of failures in ATM transport networks. The proposed restoration strategies utilize the existing portions of the network after a link or switch failure rather than relying on redundancy while restoring the affected calls. We also propose an efficient routing scheme for multi-class traffic with widely differing call characteristics. We develop as approach based on Markov decision theory and propose an adaptive band-width protection strategy to prevent any specific application type from monopolizing the link resources.
dc.language.isoen_USen_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.subjectEngineering, Electronics and Electrical.en_US
dc.titleAnalysis of cell-loss processes and restoration schemes in ATM networksen_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.identifier.proquest9720604en_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineElectrical and Computer Engineeringen_US
thesis.degree.namePh.D.en_US
dc.identifier.bibrecord.b34537004en_US
refterms.dateFOA2018-09-05T15:57:14Z
html.description.abstractThe success of the emerging ATM networks depends both on switch performance at the cell level and routing strategies at the call level. In this dissertation, we address both issues. At the cell level, we propose a measure that captures cell loss behavior and analyze ATM switch performance by computing the distribution of consecutive cell losses. The extremely low loss probability requirements of an ATM switch preclude the use of simulation, calling for the use of analytic and numerical methods. The latter methods involve the construction and solution of the underlying stochastic processes associated with the switch and workload. Since the detailed stochastic process representations of the above are on the order of tens to hundreds of thousands of states, we use a tool called UltraSAN, which allows for the automatic construction and solution of these detailed stochastic processes. We also compute the distribution of the queue length rather than just the average queue length. At the call level, we propose two restoration schemes and a method to analyze their performance in the case of failures in ATM transport networks. The proposed restoration strategies utilize the existing portions of the network after a link or switch failure rather than relying on redundancy while restoring the affected calls. We also propose an efficient routing scheme for multi-class traffic with widely differing call characteristics. We develop as approach based on Markov decision theory and propose an adaptive band-width protection strategy to prevent any specific application type from monopolizing the link resources.


Files in this item

Thumbnail
Name:
azu_td_9720604_sip1_m.pdf
Size:
4.232Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record