Utility maximization in peer-to-peer systems

In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2P nodes, which are constrained by their uplink capacities. This may be understood as extending Kelly's seminal framework from single-path unicast over general topology to multi-path multicast over P2P topology, with network coding allowed. For certain classes of popular P2P topologies, we show that routing along a linear number of trees per source can achieve the largest rate region that can be possibly obtained by (multi-source) network coding. This simplification result allows us to develop a new multi-tree routing formulation for the problem. Despite of the negative results in literature on applying Primal-dual algorithms to maximize utility under multi-path settings, we have been able to develop a Primal-dual distributed algorithm to maximize the aggregate utility under the multi-path routing environ...

• Type: Journal
• Year: 2008
• Where: SIGMETRICS
• Authors: Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Jin Li, Philip A. Chou
• Keywords: Algorithm, Computer Systems Organization, Hardware, Primal-dual Algorithm, SIGMETRICS 2008