Please use this identifier to cite or link to this item: http://hdl.handle.net/10125/20541

Global multi-hop scheduling for improving network utilization and Qos

File Description Size Format  
HAWN_Q111.H3_4323_r.pdf Version for non-UH users. Copying/Printing is not permitted 3.74 MB Adobe PDF View/Open
HAWN_Q111.H3_4323_uh.pdf Version for UH users 3.74 MB Adobe PDF View/Open

Item Summary

Title:Global multi-hop scheduling for improving network utilization and Qos
Authors:Li, Jiang
Date Issued:2008
Abstract:In this thesis, we present an analytical framework to provide statistical end-to-end delay guarantees to network traffic with a novel packet scheduling scheme, namely the Global multi-hop Scheduling (GMS). We first introduce background literature, then present the framework and performance analysis of this proposed scheduling mechanism, which considers bandwidth resources at both upstream and downstream hops, reserves expected bandwidth to admitted flows, assigns expected deadlines to packets differently from traditional scheduling schemes, and decides packet service order based on the path of each flow. The framework of this thesis can serve as the criterion to provide statistical bounds for the delay violation probability. We will show that this novel scheduling mechanism can provide much better Quality of Service (Qos) performance over current scheduling schemes in both aggregated flows and specific flows with strict Qos requirement, by both theoretic analysis and simulations.
Description:Thesis (M.S.)--University of Hawaii at Manoa, 2008.
Includes bibliographical references (leaves 91-97).
xi, 97 leaves, bound 29 cm
URI/DOI:http://hdl.handle.net/10125/20541
Rights:All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.
Appears in Collections: M.S. - Electrical Engineering


Please email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.

Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.