English
Related papers

Related papers: Max-Flow Protection using Network Coding

200 papers

There is a rich recent literature on how to assist secure communication between a single transmitter and receiver at the physical layer of wireless networks through techniques such as cooperative jamming. In this paper, we consider how…

Networking and Internet Architecture · Computer Science 2013-04-10 Majid Ghaderi , Dennis Goeckel , Ariel Orda , Mostafa Dehghan

Redundancy is commonly used to guarantee continued functionality in networked systems. However, often many nodes are vulnerable to the same failure or adversary. A "backup" path is not sufficient if both paths depend on nodes which share a…

Physics and Society · Physics 2016-11-02 Sebastian M. Krause , Michael M. Danziger , Vinko Zlatić

For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and little is known about its complexity. Most of the existing solutions rely on very restricted classes of…

Information Theory · Computer Science 2015-03-02 Ying Cui , Muriel Médard , Edmund Yeh , Douglas Leith , Ken Duffy

In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a…

Networking and Internet Architecture · Computer Science 2012-06-14 Bo Ji , Changhee Joo , Ness B. Shroff

A common problem in science networks and private wide area networks (WANs) is that of achieving predictable data transfers of multiple concurrent flows by maintaining specific pacing rates for each. We address this problem by developing a…

Networking and Internet Architecture · Computer Science 2020-02-25 Taran Lynn , Dipak Ghosal , Nathan Hanford

This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…

Information Theory · Computer Science 2015-12-18 Pedro H. J. Nardelli , Hirley Alves , Carlos H. M. de Lima , Matti Latva-aho

The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-design problem: given a…

Data Structures and Algorithms · Computer Science 2015-06-02 Samir Khuller , Balaji Raghavachari , Neal E. Young

In this thesis, we design algorithms for several NP-hard problems in both worst and beyond worst case settings. In the first part of the thesis, we apply the traditional worst case methodology and design approximation algorithms for the Hub…

Data Structures and Algorithms · Computer Science 2018-07-26 Haris Angelidakis

In this paper we analyze a continuous version of the maximal covering location problem, in which the facilities are required to be interconnected by means of a graph structure in which two facilities are allowed to be linked if a given…

Optimization and Control · Mathematics 2020-05-08 Víctor Blanco , Ricardo Gázquez

Single-user multiple-input / multiple-output (SU-MIMO) communication systems have been successfully used over the years and have provided a significant increase on a wireless link's capacity by enabling the transmission of multiple data…

Information Theory · Computer Science 2017-07-06 George K. Papageorgiou , Konstantinos Ntougias , Constantinos B. Papadias

We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e.…

Networking and Internet Architecture · Computer Science 2016-11-15 MinJi Kim , Jay Kumar Sundararajan , Muriel Medard

Due to the importance of robustness in many real-world optimization problems, the field of robust optimization has gained a lot of attention over the past decade. We concentrate on maximum flow problems and introduce a novel robust…

Discrete Mathematics · Computer Science 2016-01-15 Jannik Matuschke , S. Thomas McCormick , Gianpaolo Oriolo , Britta Peis , Martin Skutella

Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention.…

Discrete Mathematics · Computer Science 2017-05-24 Fabian Mies , Britta Peis , Andreas Wierz

Packet networks need to maintain state in the form of forwarding tables at each switch. The cost of this state increases as networks support ever more sophisticated per-flow routing, traffic engineering, and service chaining. Per-flow or…

Networking and Internet Architecture · Computer Science 2017-06-23 Adiseshu Hari , Urs Niesen , Gordon Wilfong

In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the…

Information Theory · Computer Science 2015-02-11 Maha Zohdy , Tamer ElBatt , Mohamed Nafie

We consider the multiple unicast problem under network coding over directed acyclic networks when there are two source-terminal pairs, $s_1-t_1$ and $s_2-t_2$. Current characterizations of the multiple unicast capacity region in this…

Information Theory · Computer Science 2011-11-03 Shurui Huang , Aditya Ramamoorthy

Multipath communication not only allows improved throughput but can also be used to leverage different path characteristics to best fulfill each application's objective. In particular, certain delay-sensitive applications, such as real time…

Networking and Internet Architecture · Computer Science 2017-07-06 Laurent Chuat , Adrian Perrig , Yih-Chun Hu

Software Defined Networking (SDN) brings numbers of advantages along with many challenges. One particular concern is on the control-plane resilience, while the existing protection approaches proposed for SDN networks mainly focus on…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-11-08 Huawei Huang , Song Guo , Weifa Liang , Keqiu Li , Baoliu Ye

In optical-processing-enabled network, transitional lightpaths crossing the same node could be optically encoded to each other to achieve greater spectral efficiency. In this context, we present a new research problem, entitled, routing,…

Networking and Internet Architecture · Computer Science 2022-04-27 Dao Thanh Hai

Nodes in contemporary radio networks often have multiple interfaces available for communication: WiFi, cellular, LoRa, Zigbee, etc. This motivates understanding both link and network configuration when multiple communication modalities with…

Signal Processing · Electrical Eng. & Systems 2025-01-10 Amna Gillani , Beatriz Lorenzo , Majid Ghaderi , Fikadu Dagefu , Dennis Goeckel