Sciweavers

19 search results - page 2 / 4
» A Probabilistic Approach for Achieving Fair Bandwidth Alloca...
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
WINET
2010
105views more  WINET 2010»
13 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...
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 7 months ago
Breaking the Legend: Maxmin Fairness notion is no longer effective
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for re...
Yaser Miaji, Suhaidi Hassan
ICDCS
2008
IEEE
14 years 1 months ago
Achieving Global End-to-End Maxmin in Multihop Wireless Networks
Following the huge commercial success of WLAN, multihop wireless networks are expected to lead in the next wave of deployment. Fundamental methods for traffic engineering must be...
Liang Zhang, Shigang Chen, Ying Jian
SIGCOMM
1999
ACM
13 years 11 months ago
The Impact of Multicast Layering on Network Fairness
Many de nitions of fairness for multicast networks assume that sessions are single-rate, requiring that each multicast session transmits data to all of its receivers at the same r...
Dan Rubenstein, James F. Kurose, Donald F. Towsley