Sciweavers

21 search results - page 1 / 5
» Fair Scheduling through Packet Election
Sort
View
INFOCOM
2008
IEEE
13 years 11 months ago
Fair Scheduling through Packet Election
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...
Srikanth Jagabathula, Vishal Doshi, Devavrat Shah
SIGCOMM
2012
ACM
11 years 7 months ago
Multi-resource fair queueing for packet processing
Middleboxes are ubiquitous in today’s networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastl...
Ali Ghodsi, Vyas Sekar, Matei Zaharia, Ion Stoica
INFOCOM
2000
IEEE
13 years 9 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...
DC
2007
13 years 4 months ago
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
We present a randomizedself-stabilizing leaderelection protocol and a randomizedself-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirect...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
ICNP
2000
IEEE
13 years 9 months ago
A Topology-Independent Fair Queueing Model in Ad Hoc Wireless Networks
Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as locat...
Haiyun Luo, Songwu Lu