Sciweavers

794 search results - page 76 / 159
» Stackelberg scheduling strategies
Sort
View
CORR
2007
Springer
124views Education» more  CORR 2007»
15 years 1 months ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...
INFOCOM
2006
IEEE
15 years 7 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
TMC
2010
141views more  TMC 2010»
14 years 12 months ago
Energy-Optimal Scheduling with Dynamic Channel Acquisition in Wireless Downlinks
—We consider a wireless base station serving L users through L time-varying channels. It is well known that opportunistic scheduling algorithms with full channel state informatio...
Chih-Ping Li, Michael J. Neely
ASPLOS
2010
ACM
15 years 3 months ago
Decoupling contention management from scheduling
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...
Ryan Johnson, Radu Stoica, Anastasia Ailamaki, Tod...
DSN
2005
IEEE
15 years 7 months ago
Probabilistic QoS Guarantees for Supercomputing Systems
Supercomputing systems must be able to reliably and efficiently complete their assigned workloads, even in the presence of failures. This paper proposes a system that allows the ...
Adam J. Oliner, Larry Rudolph, Ramendra K. Sahoo, ...