Sciweavers

2517 search results - page 42 / 504
» The Fairness Challenge in Computer Networks
Sort
View
HIPC
2007
Springer
14 years 17 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
TSP
2008
122views more  TSP 2008»
13 years 8 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...
ICDCS
2011
IEEE
12 years 8 months ago
Competitive and Fair Medium Access Despite Reactive Jamming
Abstract—Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often...
Andréa W. Richa, Christian Scheideler, Stef...
APNOMS
2007
Springer
14 years 2 months ago
Scheduling Management in Wireless Mesh Networks
We propose a greedy algorithm to investigate the problem of how to schedule of a set of feasible transmissions under physical interference model. We also consider the fairness in s...
Nguyen H. Tran, Choong Seon Hong
TAPIA
2005
ACM
14 years 2 months ago
The challenges of ambient collaboration
Collaborative capabilities are a hallmark of a new generation of networked applications. While traditional collaboration puts the computer in the foreground to help users interfac...
Hans-Peter Dommel