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

{"title":"Efficient Weakly-Secure Network Coding Schemes against Wiretapping Attacks","authors":"Yawen Wei, Zhen Yu, Y. Guan","doi":"10.1109/NETCOD.2010.5487671","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487671","url":null,"abstract":"Network coding is promising for improving network throughput in various networking systems. However, the systems adopting network coding are vulnerable to wiretapping attacks, in which adversaries wiretap on a subset of links and solve for information symbols that are intended to be decoded only by receivers. A number of solutions have been proposed to prevent information leakage to wiretappers, however, they either enlarge the finite field over which the coding is done and thus consume more communication bandwidth, or reduce the multicast rate due to inserting random numbers into the source. In this paper, we propose two efficient coding schemes against wiretapping attacks. Our schemes are weakly-secure, i.e., the wiretapper can obtain some linear combination of the information symbols, but he cannot solve for any single one. Both schemes utilize a permutation function to randomize the message vector sent by the source. The first scheme inserts only one random symbol into the source; the second scheme inserts no random symbols at all and thus achieves the maximum multicast capacity. Moreover, the second scheme retains the same finite field size as insecure coding schemes, thus does not consume more bandwidth to transmit symbols and encoding coefficients. Our schemes are lightweight: the permutation function can be implemented using Linear Feedback Shift Register (LFSR) or its variants, which can be efficiently implemented in hardware.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123898399","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}

{"title":"Network Coding-Aware Queue Management for Unicast Flows over Coded Wireless Networks","authors":"H. Seferoglu, A. Markopoulou","doi":"10.1109/NETCOD.2010.5487689","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487689","url":null,"abstract":"We are interested in unicast flows over wireless networks with intersession network coding (such as COPE [1]). TCP flows over coded wireless networks do not fully exploit network coding opportunities due to their bursty behavior and to the fact that TCP is agnostic to the underlying network coding. In this paper, we take the following steps. First, we formulate congestion control for unicast flows over coded wireless networks as a network utility maximization problem and we present a distributed solution. Second, by mimicking the structure of the optimal solution, we propose a \"network-coding aware\" queue management scheme (NCAQM) at intermediate nodes. We make no changes to TCP or MAC protocols. We demonstrate, via simulation, that TCP over NCAQM performs significantly better than TCP over COPE.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129618397","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}

{"title":"The Role of Feedback in the Choice between Routing and Coding for Wireless Unicast","authors":"R. Gummadi, L. Massoulié, R. Sreenivas","doi":"10.1109/NETCOD.2010.5487664","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487664","url":null,"abstract":"We consider the benefits of coding in wireless networks, specifically its role in exploiting the local broadcast property of the wireless medium. We first argue that for unicast, the throughput achieved with network coding is the same as that achieved without any coding. This argument highlights the role of a general max-flow min-cut duality and is more explicit than previous proofs. The maximum throughput can be achieved in multiple ways without any coding, for example, using backpressure routing, or using some centralized flow scheduler that is aware of the network topology. However, all such schemes, in order to take advantage of the local broadcast property, require dynamic routing decisions for choosing the next hop for each packet from among the nodes where it is successfully received. This choice seems to depend critically on feedback signalling information like queue lengths, or ARQ. In contrast, note that the use of network coding can achieve the same without such feedback, in exchange for decoding overhead. A key issue to be resolved in making a comparison between routing and coding would be how critical feedback signalling is, for the throughput of routing policies. With this motivation, we first explore how feedback at a given node affects its throughput, with arbitrary rates of its one hop neighbors to the destination. emph{Static} routing policies which are essentially emph{feedback independent}, are considered. An explicit characterization of the optimal policies under such a feedback constraint is obtained, which turns out to be a natural generalization of both flooding and traditional routing (which does not exploit local broadcast, because the next hop is fixed prior to the transmission). When losses at the receivers are independent (still allowing for dependencies on transmissions by two different nodes, to model interference), the reduction in capacity due to constraining the feedback is limited to a constant fraction ($1-e^{-1} = 63%$) of the coding capacity, and gets arbitrarily close to optimal as the capacity itself is low. This result also extends to a more general version on feedforward networks without any assigned rates of the one hop neighbors to the destination. However, if there are dependencies in the losses seen by receivers from a single broadcast, the reduction could be arbitrarily bad, even with just two hops.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125760699","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}

{"title":"A Practical Network Coding Approach for Peer-to-Peer Distributed Storage","authors":"M. Martalò, Marco Picone, Riccardo Bussandri, M. Amoretti","doi":"10.1109/NETCOD.2010.5487686","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487686","url":null,"abstract":"In this paper, we analyze the performance of a peer-to-peer (P2P) distributed storage network based on the overlay architecture defined by the Wuala project. Although the original system is based on efficient erasure codes, e.g., Reed-Solomon codes, we investigate the use of a \"simple\" network coding strategy, which leverages on the well-known idea of randomized network coding. In particular, when a resource is published in the network, the fragments are randomly encoded with a predetermined overhead, which is consistent with the erasure coding strategy. Moreover, no regular network maintenance is scheduled to guarantee that a client node is able to successfully complete a resource download. We instead propose that a client node generates new fragments, to be stored in the network, when it is able to successfully download the entire resource. Our simulation results show that this simple coding strategy reduces the amount of data flowing in the network, thus obtaining more free disk space on storage nodes.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126620684","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}

{"title":"Issues in Peer-to-Peer Networking: A Coding Optimization Approach","authors":"Christopher S. Chang, T. Ho, M. Effros, M. Médard, B. Leong","doi":"10.1109/NETCOD.2010.5487668","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487668","url":null,"abstract":"In this paper we consider a linear optimization approach for studying download finish times in peer-to-peer networks that allow but do not require coding. We demonstrate that using the network coding framework simplifies analysis even in scenarios where the optimal solution does not require coding. For example, we use the network coding framework to disprove the claim of Ezovski et al. that in the absence of coding, the sequential minimization of file download times minimizes the average finish time over all users. We also use this framework to study the effect of requiring reciprocity, a typical feature of incentive-compatible protocols. Lastly, we show that for a dynamically changing network scenario, coding can provide a robust and optimal solution that outperforms routing.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128416179","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}

{"title":"Locating Byzantine Attackers in Intra-Session Network Coding Using SpaceMac","authors":"Anh Le, A. Markopoulou","doi":"10.1109/NETCOD.2010.5487673","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487673","url":null,"abstract":"Intra-session network coding is known to be vulnerable to Byzantine attacks: malicious nodes can inject bogus packets, which get combined with legitimate blocks at downstream nodes, thus preventing decoding of original packets and degrading the overall performance. In this paper, we provide a novel approach that can identify the precise location of all Byzantine attackers in systems with intra-session network coding. A key ingredient of our approach is a novel homomorphic MAC scheme for expanding subspaces (SpaceMac) that allows to eliminate any uncertainty in identifying attackers via subspace properties. To the best of our knowledge, our scheme is the first that can identify precisely all Byzantine attackers, and at the same time has both low computation (sub- millisecond) and communication overhead (20 bytes per data block). Simulation results show that, even when there are multiple colluding attackers in a network, all of them can be successfully identified in a very short time.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"27 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018478","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}

{"title":"On the Performance of Network Coding in Multi-Resolution Wireless Video Streaming","authors":"S. Gheorghiu, L. Lima, Alberto López Toledo, J. Barros, M. Médard","doi":"10.1109/NETCOD.2010.5487688","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487688","url":null,"abstract":"Scalable video can be used to provide video streaming reliably to an heterogeneous set of receivers with different subscription levels. However, the performance of such schemes can be highly affected by scheduling constraints and unreliable feedback. Network coding, on the other hand, has been shown to reduce scheduling and prioritization problems and to perform well in wireless scenarios with perfect feedback. Motivated by this observation, we implement and analyze a system architecture for network coding-based multiresolution video streaming in a wireless environment. In contrast to existing work, we take into account realistic feedback, where the control packets are sent over the same unreliable channel as data packets, and compare it to the case of perfect feedback, where the server has perfect knowledge of the state of the buffer at every receiver. We provide an evaluation of the system via simulation and show that even in highly volatile environments, a network coding-based scheme with limited and unreliable feedback can achieve a good performance.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"87 20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126298759","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}

{"title":"Non-Asymptotic Analysis of Network Coding Delay","authors":"Maricica Nistor, R. Costa, T. Vinhoza, J. Barros","doi":"10.1109/NETCOD.2010.5487665","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487665","url":null,"abstract":"We present an expression for the delay distribution of Random Linear Network Coding over an erasure channel with a given loss probability. In contrast with previous contributions, our analysis is non- asymptotic in the sense that it is valid for any field size and any number of symbols. The results confirm that GF(16) already offers near-optimal decoding delay, whereas smaller field sizes (e.g. requiring only XOR operations) induce heavy tails in the delay distribution. A comparison with Automatic Repeat reQuest (ARQ) techniques (with perfect feedback) is also included.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116837375","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}

{"title":"Collecting Coded Coupons over Overlapping Generations","authors":"Yao Li, E. Soljanin, P. Spasojevic","doi":"10.1109/NETCOD.2010.5487677","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487677","url":null,"abstract":"Coding over subsets (known as generations) rather than over all content blocks in P2P distribution networks and other applications is necessary for a number of practical reasons such as computational complexity. A penalty for coding only within generations is an overall throughput reduction. It has been previously shown that allowing contiguous generations to overlap in a head-to-toe manner improves the throughput. We here propose and study a scheme, referred to as the random annex code, that creates shared packets between any two generations at random rather than only the neighboring ones. By optimizing very few design parameters, we obtain a simple scheme that outperforms both the non-overlapping and the head-to-toe overlapping schemes of comparable computational complexity, both in the expected throughput and in the rate of convergence of the probability of decoding failure to zero. We provide a practical algorithm for accurate analysis of the expected throughput of the random annex code for finite-length information. This algorithm enables us to quantify the throughput vs.computational complexity tradeoff, which is necessary for optimal selection of the scheme parameters.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123398132","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}