2008 IEEE International Conference on Network Protocols最新文献_第3页

Mobility-centric geocasting for mobile partitioned networks 移动分区网络的以移动为中心的地理广播

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697041

M. Piórkowski

{"title":"Mobility-centric geocasting for mobile partitioned networks","authors":"M. Piórkowski","doi":"10.1109/ICNP.2008.4697041","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697041","url":null,"abstract":"We describe our design of a geocast service for mobile partitioned networks (MPNs). We focus mainly on minimizing the delivery latency. Our approach exploits the time-stability of the collective mobility pattern. In MPNs, in contrast to MANETs, the end-to-end path is frequently not available. Thus, communication in such networks becomes problematic. To overcome this difficulty, researchers propose a solution in which the nodepsilas mobility is exploited. This paradigm is often called mobility-assisted forwarding. In order to design routing protocols for MPNs, researchers study key mobility metrics, for example the inter-contact times between nodes. Based on the analysis of a real-life mobility trace, we show that the inter-contact time distribution is spatially dependent. This is a result of spatially heterogeneous mobility pattern that appears to be stable in time. We demonstrate that any georouting protocol designed to work in MPNs can benefit from knowing such an underlying mobility pattern. We propose an abstraction called mobility map that represents the collective mobility pattern. We also present how mobility maps can be used for georouting in MPNs and we also show a simple mechanism for the collaborative discovery of mobility maps. Finally, we propose a geocast protocol for MPNs - GeoMobCast - that explicitly uses mobility maps and is designed to minimize the expected message delay while maximizing the message delivery. We empirically evaluate the protocol by using simulations and we observe the improved performance, compared to other approaches.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115673474","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

Protecting anonymity in dynamic peer-to-peer networks 在动态对等网络中保护匿名性

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697029

Krishna P. N. Puttaswamy, A. Sala, Christo Wilson, Ben Y. Zhao

{"title":"Protecting anonymity in dynamic peer-to-peer networks","authors":"Krishna P. N. Puttaswamy, A. Sala, Christo Wilson, Ben Y. Zhao","doi":"10.1109/ICNP.2008.4697029","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697029","url":null,"abstract":"Peer-to-peer anonymous networks offer the resources to support todaypsilas Internet applications. In todaypsilas dynamic networks, the key challenge to these systems arises from node dynamics and failures that disrupt anonymous routing paths, forcing them to be frequently rebuilt. Not only do these path rebuilds interrupt application sessions, but they also leak information to logging attacks such as the predecessor attack, leading to significant degradation of anonymity over long sessions. In this paper, we propose Bluemoon, a new anonymous protocol that provides strong resilience against the predecessor attack through the use of persistent anonymous links called hooks. When chained together, these links create robust anonymous paths that avoid path disruptions and rebuilds across node failures. Through detailed analysis, we show that relative to prior approaches, Bluemoon provides significantly stronger resistance against predecessor attacks. Finally, we implement and deploy a prototype on both local and Internet-scale network testbeds, and show that it provides high throughput even in high-load environments such as PlanetLab.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128899128","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}

引用次数: 13

Byzantine resilient synchronization for content and presence updates in MANETS MANETS中内容和状态更新的拜占庭弹性同步

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697045

Bogdan Carbunar, Michael Pearce, S. Mohapatra, Loren J. Rittle, V. Vasudevan

{"title":"Byzantine resilient synchronization for content and presence updates in MANETS","authors":"Bogdan Carbunar, Michael Pearce, S. Mohapatra, Loren J. Rittle, V. Vasudevan","doi":"10.1109/ICNP.2008.4697045","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697045","url":null,"abstract":"In this paper, we present techniques for synchronizing nodes that periodically broadcast content and presence updates to co-located nodes over an ad-hoc network, where nodes may exhibit Byzantine malicious behavior. We first propose an algorithm for synchronizing the periodic transmissions of all the nodes in an attacker-free multi-hop network. This allows nodes to save battery power by switching off their network cards without missing updates from their neighbors. We then introduce a suite of spoofing attacks and show that they are able to disrupt synchronization and destabilize the network even when launched by a single attacker in large, multi-hop networks. Finally, we devise a rating based algorithm that rates neighbors based on the consistency of their behaviors. By favoring well-behaved nodes in the synchronization process, we show that we can address the issue of Byzantine malicious behavior very effectively. Our evaluation shows that the algorithms are computationally efficient and, for the setup considered, extend the device lifetime by 30% over an always-on Wi-Fi scenario. Moreover, in the presence of attacks, our rating based algorithm quickly stabilizes the synchronization process and reduces the number of lost updates by 85%.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126797941","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

RelayCast: Scalable multicast routing in Delay Tolerant Networks RelayCast:延迟容忍网络中可扩展的多播路由

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697040

U. Lee, Soon-Young Oh, Kang-Won Lee, M. Gerla

{"title":"RelayCast: Scalable multicast routing in Delay Tolerant Networks","authors":"U. Lee, Soon-Young Oh, Kang-Won Lee, M. Gerla","doi":"10.1109/ICNP.2008.4697040","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697040","url":null,"abstract":"Mobile wireless networks with intermittent connectivity, often called delay/disruption tolerant networks (DTNs), have recently received a lot of attention because of their applicability in various applications, including multicasting. To overcome intermittent connectivity, DTN routing protocols utilize mobility-assist routing by letting the nodes carry and forward the data. In this paper, we study the scalability of DTN multicast routing. As Gupta and Kumar showed that unicast routing is not scalable, recent reports on multicast routing also showed that the use of a multicast tree results in a poor scaling behavior. However, Grossglauser and Tse showed that in delay tolerant applications, the unicast routing overhead can be relaxed using the two-hop relay routing where a source forwards packets to relay nodes and the relay nodes in turn deliver packets to the destination via ldquomobility,rdquo thus achieving a perfect scaling behavior of Theta(1). Inspired by this result, we seek to improve the throughput bound of wireless multicast in a delay tolerant setting using mobility-assist routing. To this end, we propose RelayCast, a routing scheme that extends the two-hop relay algorithm in the multicast scenario. Given that there are ns sources each of which is associated with nd random destinations, our results show that RelayCast can achieve the throughput upper bound of Theta(min(1, n/nsnd)). We also analyze the impact of various network parameters and routing strategies (such as buffer size, multi-user diversity among multicast receivers, and delay constraints) on the throughput and delay scaling properties of RelayCast. Finally, we validate our analytical results with a simulation study.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128257388","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}

引用次数: 96

Monitoring persistently congested Internet links 监控持续拥塞的互联网连接

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697035

Leiwen Deng, A. Kuzmanovic

{"title":"Monitoring persistently congested Internet links","authors":"Leiwen Deng, A. Kuzmanovic","doi":"10.1109/ICNP.2008.4697035","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697035","url":null,"abstract":"Measurement tools that can accurately locate and monitor congested Internet links would significantly help us understand how the Internet operates. However, developing such tools is challenging, especially when our concerned target is congestion on the core Internet links rather than that on the relatively easily measured access links. Congestion on core links - and persistent congestion in particular - can reveal systematic problems such as routing pathologies, poorly-engineered network policies, or non-cooperative inter-AS relationships. In this paper, we present Pong, a novel tool capable of accurately locating and monitoring a subset of non-access Internet links that exhibit persistent congestion over longer time scales. Pong takes advantage of the persistently congested link property to overcome the long-lasting challenges common for delay-based inference tools. In addition, it exploits the same property to (i) infer otherwise unknown underlying path conditions, (ii) determine appropriate queuing delay thresholds to reveal congestion, (iii) achieve high accuracy with low probing rate, and (iv) detect moments of its own inaccuracy. Finally, Pong can quantify measurement resultspsila accuracy comprehensively, allowing us to further select vantage points that maximize the observability of the underlying congestion.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131273622","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

Rank-indexed hashing: A compact construction of Bloom filters and variants 排序索引哈希:Bloom过滤器和变体的紧凑结构

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697026

Nan Hua, Haiquan Zhao, Bill Lin, Jun Xu

{"title":"Rank-indexed hashing: A compact construction of Bloom filters and variants","authors":"Nan Hua, Haiquan Zhao, Bill Lin, Jun Xu","doi":"10.1109/ICNP.2008.4697026","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697026","url":null,"abstract":"Bloom filter and its variants have found widespread use in many networking applications. For these applications, minimizing storage cost is paramount as these filters often need to be implemented using scarce and costly (on-chip) SRAM. Besides supporting membership queries, Bloom filters have been generalized to support deletions and the encoding of information. Although a standard Bloom filter construction has proven to be extremely space-efficient, it is unnecessarily costly when generalized. Alternative constructions based on storing fingerprints in hash tables have been proposed that offer the same functionality as some Bloom filter variants, but using less space. In this paper, we propose a new fingerprint hash table construction called Rank-Indexed Hashing that can achieve very compact representations. A rank-indexed hashing construction that offers the same functionality as a counting Bloom filter can be achieved with a factor of three or more in space savings even for a false positive probability of just 1%. Even for a basic Bloom filter function that only supports membership queries, a rank-indexed hashing construction requires less space for a false positive probability as high as 0.1%, which is significant since a standard Bloom filter construction is widely regarded as extremely space-efficient for approximate membership problems.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"65 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131435865","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}

引用次数: 34

CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding 使用分段网络编码的无线网状网络中的机会路由

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697020

Yunfeng Lin, Baochun Li, B. Liang

{"title":"CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding","authors":"Yunfeng Lin, Baochun Li, B. Liang","doi":"10.1109/ICNP.2008.4697020","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697020","url":null,"abstract":"Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportunistic routing can be implemented in a simple and practical way without resorting to a complicated scheduling protocol. Due to constraints of computational complexity, a protocol utilizing network coding needs to perform segmented network coding, which partitions the data into multiple segments and encode only packets in the same segment. However, existing designs transmit only one segment at any given time while waiting for its acknowledgment, which degrades performance as the size of the network scales up. In this paper, we propose CodeOR, a new protocol that uses network coding in opportunistic routing to improve throughput. By transmitting a window of multiple segments concurrently, it improves the performance of existing work by a factor of two on average (and a factor of four in some cases). CodeOR is especially appropriate for real-time multimedia applications through the use of a small segment size to decrease decoding delay, and is able to further increase network throughput with a smaller packet size and a larger window size.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133663183","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}

引用次数: 187

An interest-driven approach to integrated unicast and multicast routing in MANETs 基于兴趣驱动的多播和单播路由集成方法

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697043

R. Menchaca-Méndez

引用次数: 15

Competitive analysis of buffer policies with SLA commitments 具有SLA承诺的缓冲策略的竞争分析

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697038

B. Patt-Shamir, Gabriel Scalosub, Y. Shavitt

引用次数: 1

IMS presence server: Traffic analysis & performance modelling IMS状态服务器:流量分析和性能建模

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697025

Caixia Chi, Ruibing Hao, Dong Wang, Zhen Cao

{"title":"IMS presence server: Traffic analysis & performance modelling","authors":"Caixia Chi, Ruibing Hao, Dong Wang, Zhen Cao","doi":"10.1109/ICNP.2008.4697025","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697025","url":null,"abstract":"Presence is a service that allows a user to be informed about the reachability, availability, and willingness to communicate of another user. Presence service has become a key enabler for many popular applications such as instant messaging and push-to-talk. However a study shows that presence service can account for 50% or more of the total signalling traffic the IMS core network handles (C. Urrutia-Valds et al., 2006). This is quite a burden for a real IMS network and need to be tackled. In this paper, a thorough analysis of the traffic load distribution reveals that notify messages account for the largest portion of the traffic load on a presence server. We propose a mathematical model of a queueing system with batch arrival and controlled vacation to describe the processing of notify messages inside a presence server. The model is then used to calculate the optimal value of the timer that controls the notify queue, which is an essential parameter to adjust in network sizing upon deploying a presence server. An approximation of the model is also provided so that the performance of a presence server can be tuned in an online manner based on real traffic statistics.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125011350","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}

引用次数: 30