68 citations · 108 across the 6 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.NI2010★ 68 cited
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Libin Jiang, Jean Walrand
It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) u…
cs.NI2010★ 1 cited
Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling
Libin Jiang, Mathieu Leconte, Jian Ni +2
Glauber dynamics is a powerful tool to generate randomized, approximate solutions to combinatorially difficult problems. It has been used to analyze and design distributed CSMA (Ca…
cs.NI2010★ 15 cited
Optimal Distributed P2P Streaming under Node Degree Bounds
Shaoquan Zhang, Ziyu Shao, Minghua Chen +1
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under \emph{node degree bounds}, i.e., the number of neighbors a node can simultaneously connect…