Sciweavers

Share
5 search results - page 1 / 1
» Probabilistic Packet Scheduling: Achieving Proportional Shar...
Sort
View
INFOCOM
2002
IEEE
9 years 9 days ago
Probabilistic Packet Scheduling: Achieving Proportional Share Bandwidth Allocation for TCP Flows
— This paper describes and evaluates a probabilistic packet scheduling (PPS) algorithm for providing different levels of service to TCP flows. With our approach, each router de...
Ming Zhang, Randolph Y. Wang, Larry L. Peterson, A...
MOBICOM
2000
ACM
8 years 11 months ago
Distributed fair scheduling in a wireless LAN
—Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows ...
Nitin H. Vaidya, Paramvir Bahl, Seema Gupta
CN
2006
84views more  CN 2006»
8 years 7 months ago
Distributed mechanism in detecting and defending against the low-rate TCP attack
In this paper, we consider a distributed mechanism to detect and to defend against the low-rate TCP attack. The low-rate TCP attack is a recently discovered attack. In essence, it ...
Haibin Sun, John C. S. Lui, David K. Y. Yau
WINET
2010
105views more  WINET 2010»
8 years 5 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...
JSAC
2010
101views more  JSAC 2010»
8 years 5 months ago
Shortest propagation delay (SPD) first scheduling for EPONs with heterogeneous propagation delays
—Due to the geographic distribution of its subscribers, Ethernet Passive Optical Networks (EPONs) have typically varying propagation delays between the Optical Network Units (ONU...
Michael P. McGarry, Martin Reisslein, Frank Aurzad...
books