Minimum-cost multicast over coded packet networks

Lun, Desmond S.; Ratnakar, N.; Médard, Muriel; Koetter, R.; Karger, David R.; Ho, Tracey; Ahmed, Ebad; Zhao, Fang

doi:10.1109/tit.2006.874523

Cited by 345 publications

(384 citation statements)

References 53 publications

(111 reference statements)

Supporting

Mentioning

380

Contrasting

Order By: Relevance

“…In many cases, the use of a relay node will incur a cost, for example representing the energy consumption of the relay. The use of network coding can also reduce this cost [4], [5]. For example, with network coding a single transmission by the relay can be used to forward one packet from each source simultaneously, while with plain routing this would require two transmissions.…”

Section: Introductionmentioning

confidence: 99%

Cost sharing with network coding in two-way relay networks

Ciftcioglu

Sagduyu

Berry

et al. 2009

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-We consider a scenario in which two sources exchange stochastically varying traffic with the aid of a bidirectional relay that may perform network coding over the incoming packets. Each relay use incurs a unit cost, e.g., transmission energy. This cost is shared between the sources when packets from both are transmitted via network coding; if traffic from a single source is sent, the cost is passed on to only that source. We study transmission policies which trade-off the average cost with the average packet delay. First, we analyze the cost-delay trade-off for a centralized control scheme using Lyapunov stability arguments. We then consider a distributed control scheme, where each source selfishly optimizes its own cost-delay trade-off by playing a non-cooperative game. We determine the Nash equilibrium and show that it performs worse than the centralized algorithm. However, appropriate pricing at the relay achieves the centralized performance. These algorithms require full information of queue backlogs. Next, we relax this assumption and any source makes the transmission decision depending on whether the other sources queue backlog exceeds a threshold, or not. This needs only one bit information exchange and leads to asymptotically optimal cost, as the delay grows. Finally, we consider cost sharing with only local queue information at each source. The results illustrate new cost-delay trade-offs based on different levels of cooperation and queue information availability.

show abstract

Section: Introductionmentioning

confidence: 99%

Cost sharing with network coding in two-way relay networks

Ciftcioglu

Sagduyu

Berry

et al. 2009

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

show abstract

“…Let also q = 2 4 . The code C can be chosen to be the Reed-Solomon code with parameters C = [15,11,5] q . The parity check matrix of C can be written as follows…”

Section: Is There An Alternative Approach?mentioning

confidence: 99%

“…Second, it allows to find the optimal values using smaller complexity. For example, for some cases, an optimization problem that is computationally hard, i.e., required essentially an exhaustive search of the routing solution space, can now be solved efficiently [11]. In some other cases, even a randomly selected solution in the increased space is optimal with high probability [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

Network Coding: Beyond Throughput Benefits

Fragouli

2011

Proc. IEEE

View full text Add to dashboard Cite

Abstract-Network coding enables novel network functionalities and thus offers a wider canvas of choices when optimizing an information flow problem. In this paper we examine the simplest possible information flow problem, a unicast connection, and explore what we believe is one of the most attractive features network coding offers: the ability to enable near optimal performance in a completely decentralized and randomized setting. This is an especially attractive feature for wireless applications. However, it comes at the cost of an overhead in terms of rate, that can be significant for applications that operate using relatively short frame lengths, as is the case in the wireless setting. We review the efforts in the literature to either alleviate this overhead, or alternatively, to exploit it for network management and control.

show abstract

“…So, flows of different sessions cannot be combined and have to share the network resources. The problem can be written as follows, extending the formulation in [3] for multiple sessions:…”

Section: A No Inter-session Coding (Nic)mentioning

confidence: 99%

“…The original sessions and the virtual multicast can be characterized in terms of flows from sources to terminals, similar to [3]. Therefore, the whole problem can be stated as a convex flow optimization problem.…”

mentioning

confidence: 99%

Wireless Inter-Session Network Coding - An Approach Using Virtual Multicasts

Heindlmaier

Lun

Traskov

et al. 2011

2011 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-This paper addresses the problem of inter-session network coding to maximize throughput for multiple communication sessions in wireless networks. We introduce virtual multicast connections which can extract packets from original sessions and code them together. Random linear network codes can be used for these virtual multicasts. The problem can be stated as a flowbased convex optimization problem with side constraints. The proposed formulation provides a rate region which is at least as large as the region without inter-session network coding. We show the benefits of our technique for several scenarios by means of simulation. The optimal solution for inter-session network coding might require nonlinear encoding functions [6] and even deciding a linear inter-session coding problem can be NP-complete [7]. Nonetheless, suboptimal linear coding schemes have been proposed both for wireline and wireless networks. Previous work on inter-session coding for wireline networks has focused on a graph-theoretic characterization of network codes [8], [9]. For example, in [10], the authors present an approach to translate the solution for the well-known butterfly network to larger networks. In [11] inter-session network coding is combined with multiple description coding. Recent work [12] presented an interference alignment approach to perform intersession coding. I. INTRODUCTIONWe focus on wireless networks, where the most prominent technique is the COPE protocol [13] which exploits the broadcast nature of the wireless medium. As shown in Fig. 1a, the number of transmissions can be reduced compared to routing if packets from different sessions are combined. This technique is called reverse carpooling in [14] due to the fact that the combined information has to travel in opposite directions. The interplay of the COPE protocol with medium access has been analyzed in [15] and approaches to model its performance were proposed in [16], [17]. COPE has been successfully implemented and shows gains especially when the reverse carpooling situation occurs.

show abstract

Minimum-cost multicast over coded packet networks

Cited by 345 publications

References 53 publications

Cost sharing with network coding in two-way relay networks

Cost sharing with network coding in two-way relay networks

Network Coding: Beyond Throughput Benefits

Wireless Inter-Session Network Coding - An Approach Using Virtual Multicasts

Contact Info

Product

Resources

About