Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191392
G. Kramer
Recent coding strategies for deterministic and noisy relay networks are related to the pipelining of block Markov encoding. For deterministic networks, it is shown that pipelined encoding improves encoding delay, as opposed to end-to-end delay. For noisy networks, it is observed that decode-and-forward exhibits good rate scaling when the signal-to-noise ratio (SNR) increases.
{"title":"Pipelined encoding for deterministic and noisy relay networks","authors":"G. Kramer","doi":"10.1109/NETCOD.2009.5191392","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191392","url":null,"abstract":"Recent coding strategies for deterministic and noisy relay networks are related to the pipelining of block Markov encoding. For deterministic networks, it is shown that pipelined encoding improves encoding delay, as opposed to end-to-end delay. For noisy networks, it is observed that decode-and-forward exhibits good rate scaling when the signal-to-noise ratio (SNR) increases.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127410273","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5437470
J. Sundararajan, P. Sadeghi, M. Médard
We propose a new feedback-based adaptive coding scheme for a packet erasure broadcast channel. The main performance metric of interest is the delay. We consider two types of delay - decoding delay and delivery delay. Decoding delay is the time difference between the instant when the packet is decoded at an arbitrary receiver and the instant when it arrived at the sender. Delivery delay also includes the period when a decoded packet waits in a resequencing buffer at the receiver until all previous packets have also been decoded. This notion of delay is motivated by applications that accept packets only in order. Our coding scheme has the innovation guarantee property and is hence throughput optimal. It also allows efficient queue management. It uses the simple strategy of mixing only the oldest undecoded packet of each receiver, and therefore extends to any number of receivers. We conjecture that this scheme achieves the asymptotically optimal delivery (and hence decoding) delay. The asymptotic behavior is studied in the limit as the load factor of the system approaches capacity. This conjecture is verified through simulations.
{"title":"A feedback-based adaptive broadcast coding scheme for reducing in-order delivery delay","authors":"J. Sundararajan, P. Sadeghi, M. Médard","doi":"10.1109/NETCOD.2009.5437470","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5437470","url":null,"abstract":"We propose a new feedback-based adaptive coding scheme for a packet erasure broadcast channel. The main performance metric of interest is the delay. We consider two types of delay - decoding delay and delivery delay. Decoding delay is the time difference between the instant when the packet is decoded at an arbitrary receiver and the instant when it arrived at the sender. Delivery delay also includes the period when a decoded packet waits in a resequencing buffer at the receiver until all previous packets have also been decoded. This notion of delay is motivated by applications that accept packets only in order. Our coding scheme has the innovation guarantee property and is hence throughput optimal. It also allows efficient queue management. It uses the simple strategy of mixing only the oldest undecoded packet of each receiver, and therefore extends to any number of receivers. We conjecture that this scheme achieves the asymptotically optimal delivery (and hence decoding) delay. The asymptotic behavior is studied in the limit as the load factor of the system approaches capacity. This conjecture is verified through simulations.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125440137","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191401
C. Ngai, R. Yeung
We investigate transmission of information in a network in the presence of an adversary that can eavesdrop k channels and inject d errors into the network at the same time. We propose a deterministic construction of a secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all the sink nodes which protecting the information from eavesdropping and contamination by the adversary, where m is the minimum maxflow among all the sink nodes. We also show that this rate is optimal.
{"title":"Secure error-correcting (SEC) network codes","authors":"C. Ngai, R. Yeung","doi":"10.1109/NETCOD.2009.5191401","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191401","url":null,"abstract":"We investigate transmission of information in a network in the presence of an adversary that can eavesdrop k channels and inject d errors into the network at the same time. We propose a deterministic construction of a secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all the sink nodes which protecting the information from eavesdropping and contamination by the adversary, where m is the minimum maxflow among all the sink nodes. We also show that this rate is optimal.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126671815","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191386
Kui Wu, W. Jia, Yuan Yuan, Yuming Jiang
With network coding, a network node can code information flows before forwarding them. While it has been theoretically proved that network coding can achieve maximum network throughput, the theoretical results usually do not consider the burstiness of data traffic, delays, and the stochastic nature in information processing and transmission. There is currently no theory to systematically model and evaluate the performance of network coding, especially when nodes' capacity (i.e., coding and transmission) becomes stochastic. Without such a theory, the performance of network coding under various practical system settings is far from clear. To fill the vacancy, we develop an analytical approach by extending the stochastic network calculus theory to tackle the special difficulties in the evaluation of network coding. We prove the new properties of stochastic network calculus for network coding, which are used to derive the stochastic end-to-end delay and throughput.
{"title":"Performance modeling of stochastic networks with network coding","authors":"Kui Wu, W. Jia, Yuan Yuan, Yuming Jiang","doi":"10.1109/NETCOD.2009.5191386","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191386","url":null,"abstract":"With network coding, a network node can code information flows before forwarding them. While it has been theoretically proved that network coding can achieve maximum network throughput, the theoretical results usually do not consider the burstiness of data traffic, delays, and the stochastic nature in information processing and transmission. There is currently no theory to systematically model and evaluate the performance of network coding, especially when nodes' capacity (i.e., coding and transmission) becomes stochastic. Without such a theory, the performance of network coding under various practical system settings is far from clear. To fill the vacancy, we develop an analytical approach by extending the stochastic network calculus theory to tackle the special difficulties in the evaluation of network coding. We prove the new properties of stochastic network calculus for network coding, which are used to derive the stochastic end-to-end delay and throughput.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121641957","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191394
L. Georgiadis, L. Tassiulas
We consider the two-user broadcast erasure channel where feedback in the form of ack messages is fed back to the transmitter. We provide an upper bound to the capacity region of this system. We then present two algorithms whose rate region (information bits per transmitted bit) becomes arbitrarily close to the upper bound for large packet sizes. The first algorithm relies on random coding techniques while the second relies only on XOR operations between pairs of packets. Complexity and feedback information tradeoffs for the two algorithms are discussed. For the case where, in addition to traffic destined exclusively to either one of the users there is additional multicast traffic, we present an algorithm that shows that the rate region of the system can be increased by allowing intersession coding. Finally, for the case where there are random arrivals to the system we present an algorithm, based on the previous algorithms, whose stability region gets close to the capacity region for reasonably large packet sizes. The latter algorithm operates without knowledge of arrival process and channel statistics.
{"title":"Broadcast erasure channel with feedback - Capacity and algorithms","authors":"L. Georgiadis, L. Tassiulas","doi":"10.1109/NETCOD.2009.5191394","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191394","url":null,"abstract":"We consider the two-user broadcast erasure channel where feedback in the form of ack messages is fed back to the transmitter. We provide an upper bound to the capacity region of this system. We then present two algorithms whose rate region (information bits per transmitted bit) becomes arbitrarily close to the upper bound for large packet sizes. The first algorithm relies on random coding techniques while the second relies only on XOR operations between pairs of packets. Complexity and feedback information tradeoffs for the two algorithms are discussed. For the case where, in addition to traffic destined exclusively to either one of the users there is additional multicast traffic, we present an algorithm that shows that the rate region of the system can be increased by allowing intersession coding. Finally, for the case where there are random arrivals to the system we present an algorithm, based on the previous algorithms, whose stability region gets close to the capacity region for reasonably large packet sizes. The latter algorithm operates without knowledge of arrival process and channel statistics.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115221483","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191385
Huseyin Balli, Zhen Zhang
The performance analysis of Random Linear Network Codes is important both theoretically and for its applications. In this paper, we derive improved upper bounds for the failure probability of random linear network codes and analyze the limiting behavior as the field size goes to infinity. Unlike the previously reported bounds, the new bound is shown to be tight as the field size |F| goes to infinity.
{"title":"On the limiting behavior of Random Linear Network Codes","authors":"Huseyin Balli, Zhen Zhang","doi":"10.1109/NETCOD.2009.5191385","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191385","url":null,"abstract":"The performance analysis of Random Linear Network Codes is important both theoretically and for its applications. In this paper, we derive improved upper bounds for the failure probability of random linear network codes and analyze the limiting behavior as the field size goes to infinity. Unlike the previously reported bounds, the new bound is shown to be tight as the field size |F| goes to infinity.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117333228","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191398
P. Sadeghi, D. Traskov, R. Koetter
We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.
{"title":"Adaptive network coding for broadcast channels","authors":"P. Sadeghi, D. Traskov, R. Koetter","doi":"10.1109/NETCOD.2009.5191398","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191398","url":null,"abstract":"We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123228288","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191391
Pegah Sattari, A. Markopoulou, C. Fragouli
In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology [1]. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems [2]. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.
{"title":"Multiple source multiple destination topology inference using network coding","authors":"Pegah Sattari, A. Markopoulou, C. Fragouli","doi":"10.1109/NETCOD.2009.5191391","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191391","url":null,"abstract":"In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology [1]. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems [2]. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129981485","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191390
J. Goseling, R. Boucherie, Jan-Kees van Ommeren
We show the close relation between network coding and queuing networks with negative and positive customers. Moreover, we develop Markov reward error bounding techniques for networks with negative and positive customers. We obtain bounds on the energy consumption in a wireless information exchange setting using network coding.
{"title":"Energy consumption in coded queues for wireless information exchange","authors":"J. Goseling, R. Boucherie, Jan-Kees van Ommeren","doi":"10.1109/NETCOD.2009.5191390","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191390","url":null,"abstract":"We show the close relation between network coding and queuing networks with negative and positive customers. Moreover, we develop Markov reward error bounding techniques for networks with negative and positive customers. We obtain bounds on the energy consumption in a wireless information exchange setting using network coding.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132893902","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}
Pub Date : 2009-06-15DOI: 10.1109/NETCOD.2009.5191396
Rudolf Ahlswede, Harout K. Aydinian
The random network coding approach is an effective technique for linear network coding, however it is highly susceptible to errors and adversarial attacks. Recently Kötter and Kschischang [14] introduced the operator channel, where the inputs and outputs are subspaces of a given vector space, showing that this is a natural transmission model in noncoherent random network coding. A suitable metric, defined for subspaces: dS(U; V ) = dimU + dim V - 2 dim(U ∩ V), gives rise to the notion of codes capable of correcting different kinds of errors (like packet errors, erasures etc.) in noncoherent random network coding. In this paper we continue the study of coding for operator channels started in [14]. We consider codes correcting insertions/deletions (dimension enlargement and dimension reduction respectively). Bounds and constructions for those codes are presented.
随机网络编码方法是一种有效的线性网络编码方法，但它极易受到错误和对抗性攻击的影响。最近Kötter和Kschischang[14]引入了算子信道，其中输入和输出是给定向量空间的子空间，表明这是非相干随机网络编码中的自然传输模型。一个合适的度量，为子空间定义:dS(U;V) = dimU + dim V - 2 dim(U∩V)，产生了在非相干随机网络编码中能够纠正不同类型错误(如数据包错误，擦除等)的代码的概念。本文继续研究从b[14]开始的运营商信道的编码问题。我们考虑代码纠正插入/删除(分别是维数扩大和维数减少)。给出了这些规范的边界和结构。
{"title":"On error control codes for random network coding","authors":"Rudolf Ahlswede, Harout K. Aydinian","doi":"10.1109/NETCOD.2009.5191396","DOIUrl":"https://doi.org/10.1109/NETCOD.2009.5191396","url":null,"abstract":"The random network coding approach is an effective technique for linear network coding, however it is highly susceptible to errors and adversarial attacks. Recently Kötter and Kschischang [14] introduced the operator channel, where the inputs and outputs are subspaces of a given vector space, showing that this is a natural transmission model in noncoherent random network coding. A suitable metric, defined for subspaces: dS(U; V ) = dimU + dim V - 2 dim(U ∩ V), gives rise to the notion of codes capable of correcting different kinds of errors (like packet errors, erasures etc.) in noncoherent random network coding. In this paper we continue the study of coding for operator channels started in [14]. We consider codes correcting insertions/deletions (dimension enlargement and dimension reduction respectively). Bounds and constructions for those codes are presented.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115840411","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：