Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects最新文献

Designing packet buffers with statistical guarantees 设计具有统计保证的数据包缓冲区

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375202

G. Shrimali, I. Keslassy, N. McKeown

引用次数: 12

Non-random generator for IPv6 tables IPv6表的非随机生成器

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375198

Mei Wang, S. Deering, T. Hain, L. Dunn

{"title":"Non-random generator for IPv6 tables","authors":"Mei Wang, S. Deering, T. Hain, L. Dunn","doi":"10.1109/CONECT.2004.1375198","DOIUrl":"https://doi.org/10.1109/CONECT.2004.1375198","url":null,"abstract":"The next generation Internet Protocol, IPv6, has attracted growing attention. The characteristics of future IPv6 routing tables play a key role in router architecture and network design. In order to design and analyze efficient and scalable IP lookup algorithms for IPv6, IPv6 routing tables are needed. Analysis of existing IPv4 tables shows that there is an underlying structure that differs greatly from random distributions. Since there are few users on IPv6 at present, current IPv6 table sizes are small and unlikely to reflect future IPv6 network growth. Thus, neither randomly generated tables nor current IPv6 tables are good benchmarks for analysis. More representative IPv6 lookup tables are needed for the development of IPv6 routers. From an analysis of current IPv4 tables, algorithms are proposed for generating IPv6 lookup tables. Tables generated by the suggested methods exhibit certain features characteristic of real lookup tables, reflecting not only new IPv6 address allocation schemes but also patterns common to IPv4 tables. These tables provide useful research tools by a better representation of future lookup tables as IPv6 becomes more widely deployed.","PeriodicalId":224195,"journal":{"name":"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects","volume":" 29","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120833363","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}

引用次数: 56

Efficient multi-match packet classification with TCAM 基于TCAM的高效多匹配分组分类

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375197

Fang Yu, R. Katz

{"title":"Efficient multi-match packet classification with TCAM","authors":"Fang Yu, R. Katz","doi":"10.1109/CONECT.2004.1375197","DOIUrl":"https://doi.org/10.1109/CONECT.2004.1375197","url":null,"abstract":"Today's packet classification systems are designed to provide the highest priority matching result, e.g., the longest prefix match, even if a packet matches multiple classification rules. However, new network applications, such as intrusion detection systems, require information about all the matching results. We call this the multi-match classification problem. In several complex network applications, multi-match classification is immediately followed by other processing dependent on the classification results. Therefore, classification should be even faster than the line rate. Pure software solutions cannot be used due to their slow speeds. We present a solution based on ternary content addressable memory (TCAM), which produces multi-match classification results with only one TCAM lookup and one SRAM lookup per packet - about ten times fewer memory lookups than a pure software approach. In addition, we present a scheme to remove the negation format in rule sets, which can save up to 95% of TCAM space compared with the straight forward solution. We show that using our pre-processing scheme, header processing for the SNORT rule set can be done with one TCAM and one SRAM lookup using a 135 KB TCAM.","PeriodicalId":224195,"journal":{"name":"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120991422","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}

引用次数: 69

Efficient multicast on a terabit router 在太比特路由器上实现高效组播

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375203

Punit Bhargava, Sriram C. Krishnan, R. Panigrahy

{"title":"Efficient multicast on a terabit router","authors":"Punit Bhargava, Sriram C. Krishnan, R. Panigrahy","doi":"10.1109/CONECT.2004.1375203","DOIUrl":"https://doi.org/10.1109/CONECT.2004.1375203","url":null,"abstract":"Multicast routing protocols and routers on the Internet enable multicast transmission by replicating packets close to the destinations, obviating the need for multiple unicast connections, thereby saving network bandwidth and improving throughput. Similarly, within a router, multicast between linecards is enabled by a multicast capable switch fabric. A multicast cell is sent once from the source linecard to the switch fabric; the switch fabric sends the cells to all the destination linecards obviating the need for, and the waste of, linecard to fabric bandwidth that would result from multiple unicast cell transmissions. For high capacity routers (several terabits), the fixed size destination field of the cell is inadequate to specify exactly the subset of the switch ports the multicast cell should be sent to the number of multicast connections to be supported. Therefore, for several connections, we have to supercast, i.e., send the cell to non-subscribing linecards and have them drop the cell. We study the problem of assigning destination labels for multicast cells so that the amount of supercast, i.e., wasted bandwidth, is minimized, and the throughput of the router is maximized. We formalize this combinatorial optimization problem and prove it NP-complete and hard to find approximate solutions. We have devised several heuristic algorithms that we have implemented and we report the experimental results. Faster heuristics can support a higher multicast connection establishment rate; slower heuristics can be invoked off-line to further optimize multicast label maps.","PeriodicalId":224195,"journal":{"name":"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122078053","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}

引用次数: 7

Performance evaluation of InfiniBand with PCI Express 采用 PCI Express 的 InfiniBand 性能评估

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375193

Jiuxing Liu, A. Mamidala, Abhinav Vishnu, D. Panda

{"title":"Performance evaluation of InfiniBand with PCI Express","authors":"Jiuxing Liu, A. Mamidala, Abhinav Vishnu, D. Panda","doi":"10.1109/CONECT.2004.1375193","DOIUrl":"https://doi.org/10.1109/CONECT.2004.1375193","url":null,"abstract":"We present an initial performance evaluation of InfiniBand HCAs (host channel adapters) from Mellanox with PCI Express interfaces. We compare the performance with HCAs using PCI-X interfaces. Our results show that InfiniBand HCAs with PCI Express can achieve significant performance benefits. Compared with HCAs using 64 bit/133 MHz PCI-X interfaces, they can achieve 20%-30% lower latency for small messages. The small message latency achieved with PCI Express is around 3.8 /spl mu/s, compared with the 5.0 /spl mu/s with PCI-X. For large messages, HCAs with PCI Express using a single port can deliver unidirectional bandwidth up to 968 MB/s and bidirectional bandwidth up to 1916 MB/s, which are, respectively, 1.24 and 2.02 times the peak bandwidths achieved by HCAs with PCI-X. When both the ports of the HCAs are activated, HCAs with PCI Express can deliver a peak unidirectional bandwidth of 1486 MB/s and aggregate bidirectional bandwidth up to 2729 MB/s, which are 1.93 and 2.88 times the peak bandwidths obtained using HCAs with PCI-X. PCI Express also improves performance at the MPI level. A latency of 4.6 /spl mu/s with PCI Express is achieved for small messages. And for large messages, unidirectional bandwidth of 1497 MB/s and bidirectional bandwidth of 2724 MB/s are observed.","PeriodicalId":224195,"journal":{"name":"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128371906","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}

引用次数: 26

Resilient network infrastructures for global grid computing 面向全局网格计算的弹性网络基础设施

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375212

L. Valcarenghi

{"title":"Resilient network infrastructures for global grid computing","authors":"L. Valcarenghi","doi":"10.1109/CONECT.2004.1375212","DOIUrl":"https://doi.org/10.1109/CONECT.2004.1375212","url":null,"abstract":"Summary form only given. Grid computing is defined as \"coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations\". The transport network infrastructure represents one of the main resources to be shared. Emerging high capacity intelligent grid transport network infrastructures, such as optical transport networks based on generalized multiprotocol label switching (GMPLS) and automatically switched optical networks/automatically switched transport networks (ASON/ASTN), are fostering the expansion of grid computing from local area networks (LAN) (i.e., cluster grid) to wide area networks (WAN) (i.e., global grid). Indeed they are able to guarantee the required quality of service (QoS) to heterogeneous grid applications that share the same grid network infrastructure. The tutorial addresses one particular aspect of the grid transport network QoS: resilience, i.e. the ability to overcome failures. In particular, it gives an overview of the current efforts for guaranteeing grid application resilience in spite of different types of failures, such as network infrastructure failures or computer crashes. Finally, it shows that, by tailoring the utilized recovery scheme to the type of failure that occurred, it is possible to optimize the failure recovery process.","PeriodicalId":224195,"journal":{"name":"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121368557","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}

引用次数: 0

Design of a high-speed optical interconnect for scalable shared memory multiprocessors 可扩展共享存储器多处理器高速光互连设计

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/MM.2005.7

Avinash Karanth Kodi, A. Louri

{"title":"Design of a high-speed optical interconnect for scalable shared memory multiprocessors","authors":"Avinash Karanth Kodi, A. Louri","doi":"10.1109/MM.2005.7","DOIUrl":"https://doi.org/10.1109/MM.2005.7","url":null,"abstract":"The paper proposes a highly connected optical interconnect based architecture that maximizes the channel availability for future scalable parallel computers, such as distributed shared memory (DSM) multiprocessors and cluster networks. As the system size increases, various messages (requests, responses and acknowledgments) increase in the network resulting in contention. This results in increasing the remote memory access latency and significantly affects the performance of these parallel computers. As a solution, we propose an architecture called RAPID (reconfigurable and scalable all-photonic interconnect for distributed-shared memory), that provides low remote memory access latency by providing fast and efficient unicast, multicast and broadcast capabilities using a combination of aggressively designed WDM, TDM and SDM techniques. We evaluated RAPID based on network characteristics and by simulation using synthetic traffic workloads and compared it against other networks such as electrical ring, torus, mesh and hypercube networks. We found that RAPID outperforms all networks and satisfies most of the requirements of parallel computer design such as low latency, high bandwidth, high connectivity, and easy scalability.","PeriodicalId":224195,"journal":{"name":"Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116096010","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}

引用次数: 45

Studying network protocol offload with emulation: approach and preliminary results 网络协议卸载仿真研究方法及初步结果

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375208

R. Westrelin, Nicolas Fugier, Erik Nordmark, Kai Kunze, E. Lemoine

引用次数: 34

Worms vs. perimeters: the case for hard-LANs 蠕虫vs.外围:硬局域网的情况

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375206

N. Weaver, Daniel P. W. Ellis, Stuart Staniford-Chen, V. Paxson

引用次数: 39

Evaluation of a wireless enterprise backbone network architecture 无线企业骨干网体系结构评估

Proceedings. 12th Annual IEEE Symposium on High Performance Interconnects Pub Date : 2004-08-05 DOI: 10.1109/CONECT.2004.1375211

Ashish Raniwala, T. Chiueh

引用次数: 56