English
Related papers

Related papers: Optimal Algorithms for Near-Hitless Network Restor…

200 papers

Network coding-based link failure recovery techniques provide near-hitless recovery and offer high capacity efficiency. Diversity coding is the first technique to incorporate coding in this field and is easy to implement over small…

Networking and Internet Architecture · Computer Science 2013-08-12 Serhat Nazim Avci , Ender Ayanoglu

Network coding-based link failure recovery techniques provide near-hitless recovery and offer high capacity efficiency. Diversity coding is the first technique to incorporate coding in this field and is easy to implement over small…

Networking and Internet Architecture · Computer Science 2013-04-24 Serhat Nazim Avci , Ender Ayanoglu

Link failures in wide area networks are common. To recover from such failures, a number of methods such as SONET rings, protection cycles, and source rerouting have been investigated. Two important considerations in such approaches are the…

Networking and Internet Architecture · Computer Science 2025-05-15 S. N. Avci , X. Hu , E. Ayanoglu

Digital contents in large scale distributed storage systems may have different reliability and access delay requirements, and for this reason, erasure codes with different strengths need to be utilized to achieve the best storage…

Information Theory · Computer Science 2016-04-29 Chao Tian , Tie Liu

While most methods for solving mixed-integer optimization problems compute a single optimal solution, a diverse set of near-optimal solutions can often lead to improved outcomes. We present a new method for finding a set of diverse…

Discrete Mathematics · Computer Science 2023-02-09 Izuwa Ahanor , Hugh Medal , Andrew C. Trapp

The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we…

Information Theory · Computer Science 2016-09-22 Parikshit Gopalan , Guangda Hu , Swastik Kopparty , Shubhangi Saraf , Carol Wang , Sergey Yekhanin

We consider the problem of single link failure in an elastic optical network, (also known as flex-grid WDM network). The task is to reroute optical connections that go through the broken link using free capacity of other links of the…

Networking and Internet Architecture · Computer Science 2024-06-17 Alexander Rubtsov , Bruno Bauwens , Dmitri Shmelkin , Elizaveta Rudenko , Alexey Lavrov

Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must be done with the least amount of protection resources, while…

Networking and Internet Architecture · Computer Science 2008-12-16 Salah A. Aly , Ahmed E. Kamal

Software diversity protects against a modern-day exploits such as code-reuse attacks. When an attacker designs a code-reuse attack on an example executable, it relies on replicating the target environment. With software diversity, the…

Programming Languages · Computer Science 2013-12-16 Michael Stewart

Ultra-reliable low-latency communication is essential in mission-critical settings, including military applications, where persistent and asymmetric link blockages caused by mobility, jamming, or adversarial attacks can disrupt…

Information Theory · Computer Science 2025-08-26 Mine Gokce Dogan , Abhiram Kadiyala , Jaimin Shah , Martina Cardone , Christina Fragouli

In this paper, a transmission protocol is studied for a two relay wireless network in which simple repetition coding is applied at the relays. Information-theoretic achievable rates for this transmission scheme are given, and a space-time…

Information Theory · Computer Science 2016-11-17 Yijia Fan , Chao Wang , John Thompson , H. Vincent Poor

In a distributed storage systems (DSS) with $k$ systematic nodes, robustness against node failure is commonly provided by storing redundancy in a number of other nodes and performing repair mechanism to reproduce the content of the failed…

Information Theory · Computer Science 2018-01-01 Kaveh Mahdaviani , Soheil Mohajer , Ashish Khisti

Distributed storage systems need to store data redundantly in order to provide some fault-tolerance and guarantee system reliability. Different coding techniques have been proposed to provide the required redundancy more efficiently than…

Information Theory · Computer Science 2016-11-15 Lluis Pamies-Juarez , Henk D. L. Hollmann , Frédérique Oggier

Network coding and cooperative communication have received considerable attention from the research community recently in order to mitigate the adverse effects of fading in wireless transmissions and at the same time to achieve high…

Information Theory · Computer Science 2010-04-20 Hakan Topakkaya , Zhengdao Wang

We propose a simple yet effective wireless network coding and decoding technique for a multiple unicast network. It utilizes spatial diversity through cooperation between nodes which carry out distributed encoding operations dictated by…

Information Theory · Computer Science 2012-09-06 Tugcan Aktas , A. Ozgur Yilmaz , Emre Aktas

The continuously increasing amount of digital data generated by today's society asks for better storage solutions. This survey looks at a new generation of coding techniques designed specifically for the needs of distributed networked…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-01-31 Anwitaman Datta , Frederique Oggier

Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-12 Lluis Pamies-Juarez , Frédérique Oggier , Anwitaman Datta

Regenerating codes are efficient methods for distributed storage in storage networks, where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrarily chosen…

Information Theory · Computer Science 2017-11-09 Kaveh Mahdaviani , Ashish Khisti , Soheil Mohajer

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding…

Information Theory · Computer Science 2016-11-18 Aggelos Bletsas , Ashish Khisti , David P. Reed , Andrew Lippman

In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the…

Information Theory · Computer Science 2018-01-01 Kaveh Mahdaviani , Soheil Mohajer , Ashish Khisti
‹ Prev 1 2 3 10 Next ›