BRADFORD SCHOLARS

    • Sign in
    View Item 
    •   Bradford Scholars
    • University of Bradford eTheses
    • Theses
    • View Item
    •   Bradford Scholars
    • University of Bradford eTheses
    • Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Bradford ScholarsCommunitiesAuthorsTitlesSubjectsPublication DateThis CollectionAuthorsTitlesSubjectsPublication Date

    My Account

    Sign in

    HELP

    Bradford Scholars FAQsCopyright Fact SheetPolicies Fact SheetDeposit Terms and ConditionsDigital Preservation Policy

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Localized Quality of Service Routing Algorithms for Communication Networks. The Development and Performance Evaluation of Some New Localized Approaches to Providing Quality of Service Routing in Flat and Hierarchical Topologies for Computer Networks.

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    View/Open
    Thesis_Alzahrani.pdf (1.868Mb)
    Download
    Publication date
    2010-03-10T16:46:10Z
    Author
    Alzahrani, Ahmed S.
    Supervisor
    Woodward, Mike E.
    Keyword
    Quality of Service (QoS) routing
    Algorithms
    Communication networks
    Performance evaluation
    Computer networks
    Rights
    Creative Commons License
    The University of Bradford theses are licenced under a Creative Commons Licence.
    Institution
    University of Bradford
    Department
    Department of Computing
    Awarded
    2009
    
    Metadata
    Show full item record
    Abstract
    Quality of Service (QoS) routing considered as one of the major components of the QoS framework in communication networks. The concept of QoS routing has emerged from the fact that routers direct traffic from source to destination, depending on data types, network constraints and requirements to achieve network performance efficiency. It has been introduced to administer, monitor and improve the performance of computer networks. Many QoS routing algorithms are used to maximize network performance by balancing traffic distributed over multiple paths. Its major components include bandwidth, delay, jitter, cost, and loss probability in order to measure the end users¿ requirements, optimize network resource usage and balance traffic load. The majority of existing QoS algorithms require the maintenance of the global network state information and use it to make routing decisions. The global QoS network state needs to be exchanged periodically among routers since the efficiency of a routing algorithm depends on the accuracy of link-state information. However, most of QoS routing algorithms suffer from scalability problems, because of the high communication overhead and the high computation effort associated with marinating and distributing the global state information to each node in the network.The goal of this thesis is to contribute to enhancing the scalability of QoS routing algorithms. Motivated by this, the thesis is focused on localized QoS routing that is proposed to achieve QoS guarantees and overcome the problems of using global network state information such as high communication overhead caused by frequent state information updates, inaccuracy of link-state information for large QoS state update intervals and the route oscillating due to the view of state information. Using such an approach, the source node makes its own routing decisions based on the information that is local to each node in the path. Localized QoS routing does not need the global network state to be exchanged among network nodes because it infers the network state and avoids all the problems associated with it, like high communication and processing overheads and oscillating behaviour. In localized QoS routing each source node is required to first determine a set of candidate paths to each possible destination. In this thesis we have developed localized QoS routing algorithms that select a path based on its quality to satisfy the connection requirements. In the first part of the thesis a localized routing algorithm has been developed that relies on the average residual bandwidth that each path can support to make routing decisions. In the second part of the thesis, we have developed a localized delay-based QoS routing (DBR) algorithm which relies on a delay constraint that each path satisfies to make routing decisions. We also modify credit-based routing (CBR) so that this uses delay instead of bandwidth. Finally, we have developed a localized QoS routing algorithm for routing in two levels of a hierarchal network and this relies on residual bandwidth to make routing decisions in a hierarchical network like the internet. We have compared the performance of the proposed localized routing algorithms with other localized and global QoS routing algorithms under different ranges of workloads, system parameters and network topologies. Simulation results have indicated that the proposed algorithms indeed outperform algorithms that use the basics of schemes that currently operate on the internet, even for a small update interval of link state. The proposed algorithms have also reduced the routing overhead significantly and utilize network resources efficiently.
    URI
    http://hdl.handle.net/10454/4254
    Type
    Thesis
    Qualification name
    PhD
    Collections
    Theses

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    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.