{"id":{"repo_id":"bradford","oai_identifier":"oai:bradscholars.brad.ac.uk:10454/4288"},"canonical_url":"https://search.dev.ndltd.org/etd/bradford/oai:bradscholars.brad.ac.uk:10454/4288","repository":{"repo_id":"bradford","name":"University of Bradford","base_url":"https://bradscholars.brad.ac.uk/oai/request"},"display":{"title":"Some new localized quality of service models and algorithms for communication networks. The development and evaluation of new localized quality of service routing algorithms and path selection methods for both flat and hierarchical communication networks.","abstract":"The Quality of Service (QoS) routing approach is gaining an increasing interest in the Internet community due to the new emerging Internet applications such as real-time multimedia applications. These applications require better levels of quality of services than those supported by best effort networks. Therefore providing such services is crucial to many real time and multimedia applications which have strict quality of service requirements regarding bandwidth and timeliness of delivery. QoS routing is a major component in any QoS architecture and thus has been studied extensively in the literature. Scalability is considered one of the major issues in designing efficient QoS routing algorithms due to the high cost of QoS routing both in terms of computational effort and communication overhead. Localized quality of service routing is a promising approach to overcome the scalability problem of the conventional quality of service routing approach. The localized quality of service approach eliminates the communication overhead because it does not need the global network state information. The main aim of this thesis is to contribute towards the localised routing area by proposing and developing some new models and algorithms. Toward this goal we make the following major contributions. First, a scalable and efficient QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated. Second, we have developed a path selection technique that can be used with existing localized QoS routing algorithms to enhance their scalability and performance. Third, a scalable and efficient hierarchical QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated.","abstract_html":"The Quality of Service (QoS) routing approach is gaining an increasing interest in the Internet community due to the new emerging Internet applications such as real-time multimedia applications. These applications require better levels of quality of services than those supported by best effort networks. Therefore providing such services is crucial to many real time and multimedia applications which have strict quality of service requirements regarding bandwidth and timeliness of delivery. QoS routing is a major component in any QoS architecture and thus has been studied extensively in the literature. Scalability is considered one of the major issues in designing efficient QoS routing algorithms due to the high cost of QoS routing both in terms of computational effort and communication overhead. Localized quality of service routing is a promising approach to overcome the scalability problem of the conventional quality of service routing approach. The localized quality of service approach eliminates the communication overhead because it does not need the global network state information. The main aim of this thesis is to contribute towards the localised routing area by proposing and developing some new models and algorithms. Toward this goal we make the following major contributions. First, a scalable and efficient QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated. Second, we have developed a path selection technique that can be used with existing localized QoS routing algorithms to enhance their scalability and performance. Third, a scalable and efficient hierarchical QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated.","abstract_has_math":false,"creators":["Mustafa, Elmabrook B.M."],"institution":"University of Bradford","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Not named"],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-05-07T11:30:47Z","date_published":"2010-05-07T11:30:47Z","updated_at":"2026-07-24T01:15:46Z","subjects":["Localized routing","Quality of Service (QoS)","Bandwidth","Delay","Path selection","Communication networks","Real time applications","Multimedia applications","Routing algorithms","Path selection technique"],"languages":["en"],"rights":["\"Creative
The University of Bradford theses are licenced under a Creative Commons Licence."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10454/4288","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Not named"]},{"key":"dc:creator","label":"Author","values":["Mustafa, Elmabrook B.M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-05-07T11:30:47Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-05-07T11:30:47Z"]},{"key":"dc:date.issued","label":"Date","values":["2010-05-07T11:30:47Z"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Computing"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Bradford"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["PhD"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Localized routing","Quality of Service (QoS)","Bandwidth","Delay","Path selection","Communication networks","Real time applications","Multimedia applications","Routing algorithms","Path selection technique"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["\"Creative
The University of Bradford theses are licenced under a Creative Commons Licence."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10454/4288"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The Quality of Service (QoS) routing approach is gaining an increasing interest in the Internet community due to the new emerging Internet applications such as real-time multimedia applications. These applications require better levels of quality of services than those supported by best effort networks. Therefore providing such services is crucial to many real time and multimedia applications which have strict quality of service requirements regarding bandwidth and timeliness of delivery. QoS routing is a major component in any QoS architecture and thus has been studied extensively in the literature. Scalability is considered one of the major issues in designing efficient QoS routing algorithms due to the high cost of QoS routing both in terms of computational effort and communication overhead. Localized quality of service routing is a promising approach to overcome the scalability problem of the conventional quality of service routing approach. The localized quality of service approach eliminates the communication overhead because it does not need the global network state information. The main aim of this thesis is to contribute towards the localised routing area by proposing and developing some new models and algorithms. Toward this goal we make the following major contributions. First, a scalable and efficient QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated. Second, we have developed a path selection technique that can be used with existing localized QoS routing algorithms to enhance their scalability and performance. Third, a scalable and efficient hierarchical QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated."]},{"key":"dc:title","label":"Title","values":["Some new localized quality of service models and algorithms for communication networks. The development and evaluation of new localized quality of service routing algorithms and path selection methods for both flat and hierarchical communication networks."]}]}],"canonical_facts":{"dc:contributor.advisor":["Not named"],"dc:creator":["Mustafa, Elmabrook B.M."],"dc:date.accessioned":["2010-05-07T11:30:47Z"],"dc:date.available":["2010-05-07T11:30:47Z"],"dc:date.issued":["2010-05-07T11:30:47Z"],"dc:description.abstract":["The Quality of Service (QoS) routing approach is gaining an increasing interest in the Internet community due to the new emerging Internet applications such as real-time multimedia applications. These applications require better levels of quality of services than those supported by best effort networks. Therefore providing such services is crucial to many real time and multimedia applications which have strict quality of service requirements regarding bandwidth and timeliness of delivery. QoS routing is a major component in any QoS architecture and thus has been studied extensively in the literature. Scalability is considered one of the major issues in designing efficient QoS routing algorithms due to the high cost of QoS routing both in terms of computational effort and communication overhead. Localized quality of service routing is a promising approach to overcome the scalability problem of the conventional quality of service routing approach. The localized quality of service approach eliminates the communication overhead because it does not need the global network state information. The main aim of this thesis is to contribute towards the localised routing area by proposing and developing some new models and algorithms. Toward this goal we make the following major contributions. First, a scalable and efficient QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated. Second, we have developed a path selection technique that can be used with existing localized QoS routing algorithms to enhance their scalability and performance. Third, a scalable and efficient hierarchical QoS routing algorithm based on a localised approach to QoS routing has been developed and evaluated."],"dc:identifier.uri":["http://hdl.handle.net/10454/4288"],"dc:language.iso":["en"],"dc:publisher.department":["Department of Computing"],"dc:publisher.institution":["University of Bradford"],"dc:rights":["\"Creative
The University of Bradford theses are licenced under a Creative Commons Licence."],"dc:subject":["Localized routing","Quality of Service (QoS)","Bandwidth","Delay","Path selection","Communication networks","Real time applications","Multimedia applications","Routing algorithms","Path selection technique"],"dc:title":["Some new localized quality of service models and algorithms for communication networks. The development and evaluation of new localized quality of service routing algorithms and path selection methods for both flat and hierarchical communication networks."],"dc:type":["Thesis"],"dc:type.qualificationlevel":["doctoral"],"dc:type.qualificationname":["PhD"]},"updated_at":"2026-07-24T01:15:46Z"}