NDLI: Anonymity and fairness in packet scheduling: a quantitative tradeoff

Content Provider	ACM Digital Library
Author	Venkitasubramaniam, Parv Mishra, Abhishek
Copyright Year	2016
Description	Author Affiliation: Lehigh University(Venkitasubramaniam, Parv; Mishra, Abhishek)
Abstract	Fairness among multiple users sharing a common resource is an important criterion in the design and evaluation of scheduling algorithms in networks. Anonymous networking, where sources of transmitted packets are undecipherable to an eavesdropper, requires packets arriving at routers from multiple sources to be randomly reordered prior to transmission, which works against the notion of temporal fairness in packet scheduling. Consequently, it is important to understand the relationship between temporal fairness and achievable anonymity. In this paper, this relationship is investigated for three fair scheduling paradigms: First-Come--First-Serve (FCFS), Fair Queuing, and the Proportional Method. Using an information-theoretic metric for anonymity and a common temporal fairness index that measures the degree of out-of-order transmissions, the anonymity achievable under these scheduling paradigms is characterized and their anonymity-fairness tradeoffs are compared. The FCFS and Fair Queuing algorithms have little inherent anonymity, and a significant improvement in anonymity is achieved by relaxing their respective fairness paradigms. The analysis of the relaxed FCFS criterion, in particular, is accomplished by modeling the problem as a stochastic control system that is solved using dynamic programming. The proportional method of scheduling, while unpopular in networks today, is shown to outperform the other fair scheduling algorithms when trading temporal fairness for anonymity, and is also proven to be asymptotically optimal as the buffer size of the scheduler is increased.
Starting Page	688
Ending Page	702
Page Count	15
File Format	PDF
ISSN	10636692
Volume Number	24
Issue Number	2
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-04-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Chaum mix Markov decision processes Anonymity Proportional method Round robin Scheduling
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

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

Comments on “carry-over round robin: a simple cell scheduling mechanism for ATM networks”

Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness

Two-dimensional round-robin schedulers for packet switches with multiple input queues

Anonymity in packet scheduling under the max-min fairness criterion

Tradeoffs between Throughput and Fairness of Parallel Round Robin Scheduling in DAS

Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers

Fair Scheduling for Delay-Sensitive VoIP Traffic

Carry-over round robin: a simple cell scheduling mechanism for ATM networks

1 fair round robin: a low complexity packet scheduler with proportional and worst-case fairness.

Anonymity and fairness in packet scheduling: a quantitative tradeoff

Similar Documents

Comments on “carry-over round robin: a simple cell scheduling mechanism for ATM networks”

Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness

Two-dimensional round-robin schedulers for packet switches with multiple input queues

Anonymity in packet scheduling under the max-min fairness criterion

Tradeoffs between Throughput and Fairness of Parallel Round Robin Scheduling in DAS

Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers

Fair Scheduling for Delay-Sensitive VoIP Traffic

Carry-over round robin: a simple cell scheduling mechanism for ATM networks

1 fair round robin: a low complexity packet scheduler with proportional and worst-case fairness.

Anonymity and fairness in packet scheduling: a quantitative tradeoff