arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.12581cs.DC
收藏

D2D资源共享贪婪匹配的平均-实例分析

Average-Case Analysis of Greedy Matching for D2D Resource Sharing

Shuqin Gao, Costas Courcoubetis, Lingjie Duan

摘要:

考虑到许多无线用户的邻近性以及它们在消耗本地资源方面的多样性(例如,数据计划、计算甚至能源),设备到设备(D2 D)资源共享是实现共享经济的一种有前途的方法。在由此产生的网络经济中,$n$用户将自己划分为需要在本地有效匹配的卖家和买家。本文采用了一种易于实现的分布式贪婪匹配算法,其并行复杂度仅为次线性$O(\log n)$,与最优但计算量大的集中式匹配算法相比具有很大的优势。但与最优匹配相比,它是否有效?大量的模拟表明,在大量的实际情况下,平均损失不超过$10\%$,远远好于最坏情况下的$50\%$损失界限的结果。然而,在文献中没有严格的平均情况分析来支持这种令人鼓舞的发现,这是支持在D2 D共享中实际使用贪婪匹配的基本步骤。本文是第一个提出严格的平均分析的某些代表性类的图与随机参数,提出了一个新的渐近方法。对于具有随机匹配权重的典型2D网格,我们严格证明了我们的贪心算法优于最优的$84.9\%$,而对于典型的Erdos-Renyi随机图,我们证明了当图既不稠密也不稀疏时$79\%$的下界。最后,我们使用实际数据表明,我们的随机图模型很好地近似了实际中遇到的D2 D共享网络。

英文摘要:

Given the proximity of many wireless users and their diversity in consuming local resources (e.g., data-plans, computation and even energy resources), device-to-device (D2D) resource sharing is a promising approach towards realizing a sharing economy. In the resulting networked economy, $n$ users segment themselves into sellers and buyers that need to be efficiently matched locally. This paper adopts an easy-to-implement greedy matching algorithm with distributed fashion and only sub-linear $O(\log n)$ parallel complexity, which offers a great advantage compared to the optimal but computational-expensive centralized matching. But is it efficient compared to the optimal matching? Extensive simulations indicate that in a large number of practical cases the average loss is no more than $10\%$, a far better result than the $50\%$ loss bound in the worst case. However, there is no rigorous average-case analysis in the literature to back up such encouraging findings, which is a fundamental step towards supporting the practical use of greedy matching in D2D sharing. This paper is the first to present the rigorous average analysis of certain representative classes of graphs with random parameters, by proposing a new asymptotic methodology. For typical 2D grids with random matching weights we rigorously prove that our greedy algorithm performs better than $84.9\%$ of the optimal, while for typical Erdos-Renyi random graphs we prove a lower bound of $79\%$ when the graph is neither dense nor sparse. Finally, we use realistic data to show that our random graph models approximate well D2D sharing networks encountered in practice.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑