Show simple item record

dc.contributor.advisorWoodward, Mike E.
dc.contributor.advisorAwan, Irfan U.
dc.contributor.authorMohammad, Abdulbaset H. T.*
dc.date.accessioned2011-10-28T16:54:09Z
dc.date.available2011-10-28T16:54:09Z
dc.date.issued2011-10-28
dc.identifier.urihttp://hdl.handle.net/10454/5163
dc.description.abstractThe Quality of Service (QoS) is a profound concept which is gaining increasing attention in the Internet industry. Best-effort applications are now no longer acceptable in certain situations needing high bandwidth provisioning, low loss and streaming of multimedia applications. New emerging multimedia applications are requiring new levels of quality of services beyond those supported by best-effort networks. Quality of service routing is an essential part in any QoS architecture in communication networks. QoS routing aims to select a path among the many possible choices that has sufficient resources to accommodate the QoS requirements. QoS routing can significantly improve the network performance due to its awareness of the network QoS state. Most QoS routing algorithms require maintenance of the global network¿s state information to make routing decisions. Global state information needs to be periodically exchanged among routers since the efficiency of a routing algorithm depends on link-state information accuracy. However, most QoS routing algorithms suffer from scalability due to the high communication overhead and the high computation effort associated with maintaining accurate link state information and distributing global state information to each node in the network. The ultimate goal of this thesis is to contribute towards enhancing the scalability of QoS routing algorithms. Towards this goal, the thesis is focused on Localised QoS routing algorithms proposed to overcome the problems of using global network state information. Using such an approach, the source node makes routing decisions based on the local state information for each node in the path. Localised QoS routing algorithms avoid the problems associated in the global network state, like high communication and processing overheads. In Localised QoS routing algorithms each source node maintains a predetermined set of candidate paths for each destination and avoids the problems associated with the maintenance of a global network state by using locally collected flow statistics and flow blocking probabilities.en_US
dc.description.sponsorshipLibya's higher educationen_US
dc.language.isoenen_US
dc.rights© 2010 Mohammad, A. H. T. This work is licensed under a Creative Commons Attribution-Non-Commercial-Share-Alike License (http://creativecommons.org/licenses/by-nc-nd/2.0/uk).en_US
dc.subjectLocalised quality of service routingen_US
dc.subjectPerformance evaluationen_US
dc.subjectRouting algorithmsen_US
dc.subjectQuality of Service (QoS)en_US
dc.subjectScalabilityen_US
dc.titleLocalised Routing Algorithms in Communication Networks with Quality of Service Constraints. Performance Evaluation and Enhancement of New Localised Routing Approaches to Provide Quality of Service for Computer and Communication Networks.en_US
dc.type.qualificationleveldoctoralen_US
dc.publisher.institutionUniversity of Bradfordeng
dc.publisher.departmentSchool of Computing, Informatics and Mediaen_US
dc.typeThesiseng
dc.type.qualificationnamePhDen_US
dc.date.awarded2010
refterms.dateFOA2018-07-19T07:47:21Z


Item file(s)

Thumbnail
Name:
PhDThesis.pdf
Size:
1.209Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record