Optimizing resource sharing in node-capacitated overlay networks

A frequently occurring problem in the field of distributed systems is to determine an allocation of a generic resource so that the demand of every node in the system is fulfilled. Node-capacitated graphs, i.e. graphs where the weight of a node corresponds to the amount of resources it can give to the system, provide an appealing model that can be readily applied to real-world applications, such as peer-to-peer and grid-based systems. In this paper, we propose a model for this problem and show that it can be reduced to a problem of maximizing a flow in a bipartite network. We then describe a distributed fault-tolerant algorithm which allows each peer to compute the allocation of its resources using only local knowledge. Finally, we show that computing the maximal flow in a bounded-degree graph is NP-complete, which means that optimizing resource sharing in bounded-degree overlays is still an open problem.

[1]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[2]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[3]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[4]  Mohammad Taghi Hajiaghayi,et al.  Oblivious routing on node-capacitated and directed graphs , 2005, SODA '05.

[5]  I. Kamwa,et al.  Causes of the 2003 major grid blackouts in North America and Europe, and recommended means to improve system dynamic performance , 2005, IEEE Transactions on Power Systems.

[6]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[7]  Janka Chlebíková,et al.  Approximating the Maximally Balanced Connected Partition Problem in Graphs , 1996, Inf. Process. Lett..

[8]  Brian D. Noble,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Pastiche: Making Backup Cheap and Easy , 2022 .

[9]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[10]  Laurence A. Wolsey,et al.  The node capacitated graph partitioning problem: A computational study , 1998, Math. Program..

[11]  Laurent Massoulié,et al.  Randomized Decentralized Broadcasting Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[13]  Brian D. Noble,et al.  Samsara: honor among thieves in peer-to-peer storage , 2003, SOSP '03.

[14]  Arobinda Gupta,et al.  A self-stabilizing algorithm for the maximum flow problem , 1997, Distributed Computing.

[15]  Laurent Massoulié,et al.  Push-to-Peer Video-on-Demand System: Design and Evaluation , 2007, IEEE Journal on Selected Areas in Communications.

[16]  András Frank,et al.  An Algorithm for Node-Capacitated Ring Routing , 2005, ESA.

[17]  Patrick Shanahan.  Outline of the proof , 1978 .

[18]  Y. Benkler,et al.  The Wealth of Networks , 2008 .

[19]  Azer Bestavros,et al.  Implications of Selfish Neighbor Selection in Overlay Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.