• Login
    View Item 
    •   Treasures Home
    • Electronic Theses and Dissertations
    • UTD Theses and Dissertations
    • View Item
    •   Treasures Home
    • Electronic Theses and Dissertations
    • UTD Theses and Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Traffic and Topology Engineering in Networks: Algorithms, Models and Optimization

    Thumbnail
    View/Open
    ETD-5608-7474.09.pdf (2.802Mb)
    Date
    2017-05
    Author
    Askarian, Ahmad
    Metadata
    Show full item record
    Abstract
    Abstract
    Traffic engineering (TE) helps to use network resources more efficiently. Network operators use TE to obtain different objectives such as load balancing, congestion avoidance and average delay reduction. We approach the issue using optimization theory and a network design game model. Also routing methods for optimal distribution of traffic in data networks that can also provide quality of service (QoS) for users is one of the challenges in recent years’ research on next generation networks. The major QoS requirement in most cases is an upper bound on end-to-end path delay. In this dissertation, we address the problem of parallelizing some network algorithms on a practical distributed memory system. Also we use approximation approach for analyzing NP hard problems in networks.
    URI
    http://hdl.handle.net/10735.1/5445
    Collections
    • UTD Theses and Dissertations

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of TreasuresCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV