Sciweavers

288 search results - page 16 / 58
» On Similarity-Invariant Fairness Measures
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Infinite order Lorenz dominance for fair multiagent optimization
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
Boris Golden, Patrice Perny
COMCOM
2004
110views more  COMCOM 2004»
13 years 7 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
ICCCN
2007
IEEE
14 years 2 months ago
Packet Scheduling with Buffer Management for Fair Bandwidth Sharing and Delay Differentiation
Abstract— Packet delay and bandwidth are two important metrics for measuring quality of service (QoS) of Internet services. Traditionally, packet delay differentiation and fair b...
Dennis Ippoliti, Xiaobo Zhou, Liqiang Zhang
AHSWN
2006
84views more  AHSWN 2006»
13 years 8 months ago
A Path Density Protocol for MANETs
Knowing or being able to measure the "path density" at sources of communications is essential to provide fair capacity distribution between sessions in multi-hop ad hoc ...
Evgeny Osipov, Christian F. Tschudin
INFOCOM
2000
IEEE
14 years 7 days ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste