Filters








2,903 Hits in 5.5 sec

Network Coding Gaps for Completion Times of Multiple Unicasts [article]

Bernhard Haeupler, David Wajc, Goran Zuzic
2020 arXiv   pre-print
We study network coding gaps for the problem of makespan minimization of multiple unicasts.  ...  Our results also hold for average completion time, and more generally any ℓ_p norm of completion times.  ...  Acknowledgements The authors would like to thank Mohsen Ghaffari for suggesting an improvement to Theorem 1.2 which resulted in a coding gap independent of n, Anupam Gupta for pointing out a simplification  ... 
arXiv:1905.02805v3 fatcat:dq4mgw5s35cntgqubqvwpx2zvq

Delay-constrained unicast and the triangle-cast problem

Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath
2015 2015 IEEE International Symposium on Information Theory (ISIT)  
We consider the single-unicast communication problem in a network with a delay constraint. For this setting, it has recently been shown that network coding offers an advantage over routing.  ...  The key insight is a connection to a new traffic model that we call triangle-cast (or degraded multiple-unicast), for which we obtain a logarithmic flow-cut gap by suitably adapting the techniques from  ...  ACKNOWLEDGEMENTS Sudeep Kamath would like to acknowledge support from the Center for Science of Information (CSoI), an NSF Science and Technology Center, under grant agreement CCF-0939370.  ... 
doi:10.1109/isit.2015.7282566 dblp:conf/isit/ChekuriKKV15 fatcat:ehpxyaemjredzhhi6ziu6qwyti

Bounding Multiple Unicasts through Index Coding and Locally Repairable Codes [article]

Karthikeyan Shanmugam, Alexandros G. Dimakis
2014 arXiv   pre-print
Our second result uses this duality to establish a new upper bound for the multiple unicast network coding problem.  ...  We believe that our bound could lead to a logarithmic approximation factor for multiple unicast network coding if a plausible connection we state is verified.  ...  Fig. 2 : 2 Illustration of an example multiple unicast network coding instance along with a multiple unicast code and a correlated unicast code.  ... 
arXiv:1402.3895v1 fatcat:z5c35n6sjjhg7puu6ugor4zgcy

On the multiple unicast network coding, conjecture

Michael Langberg, Muriel Medard
2009 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
In this paper, we study the multiple unicast network communication problem on undirected graphs.  ...  It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing.  ...  For directed networks it was shown in [4] that any general network coding problem can be reduced to a multiple-unicast network coding instance in which there are k source/terminal pairs (s i , t i )  ... 
doi:10.1109/allerton.2009.5394800 fatcat:7v7bebc6drgzbfduqhyf6xtqxy

Approximately Optimal Wireless Broadcasting

S. Kannan, A. Raja, P. Viswanath
2012 IEEE Transactions on Information Theory  
with an outer Marton code for the induced deterministic broadcast channel.  ...  We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the potential aid of relays and cooperation between destinations.  ...  Lemma 4 . 4 [2] Given a zero-error coding scheme for the DSN unicast network of rate R, a pruned coding scheme of rate R − κ (with κ = log(6|V| − 1) + 11) can be created for the DSN unicast network and  ... 
doi:10.1109/tit.2012.2211566 fatcat:hh65xhplbjbs7kceef4biaj2ta

Space information flow: Multiple unicast

Zongpeng Li, Chuan Wu
2012 2012 IEEE International Symposium on Information Theory Proceedings  
The multiple unicast network coding conjecture states that for multiple unicast in an undirected network, network coding is equivalent to routing.  ...  Simple and intuitive as it appears, the conjecture has remained open since its proposal in 2004 [1], [2], and is now a well-known unsolved problem in the field of network coding.  ...  In directed networks, network coding can augment the capacity region of multiple unicast.  ... 
doi:10.1109/isit.2012.6283627 dblp:conf/isit/LiW12 fatcat:kvyf2yc3mzd4thrhi7to2x3mlq

A Geometric Perspective to Multiple-Unicast Network Coding

Tang Xiahou, Zongpeng Li, Chuan Wu, Jiaqing Huang
2014 IEEE Transactions on Information Theory  
The multiple-unicast network coding conjecture states that for multiple unicast sessions in an undirected network, network coding is equivalent to routing.  ...  Based on a recently proposed tool of space information flow, we present a geometric framework for analyzing the multiple-unicast conjecture.  ...  If the network is directed, network coding can outperform routing for multiple unicast sessions.  ... 
doi:10.1109/tit.2014.2308998 fatcat:5opkwlrfrbf5vfyrkcvgljvf6i

On Approximating the Sum-Rate for Multiple-Unicasts [article]

Karthikeyan Shanmugam, Megasthenis Asteris, Alexandros G. Dimakis
2015 arXiv   pre-print
We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with k independent sources.  ...  field can heavily impact the performance of a linear network code.  ...  From Multiple-Unicasts Network Coding to Index Coding Consider a multiple-unicasts network G with k sources and m links.  ... 
arXiv:1504.05294v2 fatcat:r4tlubgisnh6hcs6h5snyfi62q

SCDP: Systematic Rateless Coding for Efficient Data Transport in Data Centres [article]

Mohammed Alasmar and George Parisis and Jon Crowcroft
2019 arXiv   pre-print
Incast and Outcast are eliminated; (3) the systematic nature of RaptorQ codes, in combination with MLFQ, enable fast, decoding-free completion of short flows.  ...  many-to-one data transport; (2) on top of RaptorQ codes, receiver-driven flow control, in combination with in-network packet trimming, enable efficient usage of network resources as well as multi-path  ...  in many-to-one communication, while performing at least as well as the state of the art with respect to goodput and flow completion time for long and short unicast flows, respectively.  ... 
arXiv:1909.08928v1 fatcat:mhwigd2ffbaoxex2mon32gzpde

Topological Interference Management Through Index Coding

Syed Ali Jafar
2014 IEEE Transactions on Information Theory  
The network capacity (wired) and DoF (wireless) are found to be bounded above by the capacity of an index coding problem for which the antidote graph is the complement of the given interference graph.  ...  An interference alignment perspective is then used to translate the existing index coding solutions into the wired network capacity and wireless network DoF solutions, as well as to find new and unified  ...  an index coding problem, even for the simpler setting of multiple unicast.  ... 
doi:10.1109/tit.2013.2285151 fatcat:nkj6paddh5ayxnzhnko2haxjse

A high-performance communication service for parallel computing on distributed DSP systems

James Kohout, Alan D. George
2003 Parallel Computing  
the data needed, and completing and reviewing the collection of information.  ...  This paper presents the design and analysis of such a service, based on the MPI specification, for unicast and collective communications.  ...  Acknowledgements This work was supported in part by grant N00014-99-1-0278 from the Office of Naval Research, and by equipment and software tools provided by vendor sponsors including Nortel Networks,  ... 
doi:10.1016/s0167-8191(03)00061-9 fatcat:ugbeg62t5vakpmrurfteng65gm

Pioneering Studies on LTE eMBMS: Towards 5G Point - to-Multipoint Transmissions

Hongzhi Chen, De Mi, Manuel Fuentes, David Vargas, Eduardo Garro, Jose Luis Carccl, Belkacem Mouhouche, Pei Xiao, Rahim Tafazolli
2018 2018 IEEE 10th Sensor Array and Multichannel Signal Processing Workshop (SAM)  
., multiple antennas and millimeter wave, and its potentials to meet the requirements of next generation PTM transmissions.  ...  Then based on the simulation analysis, we discuss potential improvements for the two current eMBMS solutions, i.e., MBSFN (MBMS over Single Frequency Networks) and SC-PTM (Single-Cell PTM).  ...  , since the last one does not support the use of multiple antennas with multiple codewords.  ... 
doi:10.1109/sam.2018.8448955 dblp:conf/ieeesam/ChenMFVGCMXT18 fatcat:5xspudprmfhvfgjhvi4mnfxc7i

Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach

Sreeram Kannan, Pramod Viswanath
2014 IEEE Transactions on Information Theory  
A classical result in undirected wireline networks is the near optimality of routing (flow) for multiple-unicast traffic (multiple sources communicating independent messages to multiple destinations):  ...  In particular, we show the following meta-theorem: if for a given channel and its reciprocal channel, the cut-set bound is (approximately) achievable, then for multiple-unicast in a bidirected network  ...  Acknowledgements The authors would like to thank Chandra Chekuri and Adnan Raja for several useful discussions.  ... 
doi:10.1109/tit.2014.2347277 fatcat:mapirxy4tzhphpdpzulpx27jaa

A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks

Zongpeng Li, Baochun Li, Lap Chi Lau
2009 IEEE Transactions on Information Theory  
In this paper, we prove that in undirected networks, the ratio of achievable multicast throughput with network coding to that without network coding is bounded by a constant ratio of 2, i.e., network coding  ...  A fundamental question in the field of network coding is: how large can the throughput improvement due to network coding be?  ...  For example, Dougherty and Zeger [32] demonstrated a specific (directed) network N 7 consisting of multiple unicast sessions, such that N 7 has a network coding solution while its reverse network does  ... 
doi:10.1109/tit.2008.2011516 fatcat:pf6qktx5i5fthdjlvngfy4hi7q

Multihop Wireless Networks: A Unified Approach to Relaying and Interference Management

Ilan Shomorony, Salman Avestimehr
2013 Foundations and Trends® in Networking  
These techniques yield a complete characterization of the degrees of freedom of two-unicast layered networks as a function of the network graph.  ...  Interestingly, we show that with such schemes we can achieve 4/3 degrees of freedom by effectively creating distinct network topologies at different times and coding across them.  ... 
doi:10.1561/1300000044 fatcat:cyvs72m5kze27criokho35oli4
« Previous Showing results 1 — 15 out of 2,903 results