Polynomial-time algorithms for coding across multiple unicasts
نویسنده
چکیده
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network codes within the class of network codes restricted to XOR coding between pairs of flows.
منابع مشابه
On Low-Power Multiple Unicast Network Coding Over a Wireless Triangular Grid
Power saving is an important issue in wireless networks. In this paper, we consider minimizing the power consumption in a network coded wireless network with multiple unicast sessions. We consider a simple network coding strategy termed “reverse carpooling”, which uses only XOR operations at each node. This can reduce the number of transmissions and the corresponding power consumption. We inves...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملPrecoding-Based Techniques for Multiple Unicasts in Wired and Wireless Networks
OF THE DISSERTATION Precoding-Based Techniques for Multiple Unicasts in Wired and Wireless Networks
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملThe Case for Network Coding for Collective Communication on HPC Interconnection Networks
Recently network bandwidth becomes a performance concern particularly for collective communication since bisection bandwidths of supercomputers become far less than their full bisection bandwidths. In this context we propose the use of a network coding technique to reduce the number of unicasts and the size of data transferred in latency-sensitive collective communications in supercomputers. Ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0604096 شماره
صفحات -
تاریخ انتشار 2006