Linear system theory
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
Introduction to Linear Optimization
Introduction to Linear Optimization
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
IEEE/ACM Transactions on Networking (TON)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Congestion control for fair resource allocation in networks with multicast flows
IEEE/ACM Transactions on Networking (TON)
The H.264 Video Coding Standard
IEEE MultiMedia
IEEE/ACM Transactions on Networking (TON)
Utility maximization in peer-to-peer systems
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Multi-rate peer-to-peer video conferencing: a distributed approach using scalable coding
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Minimum-cost multicast over coded packet networks
IEEE Transactions on Information Theory
Distributed utility maximization for network coding based multicasting: a shortest path approach
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we study the problem of utility maximization in peer-to-peer (P2P) systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2P nodes, which are constrained by their uplink capacities. For certain 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 intrasession and intersession network coding. This observation allows us to develop a simple multitree formulation for the problem. For the resulting nonstrictly concave optimization problem, we develop a Primal-dual distributed algorithm and prove its global convergence using our proposed sufficient conditions. These conditions are general and add understanding to the convergence of primal-dual algorithms under nonstrictly concave settings. We implement the proposed distributed algorithm in a peer-assisted multiparty conferencing system by utilizing only end-to-end delay measurements between P2P nodes. We demonstrate its superior performance through actual experiments on a LAN testbed and the Internet.