2009 17th IEEE International Conference on Network Protocols最新文献_第2页

Memory Efficient Protocols for Detecting Node replication attacks in wireless sensor networks 无线传感器网络中节点复制攻击检测的高效内存协议

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339674

Ming Zhang, Vishal Khanapure, Shigang Chen, Xuelian Xiao

{"title":"Memory Efficient Protocols for Detecting Node replication attacks in wireless sensor networks","authors":"Ming Zhang, Vishal Khanapure, Shigang Chen, Xuelian Xiao","doi":"10.1109/ICNP.2009.5339674","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339674","url":null,"abstract":"Sensor networks deployed in hostile areas are subject to node replication attacks, in which an adversary compromises a few sensors, extracts the security keys, and clones them in a large number of replicas, which are introduced into the network to perform insider attacks. Memory overhead, energy efficiency and detection probability are the main technical concerns for any replication detection protocol. The previous distributed solutions either require network-wide spontaneous change of pseudo-random numbers or incur significant memory and energy overhead to the sensors, especially in the central area of the deployment. In this paper, we propose four replication detection protocols that have high detection probability, low memory requirement, and balanced energy consumption. The new protocols use Bloom filters to compress the information stored at the sensors, and use two new techniques, called cell forwarding and cross forwarding, to improve detection probability, further reduce memory consumption, and in the mean time distribute the memory and energy overhead evenly across the whole network. Simulations show that the protocols can achieve nearly 100% detection probability with average memory reduction up to 91%.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127622109","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}

引用次数: 78

CUBS: Coordinated Upload Bandwidth Sharing in residential networks 小熊:在住宅网络中协调上传带宽共享

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339685

Enhua Tan, Lei Guo, Songqing Chen, Xiaodong Zhang

{"title":"CUBS: Coordinated Upload Bandwidth Sharing in residential networks","authors":"Enhua Tan, Lei Guo, Songqing Chen, Xiaodong Zhang","doi":"10.1109/ICNP.2009.5339685","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339685","url":null,"abstract":"Millions of residential users are widely served by cable or DSL connections with modest upload bandwidth and relatively high download bandwidth. For the increasingly important and demanding P2P applications such as VoIP, BitTorrent, and Internet streaming, stable or high upload bandwidth is required. Inadequate upload bandwidth degrades the performance of these applications among residential users. On the other hand, our Internet measurements show that plenty of idle upload bandwidth (from 50% to 80%) is always available in a local residential network. Based on this observation, we propose a system prototype to Coordinate Upload Bandwidth Sharing (CUBS) among neighboring residential users. Specifically, the idle upload bandwidth of neighbors can be used upon a request from a demanding user. Since it has become a common practice to deploy wireless access points in a residential user's home, we have built CUBS by leveraging the support from the wireless networks. In CUBS, to discover and manage idle bandwidth, a localized overlay is constructed by the cooperative users. CUBS is application independent as the bandwidth sharing is implemented at the network layer. CUBS is also ISP transparent because the sharing of neighbors' bandwidth does not demand any additional bandwidth supplies. We have evaluated the CUBS system prototype with experiments on Internet. The experimental results demonstrate that CUBS can effectively improve the performance of upload intensive applications by more than 30%.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122557470","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}

引用次数: 14

RASPberry: A stable reader activation scheduling protocol in multi-reader RFID systems 多读写器RFID系统中稳定的读写器激活调度协议

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339672

Shaojie Tang, Jing Yuan, Xiangyang Li, Guihai Chen

{"title":"RASPberry: A stable reader activation scheduling protocol in multi-reader RFID systems","authors":"Shaojie Tang, Jing Yuan, Xiangyang Li, Guihai Chen","doi":"10.1109/ICNP.2009.5339672","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339672","url":null,"abstract":"Recent technological advances have motivated large-scale deployment of RFID systems. RFID readers are often static and carefully deployed in a planned manner. However, the distribution and movements of tags are often dynamically changed and unpredictable. We study a challenging problem of scheduling the activation of the readers without collision such that the system can work in a stable way in the long term. Here a schedule is stable if at any time slot, the number of total unread tags is bounded from above with high probability under this scheduling. In this paper, we propose a stable reader activation scheduling protocol, RASPberry, in multi-reader RFID systems. We analytically prove that our scheduling protocol, RASPberry, is stable if the arrival rate of tags is less than the processing rate of all readers. In RASPberry, at any time slot, a reader can determine its status using only information of readers within a local neighborhood. To the best of our knowledge, this is the first work to address the stability problem of reader activation scheduling in RFID systems. Our extensive simulations show that our system performs very well.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117124084","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}

引用次数: 68

Linear-time verification of firewalls 防火墙的线性时间验证

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339691

H. B. Acharya, M. Gouda

引用次数: 15

wheel + ring = reel: the impact of route filtering on the stability of policy routing Wheel + ring = reel:路由过滤对策略路由稳定性的影响

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339677

L. Cittadini, G. Battista, M. Rimondini, Stefano Vissicchio

{"title":"wheel + ring = reel: the impact of route filtering on the stability of policy routing","authors":"L. Cittadini, G. Battista, M. Rimondini, Stefano Vissicchio","doi":"10.1109/ICNP.2009.5339677","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339677","url":null,"abstract":"BGP allows providers to express complex routing policies preserving high degrees of autonomy. However, unrestricted routing policies can adversely impact routing stability. A key concept to understand the interplay between autonomy and expressiveness on one side, and stability on the other side, is safety under filtering, i.e., guaranteed stability under autonomous usage of route filters. BGP route filters are used to selectively advertise specific routes to specific neighbors. We provide a necessary and sufficient condition for safety under filtering, filling the large gap between previously known necessary and sufficient conditions. Our characterization is based on the absence of a particular kind of dispute wheel, a structure involving circular dependencies among routing preferences. We exploit our result to show that networks admitting multiple stable states are provably unsafe under filtering. This is especially interesting from an operational point of view, since networks with multiple stable states actually happen in practice (BGP wedgies). Finally, we show that adding filters to an existing configuration may lead to oscillations even if the configuration is safe under any link failure. Unexpectedly, we find policy configurations where misconfigured filters can do more harm than network faults.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131716737","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}

引用次数: 16

Quota: Rationing server resources in peer-assisted online hosting systems 配额:在对等辅助在线托管系统中配给服务器资源

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339692

Fangming Liu, Ye Sun, Bo Li, Baochun Li

{"title":"Quota: Rationing server resources in peer-assisted online hosting systems","authors":"Fangming Liu, Ye Sun, Bo Li, Baochun Li","doi":"10.1109/ICNP.2009.5339692","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339692","url":null,"abstract":"The increasingly popular online hosting systems are designed to provide versatile and convenient platforms for content hosting and sharing. To guarantee adequate levels of service quality while conserving prohibitive server costs, such systems are often designed to integrate peer bandwidth contributions with strategic server resource provisioning in a complementary and transparent manner. This paper seeks to explore the design space of new protocols to allocate scarce server resources—including both storage space and bandwidth—in peer-assisted online hosting systems. The objective is to maximize the use of limited server storage and bandwidth resources to guarantee adequate levels of service quality, with respect to file availability and downloading performance, while taking full advantage of peer assistance. We identify a number of unique challenges involved in such systems, and propose our design of resource allocation protocols to address these challenges, based on both mathematical analysis and practical implementations. Using real world data sets that we have collected, we evaluate our protocol design through extensive experimental studies from different perspectives, which demonstrate the effectiveness of our design and offer a number of practical guidelines.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133004963","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

Attack-tolerant distributed sensing for dynamic spectrum access networks 动态频谱接入网络的容错分布式感知

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339675

Alexander W. Min, K. Shin, Xin Hu

{"title":"Attack-tolerant distributed sensing for dynamic spectrum access networks","authors":"Alexander W. Min, K. Shin, Xin Hu","doi":"10.1109/ICNP.2009.5339675","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339675","url":null,"abstract":"Accurate sensing of the spectrum condition is of crucial importance to the mitigation of the spectrum scarcity problem in dynamic spectrum access (DSA) networks. Specifically, distributed sensing has been recognized as a viable means to enhance the incumbent signal detection by exploiting the diversity of sensors. However, it is challenging to make such distributed sensing secure due mainly to the unique features of DSA networks—openness of a low-layer protocol stack in SDR devices and non-existence of communications between primary and secondary devices. To address this challenge, we propose attack-tolerant distributed sensing protocol (ADSP), under which sensors in close proximity are grouped into a cluster, and sensors in a cluster cooperatively safeguard distributed sensing. The heart of ADSP is a novel shadow fading correlation-based filter tailored to anomaly detection, by which the fusion center prefilters abnormal sensor reports via cross-validation. By realizing this correlation filter, ADSP minimizes the impact of an attack on the performance of distributed sensing, while incurring minimal processing and communications overheads. The efficacy of our scheme is validated on a realistic two-dimensional shadow-fading field, which accurately approximates real-world shadowing environments. Our extensive simulation-based evaluation shows that ADSP significantly reduces the impact of attacks on incumbent detection performance.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115406144","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}

引用次数: 81

Multipath load-adaptive routing: putting the emphasis on robustness and simplicity 多路径负载自适应路由:强调鲁棒性和简单性

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339682

A. Kvalbein, C. Dovrolis, Chidambaram Muthu

引用次数: 43

Scalable IP lookups using shape graphs 使用形状图进行可扩展的IP查找

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339697

Haoyu Song, M. Kodialam, F. Hao, T. V. Lakshman

{"title":"Scalable IP lookups using shape graphs","authors":"Haoyu Song, M. Kodialam, F. Hao, T. V. Lakshman","doi":"10.1109/ICNP.2009.5339697","DOIUrl":"https://doi.org/10.1109/ICNP.2009.5339697","url":null,"abstract":"Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been motivated by several factors: (1) The advent of 100Gbps interfaces necessitating correspondingly fast packet processing algorithms with a compact memory footprint; (2) network virtualization leading to virtualization of physical router platforms making it critical to reduce high-speed memory needs per virtual router; (3) software routers built on multi-core processors requiring the use of compact data-structures that fit in on-chip caches for good performance. In this paper, we revisit this issue of developing compact data structures for key packet-processing functions. We develop a new data structure, called the shape graph, that significantly compacts the trie data-structure used for IP lookups. We accomplish this by identifying considerable structural similarities in IP lookup tries that have not previously been used in the literature for scalable IP lookups. We use these similarities to store lookup tries in a new graph data structure that has a significantly lower memory-footprint. Using real IP forwarding tables, we compare the memory usage of this new data structure to that of multi-bit tries and of Bloom filters used for IP lookups. The shape graph requires significantly less memory and allows the far more effective use of on-chip memory. This effective use of on-chip memory combined with multi-threading on a multi-core processor makes shape-graph-based IP lookups well suited for 100Gbps lookups. The small footprint also makes it well suited for use in router platforms that host a large number of virtual routers.","PeriodicalId":439867,"journal":{"name":"2009 17th IEEE International Conference on Network Protocols","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121218552","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}

引用次数: 29

Message from the TPC chairs 来自TPC主席的信息

2009 17th IEEE International Conference on Network Protocols Pub Date : 2009-11-20 DOI: 10.1109/ICNP.2009.5339663

T. Griffin, S. Krishnamurthy

引用次数: 0