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

Pretty Good BGP: Improving BGP by Cautiously Adopting Routes Pretty Good BGP:通过谨慎地采用路由来改进BGP

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

Josh Karlin, S. Forrest, J. Rexford

引用次数: 196

High Speed Pattern Matching for Network IDS/IPS 网络IDS/IPS的高速模式匹配

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

M. Alicherry, M. Muthuprasanna, Vijay P. Kumar

{"title":"High Speed Pattern Matching for Network IDS/IPS","authors":"M. Alicherry, M. Muthuprasanna, Vijay P. Kumar","doi":"10.1109/ICNP.2006.320212","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320212","url":null,"abstract":"The phenomenal growth of the Internet in the last decade and society's increasing dependence on it has brought along, a flood of security attacks on the networking and computing infrastructure. Intrusion detection/prevention systems provide defenses against these attacks by monitoring headers and payload of packets flowing through the network. Multiple string matching that can compare hundreds of string patterns simultaneously is a critical component of these systems, and is a well-studied problem. Most of the string matching solutions today are based on the classic Aho-Corasick algorithm, which has an inherent limitation; they can process only one input character in one cycle. As memory speed is not growing at the same pace as network speed, this limitation has become a bottleneck in the current network, having speeds of tens of gigabits per second. In this paper, we propose a novel multiple string matching algorithm that can process multiple characters at a time thus achieving multi-gigabit rate search speeds. We also propose an architecture for an efficient implementation on TCAM-based hardware. We additionally propose novel optimizations by making use of the properties of TCAMs to significantly reduce the memory requirements of the proposed algorithm. We finally present extensive simulation results of network-based virus/worm detection using real signature databases to illustrate the effectiveness of the proposed scheme.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"37 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":"117133137","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}

引用次数: 121

O-MAC: A Receiver Centric Power Management Protocol O-MAC:以接收器为中心的电源管理协议

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

H. Cao, Kenneth W. Parker, A. Arora

{"title":"O-MAC: A Receiver Centric Power Management Protocol","authors":"H. Cao, Kenneth W. Parker, A. Arora","doi":"10.1109/ICNP.2006.320181","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320181","url":null,"abstract":"Energy efficiency is widely understood to be one of the dominant considerations for wireless sensor networks. Based on historical data and technology trends, the receiver energy consumption will dominate all energy, to the point that for the majority of applications, power management research must focus on receiver efficiency. By modeling several popular MAC layer protocols, we derive bounds on performance for receiver efficiency. In particular, we analyze four abstract models, synchronous blinking (e.g. T- MAC, S-MAC), Long Preamble (e.g. B-MAC), structured time-spreading (also called asynchronous wake-up), and random time spreading. These results strongly suggest that scheduling the receiver so as to minimize (or eliminate) the potential for interference (or collisions) could be from 10 fold to 100 fold more efficient than current practice. We provide two new receiver scheduling methods, staggered on and pseudorandom staggered on, both of which are designed to exploit the untapped opportunity for greater receiver efficiency. Compared with the centralized deterministic scheduling in staggering on, the decentralized scheduling in pseudorandom staggered on achieves only slightly lower energy efficiency. In addition, we design a new MAC protocol, called O-MAC, based upon pseudorandom staggered on that achieves near optimal energy efficiency. Finally, we describe two variations of our O-MAC protocol-with local broadcast channel and preamble-sized slots.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"3 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":"126453696","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

Differentiated BGP Update Processing for Improved Routing Convergence 差分BGP更新处理，提高路由收敛性

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

Wei Sun, Z. Morley Mao, K. Shin

{"title":"Differentiated BGP Update Processing for Improved Routing Convergence","authors":"Wei Sun, Z. Morley Mao, K. Shin","doi":"10.1109/ICNP.2006.320178","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320178","url":null,"abstract":"Internet routers today can be overwhelmed by a large number of BGP updates triggered by events such as session resets, link failures, and policy changes. Such excessive updates can delay routing convergence, which, in turn, degrades the performance of delay- and jitter-sensitive applications. This paper proposes a simple and novel idea of differentiated processing of BGP updates to reduce routers' load and improve routing convergence without changing the protocol semantics. Based on a set of criteria, BGP updates are grouped into different priority classes. Higher-priority updates are processed and propagated sooner, while lower-priority ones, not affecting routing decisions, can be delayed to both reduce routers' load and improve routing convergence. We first present a general methodology for update classification, update processing, and priority-state inference. By analyzing real BGP data obtained from Route Views, we show that our update classification is feasible and beneficial. We further propose two differentiated update processing (DUP) algorithms and evaluate them using the SSFNet BGP simulator on several realistic network topologies. The algorithms are shown to be very effective for large networks, yielding 30% fewer updates and reducing convergence time by 80%. Our scheme is simple and light-weight with little added processing overhead. It can be deployed incrementally, since BGP messages are not modified and every BGP router makes routing decisions independently.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"61 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":"129612824","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

Heterogeneous Congestion Control: Efficiency, Fairness and Design 异构拥塞控制:效率、公平与设计

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

A. Tang, D. X. Wei, S. Low

{"title":"Heterogeneous Congestion Control: Efficiency, Fairness and Design","authors":"A. Tang, D. X. Wei, S. Low","doi":"10.1109/ICNP.2006.320206","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320206","url":null,"abstract":"When heterogeneous congestion control protocols that react to different pricing signals (e.g. packet loss, queueing delay, ECN marking etc.) share the same network, the current theory based on utility maximization fails to predict the network behavior. Unlike in a homogeneous network, the bandwidth allocation now depends on router parameters and flow arrival patterns. It can be non-unique, inefficient and unfair. This paper has two objectives. First, we demonstrate the intricate behaviors of a heterogeneous network through simulations and present a rigorous framework to help understand its equilibrium efficiency and fairness properties. By identifying an optimization problem associated with every equilibrium, we show that every equilibrium is Pareto efficient and provide an upper bound on efficiency loss due to pricing heterogeneity. On fairness, we show that intra-protocol fairness is still decided by a utility maximization problem while inter-protocol fairness is the part over which we don't have control. However it is shown that we can achieve any desirable inter-protocol fairness by properly choosing protocol parameters. Second, we propose a simple slow timescale source- based algorithm to decouple bandwidth allocation from router parameters and flow arrival patterns and prove its feasibility. The scheme needs only local information.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"25 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":"128290081","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}

引用次数: 28

Reducing Congestion Effects in Wireless Networks by Multipath Routing 通过多路径路由减少无线网络中的拥塞效应

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

L. Popa, C. Raiciu, I. Stoica, David S. Rosenblum

{"title":"Reducing Congestion Effects in Wireless Networks by Multipath Routing","authors":"L. Popa, C. Raiciu, I. Stoica, David S. Rosenblum","doi":"10.1109/ICNP.2006.320202","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320202","url":null,"abstract":"We propose a solution to improve fairness and increase throughput in wireless networks with location information. Our approach consists of a multipath routing protocol, biased geographical routing (BGR), and two congestion control algorithms, in-network packet scatter (IPS) and end-to-end packet scatter (EPS), which leverage BGR to avoid the congested areas of the network. BGR achieves good performance while incurring a communication overhead of just 1 byte per data packet, and has a computational complexity similar to greedy geographic routing. IPS alleviates transient congestion by splitting traffic immediately before the congested areas. In contrast, EPS alleviates long term congestion by splitting the flow at the source, and performing rate control. EPS selects the paths dynamically, and uses a less aggressive congestion control mechanism on non-greedy paths to improve energy efficiency. Simulation and experimental results show that our solution achieves its objectives. Extensive ns-2 simulations show that our solution improves both fairness and throughput as compared to single path greedy routing. Our solution reduces the variance of throughput across all flows by 35%, reduction which is mainly achieved by increasing throughput of long-range flows with around 70%. Furthermore, overall network throughput increases by approximately 10% Experimental results on a 50- node testbed are consistent with our simulation results, suggesting that BGR is effective in practice.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116920928","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}

引用次数: 109

Impact of Routing Metrics on Path Capacity in Multirate and Multihop Wireless Ad Hoc Networks 多速率和多跳无线自组织网络中路由度量对路径容量的影响

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

H. Zhai, Yuguang Fang

{"title":"Impact of Routing Metrics on Path Capacity in Multirate and Multihop Wireless Ad Hoc Networks","authors":"H. Zhai, Yuguang Fang","doi":"10.1109/ICNP.2006.320201","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320201","url":null,"abstract":"Finding a path with enough throughput in multihop wireless ad hoc networks is a critical task of QoS Routing. Previous studies on routing algorithms focused on networks with a single channel rate. The capability of supporting multiple channel rates, which is common in wireless systems, has not been carefully studied in routing algorithms. In this paper, we first carry out a comprehensive study on the impacts of multiple rates, interference and packet loss rate on the maximum end-to-end throughput or path capacity. A linear programming problem is formulated to determine the path capacity of any given path. This problem is also extended to a joint routing and link scheduling optimization problem to find a path with the largest path capacity. We show that interference clique transmission time is inversely proportional to the upper bound of the path capacity, and hence we propose to use it as a new routing metric. Moreover, we evaluate the capability of various routing metrics such as hop count, expected transmission times, end-to-end transmission delay or medium time, link rate, bandwidth distance product, and interference clique transmission time to discover a high throughput path. The results show that different routing metrics lead to paths with significantly different path capacity, and the interference clique transmission time tends to discover paths with higher throughput than other metrics.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133188049","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}

引用次数: 121

The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design 类bittorrent文件共享协议设计中的微妙权衡

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

Bin Fan, D. Chiu, John C.S. Lui

{"title":"The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design","authors":"Bin Fan, D. Chiu, John C.S. Lui","doi":"10.1109/ICNP.2006.320217","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320217","url":null,"abstract":"The BitTorrent (BT) file sharing protocol is popular due to its scalability property and the incentive mechanism to reduce free-riding. However, in designing such P2P file sharing protocols, there is a fundamental \"tussle\" between keeping peers, specially the more resourceful ones, in the system for as long as possible to help the system achieve better performance and allowing peers finish their download as quickly as possible. The current BT protocol represents only \"one\" possible implementation in this whole design spectrum. In this paper, we characterize the \"complete\" design space of BT-like protocols. We use fairness index to measure the fairness that incorporates the contribution peers make. We show that there is a wide range of design choices, ranging from optimizing the performance of file download, to optimizing the fairness measure. More importantly, we show that there is a simple and easily implementable design knob which can be used to choose a particular operating point in the design space. We then discuss different algorithms (centralized versus distributed) in realizing the design knob. We also carry out performance evaluation to quantify the merits and properties of the BT-like file sharing protocols.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134272900","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}

引用次数: 127

On the Practical and Security Issues of Batch Content Distribution Via Network Coding 基于网络编码的批量内容分发的实用与安全问题研究

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

Qiming Li, D. Chiu, John C.S. Lui

{"title":"On the Practical and Security Issues of Batch Content Distribution Via Network Coding","authors":"Qiming Li, D. Chiu, John C.S. Lui","doi":"10.1109/ICNP.2006.320209","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320209","url":null,"abstract":"File distribution via network coding has received a lot of attention lately. However, direct application of network coding may have security problems. In particular, attackers can inject \"faked\" packets into the file distribution process to slow down the information dispersal or even deplete the network resource. Therefore, content verification is an important and practical issue when network coding is employed. When network coding is used, it is infeasible for the source of the content to provide all the hash values or signatures required for verification, and hence the traditional \"hash-and-sign\" methods are no longer applicable. Recently, a new on-the-fly verification technique is proposed by Krohn et al. for rateless erasure codes. However, their scheme requires a large number of hash values to be distributed in advance, and all of them are needed to verify even for a single packet. We propose a new batch delivery and verification scheme that is similar to the classical scenario where the authentication information of a message is embedded with the message and is sufficient for the verification purpose. We investigate how our technique can be applied when random linear network coding is employed, and show that both the computational and the bandwidth overhead can be greatly reduced by using a variant of the random network coding. We further show by simulation that this variant is sufficiently effective in practice.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122899032","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}

引用次数: 62