Sciweavers

262 search results - page 3 / 53
» Stability bounds in networks with dynamic link capacities
Sort
View
COMSNETS
2012
176views more  COMSNETS 2012»
12 years 1 months ago
Capacity of Byzantine consensus in capacity limited point-to-point networks
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
Guanfeng Liang, Nitin H. Vaidya
TMC
2011
158views more  TMC 2011»
13 years 1 months ago
Explicit Congestion Control Algorithms for Time Varying Capacity Media
—Explicit congestion control (XCC) is emerging as one potential solution for overcoming limitations inherent to the current TCP algorithm, characterized by unstable throughput, h...
Filipe Abrantes, João Taveira Araujo, Manue...
MOBIHOC
2012
ACM
11 years 8 months ago
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...
Peng-Jun Wan, XiaoHua Xu, Zhu Wang, ShaoJie Tang, ...
MOBIQUITOUS
2005
IEEE
13 years 11 months ago
A Feedback Control Scheme for Resource Allocation in Wireless Multi-hop Ad Hoc Networks
We present a new feedback control scheme for resource allocation in wireless ad hoc environment. The congestion measure on a wireless link is symbolized as a virtual price, which ...
Wenbo He, Xue Liu, Klara Nahrstedt
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 1 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi