Sciweavers

Share
TON
2010

Rate Control With Pairwise Intersession Network Coding

8 years 6 months ago
Rate Control With Pairwise Intersession Network Coding
In this paper, we develop a distributed rate-control algorithm for networks with multiple unicast sessions when network coding is allowed across different sessions. Building on recent flow-based characterization of pairwise intersession network coding, the corresponding optimal rate-control problem is formulated as a convex optimization problem. The formulation exploits pairwise coding possibilities between any pair of sessions, where any coded symbol is formed by coding over at most two original symbols. The objective function is the sum of the utilities based on the rates supported by each unicast session. Working on the Lagrangian of the formulated problem, a distributed algorithm is developed with little coordination among intermediate nodes. Each unicast session has the freedom to choose its own utility function. The only information exchange required by the source is the weighted sum of the queue length of each link, which can be piggybacked to the acknowledgment messages. In add...
Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
Added 22 May 2011
Updated 22 May 2011
Type Journal
Year 2010
Where TON
Authors Abdallah Khreishah, Chih-Chun Wang, Ness B. Shroff
Comments (0)
books