Cover Image

Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches

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 applicati...

Full description

Saved in:
Bibliographic Details
Main Author: Subramaniam, Shamala
Format: Thesis
Language:English
English
Published: 2002
Subjects:
Computer algorithms
Computer science
Online Access:http://psasir.upm.edu.my/id/eprint/8688/1/FSKTM_2002_6%20IR.pdf
http://psasir.upm.edu.my/id/eprint/8688/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.8688
record_format eprints
spelling my.upm.eprints.86882023-12-27T02:04:03Z http://psasir.upm.edu.my/id/eprint/8688/ Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches Subramaniam, Shamala 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. 2002-12 Thesis NonPeerReviewed text en http://psasir.upm.edu.my/id/eprint/8688/1/FSKTM_2002_6%20IR.pdf Subramaniam, Shamala (2002) Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches. Doctoral thesis, Universiti Putra Malaysia. Computer algorithms Computer science English
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
English
topic Computer algorithms
Computer science
spellingShingle Computer algorithms
Computer science
Subramaniam, Shamala
Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches
description 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.
format Thesis
author Subramaniam, Shamala
author_facet Subramaniam, Shamala
author_sort Subramaniam, Shamala
title Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches
title_short Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches
title_full Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches
title_fullStr Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches
title_full_unstemmed Dynamic traffic scheduling and resource reservation algorithms for output-buffered switches
title_sort dynamic traffic scheduling and resource reservation algorithms for output-buffered switches
publishDate 2002
url http://psasir.upm.edu.my/id/eprint/8688/1/FSKTM_2002_6%20IR.pdf
http://psasir.upm.edu.my/id/eprint/8688/
_version_ 1787137185024049152
score 13.211869

Similar Items