Results 1 - 10
of
13
Issues in Peer-to-Peer Networking: a Coding Optimization Approach
"... Abstract—In this paper we consider a linear optimization approach for studying download finish times in peer-to-peer networks that allow but do not require coding. We demonstrate that using the network coding framework simplifies analysis even in scenarios where the optimal solution does not require ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
Abstract—In this paper we consider a linear optimization approach for studying download finish times in peer-to-peer networks that allow but do not require coding. We demonstrate that using the network coding framework simplifies analysis even in scenarios where the optimal solution does not require coding. For example, we use the network coding framework to disprove the claim of Ezovski et al. that in the absence of coding, the sequential minimization of file download times minimizes the average finish time over all users. We also use this framework to study the effect of requiring reciprocity, a typical feature of incentive-compatible protocols. Lastly, we show that for a dynamically changing network scenario, coding can provide a robust and optimal solution that outperforms routing. I.
Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes
, 2011
"... Content distribution over networks is often achieved by using mirror sites that hold copies of files or portions thereof to avoid congestion and delay issues arising from excessive demands to a single location. Accordingly, there are distributed storage solutions that divide the file into pieces an ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Content distribution over networks is often achieved by using mirror sites that hold copies of files or portions thereof to avoid congestion and delay issues arising from excessive demands to a single location. Accordingly, there are distributed storage solutions that divide the file into pieces and place copies of the pieces (replication) or coded versions of the pieces (coding) at multiple source nodes. We consider a network which uses network coding for multicasting the file. There is a set of source nodes that contains either subsets or coded versions of the pieces of the file. The cost of a given storage solution is defined as the sum of the storage cost and the cost of the flows required to support the multicast. Our interest is in finding the storage capacities and flows at minimum combined cost. We formulate the corresponding optimization problems by using the theory of information measures. In particular, we show that when there are two source nodes, there is no loss in considering subset sources. For three source nodes, we derive a tight upper bound on the cost gap between the coded and uncoded cases. We also present algorithms for determining the content of the source nodes.
Balancing Peer and Server Energy Consumption in Large Peer-to-Peer File Distribution Systems
- Proceedings of IEEE Online Conference on Green Communications (GreenCom), Sept.26-29
, 2011
"... Abstract—Network induced energy consumption is a significant fraction of all ICT energy consumption. This paper investigates the most energy efficient way to distribute a file to a large number of recipients. It is shown that using peer-to-peer and naively minimizing the transfer time results in ene ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Network induced energy consumption is a significant fraction of all ICT energy consumption. This paper investigates the most energy efficient way to distribute a file to a large number of recipients. It is shown that using peer-to-peer and naively minimizing the transfer time results in energy consumption that is an order of magnitude larger than simply distributing directly from a server, but that with careful management peer-to-peer systems can reduce the server’s cost without increasing overall energy consumption. I.
Minimizing Streaming Delay in Homogeneous Peer-to-Peer Networks
"... Abstract—Two questions on the theory of content distribution capacity are addressed in this paper: What is the worst user delay performance bound in a chunk-based P2P streaming systems under peer fanout degree constraint? Can we achieve both the minimum delay and the maximum streaming rate simultane ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Two questions on the theory of content distribution capacity are addressed in this paper: What is the worst user delay performance bound in a chunk-based P2P streaming systems under peer fanout degree constraint? Can we achieve both the minimum delay and the maximum streaming rate simultaneously? In the homogeneous user scenario, we propose a tree-based algorithm called Inverse Waterfilling, which schedules the chunk transmission following an optimal transmitting structure, under fanout degree bound. We show that the algorithm guarantees the delay bound for each chunk of the stream and maintains the maximum streaming rate at the same time. I.
Minimizing weighted sum download time for one-to-many file transfer in peer-to-peer networks
, 2011
"... ..."
Minimizing Weighted Sum Delay for One-to-Many File Transfer in Peer-to-Peer Networks
"... Abstract — This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum delay (WSD) for the one-to-many file transfer where peers have both uplink and downlink bandwidth constraints s ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum delay (WSD) for the one-to-many file transfer where peers have both uplink and downlink bandwidth constraints specified. The static scenario is a file-transfer scheme in which the network resource allocation remains static until all receivers finish downloading. This paper shows that the static scenario can be optimized in polynomial time by convex optimization, and the associated optimal static WSD can be achieved by linear network coding. This paper also proposes a static rateless-codingbased scheme which has almost-optimal empirical performance. The dynamic scenario is a file-transfer scheme which can re-allocate the network resource during the file transfer. This paper proposes a dynamic rateless-coding-based scheme, which provides significantly smaller WSD than the optimal static scheme does. Index Terms—P2P network, network coding, rateless code, static scenario, dynamic scenario. I.
1 Network Coding for Content Distribution and Multimedia Streaming in Peer-to-Peer Networks
"... Peer-to-peer (P2P) networks have been one of the most promising platforms to realize the potential of network coding, since end hosts (referred to as peers) at the edge of the Internet have abundant computational resources with modern processors. In this chapter, we take a journey into the applicati ..."
Abstract
- Add to MetaCart
(Show Context)
Peer-to-peer (P2P) networks have been one of the most promising platforms to realize the potential of network coding, since end hosts (referred to as peers) at the edge of the Internet have abundant computational resources with modern processors. In this chapter, we take a journey into the application world of network coding in P2P networks, with a focus on two important applications: content distribution and multimedia streaming. For each application, we explore the possible design space of P2P systems with network coding, and provide an intuitive explanation for advantages of using network the coding technique. We further unfold our journey through a discussion of several theoretical results and practical issues. 1.1 P2P Content Distribution with Network Coding P2P content distribution has become increasingly popular in current-generation content distribution protocols. The basic idea in P2P content distribution protocols is surprisingly simple. Consider a single server distributing a file (usually hundreds of megabytes or even gigabytes) to a large number of end hosts (peers)
Minimizing Weighted Sum Finish Time for One-to-Many File Transfer in Peer-to-Peer Networks
"... Abstract — This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum finish time (WSFT) for the one-to-many file transfer where peers have both uplink and downlink bandwidth constr ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum finish time (WSFT) for the one-to-many file transfer where peers have both uplink and downlink bandwidth constraints specified. The static scenario is a file-transfer scheme in which the constructed network topology and the network resource (link throughput) allocation remains static until all receivers finish downloading. This paper first shows that the static scenario can be optimized in polynomial time by convex optimization, and the associated optimal static WSFT can be achieved by linear network coding. This paper also proposes a static rateless-coding-based scheme which has almost-optimal empirical performance. The dynamic scenario is a filetransfer scheme which can re-construct the network topology and re-allocate the network resource during the file transfer. This paper proposes a dynamic rateless-codingbased scheme, which provides significantly smaller WSFT than the optimal static scheme does. Index Terms — P2P network, network coding, rateless code, static scenario, dynamic scenario.
