Thesis
Multi-constrained node-disjoint multipath QoS routing algorithms for status dissemination networks
Washington State University
Master of Science (MS), Washington State University
2004
Handle:
https://hdl.handle.net/2376/205
Abstract
Status dissemination networks (SDN) are geographically distributed critical infrastructure networks wherein, the status information which includes data and/or control information needs to be gathered and distributed to the registered clients through status variables according to their QoS specification in a reliable and timely manner. In order to achieve this, SDN require routing algorithms to find multiple disjoint paths, which satisfy multiple QoS constraints simultaneously. In this thesis, we present a heuristic algorithm for QoS routing, which ensures reliability and timeliness by computing a pair of node-disjoint paths that satisfy multiple QoS constraints. The multiple QoS constraints addressed by the heuristic algorithm are delay, delay-jitter, bandwidth and buffer space. We show that the performance of our heuristic algorithm is better than the remove-find method in terms of committing QoS subscriptions, utilization of network resources and finding disjoint pairs of paths.
Metrics
6 File views/ downloads
13 Record Views
Details
- Title
- Multi-constrained node-disjoint multipath QoS routing algorithms for status dissemination networks
- Creators
- Sheshadri Supreeth Koushik
- Contributors
- Carl H. Hauser (Degree Supervisor)
- Awarding Institution
- Washington State University
- Academic Unit
- Electrical Engineering and Computer Science, School of
- Theses and Dissertations
- Master of Science (MS), Washington State University
- Publisher
- Washington State University; [Pullman, Washington] :
- Identifiers
- 99900525068701842
- Language
- English
- Resource Type
- Thesis