In partial fulfillment of the Requirements for the Degree of
Master of Science
Madhura Joglekar
will defend her thesis
Preserving Quality of Service Requirements
In Spite of Flow Aggregation
Abstract
We examine the effect of aggregation of flows on Quality of Service guarantees of packets in a network model. We emphasize on studying the end-to-end delay parameter of QoS in packets of flows that undergo aggregation, and examine our hypothesis that the end-to-end delay improves as a result of aggregation.
In this thesis, an algorithm is developed for a general aggregator, that can be adapted to any scheduling algorithm, and the properties of rate-proportionality and fairness are proved for it. We also describe an implementation of the general algorithm using the Virtual Clock scheduling algorithm, and prove that the aforementioned properties hold for it. Further, we present the design of a multiple aggregator, which is a machine consisting of an aggregator and scheduler combined. It is observed that the complexity involved in such a scheduling process is O(N). To seek efficient scheduling of packets, we introduce a queuing algorithm that reduces the complexity of scheduling from O(N) to O(log N).
Date: Friday, October 22, 1999
Time: 1:30 PM
Place: 550-PGH
Faculty, students, and the general public are invited.
Thesis Advisor: Dr. Ernst Leiss
