Sciweavers

137 search results - page 25 / 28
» Lyapunov Convergence for Lagrangian Models of Network Contro...
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 8 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
JSAC
2010
138views more  JSAC 2010»
13 years 6 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
WINET
2010
97views more  WINET 2010»
13 years 6 months ago
Routing in the frequency domain
Abstract The design of single transceiver based multichannel multi-hop wireless mesh networks focuses on the trade-off between rapid neighbor synchronization and maximizing the usa...
Jay A. Patel, Haiyun Luo, Indranil Gupta
PE
2002
Springer
176views Optimization» more  PE 2002»
13 years 8 months ago
Effective bandwidth estimation and testing for Markov sources
This work addresses the resource sharing problem in broadband communication networks that can guarantee some quality of service (QoS), and develops some results about data source ...
Juan Pechiar, Gonzalo Perera, María Simon
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 2 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking