Sciweavers

454 search results - page 51 / 91
» The Capacity Allocation Paradox
Sort
View
WSS
1997
112views Control Systems» more  WSS 1997»
13 years 11 months ago
Propagated timestamps: a scheme for the stabilization of maximum-flow routing protocols
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...
Jorge Arturo Cobb, Mohamed Waris
QUESTA
2006
100views more  QUESTA 2006»
13 years 10 months ago
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
We compare the performance of three usual allocations (max-min fairness, proportional fairness and balanced fairness) in a communication network whose resources are shared by a ra...
Thomas Bonald, Laurent Massoulié, Alexandre...
INFOCOM
2011
IEEE
13 years 1 months ago
Analysis and algorithms for partial protection in mesh networks
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...
Greg Kuperman, Eytan Modiano, Aradhana Narula-Tam
JSAC
2006
128views more  JSAC 2006»
13 years 10 months ago
Optimized Transmission for Fading Multiple-Access and Broadcast Channels With Multiple Antennas
In mobile wireless networks, dynamic allocation of resources such as transmit powers, bit-rates, and antenna beams based on the channel state information of mobile users is known t...
Mehdi Mohseni, Rui Zhang, John M. Cioffi
TSP
2008
111views more  TSP 2008»
13 years 10 months ago
Space-Time Power Schedule for Distributed MIMO Links Without Instantaneous Channel State Information at the Transmitting Nodes
A space-time optimal power schedule for multiple distributed multiple-input multiple-output (MIMO) links without the knowledge of the instantaneous channel state information at th...
Yue Rong, Yingbo Hua, Ananthram Swami, A. Lee Swin...