Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

Fernández Anta, Antonio and López Presa, Jose Luis and Lorenzo Prieto, Maria Araceli and Manzano García, Pilar and Martinez Romo, Juan and Mozo Velasco, Alberto and Thraves, Christopher (2011). Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks. "Theory of Computing Systems", v. 48 (n. 1); pp. 1-22. ISSN 1432-4350. https://doi.org/10.1007/s00224-009-9223-5.

Description

Title: Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
Author/s:
  • Fernández Anta, Antonio
  • López Presa, Jose Luis
  • Lorenzo Prieto, Maria Araceli
  • Manzano García, Pilar
  • Martinez Romo, Juan
  • Mozo Velasco, Alberto
  • Thraves, Christopher
Item Type: Article
Título de Revista/Publicación: Theory of Computing Systems
Date: June 2011
ISSN: 1432-4350
Volume: 48
Subjects:
Freetext Keywords: Scheduling, Continuous adversarial queuing theory, Adversarial models, Clock skew, Clock drift, Clock synchronization
Faculty: E.U. de Informática (UPM)
Department: Arquitectura y Tecnología de Computadores [hasta 2014]
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview

Abstract

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

More information

Item ID: 11650
DC Identifier: http://oa.upm.es/11650/
OAI Identifier: oai:oa.upm.es:11650
DOI: 10.1007/s00224-009-9223-5
Official URL: http://link.springer.com/article/10.1007%2Fs00224-009-9223-5
Deposited by: Memoria Investigacion
Deposited on: 29 Nov 2012 10:38
Last Modified: 20 Apr 2016 19:40
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM