• Login
    View Item 
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UA Campus RepositoryCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    About

    AboutUA Faculty PublicationsUA DissertationsUA Master's ThesesUA Honors ThesesUA PressUA YearbooksUA CatalogsUA Libraries

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Modeling and adaptive resource management in integrated communication networks.

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    azu_td_9005725_sip1_m.pdf
    Size:
    8.034Mb
    Format:
    PDF
    Description:
    azu_td_9005725_sip1_m.pdf
    Download
    Author
    Meempat, Gopalakrishnan.
    Issue Date
    1989
    Keywords
    Integrated services digital networks.
    Telecommunication -- Switching systems.
    Telecommunication -- Traffic.
    Advisor
    Sundareshan, M. K.
    
    Metadata
    Show full item record
    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 focus of this dissertation is the development of resource management schemes for integrated networks, with the major contributions being: (i) the development of an optimal adaptive buffer management scheme for the packet-switched subsystem, (ii) the integration of a moveable-boundary hybrid switching scheme with the time assigned speech interpolation technique for implementing a congestion control mechanism for the packet-switched subsystem, and (iii) the development of an adaptive hierarchical scheme for implementing the access control and routing functions within the circuit-switched subsystem. The problem of buffer management at an integrated network node is formulated as a nonlinear programming problem with a convex objective function and an interative solution technique with fast convergence is proposed for a real-time implementation of the buffer management scheme in practical environments. In order to exercise an additional degree of control over the packet-blocking probability at each hybrid-switched link within the network, a new multiplexing scheme based on the integration of the moveable-boundary hybrid switching scheme and the time assigned speech interpolation technique is presented in this dissertation. The tradeoff between the corresponding decrease in the packet blocking probability and the increase in the circuit freezeout fraction is demonstrated by a detailed queueing analysis of the multiplexer. Specific algorithms are also presented in this dissertation for the solution of the access control and routing problems within the circuit-switched subsystem. In particular, an access control scheme is developed by solving an integer programming problem formulated using the policy of complete partitioning of the available bandwidth among the competing user classes. As an alternative to the completely partitioned approach, the problem of traffic routing is considered in a network that supports homogeneous traffic classes based on the policy of complete sharing. Finally, for the general case of networks with heterogeneous traffic classes, a hierarchical scheme is developed for the implementation of the access control and the routing functions at two functional levels, where the access control is implemented by the network supervisor who solves an appropriate linear integer programming problem periodically, and the routing function is handled by the individual nodes of the network on a distributed basis. (Abstract shortened with permission of author.)
    Type
    text
    Dissertation-Reproduction (electronic)
    Degree Name
    Ph.D.
    Degree Level
    doctoral
    Degree Program
    Electrical and Computer Engineering
    Graduate College
    Degree Grantor
    University of Arizona
    Collections
    Dissertations

    entitlement

     
    The University of Arizona Libraries | 1510 E. University Blvd. | Tucson, AZ 85721-0055
    Tel 520-621-6442 | repository@u.library.arizona.edu
    DSpace software copyright © 2002-2017  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.