2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第9页

CombiHeader: Minimizing the number of shim headers in redundancy elimination systems CombiHeader:最小化冗余消除系统中垫片头的数量

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928920

Sumanta Saha, Andrey Lukyanenko, Antti Yla-Jaaski

{"title":"CombiHeader: Minimizing the number of shim headers in redundancy elimination systems","authors":"Sumanta Saha, Andrey Lukyanenko, Antti Yla-Jaaski","doi":"10.1109/INFCOMW.2011.5928920","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928920","url":null,"abstract":"Redundancy elimination has been used in many places to improve network performance. The algorithms for doing this typically split data into chunks, fingerprint them, and compare the fingerprint with cache to identify similar chunks. Then these chunks are removed from the data and headers are inserted instead of them. However, this approach presents us with two crucial shortcomings. Depending on the size of chunks, either many headers need to be inserted, or probability of missing similar regions is increased. Algorithms that try to overcome missed similarity detection by expanding chunk boundary suffers from excessive memory access due to byte-by-byte comparison. This situation leads us to propose a novel algorithm, CombiHeader, that allows near maximum similarity detection using smaller chunks sizes while using chunk aggregation technique to transmit very few headers with few memory accesses. CombiHeader uses a specialized directed graph to track and merge adjacent popular chunks. By generating different generations of CombiNodes, CombiHeader can detect different lengths of similarity region, and uses the smallest number of headers possible. Experiments show that CombiHeader uses less than 25% headers than general elimination algorithms, and this number improves with the number of hits. The required memory access to detect maximal similarity region is in the range of 1%-5% of comparable algorithms for certain situations. CombiHeader is implemented as a pluggable module, which can be used with any existing redundancy elimination algorithm.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133326893","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

Combining scalability and resource awareness in Wireless Sensor Network localization 结合可扩展性和资源感知的无线传感器网络定位

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928871

R. Behnke, A. Born, J. Salzmann, D. Timmermann, R. Bill

引用次数: 0

Time-critical event dissemination in geographically distributed clouds 地理分布云中的时间关键事件传播

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928894

Chi-Jen Wu, Jan-Ming Ho, Ming-Syan Chen

引用次数: 8

Minimum Disclosure Routing for network virtualization 用于网络虚拟化的最小披露路由

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928932

M. Fukushima, T. Hasegawa, T. Hasegawa, A. Nakao

引用次数: 6

Improve physical layer security in cooperative wireless network using distributed auction games 利用分布式竞价游戏提高协作无线网络的物理层安全性

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928805

Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao

{"title":"Improve physical layer security in cooperative wireless network using distributed auction games","authors":"Rongqing Zhang, Lingyang Song, Zhu Han, B. Jiao","doi":"10.1109/INFCOMW.2011.5928805","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928805","url":null,"abstract":"In this paper, we investigate a cooperative wireless network with jamming-based secure communications, where a friendly jammer can transmit jamming signals to interfere the malicious eavesdropper. We find that the secrecy rate of the source-destination link can be effectively improved with the help of the friendly jammer, and each source intends to obtain optimal jamming power from the friendly jammer to maximize its secrecy rate for data transmission. We then formulate this power allocation problem as an auction game and propose two distributively auction-based power allocation schemes, which are power allocation using Traditional Ascending Clock Auction (ACA-T) and power allocation using Alternative Ascending Clock Auction (ACA-A), considering the friendly jammer as the auctioneer and the sources as the bidders. In addition, we prove that both the proposed schemes can converge in a finite number of iterations. We also prove that the ACA-A scheme is cheat-proof while the ACA-T scheme is not. Finally, simulation results are presented to demonstrate the efficiency of the proposed auction-based schemes in improving secrecy rate of wireless networks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130250716","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}

引用次数: 37

RepHi: A novel attack against P2P reputation systems RepHi:一种针对P2P信誉系统的新颖攻击

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928789

Jingyu Feng, Yuqing Zhang, Shenglong Chen, Anmin Fu

引用次数: 11

A design of network-based flow mobility based on proxy mobile IPv6 基于代理移动IPv6的基于网络的流量移动性设计

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928841

T. Trung, Youn-Hee Han, Hyon-Young Choi, H. Geun

引用次数: 20

IP Reachability differences: Myths and realities IP可达性差异:神话与现实

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928928

He Yan, Benjamin Say, Brendan Sheridan, Dave Oko, C. Papadopoulos, Dan Pei, D. Massey

引用次数: 6

SAIL: A scalable approach for wide-area IP mobility SAIL:广域IP移动的可扩展方法

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928840

Zhenkai Zhu, R. Wakikawa, Lixia Zhang

引用次数: 8

Speeding up pattern matching by optimal partial string extraction 通过最优部分字符串提取加速模式匹配

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928778

Jianlong Tan, Xia Liu, Yanbing Liu, Ping Liu

引用次数: 9