2015 International Symposium on Network Coding (NetCod)最新文献

Towards unconditional tor-like anonymity 走向无条件的tor式匿名

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176791

I. Safaka, László Czap, K. Argyraki, C. Fragouli

引用次数: 4

Index coding over correlated sources 对相关源进行索引编码

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176785

S. Miyake, J. Muramatsu

引用次数: 6

On adaptive (functional MSR code based) distributed storage systems 基于功能MSR代码的自适应分布式存储系统

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176787

B. K. Rai

{"title":"On adaptive (functional MSR code based) distributed storage systems","authors":"B. K. Rai","doi":"10.1109/NETCOD.2015.7176787","DOIUrl":"https://doi.org/10.1109/NETCOD.2015.7176787","url":null,"abstract":"Suppose that a data storage service provider implements a functional MSR code based distributed storage system (DSS). Consider a scenario where the service provider has implemented an (n1, k1, B, d1, t1) functional MSR code based DSS, where B is the file that is stored. At a later point of time, due to certain considerations (such as storage cost, download bandwidth to repair failed nodes etc.), the service provider wants to convert this (n1, k1, B, d1, t1) functional MSR code based DSS to an (n2, k2, B, d2, t2) functional MSR code based DSS. The service provider wants to perform this conversion at the lowest possible cost, i.e., by downloading the minimum amount of data. The question is: How should one design an (n1, k1, B, d1, t1) functional MSR code based DSS so that it requires minimum download to convert the DSS to an (n2, k2, B, d2, t2) functional MSR code based DSS? In this paper, we propose a coding scheme which requires the minimum download while converting an (n1, k1, B, d1, t1) functional MSR code based DSS to an (n2, k2, B, d2, t2) functional MSR code based DSS.","PeriodicalId":129376,"journal":{"name":"2015 International Symposium on Network Coding (NetCod)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124944645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Exploiting symmetry in computing polyhedral bounds on network coding rate regions 利用对称性计算网络编码率区域的多面体边界

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176793

Jayant Apte, J. Walsh

引用次数: 16

Computer aided proofs for rate regions of independent distributed source coding problems 独立分布式源编码问题的率域计算机辅助证明

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176794

Congduan Li, S. Weber, J. Walsh

引用次数: 8

Benchmarking the performance of hadoop triple replication and erasure coding on a nation-wide distributed cloud 在全国分布式云上对hadoop三重复制和擦除编码的性能进行基准测试

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176790

Lakshmi J. Mohan, Renji Luke Harold, Pablo Ignacio Serrano Caneleo, P. Udaya, A. Harwood

{"title":"Benchmarking the performance of hadoop triple replication and erasure coding on a nation-wide distributed cloud","authors":"Lakshmi J. Mohan, Renji Luke Harold, Pablo Ignacio Serrano Caneleo, P. Udaya, A. Harwood","doi":"10.1109/NETCOD.2015.7176790","DOIUrl":"https://doi.org/10.1109/NETCOD.2015.7176790","url":null,"abstract":"Large Scale distributed storage systems play a vital role in maintaining data across storage locations globally. These systems use replication as the default mechanism for providing fault-tolerance. Recently, erasure codes are being used as a viable alternative to replication, since they provide the same fault-tolerance for reduced storage overhead. However, their performance is unclear in a geographically diverse distributed storage system. This paper compares the performance of triple replication with the erasure coding (Reed-Solomon codes) used in Apache Hadoop's implementation of a distributed file system, on a cluster distributed across Australia that runs on the NeCTAR research cloud. Our results show that using erasure coding does not degrade the read performance in such a setting. We also compare the Hadoop's code with a local reconstruction code, implemented in the XORBAS version of Hadoop. These codes perform well in our clusters but the performance gain observed in our results does not conform to the results reported. Hence, we need new codes that perform better, addressing the geographical diversity issue. We believe that our framework is readily usable to test a range of novel erasure codes that are being introduced in the literature.","PeriodicalId":129376,"journal":{"name":"2015 International Symposium on Network Coding (NetCod)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122567368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Adaptive suppression of inter-packet delay variations in coded packet networks 编码分组网络中包间时延变化的自适应抑制

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176781

Martin E. Jobst, Stephan M. Günther, Maximilian Riemensberger, G. Carle, W. Utschick

{"title":"Adaptive suppression of inter-packet delay variations in coded packet networks","authors":"Martin E. Jobst, Stephan M. Günther, Maximilian Riemensberger, G. Carle, W. Utschick","doi":"10.1109/NETCOD.2015.7176781","DOIUrl":"https://doi.org/10.1109/NETCOD.2015.7176781","url":null,"abstract":"Network coding tends to increase not only the end-to-end delay due to unavoidable buffering of packets, but it also increases the inter-packet delay variations (jitter) due to batching. While an increase in delay does not necessarily adversely affect throughput, sudden delay spikes may interfere with TCP's congestion avoidance mechanism. Such spikes are a common phenomenon in coded packet networks since packet loss may prevent the receiver from decoding a whole generation until sufficient redundant packets have arrived. After successful decoding, a burst of packets is forwarded. In this paper, we propose an adaptive queueing-based approach to minimize the inter-packet delay variation by dynamically delaying decoded packets at the receiver side depending on the current suppression queue backlog, average delay, and packet loss rate. We evaluate our approach by measuring TCP throughput on top of an RLNC system over a lossy wireless link. The TCP throughput significantly improves when our proposed method is used for interpacket delay variation suppression. The method is implemented as a lightweight library and will be made available for download under the GNU GPLv2 at [1].","PeriodicalId":129376,"journal":{"name":"2015 International Symposium on Network Coding (NetCod)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122592537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Network coding for data-retrieving in cloud storage systems 云存储系统数据检索的网络编码

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176788

Yanbo Lu, Jie Hao, Xinji Liu, Shutao Xia

{"title":"Network coding for data-retrieving in cloud storage systems","authors":"Yanbo Lu, Jie Hao, Xinji Liu, Shutao Xia","doi":"10.1109/NETCOD.2015.7176788","DOIUrl":"https://doi.org/10.1109/NETCOD.2015.7176788","url":null,"abstract":"As the rapid growth of data, many storage systems have used erasure codes instead of replication to reduce the storage cost under the same level of reliability. Maximum-Distance- Separable (MDS) codes have been the most widely adopted, due to their optimal storage efficiency. It is well understood that the application of codes in storage systems, where the data is less frequently accessed. For the data, which is stored in cloud storage systems, is frequently accessed (or so-called “hot data”), the performance of data-retrieving is the key metric. To the best of our knowledge, there has been only a little work on the performance of data-retrieving in cloud storage systems with erasure codes. They combined queuing theory with coding theory to analyze and optimize the effect of MDS codes in the performance of data-retrieving. Their studies were based on MDS codes and they gave the solutions. In this paper, we transfer the perspective of study of based on MDS codes to that of optimizing MDS codes in order to improve the performance of data-retrieving, that is, from optimizing the system retrieving strategies to optimizing the coding schemes. We apply Network Coding to optimize the coding schemes and propose a new family of MDS codes, which reach optimal performance of data-retrieving in theory.","PeriodicalId":129376,"journal":{"name":"2015 International Symposium on Network Coding (NetCod)","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133511325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

On the fundamental limits of coded caching and exact-repair regenerating codes 关于编码缓存和精确修复再生代码的基本限制

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176789

C. Tian

引用次数: 9

A hybrid EF/DF protocol with rateless coded network code for two-way relay channel 用于双向中继信道的无速率编码网络码混合EF/DF协议

2015 International Symposium on Network Coding (NetCod) Pub Date : 2015-06-22 DOI: 10.1109/NETCOD.2015.7176796

Dai Jia, Shuang Tian, Jinhong Yuan, Zesong Fei, Jingming Kuang

{"title":"A hybrid EF/DF protocol with rateless coded network code for two-way relay channel","authors":"Dai Jia, Shuang Tian, Jinhong Yuan, Zesong Fei, Jingming Kuang","doi":"10.1109/NETCOD.2015.7176796","DOIUrl":"https://doi.org/10.1109/NETCOD.2015.7176796","url":null,"abstract":"In this paper, we investigate a rateless code design for a two-way relay channel (TWRC) where a network coding operation is employed at the relay. Rateless codes are used at both two users and the relay nodes as it can cope with various channel conditions. We propose a hybrid estimate and forward (EF)/decode and forward (DF) protocol with rateless codes for the TWRC. In the proposed scheme, the relay uses a joint belief propagation (BP) decoding process to decode the messages of two users. Depending on whether the relay recovers both users' messages, only one user's message or no users' messages, the relay will generate three different types of signals, namely, network code (NC), soft network code (SNC) or soft physical-layer network code (SPNC), respectively. We design the degree distribution of the rateless codes for the three nodes of the TWRC, to make it suitable not only for decoding at two users at high SNR, but also for decoding at the relay at low SNR. We show that the proposed hybrid EF/DF protocol with the designed rateless codes outperforms other schemes significantly in terms of bit error rate (BER) performance.","PeriodicalId":129376,"journal":{"name":"2015 International Symposium on Network Coding (NetCod)","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132789865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0