A Threshold Based Dynamic Routing for Jobs with QoS Ranking - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

A Threshold Based Dynamic Routing for Jobs with QoS Ranking

Abstract

We consider a set of n heterogeneous servers which differ in processing time and Quality of Service (QoS). Jobs are divided into m levels with regard to their service ranks. We present a Threshold Policy (TP) depending on number of different jobs in the queues as a practical and flexible dynamic routing policy to control the QoS. Two performance measures are discussed: the QoS and the Average Waiting Time (AWT) in the queues. The TP is compared with both a static routing policy which maximizes the QoS level and the Minimum Expected Delay (MED) policy which minimizes the AWT. Numerical example validate that the proposed TP is more effective when both measures are considered. The TP balances the trade-off between QoS and AWT and therefore it is superior to the MED policy and any static routing which keeps the QoS in a certain level.
Fichier principal
Vignette du fichier
KhodadadiR10.pdf (282.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01060717 , version 1 (16-11-2017)

Licence

Attribution

Identifiers

Cite

Seyed Behrouz Khodadadi, Jafar Razmi. A Threshold Based Dynamic Routing for Jobs with QoS Ranking. 9th IFIP WG 5.5 International Conference on Balanced Automation Systems for Future Manufacturing Networks (BASYS), Jul 2010, Valencia, Spain. pp.137-144, ⟨10.1007/978-3-642-14341-0_16⟩. ⟨hal-01060717⟩
47 View
43 Download

Altmetric

Share

Gmail Facebook X LinkedIn More