The 18th IEEE International Conference on Network Protocols最新文献_第3页

GreenTE: Power-aware traffic engineering 绿色:功率感知交通工程

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

Mingui Zhang, Cheng Yi, B. Liu, Beichuan Zhang

{"title":"GreenTE: Power-aware traffic engineering","authors":"Mingui Zhang, Cheng Yi, B. Liu, Beichuan Zhang","doi":"10.1109/ICNP.2010.5762751","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762751","url":null,"abstract":"Current network infrastructures exhibit poor power efficiency, running network devices at full capacity all the time regardless of the traffic demand and distribution over the network. Most research on router power management are at component level or link level, treating routers as isolated devices. A complementary approach is to facilitate power management at network level by routing traffic through different paths to adjust the workload on individual routers or links. Given the high path redundancy and low link utilization in today's large networks, this approach can potentially allow more network devices or components to go into power saving mode. This paper proposes an intra-domain traffic engineering mechanism, GreenTE, which maximizes the number of links that can be put into sleep under given performance constraints such as link utilization and packet delay. Using network topologies and traffic data from several wide-area networks, our evaluation shows that GreenTE can reduce line-cards' power consumption by 27% to 42% under constraints that the maximum link utilization is below 50% and the network diameter remains the same as in shortest path routing.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"69 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":"122820481","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}

引用次数: 281

Practical Virtual Coordinates for large wireless sensor networks 大型无线传感器网络的实用虚拟坐标

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

Jiangwei Zhou, Yu Chen, B. Leong, B. Feng

引用次数: 16

Scalable video multicast with joint layer resource allocation in broadband wireless networks 宽带无线网络中具有联合层资源分配的可扩展视频组播

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

Peilong Li, Honghai Zhang, Bao-hua Zhao, S. Rangarajan

{"title":"Scalable video multicast with joint layer resource allocation in broadband wireless networks","authors":"Peilong Li, Honghai Zhang, Bao-hua Zhao, S. Rangarajan","doi":"10.1109/ICNP.2010.5762778","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762778","url":null,"abstract":"Scalable video coding (SVC), together with adaptive modulation and coding (AMC), can improve wireless multicast streaming video by jointly performing radio resource allocation and modulation and coding scheme (MCS) selection. However, the existing schemes in the literature allocate radio resources for different video layers separately, which leads to a waste of radio resources. In this work, we introduce the notion of joint layer resource allocation which allows to jointly allocate resources to multiple video layers that are assigned the same MCS. We formulate this problem and prove it to be NP-hard. Then we develop a pseudo-polynomial algorithm that finds the optimal total system utility. Our algorithm assumes a very generic utility function and flexible video layer rates. To reduce the complexity of the algorithm, we also propose Fully Polynomial Time Approximation Schemes (FPTAS) for the same problem. Simulation results show that our optimal algorithm offers significant improvement on system utility over a previous optimal algorithm and a greedy algorithm both of which do not support joint layer resource allocation. The proposed approximation algorithm provides controllable tradeoff between performance and computational complexity and, with appropriately chosen parameters, it outperforms the greedy algorithm with 40% less running time.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"31 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":"123684478","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

Passive interference measurement in Wireless Sensor Networks 无线传感器网络中的无源干扰测量

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

Shucheng Liu, G. Xing, Hongwei Zhang, Jianping Wang, Jun Huang, M. Sha, Liusheng Huang

{"title":"Passive interference measurement in Wireless Sensor Networks","authors":"Shucheng Liu, G. Xing, Hongwei Zhang, Jianping Wang, Jun Huang, M. Sha, Liusheng Huang","doi":"10.1109/ICNP.2010.5762754","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762754","url":null,"abstract":"Interference modeling is crucial for the performance of numerous WSN protocols such as congestion control, link/channel scheduling, and reliable routing. In particular, understanding and mitigating interference becomes increasingly important for Wireless Sensor Networks (WSNs) as they are being deployed for many data-intensive applications such as structural health monitoring. However, previous works have widely adopted simplistic interference models that fail to capture the wireless realities such as probabilistic packet reception performance. Recent studies suggested that the physical interference model (i.e., PRR-SINR model) is significantly more accurate than existing interference models. However, existing approaches to physical interference modeling exclusively rely on the use of active measurement packets, which imposes prohibitively high overhead to bandwidth-limited WSNs. In this paper, we propose the passive interference measurement (PIM) approach to tackle the complexity of accurate physical interference characterization. PIM exploits the spatiotemporal diversity of data traffic for radio performance profiling and only needs to gather a small amount of statistics about the network. We evaluate the efficiency of PIM through extensive experiments on both a 13-node and a 40-node testbeds of TelosB motes. Our results show that PIM can achieve high accuracy of PRR-SINR modeling with significantly lower overhead compared with the active measurement approach.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"27 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":"114480921","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}

引用次数: 61

Firewall modules and modular firewalls 防火墙模块和模块化防火墙

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

H. B. Acharya, Aditya Joshi, M. Gouda

{"title":"Firewall modules and modular firewalls","authors":"H. B. Acharya, Aditya Joshi, M. Gouda","doi":"10.1109/ICNP.2010.5762766","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762766","url":null,"abstract":"A firewall is a packet filter placed at an entry point of a network in the Internet. Each packet that goes through this entry point is checked by the firewall to determine whether to accept or discard the packet. The firewall makes this determination based on a specified sequence of overlapping rules. The firewall uses the first-match criterion to determine which rule in the sequence should be applied to which packet. Thus, to compute the set of packets to which a rule is applied, the firewall designer needs to consider all the rules that precede this rule in the sequence. This “rule dependency” complicates the task of designing firewalls (especially those with thousands of rules), and makes firewalls hard to understand. In this paper, we present a metric, called the dependency metric, for measuring the complexity of firewalls. This metric, though accurate, does not seem to suggest ways to design firewalls whose dependency metrics are small. Thus, we present another metric, called the inversion metric, and develop methods for designing firewalls with small inversion metrics. We show that the dependency metric and the inversion metric are correlated for some classes of firewalls. So by aiming to design firewalls with small inversion metrics, the designer may end up with firewalls whose dependency metrics are small as well. We present a method for designing modular firewalls whose inversion metrics are very small. Each modular firewall consists of several components, called firewall modules. The inversion metric of each firewall module is very small - in fact, 1 or 2. Thus, we conclude that modular firewalls are easy to design and easy to understand.","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":"128695378","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

Fast routing table lookup based on deterministic multi-hashing 基于确定性多哈希的快速路由表查找

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

Zhuo Huang, David Lin, J. Peir, Shigang Chen, S. Alam

{"title":"Fast routing table lookup based on deterministic multi-hashing","authors":"Zhuo Huang, David Lin, J. Peir, Shigang Chen, S. Alam","doi":"10.1109/ICNP.2010.5762752","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762752","url":null,"abstract":"New generations of video, voice, high-performance computing and social networking applications have continuously driven the development of novel routing technologies for higher packet forwarding speeds to meet the future Internet demand. One of the fundamental design issues for core routers is fast routing table lookup, which is a key problem at the network layer of the Internet protocol suite. It is difficult to scale the current TCAM-based or trie-based solutions for future routing tables due to increasing table size, longer prefix length, and demands for higher throughput. This paper focuses on hash-based lookup solutions that have the potential of offering high throughput at one memory access per packet. We design the first deterministic multi-hashing scheme with small indexing overhead, which evenly distributes address prefixes to hash buckets for routing-information storage. We minimize both the size of each bucket and the number of buckets that need to be fetched to the network processor for packet forwarding. Consequently, near-optimal routing throughput is achieved. Performance evaluations demonstrate that the proposed deterministic multi-hashing scheme can maintain a constant lookup rate of over 250 million packets per second with today's commodity SRAM, which is much faster than the existing hashing schemes.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"21 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":"133312081","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

ETOC: Obtaining robustness in component-based localization ETOC:在基于组件的定位中获得鲁棒性

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

Xiaoping Wang, Yunhao Liu, Zheng Yang, Junliang Liu, Jun Luo

{"title":"ETOC: Obtaining robustness in component-based localization","authors":"Xiaoping Wang, Yunhao Liu, Zheng Yang, Junliang Liu, Jun Luo","doi":"10.1109/ICNP.2010.5762755","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762755","url":null,"abstract":"Accurate localization is crucial for wireless ad-hoc and sensor networks. Among the localization schemes, component-based approaches specialize in localization performance, which can properly conquer network sparseness and anchor sparseness. However, such design is sensitive to measurement errors. Existing robust localization methods focus on eliminating the positioning error of a single node. Indeed, a single node has two dimensions of freedom in 2D space and only suffers from one type of transformation: translation. As a rigid 2D structure, a component suffers from three possible transformations: translation, rotation, and reflection. A high degree of freedom brings about complicated cases of error productions and difficulties on error controlling. This study is the first work addressing how to deal with ranging noises for component- based methods. By exploiting a set of robust patterns, we present an Error-TOlerant Component-based algorithm (ETOC) that not only inherits the high-performance characteristic of component-based methods, but also achieves robustness of the result. We evaluate ETOC through a real-world sensor network consisting of 120 TelosB motes as well as extensive large-scale simulations. Experiment results show that, comparing with the-state-of-the-art designs, ETOC can work properly in sparse networks and provide more accurate localization results.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"163 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":"121622159","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

An opportunistic relay protocol for vehicular road-side access with fading channels 有衰落信道的车辆路旁接入的机会中继协议

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

Joon Yoo, B. Choi, M. Gerla

{"title":"An opportunistic relay protocol for vehicular road-side access with fading channels","authors":"Joon Yoo, B. Choi, M. Gerla","doi":"10.1109/ICNP.2010.5762772","DOIUrl":"https://doi.org/10.1109/ICNP.2010.5762772","url":null,"abstract":"In the drive-thru Internet access systems, vehicles connect to road-side access points (APs) to use IP-based services, such as web-browsing, e-mail, and file download, in addition to the customized vehicular applications. However, the mobility of vehicles and the limited coverage of APs result in the short connectivity duration and low throughput, thus leading to low availability of Internet to vehicle services. Vehicle-to-vehicle (V2V) relay support is an attractive backup solution that can address these limitations by extending the coverage. To fully realize the benefit of V2V relay support, however, the vehicle that gives the best performance must be selected as relay, yet the dynamic wireless channel conditions and the high speed of vehicles render relay selection a challenging problem. In this paper, we evaluate several relay strategies in an analytic framework to compute the resulting overall network capacity with fading channels. We then propose and devise an efficient opportunistic relay protocol that exploits multiuser diversity and effectively copes with the dynamic channel. Through both capacity analysis and Qualnet simulations, we show that the opportunistic relay scheme significantly outperforms others.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"17 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113957010","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}

引用次数: 55