Sciweavers

6 search results - page 1 / 2
» Max-min fairness in multi-commodity flows
Sort
View
TPDS
2008
92views more  TPDS 2008»
13 years 4 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu
COMCOM
1999
141views more  COMCOM 1999»
13 years 4 months ago
A flow control scheme on ATM networks with max-min fairness
Asynchronous Transfer Mode (ATM) does not guarantee Quality of Service (QoS) for Available Bit Rate (ABR) service type during connection establishment. The bandwidth left for ABR ...
W. K. Lai, J.-Y. Tsai
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
11 years 7 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield
IPPS
2009
IEEE
13 years 11 months ago
Throughput-fairness tradeoff in Best Effort flow control for on-chip architectures
We consider two flow control schemes for Best Effort traffic in on-chip architectures, which can be deemed as the solutions to the boundary extremes of a class of utility maximi...
Fahimeh Jafari, Mohammad Sadegh Talebi, Mohammad H...
COR
2008
124views more  COR 2008»
13 years 5 months ago
Max-min fairness in multi-commodity flows
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein,...