Sciweavers

231 search results - page 14 / 47
» End-to-end Fairness Analysis of Fair Queuing Networks
Sort
View
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
INFOCOM
2008
IEEE
14 years 3 months ago
Utility Max-Min Fair Congestion Control with Time-Varying Delays
Abstract—We present a framework for designing delayindependent end-to-end congestion control algorithms, where each end-user may have a different utility function. We only requir...
Konstantin Miller, Tobias Harks
WSC
2008
13 years 11 months ago
Simulating the performance of a Class-Based Weighted Fair Queueing system
Class Based Weighted Fair Queueing (CBWFQ) is a very important router discipline that allows different types of Internet Protocol (IP) traffic like voice, video, and best effort d...
Martin J. Fischer, Denise M. Bevilacqua Masi, John...
INFOCOM
2005
IEEE
14 years 2 months ago
Pricing and revenue sharing strategies for Internet service providers
— One of the challenges facing the networking industry today is to increase the profitability of Internet services. This calls for economic mechanisms that can enable providers ...
Linhai He, Jean C. Walrand
HIPC
2007
Springer
14 years 15 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri