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

An Analytical Study of Network Coding in the Presence of Real-Time Messages 实时消息存在下的网络编码分析研究

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487663

Marc Aoun, P. Beekhuizen, A. Argyriou

引用次数: 4

Prioritized Wireless Transmissions Using Random Linear Codes 使用随机线性码的优先无线传输

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487690

Tuan T. Tran, Thinh P. Q. Nguyen

引用次数: 3

Broadcast Scheduling Based on Network Coding in Time Critical Wireless Networks 时效性无线网络中基于网络编码的广播调度

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487684

Cheng Zhan, Yinlong Xu

{"title":"Broadcast Scheduling Based on Network Coding in Time Critical Wireless Networks","authors":"Cheng Zhan, Yinlong Xu","doi":"10.1109/NETCOD.2010.5487684","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487684","url":null,"abstract":"Using network coding in wireless networks can increase throughput and reduce energy consumption. Recently there are many works focusing on how to utilize network coding to increase throughput, however there are few works considering the quality of service such as delay which is important to time critical applications. This paper focuses on network coding based broadcast scheduling problem in time critical wireless networks with packet delay constraint and aims at minimizing the number of packets which miss their deadlines. Using a weighted graph model, we formulate the problem with an integer linear programming and prove that it is NP-hard. By assigning vertex weight as a decreasing function of packet deadline, we propose a packet encoding and broadcasting algorithm based on the maximum weight clique in the graph. Detailed analysis shows that some typical application requirements can be realized with different weight functions, which can be useful for Qos design. Simulation results show that our algorithm significantly reduce the deadline miss ratio in most cases, which is an important performance metric in time critical applications.","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":"124709324","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}

引用次数: 21

A Fundamental Trade-Off between the Download Cost and Repair Bandwidth in Distributed Storage Systems 分布式存储系统中下载成本与修复带宽的基本权衡

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487685

S. Akhlaghi, Abbas Kiani, M. Ghanavati

{"title":"A Fundamental Trade-Off between the Download Cost and Repair Bandwidth in Distributed Storage Systems","authors":"S. Akhlaghi, Abbas Kiani, M. Ghanavati","doi":"10.1109/NETCOD.2010.5487685","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487685","url":null,"abstract":"Distributed storage systems are mainly justified due to the limited amount of storage capacity and improving the reliability through distributing data over multiple storage nodes. However, it may happen the data is stored in unreliable nodes, while it is desirable the end user to have a reliable access to the stored data. So,~in an event that a node is damaged,~to prevent the system reliability to regress,~it is necessary to regenerate a new node with the same amount of stored data as the damaged node to retain the number of storage nodes, thereby having the previous reliability. This requires the new node to connect to some of existing nodes, and downloads the required information, thereby occupying some bandwidth, called the repair bandwidth. On the other hand, it is more likely the cost of downloading varies across different nodes. This paper aims at investigating the fundamental trade-off between the download cost and repair bandwidth, and more importantly, it is shown any point on this curve can be achieved through the use of the so called generalized regenerating codes which is an enhancement to the regenerating codes introduced by Dimakis et al. in~cite{dim1}.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"31 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":"128355722","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}

引用次数: 19

Practical Wireless Network Coding with Constrained Decoding Buffers 实用无线网络编码与约束解码缓冲

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487687

Yu Wang, Hanchen Lu, P. Hong, Kaiping Xue

引用次数: 5

On the Queueing Behavior of Network Coding 网络编码的排队行为研究

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487681

Yuan Yuan, Kui Wu, W. Jia

引用次数: 2

Function Computation over Linear Channels 线性通道上的函数计算

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487679

L. Keller, N. Karamchandani, C. Fragouli

引用次数: 12

A Simple Optimization Model for Wireless Opportunistic Routing with Intra-Session Network Coding 会话内网络编码无线机会路由的简单优化模型

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487667

F. Soldo, A. Markopoulou, Alberto López Toledo

引用次数: 16

Network Coding in Passive Optical Networks 无源光网络中的网络编码

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487683

K. Miller, T. Biermann, H. Woesner, H. Karl

引用次数: 42

A Network Coding Approach to IP Traceback IP回溯的网络编码方法

2010 IEEE International Symposium on Network Coding (NetCod) Pub Date : 2010-06-09 DOI: 10.1109/NETCOD.2010.5487682

Pegah Sattari, Minas Gjoka, A. Markopoulou

{"title":"A Network Coding Approach to IP Traceback","authors":"Pegah Sattari, Minas Gjoka, A. Markopoulou","doi":"10.1109/NETCOD.2010.5487682","DOIUrl":"https://doi.org/10.1109/NETCOD.2010.5487682","url":null,"abstract":"Traceback schemes aim at identifying the source(s) of a sequence of packets and the nodes these packets traversed. This is useful for tracing the sources of high volume traffic, e.g., in Distributed Denial-of-Service (DDoS) attacks. In this paper, we are particularly interested in Probabilistic Packet Marking (PPM) schemes, where intermediate nodes probabilistically mark packets with information about their identity and the receiver uses information from several packets to reconstruct the paths they have traversed. Our work is inspired by two observations. First, PPM is essentially a coupon collector's problem. Second, the coupon collector's problem significantly benefits from network coding ideas. Based on these observations, we propose a network coding-based approach (PPM+NC) that marks packets with random linear combinations of router IDs, instead of individual router IDs. We demonstrate its benefits through analysis. We then propose a practical PPM+NC scheme based on the main PPM+NC idea, but also taking into account the limited bit budget in the IP header available for marking and other practical constraints. Simulation results show that our scheme significantly reduces the number of packets needed to reconstruct the attack graph, in both single- and multi-path scenarios, thus increasing the speed of tracing the attack back to its source(s).","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"9 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":"132147463","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}

引用次数: 26