Computer Science > Networking and Internet Architecture
arXiv:1304.6128 (cs)
[Submitted on 22 Apr 2013]
Title:Network Coding-Based Link Failure Recovery over Large Arbitrary Networks
View a PDF of the paper titled Network Coding-Based Link Failure Recovery over Large Arbitrary Networks, by Serhat Nazim Avci and Ender Ayanoglu
View PDFAbstract: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 arbitrary networks. However, its capacity efficiency is restricted by its systematic coding and high design complexity even though it has lower complexity than the other coding-based recovery techniques. Alternative techniques mitigate some of these limitations, but they are difficult to implement over arbitrary networks. In this paper, we propose a novel non-systematic coding technique and a simple design algorithm to implement the diversity coding-based (or network coding-based) recovery over arbitrary networks. The design framework consists of two parts. An ILP formulation for each part is developed. The simulation results suggest that both the novel coding structure and the novel design algorithm lead to higher capacity efficiency for near-hitless recovery. The new design algorithm is able to achieve optimal results in large arbitrary networks.
| Comments: | A copy is submitted to Globecom 2013 conference |
| Subjects: | Networking and Internet Architecture (cs.NI) |
| Cite as: | arXiv:1304.6128 [cs.NI] |
| (orarXiv:1304.6128v1 [cs.NI] for this version) | |
| https://doi.org/10.48550/arXiv.1304.6128 arXiv-issued DOI via DataCite |
Full-text links:
Access Paper:
- View PDF
- TeX Source
- Other Formats
View a PDF of the paper titled Network Coding-Based Link Failure Recovery over Large Arbitrary Networks, by Serhat Nazim Avci and Ender Ayanoglu
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
Litmaps(What is Litmaps?)
scite Smart Citations(What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv(What is alphaXiv?)
CatalyzeX Code Finder for Papers(What is CatalyzeX?)
DagsHub(What is DagsHub?)
Gotit.pub(What is GotitPub?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)
ScienceCast(What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.