NDLI: Performance of scheduling policies in adversarial networks with non synchronized clocks

Content Provider	IEEE Xplore Digital Library
Author	Cespedes, J. Fernandez, A. Lopez-Presa, J.L. Lorenzo, M.A. Manzano, P. Martinez-Romo, J. Mozo, A. Puig-Centelles, A. Santos, A. Thraves, C.
Copyright Year	2007
Description	Author affiliation: Univ. Rey Juan Carlos, Madrid (Cespedes, J.; Fernandez, A.)
Abstract	In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model by considering the possibility that the router clocks in the network are not synchronized. Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. First, if all clocks run at the same speed, maintaining constant differences, 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, if clock differences can vary over time, but difference is bounded, we show the universal stability of SIS and a family of policies related to LIS. The bounds we obtain in this case depend on the maximum difference between clocks. 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 do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these protocols in a network with stochastic injection of packets.
Starting Page	1071
Ending Page	1078
File Size	597175
Page Count	8
File Format	PDF
ISBN	9781424415205
ISSN	15301346
DOI	10.1109/ISCC.2007.4381620
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-07-01
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Synchronization Clocks Stability Delay Quality of service Timing Telecommunication traffic Queueing analysis Scheduling algorithm Polynomials
Content Type	Text
Resource Type	Article
Subject	Signal Processing Mathematics Computer Networks and Communications Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

QoS using delay-synchronized dynamic priority scheduling

A probabilistic priority scheduling discipline for multi-service networks

Resource division policies for EDF scheduling in ATM networks

Delay analysis of scheduling policies in wireless networks

Simulated Internet traffic behavior under different QoS management scenarios

Network level call admission control algorithms for generalized processor sharing scheduling discipline

New Aspect of Beaconing in IEEE 802.11s Mesh Networks

Enhancing revenue maximization with adaptive WRR

ADPQ: an adaptive approach for expedited forwarding traffic scheduling

Performance of scheduling policies in adversarial networks with non synchronized clocks

Similar Documents

QoS using delay-synchronized dynamic priority scheduling

A probabilistic priority scheduling discipline for multi-service networks

Resource division policies for EDF scheduling in ATM networks

Delay analysis of scheduling policies in wireless networks

Simulated Internet traffic behavior under different QoS management scenarios

Network level call admission control algorithms for generalized processor sharing scheduling discipline

New Aspect of Beaconing in IEEE 802.11s Mesh Networks

Enhancing revenue maximization with adaptive WRR

ADPQ: an adaptive approach for expedited forwarding traffic scheduling

Performance of scheduling policies in adversarial networks with non synchronized clocks