English
Related papers

Related papers: Network Coding-based Protection Strategies Against…

200 papers

In practice, since many communication networks are huge in scale or complicated in structure even dynamic, the predesigned network codes based on the network topology is impossible even if the topological structure is known. Therefore,…

Information Theory · Computer Science 2010-10-12 Xuan Guang , Fang-Wei Fu

This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the…

Information Theory · Computer Science 2022-03-08 Amjad Saeed Khan , Ioannis Chatzigeorgiou

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

By allowing intermediate nodes to perform non-trivial operations on packets, such as mixing data from multiple streams, network coding breaks with the ruling store and forward networking paradigm and opens a myriad of challenging security…

Cryptography and Security · Computer Science 2008-09-09 Luísa Lima , João P. Vilela , Paulo F. Oliveira , João Barros

p-Cycles offer ring-like switching speed and mesh-like spare capacity efficiency for protecting network against link failures. This makes them extremely efficient and effective protection technique. p-Cycles can also protect all the links…

Networking and Internet Architecture · Computer Science 2022-12-05 Varsha Lohani , Anjali Sharma , Yatindra Nath Singh

Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits…

Cryptography and Security · Computer Science 2016-11-17 Joao P. Vilela , Luisa Lima , Joao Barros

This paper introduces the Hub Location Problem under Link Failures, a hub location problem in which activated inter-hub links may fail with a given probability. Two different optimization models are studied, which construct hub backbone…

Optimization and Control · Mathematics 2022-04-11 Víctor Blanco , Elena Fernández , Yolanda Hinojosa

The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can significantly increase the overall throughput of wireless networks by…

Information Theory · Computer Science 2007-07-13 Salim Y. El Rouayheb , Mohammad Asad R. Chaudhry , Alex Sprintson

In our daily lives, we rely on the proper functioning of supply networks, from power grids to water transmission systems. A single failure in these critical infrastructures can lead to a complete collapse through a cascading failure…

Physics and Society · Physics 2021-06-03 Franz Kaiser , Vito Latora , Dirk Witthaut

Software-driven cloud networking is a new paradigm in orchestrating physical resources (CPU, network bandwidth, energy, storage) allocated to network functions, services, and applications, which is commonly modeled as a cross-layer network.…

Networking and Internet Architecture · Computer Science 2017-09-12 Zhili Zhou , Tachun Lin

The millimeter-wave bands have been attracting significant interest as a means to achieve major improvements in data rates and network efficiencies. One significant limitation for use of the millimeter-wave bands for cellular communication…

Networking and Internet Architecture · Computer Science 2015-12-10 Murali Narasimha , Hossein Bagheri

In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, we show that coding operations are sufficient to perform at…

Information Theory · Computer Science 2014-09-15 Peter Babarczi , Janos Tapolcai , Lajos Ronyai , Muriel Medard

We consider protection problems in multilayer networks. In single-layer networks, a pair of disjoint paths can be used to provide protection for a source-destination pair. However, this approach cannot be directly applied to layered…

Optimization and Control · Mathematics 2013-05-01 Marzieh Parandehgheibi , Hyang-Won Lee , Eytan Modiano

Link prediction is one of the fundamental problems in computational social science. A particularly common means to predict existence of unobserved links is via structural similarity metrics, such as the number of common neighbors; node…

Social and Information Networks · Computer Science 2019-01-01 Kai Zhou , Tomasz P. Michalak , Talal Rahwan , Marcin Waniek , Yevgeniy Vorobeychik

This paper characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to…

Information Theory · Computer Science 2018-10-16 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

This work provides a survey of several networking cipher algorithms and proposes a method for integrating natural language processing (NLP) as a protective agent for them. Two main proposals are covered for the use of NLP in networking.…

Computation and Language · Computer Science 2022-06-23 John E. Ortega

We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to…

While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to "pollution attacks," as the injection of even a single erroneous packet has the potential to corrupt each and every packet…

Information Theory · Computer Science 2019-05-07 Da Wang , Danilo Silva , Frank R. Kschischang

In any communication network, the maximum number of link-disjoint paths between any pair of communicating nodes, S and T, is limited by the S-T minimum link-cut. Multipath routing protocols have been proposed in the literature to make use…

Networking and Internet Architecture · Computer Science 2009-08-06 Osameh M. Al-Kofahi , Ahmed E. Kamal

This paper studies a survivable traffic grooming problem in large-scale optical transport networks under double-link failures (STG2). Each communication demand must be assigned a route for every possible scenario involving zero, one, or two…

Combinatorics · Mathematics 2025-06-17 Silong Zhang , Jixuan Feng , Junyan Liu , Yu Liu , Zhou Xu , Fan Zhang