Dynamic Traffic Scheduling and Resource Reservation Algorithms for Output-Buffered Switches
Subramaniam, Shamala (2002) Dynamic Traffic Scheduling and Resource Reservation Algorithms for Output-Buffered Switches. PhD thesis, Universiti Putra Malaysia.
Scheduling algorithms implemented in Internet switches have been dominated by the best-effort and guaranteed service models. Each of these models encompasses the extreme ends of the correlation spectrum between service guarantees and resource utilisation. Recent advancements in adaptive applications have motivated active research in predictive service models and dynamic resource reservation algorithms. The OCcuPancy_Adjusting (OCP_A) is a scheduling algorithm focused on the design of the above-mentioned research areas. Previously, this algorithm has been analysed for a unified resource reservation and scheduling algorithm while implementing a tail discarding strategy. However, the differentiated services provided by the OCP _A algorithm can be further enhanced. In this dissertation, four new algorithms are proposed. Three are extensions of the OCP _A. The fourth algorithm is an enhanced version of the Virtual Clock (VC) algorithm, denoted as ACcelErated (ACE) scheduler. The first algorithm is a priority scheduling algorithm (i.e. known as the M-Tier algorithm) incorporated with a multitier dynamic resource reservation algorithm. Periodical resource reallocations are implemented. Thus. enabling each tier's resource utilisation to converge to its desired Quality of Service (QoS) operating point. In addition. the algorithm integrates a cross-sharing concept of unused resources between the various hierarchical levels to exemplify the respective QoS sensitivity. In the second algorithm. a control parameter is integrated into the M-Tier algorithm to ensure reduction of delay segregation effects towards packet loss sensitive traffic. The third algorithm, introduces a delay approximation algorithm to justify packet admission. The fourth algorithm enhances the VC scheduling algorithm. This is performed via the incorporation of dynamic features in the computation of the VC scheduling tag. Subsequently, the delay bound limitation of the parameter is eliminated.
|Item Type:||Thesis (PhD)|
|Chairman Supervisor:||Associate Professor Mohamed Othman, PhD|
|Call Number:||FSKTM 2002 6|
|Faculty or Institute:||Faculty of Computer Science and Information Technology|
|Deposited By:||Nurul Hayatie Hashim|
|Deposited On:||09 Dec 2010 06:50|
|Last Modified:||27 Jul 2012 09:01|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 09 Dec 2010 06:50.