The 18th IEEE International Conference on Network Protocols最新文献

On exploiting transient contact patterns for data forwarding in Delay Tolerant Networks 基于暂态接触模式的容延迟网络数据转发研究

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762768

Wei Gao, G. Cao

引用次数: 93

Exploring the hidden connectivity in urban vehicular networks 探索城市车辆网络中的隐藏连接

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762773

Kebin Liu, Mo Li, Yunhao Liu, Xiangyang Li, Minglu Li, Huadong Ma

{"title":"Exploring the hidden connectivity in urban vehicular networks","authors":"Kebin Liu, Mo Li, Yunhao Liu, Xiangyang Li, Minglu Li, Huadong Ma","doi":"10.1109/ICNP.2010.5762773","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762773","url":null,"abstract":"The high mobility of VANET makes information exchange across the network excessively difficult. Traditional approaches designed for stationary networks are not applicable due to the high dynamics among the nodes. Applying the routing techniques tailored for general mobile networks inevitably brings huge traffic burden to the crowded urban VANET and leads to low efficiency. To make the information exchange fluent and efficient, we explore the unique features of the urban VANET. By exploring the invariants in the mobile network topology, we are able to efficiently manage the information on top of the “intersection graph” transformed from the underlying network of road segments in the urban area. Our approach can thus achieve efficient query dissemination and data retrieval on this information organization. We intensively investigate and analyze a trace that records the movement of more than 4000 taxies in the urban area of Shanghai City over several months. We grasp the key impact of the fundamental factors that affect the VANET behaviors and accordingly develop tailored techniques to maximize the performance of this design. Experimental results validate the effectiveness and efficiency of our design.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132080584","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

Beyond co-existence: Exploiting WiFi white space for Zigbee performance assurance 超越共存:利用WiFi空白空间实现Zigbee性能保证

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762779

Jun Huang, G. Xing, Gang Zhou, Ruogu Zhou

{"title":"Beyond co-existence: Exploiting WiFi white space for Zigbee performance assurance","authors":"Jun Huang, G. Xing, Gang Zhou, Ruogu Zhou","doi":"10.1109/ICNP.2010.5762779","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762779","url":null,"abstract":"Recent years have witnessed the increasing adoption of ZigBee technology for performance-sensitive applications such as wireless patient monitoring in hospitals. However, operating in unlicensed ISM bands, ZigBee devices often yield unpredictable throughput and packet delivery ratio due to the interference from ever increasing WiFi hotspots in 2.4 GHz band. Our empirical results show that, although WiFi traffic contains abundant white space, the existing coexistence mechanisms such as CSMA are surprisingly inadequate for exploiting it. In this paper, we propose a novel approach that enables ZigBee links to achieve assured performance in the presence of heavy WiFi interference. First, based on statistical analysis of real-life network traces, we present a Pareto model to accurately characterize the white space in WiFi traffic. Second, we analytically model the performance of a ZigBee link in the presence of WiFi interference. Third, based on the white space model and our analysis, we develop a new ZigBee frame control protocol called WISE, which can achieve desired trade-offs between link throughput and delivery ratio. Our extensive experiments on a testbed of 802.11 netbooks and 802.15.4 TelosB motes show that, in the presence of heavy WiFi interference, WISE achieves 4× and 2× performance gains over B-MAC and a recent reliable transmission protocol, respectively, while only incurring 10.9% and 39.5% of their overhead.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117178686","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}

引用次数: 302

Identifying suspicious activities through DNS failure graph analysis 通过DNS故障图分析识别可疑活动

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762763

Nan Jiang, Jin Cao, Yu Jin, Erran L. Li, Zhi-Li Zhang

{"title":"Identifying suspicious activities through DNS failure graph analysis","authors":"Nan Jiang, Jin Cao, Yu Jin, Erran L. Li, Zhi-Li Zhang","doi":"10.1109/ICNP.2010.5762763","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762763","url":null,"abstract":"As a key approach to securing large networks, existing anomaly detection techniques focus primarily on network traffic data. However, the sheer volume of such data often renders detailed analysis very expensive and reduces the effectiveness of these tools. In this paper, we propose a light-weight anomaly detection approach based on unproductive DNS traffic, namely, the failed DNS queries, with a novel tool - DNS failure graphs. A DNS failure graph captures the interactions between hosts and failed domain names. We apply a graph decomposition algorithm based on the tri-nonnegative matrix factorization technique to iteratively extract coherent co-clusters (dense subgraphs) from DNS failure graphs. By analyzing the co-clusters in the daily DNS failure graphs from a 3-month DNS trace captured at a large campus network, we find these co-clusters represent a variety of anomalous activities, e.g., spamming, trojans, bots, etc.. In addition, these activities often exhibit distinguishable subgraph structures. By exploring the temporal properties of the co-clusters, we show our method can identify new anomalies that likely correspond to unreported domain-flux bots.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129432613","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

SocialSwarm: Exploiting distance in social networks for collaborative flash file distribution SocialSwarm:利用社交网络中的距离进行协作flash文件分发

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762775

M. J. Probst, Jun Cheol Park, Ravin Abraham, S. Kasera

引用次数: 7

Identification-free batch authentication for RFID tags RFID标签的免识别批量认证

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762764

Lei Yang, Jinsong Han, Yong Qi, Yunhao Liu

引用次数: 87

Optimal cache-based route repair for real-time traffic 基于缓存的实时流量最优路由修复

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762770

Chuan Han, Yaling Yang, Y. Peng

引用次数: 0

TowerDefense: Deployment strategies for battling against IP prefix hijacking 塔防:对抗IP前缀劫持的部署策略

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762762

Tongqing Qiu, Lusheng Ji, Dan Pei, Jia Wang, Jun Xu

引用次数: 12

Impairment-aware path selection and regenerator placement in translucent optical networks 半透明光网络中损伤感知路径选择和再生器放置

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762750

F. Kuipers, Anteneh Beshir, A. Orda, P. Mieghem

{"title":"Impairment-aware path selection and regenerator placement in translucent optical networks","authors":"F. Kuipers, Anteneh Beshir, A. Orda, P. Mieghem","doi":"10.1109/ICNP.2010.5762750","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762750","url":null,"abstract":"Physical impairments, such as noise and signal distortions, negatively affect the quality of information transfer in optical networks. The effect of physical impairments predominantly augments with distance and bit rate of the signal to the point that it becomes detrimental to the information transfer. To reverse the effect of physical impairments, the signal needs to be regenerated at nodes that have regeneration capabilities. Regenerators are costly and are, therefore, usually only sparsely placed in the network, in which case it is referred to as a translucent network. This paper deals with two problems in translucent networks, namely: (1) how to incorporate impairment awareness in the routing algorithms, and (2) how many regenerators to place inside the network and where. We propose exact and heuristic algorithms for impairment-aware path selection and, through simulations, show that our heuristic TIARA is computationally efficient and performs very close to our exact algorithm EIARA. Subsequently, we propose a greedy algorithm for placing regenerators that, contrary to previous proposals, is suitable for multiple impairment metrics, has polynomial complexity for a single impairment metric, and is cheaper in terms of the number of regenerators needed.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116164792","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}

引用次数: 35

Peer-assisted VoD prefetching in double auction markets 双拍卖市场的同行辅助VoD预取

The 18th IEEE International Conference on Network Protocols Pub Date : 2010-10-05 DOI: 10.1109/ICNP.2010.5762776

Yuan Feng, Baochun Li, Bo Li

{"title":"Peer-assisted VoD prefetching in double auction markets","authors":"Yuan Feng, Baochun Li, Bo Li","doi":"10.1109/ICNP.2010.5762776","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762776","url":null,"abstract":"In peer-assisted video-on-demand (VoD) streaming systems, server bandwidth costs can be astronomical when the number of videos and peers scales up. Since peers are able to seek to an arbitrary point of playback in any video at any time, prefetching is often considered a desirable way to redistribute media content in the entire system so that less server bandwidth may be consumed. In this paper, we point out that the benefits of prefetching in peer-assisted VoD do not come without considerable upfront costs of bandwidth, and as such prefetching strategies should be carefully designed to remain beneficial, but practically carried out in a decentralized manner. We show how the challenge of minimizing server bandwidth is equivalent to maximizing the system-wide utility in the context of double auction markets, where each peer participates in a number of double auctions by bidding for and selling video segments. With simulations, we show that prefetching strategies based on such double auction markets are decentralized, and are effective in reducing the consumption of server bandwidth as well, as compared to existing alternative heuristics in the literature.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122587322","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}

引用次数: 17