2007 Workshop on High Performance Switching and Routing最新文献_第6页

Optimal Combination of Circuit and Packet Switching in Optical Core Networks 光核心网中电路与分组交换的最佳组合

2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281220

P. Menon, R.A. Thompson

引用次数: 3

Max-min Utility Fairness in Link Aggregated Systems 链路聚合系统的最大最小效用公平性

2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1109/HPSR.2007.4281267

S. Mohanty, Changbin Liu, B. Liu, L. Bhuyan

引用次数: 10

Fast Packet Classification Using Multi-Dimensional Encoding 基于多维编码的快速分组分类

2007 Workshop on High Performance Switching and Routing Pub Date : 2007-07-30 DOI: 10.1587/TRANSCOM.E92.B.2044

C. Huang, Chien Chen

{"title":"Fast Packet Classification Using Multi-Dimensional Encoding","authors":"C. Huang, Chien Chen","doi":"10.1587/TRANSCOM.E92.B.2044","DOIUrl":"https://doi.org/10.1587/TRANSCOM.E92.B.2044","url":null,"abstract":"Internet routers need to classify incoming packets quickly into flows in order to support features such as Internet security, virtual private networks and quality of service (QoS). Packet classification uses information contained in the packet header, and a predefined rule table in the routers. Packet classification of multiple fields is generally a difficult problem. Hence, researchers have proposed various algorithms. This study proposes a multidimensional encoding method in which parameters such as the source IP address, destination IP address, source port, destination port and protocol type are placed in a multidimensional space. Similar to the previously best known algorithm, i.e., bitmap intersection, multi-dimensional encoding is based on the multi-dimensional range lookup approach, in which rules are divided into several multidimensional collision-free rule sets. These sets are then used to form the new coding vector to replace the bit vector of the bitmap intersection algorithm. The average memory storage of this encoding is ominus (L-N-logN) for each dimension, where L denotes the number of collision-free rule sets, and N represents the number of rules. The multi-dimensional encoding practically requires much less memory than bitmap intersection algorithm. Additionally, the computation needed for this encoding is as simple as bitmap intersection algorithm. The low memory requirement of the proposed scheme means that it not only decreases the cost of packet classification engine, but also increases the classification performance, since memory access represents the performance bottleneck in the packet classification engine implementation using a network processor.","PeriodicalId":258491,"journal":{"name":"2007 Workshop on High Performance Switching and Routing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126097950","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}

引用次数: 1

Providing 100% Throughput in a Buffered Crossbar Switch 提供100%的吞吐量在缓冲交叉开关

2007 Workshop on High Performance Switching and Routing Pub Date : 2007-05-01 DOI: 10.1109/HPSR.2007.4281262

Yanming Shen, S. Panwar, H. J. Chao

引用次数: 21