Proceedings of the 2006 IEEE International Conference on Network Protocols最新文献_第2页

TrueLink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks TrueLink:无线网络中虫洞攻击的实用对策

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320200

Jakob Eriksson, S. Krishnamurthy, M. Faloutsos

{"title":"TrueLink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks","authors":"Jakob Eriksson, S. Krishnamurthy, M. Faloutsos","doi":"10.1109/ICNP.2006.320200","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320200","url":null,"abstract":"In a wormhole attack, wireless transmissions are recorded at one location and replayed at another, creating a virtual link under attacker control. Proposed counter-measures to this attack use tight clock synchronization, specialized hardware, or overhearing, making them difficult to realize in practice. TrueLink is a timing based countermeasure to the wormhole attack. Using TrueLink, a node i can verify the existence of a direct link to an apparent neighbor, j. Verification of a link i harr j operates in two phases. In the rendezvous phase, the nodes exchange nonces alphaj and betai. This is done with tight timing constraints, within which it is impossible for attackers to forward the exchange between distant nodes. In the authentication phase, i and j transmit a signed message (alphaj,betai), mutually authenticating themselves as the originator of their respective nonce. TrueLink does not rely on precise clock synchronization, GPS coordinates, overhearing, geometric inconsistencies, or statistical methods. It can be implemented using only standard IEEE 802.11 hardware with a minor backwards compatible firmware update. TrueLink is meant to be used together with a secure routing protocol. Such protocols require an authentication mechanism, which will also be used by TrueLink. TrueLink is virtually independent of the routing protocol used. Our performance evaluation shows that TrueLink provides effective protection against potentially devastating wormhole attacks.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114232232","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}

引用次数: 202

Vault: A Secure Binding Service Vault:一个安全的绑定服务

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320210

G. Lu, Changho Choi, Zhi-Li Zhang

引用次数: 0

Internet Cache Pollution Attacks and Countermeasures 互联网缓存污染攻击及对策

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320198

Yan Gao, Leiwen Deng, A. Kuzmanovic, Yan Chen

{"title":"Internet Cache Pollution Attacks and Countermeasures","authors":"Yan Gao, Leiwen Deng, A. Kuzmanovic, Yan Chen","doi":"10.1109/ICNP.2006.320198","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320198","url":null,"abstract":"Proxy caching servers are widely deployed in today's Internet. While cooperation among proxy caches can significantly improve a network's resilience to denial-of-service (DoS) attacks, lack of cooperation can transform such servers into viable DoS targets. In this paper, we investigate a class of pollution attacks that aim to degrade a proxy's caching capabilities, either by ruining the cache file locality, or by inducing false file locality. Using simulations, we propose and evaluate the effects of pollution attacks both in Web and peer-to- peer (p2p) scenarios, and reveal dramatic variability in resilience to pollution among several cache replacement policies. We develop efficient methods to detect both false-locality and locality-disruption attacks, as well as a combination of the two. To achieve high scalability for a large number of clients/requests without sacrificing the detection accuracy, we leverage streaming computation techniques, Le., bloom filters. Evaluation results from large-scale simulations show that these mechanisms are effective and efficient in detecting and mitigating such attacks. Furthermore, a squid-based implementation demonstrates that our protection mechanism forces the attacker to launch extremely large distributed attacks in order to succeed.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134164677","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

Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks 无线传感器网络的动态无冲突查询调度

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320182

O. Chipara, Chenyang Lu, J. Stankovic

{"title":"Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks","authors":"O. Chipara, Chenyang Lu, J. Stankovic","doi":"10.1109/ICNP.2006.320182","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320182","url":null,"abstract":"With the emergence of high data rate sensor network applications, there is an increasing demand for high- performance query services in such networks. To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose networks and workloads, DCQS is specifically designed for query services supporting in-network data aggregation. DCQS has several important features. First, it optimizes the query performance and energy efficiency by exploiting the temporal properties and precedence constraints introduced by data aggregation. Second, it can efficiently adapt to dynamic workloads and rate changes without explicitly reconstructing the transmission schedule. In addition, we provide an analytical capacity bound for DCQS in terms of query completion rate. This bound enables DCQS to handle overload through rate control. NS2 simulation results demonstrate that DCQS significantly outperforms a representative TDMA protocol (DRAND) and the 802.11 protocol in terms of query latency, throughput, and energy efficiency.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129053276","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}

引用次数: 57

Forensic Analysis for Epidemic Attacks in Federated Networks 联邦网络中流行病攻击的取证分析

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320197

Yinglian Xie, V. Sekar, M. Reiter, Hui Zhang

引用次数: 53

Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast Chunkyspread:异构非结构化基于树的点对点组播

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320193

V. Venkataraman, Kaouru Yoshida, P. Francis

{"title":"Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast","authors":"V. Venkataraman, Kaouru Yoshida, P. Francis","doi":"10.1109/ICNP.2006.320193","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320193","url":null,"abstract":"The rising popularity of live IPTV has triggered renewed interest in P2P multicast. In particular, the simple and robust 'swarming' style of P2P multicast is currently favored over more traditional tree-based approaches, which are seen to be complex and fragile. Swarming approaches, however, exhibit a basic control-overhead-versus-latency tradeoff that gears it more towards high-volume, latency-tolerant applications. This paper presents a new unstructured P2P multicast protocol called Chunkyspread that is tree-based yet simple and robust. Chunkyspread uses multiple trees to provide fine-grained control over member load, reacts quickly to membership changes, scales well, and has low overhead. This paper gives a detailed description of Chunkyspread and an apples-to-apples comparison with the DHT-based Splitstream multi-tree P2P multicast algorithm. We show that Chunkyspread exhibits far better control over transmit load than Splitstream, while exhibiting comparable or better latency and responsiveness to churn. This comparison establishes Chunkyspread as the 'best of breed' among tree- based P2P multicast algorithms, thus setting the stage for future comparisons with swarming-based approaches.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121618443","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}

引用次数: 282

Robust Path-Vector Routing Despite Inconsistent Route Preferences 鲁棒路径向量路由尽管不一致的路由偏好

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320220

A. D. Jaggard, V. Ramachandran

引用次数: 9

Modeling and Caching of Peer-to-Peer Traffic 点对点流量的建模和缓存

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320218

Osama Saleh, M. Hefeeda

{"title":"Modeling and Caching of Peer-to-Peer Traffic","authors":"Osama Saleh, M. Hefeeda","doi":"10.1109/ICNP.2006.320218","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320218","url":null,"abstract":"Peer-to-peer (P2P) file sharing systems generate a major portion of the Internet traffic, and this portion is expected to increase in the future. We explore the potential of deploying proxy caches in different autonomous systems (ASes) with the goal of reducing the cost incurred by Internet service providers and alleviating the load on the Internet backbone. We conduct a measurement study to model the popularity of P2P objects in different ASes. Our study shows that the popularity of P2P objects can be modeled by a Mandelbrot-Zipf distribution, regardless of the AS. Guided by our findings, we develop a novel caching algorithm for P2P traffic that is based on object segmentation, and partial admission and eviction of objects. Our trace-based simulations show that with a relatively small cache size, less than 10% of the total traffic, a byte hit rate of up to 35% can be achieved by our algorithm, which is close to the byte hit rate achieved by an off-line optimal algorithm with complete knowledge of future requests. Our results also show that our algorithm achieves a byte hit rate that is at least 40% more, and at most triple, the byte hit rate of the common Web caching algorithms. Furthermore, our algorithm is robust in face of aborted downloads, which is a common case in P2P systems.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129386532","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}

引用次数: 150

Robust Egress Interdomain Traffic Engineering 鲁棒出口域间流量工程

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320180

Jian Qiu, Lixin Gao

{"title":"Robust Egress Interdomain Traffic Engineering","authors":"Jian Qiu, Lixin Gao","doi":"10.1109/ICNP.2006.320180","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320180","url":null,"abstract":"BGP is traditionally configured to implement traffic engineering objectives without considering potential network dynamics. This might result in undesirable traffic distribution when network failures occur. In this paper, we present algorithms for interdomain traffic engineering that achieve the interdomain traffic engineering objectives under network failures. That is, we aim to configure routing policies so that traffic is distributed evenly. More importantly, the configuration is robust in the sense that it is able to achieve the specified traffic engineering goals despite network failures. We first investigate the coarsegrained robust configurations. The derived configuration can achieve optimal robust traffic engineering objectives for most network failures. Further, we develop a greedy algorithm to derive robust BGP configuration for any traffic distribution and link capacities. We use simulations to evaluate the robustness of the derived BGP configurations by applying the algorithm to both transit and stub ASs under realistic traffic demands. Our results show that the derived BGP configurations can improve the default configuration significantly in terms of achieving the robust traffic engineering objectives. Furthermore, our algorithm achieves robust traffic engineering goals without diminishing other routing objectives.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133155436","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}

引用次数: 2

Scaling IP Routing with the Core Router-Integrated Overlay 使用核心路由器集成覆盖扩展IP路由

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320208

Xinyang Zhang, P. Francis, Jia Wang, Kaoru Yoshida

引用次数: 55