[Paper Review] Efficient Algorithms for the Data Exchange Problem

Nebojsa Milosavljevic, Sameer Pawar+3 more|arXiv (Cornell University)|Feb 21, 2015

Cooperative Communication and Network Coding22 references4 citations

TL;DR

This paper presents deterministic, polynomial-time algorithms for the data exchange problem in wireless networks, where users collaboratively recover a shared file using linear combinations of packets. It introduces an optimal scheme minimizing arbitrary convex communication cost functions, with a randomized variant based on random linear network coding for reduced complexity, achieving optimal or near-optimal performance in practice.

ABSTRACT

In this paper we study the data exchange problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-information considered is in the form of linear combinations of the file packets. Given that the collective information of all the users is sufficient to allow recovery of the entire file, the goal is for each user to gain access to the file while minimizing some communication cost. We assume that users can communicate over a noiseless broadcast channel, and that the communication cost is a sum of each user's cost function over the number of bits it transmits. For instance, the communication cost could simply be the total number of bits that needs to be transmitted. In the most general case studied in this paper, each user can have any arbitrary convex cost function. We provide deterministic, polynomial-time algorithms (in the number of users and packets) which find an optimal communication scheme that minimizes the communication cost. To further lower the complexity, we also propose a simple randomized algorithm inspired by our deterministic algorithm which is based on a random linear network coding scheme.

Motivation & Objective

• Address the challenge of minimizing communication cost in peer-to-peer data exchange among users with partial file knowledge.
• Design algorithms that optimally allocate transmission loads under arbitrary convex cost functions per user.
• Ensure minimal total communication while maintaining fairness and scalability in user cooperation.
• Provide a scalable solution for file recovery in cellular networks where base station links are unreliable or overloaded.

Proposed method

• Formulate the data exchange problem as a linear algebraic optimization task over a finite field, where users' side information is represented as linear combinations of file packets.
• Propose a deterministic algorithm that computes an optimal transmission schedule by iteratively identifying users who can contribute the most to rank increase in the collective observation matrix.
• Use a greedy, round-by-round scheduling strategy based on a rank condition: a user is scheduled if their transmission increases the overall system rank beyond a threshold dependent on remaining required information.
• Introduce a randomized variant inspired by random linear network coding, where users transmit random linear combinations to reduce computational complexity while preserving near-optimality.
• Define a feasible rate region using submodular functions and convex cost constraints, and prove equivalence between the optimal solution and a polymatroid-based characterization.
• Leverage the duality between the minimum total transmission and the maximum rank gain to derive a tractable optimization framework.

Experimental results

Research questions

• RQ1 How can we minimize the total communication cost in a data exchange system where users have partial, linearly combined knowledge of a shared file?
• RQ2 What is the optimal allocation of transmission responsibilities among users when each has a distinct, arbitrary convex cost function for sending data?
• RQ3 Can a randomized algorithm achieve near-optimal performance with significantly reduced computational complexity compared to the deterministic solution?
• RQ4 What conditions ensure that a given transmission scheme allows all users to recover the full file with minimal total bits transmitted?

Key findings

• The proposed deterministic algorithm computes an optimal communication scheme in polynomial time with respect to the number of users and file packets.
• The algorithm guarantees that the total number of transmitted symbols is minimized, achieving the theoretical lower bound of 5 symbols in the example with 6 file packets and 3 users.
• The randomized algorithm based on random linear network coding achieves near-optimal performance in practice, significantly reducing computational complexity while maintaining high efficiency.
• The paper proves that the optimal rate vector lies within a polymatroid defined by a hybrid of rank and cost constraints, enabling a clean characterization of feasibility.
• The solution ensures fairness in load distribution by dynamically selecting users based on marginal rank gain and cost efficiency, avoiding overburdening any single user.
• The theoretical framework supports arbitrary convex cost functions, making it applicable to diverse network scenarios such as energy-constrained devices or delay-sensitive applications.