智能手机对等网络的容量
The Capacity of Smartphone Peer-to-Peer Networks
摘要：
我们研究三个容量问题的移动电话模型，网络抽象模型的对等通信能力，在大多数商品智能手机操作系统。网络的容量表示对于一组通信需求可以维持多少持续吞吐量，因此是网络有用性的基本界限。由于这种重要性，无线网络容量在过去二十年中一直是研究的活跃领域。我们研究的三个能力问题在沟通需求的结构上有所不同。第一个问题是成对容量，其中需求是（源，目的地）对。成对容量是最经典的定义之一，因为它在Gupta和Kumar关于无线网络容量的开创性论文中进行了分析。我们研究的第二个问题是广播容量，其中单个源必须将数据包发送到网络中的所有其他节点。最后，我们将注意力转向所有节点对所有节点的容量，其中所有节点都必须将数据包发送到所有其他节点。在这三个问题中，我们描述了任何给定网络的最佳可达吞吐量，并设计了渐近匹配此性能的算法。我们还研究了由古普塔和库马尔引入的过程随机生成的网络中的这些问题，并充分描述了其可实现的吞吐量。有趣的是，我们为所有对所有容量开发的技术也允许我们设计一个一次性的八卦算法，该算法在每个图中的最优多项式因子内运行。这在很大程度上解决了一个悬而未决的问题，从以前的工作在这个模型中的一次性八卦问题。
英文摘要：
We study three capacity problems in the mobile telephone model, a network abstraction that models the peer-to-peer communication capabilities implemented in most commodity smartphone operating systems. The capacity of a network expresses how much sustained throughput can be maintained for a set of communication demands, and is therefore a fundamental bound on the usefulness of a network. Because of this importance, wireless network capacity has been active area of research for the last two decades. The three capacity problems that we study differ in the structure of the communication demands. The first problem is pairwise capacity, where the demands are (source, destination) pairs. Pairwise capacity is one of the most classical definitions, as it was analyzed in the seminal paper of Gupta and Kumar on wireless network capacity. The second problem we study is broadcast capacity, in which a single source must deliver packets to all other nodes in the network. Finally, we turn our attention to all-to-all capacity, in which all nodes must deliver packets to all other nodes. In all three of these problems we characterize the optimal achievable throughput for any given network, and design algorithms which asymptotically match this performance. We also study these problems in networks generated randomly by a process introduced by Gupta and Kumar, and fully characterize their achievable throughput. Interestingly, the techniques that we develop for all-to-all capacity also allow us to design a one-shot gossip algorithm that runs within a polylogarithmic factor of optimal in every graph. This largely resolves an open question from previous work on the one-shot gossip problem in this model.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
