Sciweavers

205 search results - page 30 / 41
» An Axiomatic Theory of Fairness in Network Resource Allocati...
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Dedicated Channels as an Optimal Network Support for Effective Transfer of Massive Data
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...
Sergey Gorinsky, Nageswara S. V. Rao
VTC
2008
IEEE
136views Communications» more  VTC 2008»
14 years 1 months ago
Proportional Channel-Aware Packet Scheduling in Satellite Multimedia Broadcasting
— This paper studies the optimization techniques for scheduling multimedia packets in satellite digital multimedia broadcasting system, namely SDMB, in the presence of a return l...
Hongfei Du
ATAL
2010
Springer
13 years 8 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
SPAA
2009
ACM
14 years 2 months ago
Distributed algorithms for QoS load balancing
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...
INFOCOM
1996
IEEE
13 years 11 months ago
Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
Dimitrios Stiliadis, Anujan Varma