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

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] 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 SIS and a family of policies related to LIS (the priority of a packet in these policies depends ...

• Type: Journal
• Year: 2011
• Where: MST
• Authors: Antonio Fernández Anta, José Luis López-Presa, M. Araceli Lorenzo, Pilar Manzano, Juan Martinez-Romo, Alberto Mozo, Christopher Thraves
• Keywords: Clocks, Hardware, Maximum Difference, MST 2011, Policies