2011 19th IEEE International Conference on Network Protocols最新文献

REPICK: Random access MAC with reversed contention and Piggy-backed ACK REPICK:随机访问MAC，反向竞争和反向反向

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089033

Xiaojun Feng, Jin Zhang, Qian Zhang, Bo Li

引用次数: 1

Adaptive Subcarrier Nulling: Enabling partial spectrum sharing in wireless LANs 自适应子载波Nulling:在无线局域网中实现部分频谱共享

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089069

Xinyu Zhang, K. Shin

{"title":"Adaptive Subcarrier Nulling: Enabling partial spectrum sharing in wireless LANs","authors":"Xinyu Zhang, K. Shin","doi":"10.1109/ICNP.2011.6089069","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089069","url":null,"abstract":"Emerging WLAN standards have been incorporating a variety of channel widths ranging from 5MHz to 160MHz, in order to match the diverse traffic demands on different networks. Unfortunately, the current 802.11 MAC/PHY is not designed for the coexistence of variable-width channels. Overlapping narrowband channels may block an entire wide-band channel, resulting in severe spectrum underutilization and even starvation of WLANs on the wide-band. A similar peril exists when a WLAN partially overlaps its channel with multiple orthogonal WLANs. In this paper, we propose to solve the problem of partial spectrum sharing using Adaptive Subcarrier Nulling (ASN). ASN builds on the 802.11 OFDM PHY, but allows the radios to sense, transmit, detect, and decode packets through spectrum fragments, or subbands. An ASN transmitter can adapt its spectrum usage on a per-packet basis, by nulling the subbands used by neighboring WLANs, and sending packets through the remaining idle subbands. ASN preserves the 802.11 CSMA/CA primitives while allowing users to contend for access to each subband, and can opportunistically exploit the merits of wide-band channels via spectrum aggregation. We have implemented and evaluated ASN on the GNURadio/USRP platform. Our experimental results have shown ASN to achieve detection and decoding performance comparable to the legacy 802.11. Our detailed simulation in ns-2 further shows that ASN substantially improves the efficiency and fairness of spectrum sharing for multi-cell WLANs.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123089363","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}

引用次数: 42

Network-level characteristics of spamming: An empirical analysis 垃圾邮件的网络级特征:实证分析

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089060

Marios Kokkodis, M. Faloutsos, A. Markopoulou

{"title":"Network-level characteristics of spamming: An empirical analysis","authors":"Marios Kokkodis, M. Faloutsos, A. Markopoulou","doi":"10.1109/ICNP.2011.6089060","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089060","url":null,"abstract":"Has the behavior of spammers changed over the last few years? To answer this question, we conduct a study from three recent data sources. Specifically, we focus on the following broad questions: (a) how are email addresses harvested, (b) where is spam coming from, and (c) how does spam evolve over time. First, we discuss whether spammers still use email harvesting: 34% of the honeypot accounts we publicised received spam after 72 days on average. Interestingly, we find that simple email address obfuscation is quite effective against harvesting. Second, we identify significant skew in the spatial distribution of the origin of spam in both the IP-level and AS-level of granularity. We find that 20% of the active IPs are responsible for 80% of the total volume of spam and that 10% of the spamming ASes are responsible for the 90% of the volume. Finally, we study the temporal characteristics of the spamming IPs and find that spam activity has spread to new /8 subnetworks since 2006. Considering these spatio-temporal trends, the future of anti-spam is mixed: the current skewed spatial distribution of spam sources could be helpful in filtering spam, but the fact that spam sources are spreading in the IP space is a worrisome sign.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127133418","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}

引用次数: 3

Global optimization of file availability through replication for efficient file sharing in MANETs 通过复制实现文件可用性的全局优化，实现MANETs中有效的文件共享

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089056

Kang-Peng Chen, Haiying Shen

{"title":"Global optimization of file availability through replication for efficient file sharing in MANETs","authors":"Kang-Peng Chen, Haiying Shen","doi":"10.1109/ICNP.2011.6089056","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089056","url":null,"abstract":"File sharing applications in mobile ad hoc networks (MANETs) have attracted more and more attention in recent years. The efficiency of file querying suffers from the distinctive properties of MANETs including node mobility and limited communication range and resource. An intuitive method to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no research has focused on the global optimal replica sharing with minimum average querying delay. Specifically, current file replication protocols in MANETs have two shortcomings. First, they lack a rule to allocate limited resource to different files in order to minimize the average querying delay. Second, they simply consider storage as resource for replicas, but neglect the fact that the file holders' frequency of meeting other nodes also plays an important role in determining file availability. A node having a higher meeting frequency with others provides higher availability to its files. In this paper, we introduce a new concept of resource for file replication, which considers both node storage and meeting frequency. We theoretically study the influence of resource allocation on the average querying delay and derive a resource allocation rule to minimize the average querying delay. We further propose a distributed file replication protocol that follows the rule. The trace-driven experiments on both the real-world GENI testbed and NS-2 show that our protocol can achieve shorter average querying delay at lower cost than current replication protocols, which justifies the correctness of our theoretical analysis and the effectiveness of the proposed protocol.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121561799","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

OpenRouter: OpenFlow extension and implementation based on a commercial router OpenRouter:基于商用路由器的OpenFlow扩展和实现

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089045

Tao Feng, J. Bi, Hongyu Hu

引用次数: 16

A case for coalitions in data swarming systems 数据集群系统中的联盟案例

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089058

Honggang Zhang, Sudarshan Vasudevan, Ran Li, D. Towsley

{"title":"A case for coalitions in data swarming systems","authors":"Honggang Zhang, Sudarshan Vasudevan, Ran Li, D. Towsley","doi":"10.1109/ICNP.2011.6089058","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089058","url":null,"abstract":"We present an argument in favor of forming coalitions of peers in a data swarming system consisting of peers with different upload capacities. A coalition is a set of peers with the same upload capacity that explicitly cooperate with other peers inside the coalition via choking and capacity allocation strategies. Further, each peer interacts with other peers outside its coalition via potentially distinct choking and capacity allocation strategies. This paper focuses on the efficiency of different choking strategies, assuming that peers do not share data with other peers outside their coalitions. We first develop an analytical model that accurately predicts the performance of a coalition of peers adopting BitTorrent's Tit-for-Tat choking strategy. Our model highlights a number of inefficiencies of Tit-for-Tat strategy. Accordingly, we propose a random choking strategy, and show that it can help a coalition achieve near-optimal performance and it significantly outperforms not only Tit-for-Tat strategy but also unchoke-all strategy. Using cooperative game theory, we prove the existence of stable coalitions, and demonstrate the convergence of the dynamic coalition formation process when peers use our cooperation-aware better response strategy. Using extensive simulations, we demonstrate significant performance benefits due to coalition formation.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124079981","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}

引用次数: 8

Shield: DoS filtering using traffic deflecting 屏蔽:使用流量偏转对拒绝服务进行过滤

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089077

Erik Kline, A. Afanasyev, P. Reiher

引用次数: 23

Real-time Netshuffle: Graph distortion for on-line anonymization 实时网洗牌:在线匿名化的图形失真

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089040

R. Paul, Victor C. Valgenti, Min Sik Kim

引用次数: 6

AIDR: Aggregation of BGP routing table with AS path stretch AIDR:带AS路径伸缩的BGP路由表聚合

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089042

Yangyang Wang, J. Bi, Jianping Wu

引用次数: 1

Towards name-based trust and security for content-centric network 面向以内容为中心的网络，实现基于名称的信任和安全

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089053

Xinwen Zhang, Katharine Chang, Huijun Xiong, Yonggang Wen, G. Shi, Guoqiang Wang

{"title":"Towards name-based trust and security for content-centric network","authors":"Xinwen Zhang, Katharine Chang, Huijun Xiong, Yonggang Wen, G. Shi, Guoqiang Wang","doi":"10.1109/ICNP.2011.6089053","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089053","url":null,"abstract":"Trust and security have been considered as built-in properties for future Internet architecture. Leveraging the concept of named content in recently proposed information centric network, we propose a name-based trust and security protection mechanism. Our scheme is built with identity-based cryptography (IBC), where the identity of a user or device can act as a public key string. Uniquely, in named content network such as content-centric network (CCN), a content name or its prefixes can be used as public identities, with which content integrity and authenticity can be achieved with IBC algorithms. The trust of a content is seamlessly integrated with the verification of the content's integrity and authenticity with its name or prefix, instead of the public key certificate of its publisher. In addition, flexible confidentiality protection is enabled between content publishers and consumers. For scalable deployment purpose, we further propose to use a hybrid scheme combined with traditional public-key infrastructure (PKI) and IBC. We have implemented this scheme with CCNx open source project on Android.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132735566","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}

引用次数: 89