2012 IEEE 13th International Conference on High Performance Switching and Routing最新文献

A hybrid network traffic engineering system 混合网络流量工程系统

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260841

Zhenzhen Yan, Chris Tracy, M. Veeraraghavan

{"title":"A hybrid network traffic engineering system","authors":"Zhenzhen Yan, Chris Tracy, M. Veeraraghavan","doi":"10.1109/HPSR.2012.6260841","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260841","url":null,"abstract":"This paper describes traffic analysis undertaken to answer certain questions needed to design a hybrid network traffic engineering system (HNTES). The hybrid network in question consists of an IP-routed network and a dynamic virtual-circuit network, and the role of HNTES is to identify and redirect α-flows, which are defined as flows in which the number of bytes exceeds a threshold H (1 GB) over at least one α-interval (1 minute). NetFlow data from ESnet was analyzed. Our findings show that raw IP α-flows (identified by the 5-tuple) are mostly short-lived (80% are shorter than 2 minutes), which implies that HNTES should use an offline mechanism for identifying α-flows and preconfiguring policy-based routes to redirect packets for these flows to virtual circuits since setup delay is about 1 minute. An offline mechanism using prefix flow identifiers (/32 source and destination IP addresses or /24 source and destination subnets) appears to be highly effective because α-flow generating sources and sinks typically have static public IP addresses. For example, an analysis of two months of NetFlow data from an ESnet router shows that more than 94% of the total number of bytes from α-flows would have been redirected had a /24 based offline HNTES solution been deployed.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129269709","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}

引用次数: 9

Dynamic voltage and frequency scaling in parallel network processors 并行网络处理器的动态电压和频率缩放

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260857

R. Bolla, R. Bruschi, C. Lombardo

引用次数: 6

Machine learning models for classification of BGP anomalies BGP异常分类的机器学习模型

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260835

Nabil M. Al-Rousan, L. Trajković

引用次数: 5

A simple IP fast reroute scheme for full coverage 一个简单的IP快速重路由方案，实现全覆盖

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260822

S. Antonakopoulos, Y. Bejerano, P. Koppol

引用次数: 20

Fair packet dropping 公平丢包

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260843

A. Smiljanic, Igor Maravic, L. Milinkovic

引用次数: 0

A practical and scalable congestion control scheme for high-performance multi-stage buffered switches 一种实用的、可扩展的高性能多级缓冲交换机拥塞控制方案

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260826

Najla Alfaraj, Yang Xu, H. Jonathan Chao

{"title":"A practical and scalable congestion control scheme for high-performance multi-stage buffered switches","authors":"Najla Alfaraj, Yang Xu, H. Jonathan Chao","doi":"10.1109/HPSR.2012.6260826","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260826","url":null,"abstract":"One of the challenging problems for multi-stage buffered switching is the performance degradation due to the saturation tree congestion inside the switch when traffic destined for some output ports exceeds their link capacity (i.e., hotspots) and blocks other traffic destined for non-overloaded output ports. In previous work [18], we have proposed HOPE, an effective congestion control scheme, in the 3-stage Clos Network on Chip (NOC). HOPE proactively regulates traffic destined for each output by estimating the number of their backlogged packets in the network and applying a simple stop-and-go mechanism to prevent hotspot traffic from jamming the internal links between the stages. The effectiveness of HOPE in NOC has motivated us to apply it in the multistage buffered switches. Different from an NOC, where Switch Modules (SMs) are all on the single chip, the SMs in a multi-stage buffered switch are separated from each other for a distance up to 100 m. This significantly increases the hardware complexity of HOPE. In this paper, we address the implementation challenges when applying HOPE in the 3-stage Clos network switch. In particular, we propose a scalable traffic measurement mechanism to approximate the backlogged traffic for each output port by taking advantage of the property of Clos network that traffic is evenly distributed among central SMs. We also design an efficient messaging system to notify input sources upon congestion status updates. Simulation results with different traffic patterns show that HOPE can isolate hotspot traffic from non-hotspot traffic, achieve max-min fairness among different traffic types, and provide low latency for non-hotspot traffic and high throughput for hotspot traffic.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123023604","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}

引用次数: 6

RSTP-SP: Shortest path extensions to RSTP RSTP- sp: RSTP的最短路径扩展

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260854

E. Bonada, D. Sala

引用次数: 5

Dynamic routing and resource allocation in time-driven-switched optical networks 时间驱动交换光网络中的动态路由与资源分配

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260847

F. Musumeci, L. Hernández, Lorena Zapata, M. Tornatore, M. Riunno, A. Pattavina

{"title":"Dynamic routing and resource allocation in time-driven-switched optical networks","authors":"F. Musumeci, L. Hernández, Lorena Zapata, M. Tornatore, M. Riunno, A. Pattavina","doi":"10.1109/HPSR.2012.6260847","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260847","url":null,"abstract":"The continuous traffic growth keeps challenging operators' backbone networks, which nowadays are typically implemented through Wavelength Division Multiplexing (WDM) technology. Operators are always looking for new technical solutions to efficiently exploit the bandwidth provided by WDM fiber links, while avoiding undesired increases in network cost and energy consumption. The Time Driven Switching (TDS) technique promises to effectively addresses this issue by enabling the switching of “fractions” of wavelengths thanks to the time-coordination of all network elements. By doing so, connection requests can be efficiently “packed” into WDM links without necessarily converting optical signals into the electronic domain, i.e., traffic grooming can be accomplished directly in the optical domain. In this paper we propose new dynamic routing and scheduling strategies for TDS networks and investigate the performance of a TDS network in terms of blocking probability Pb. Due to the complexity of the joint routing and scheduling, we solve the problem by a two-step approach. Three different routing strategies are evaluated and we observe that Pb is substantially reduced (up to five orders of magnitude lower) when allowing connections to be routed over different wavelengths or different physical paths. We also note that using optical buffers at most reduces Pb 10 times. Moreover we study the variation of the time-frame size switched by TDS nodes, which influences Pb up to two orders of magnitude.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125449446","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}

引用次数: 2

Performance implications of deadlock avoidance techniques in torus networks 环面网络中死锁避免技术的性能影响

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260837

B. Prisacari, G. Rodríguez, C. Minkenberg, R. Beivide

{"title":"Performance implications of deadlock avoidance techniques in torus networks","authors":"B. Prisacari, G. Rodríguez, C. Minkenberg, R. Beivide","doi":"10.1109/HPSR.2012.6260837","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260837","url":null,"abstract":"Deadlock free routing techniques for torus topologies have been a subject of deep study in the field of HPC interconnects and many proposals exist in the literature. Practical deadlock avoidance techniques can be classified into two main categories, requiring either a segregation of traffic in non-cyclic virtual networks or some form of injection control. Simulating large high-dimension tori networks using application traffic is challenging. Most proposals use either large low-dimension tori, or synthetic traffic. Currently, tori of five and six dimensions are being used in actual supercomputers, such as the Fujitsu K Computer, which was ranked first in the Top 500 in two consecutive lists (June 2011 and November 2011). To our knowledge, there are no published papers comparing the performance implications of deadlock avoidance techniques for large high-dimension tori using traffic typical of parallel applications. We chose two well established deadlock-avoidance techniques in tori with dimension-order routing, dateline resource allocation and bubble injection restriction. The simulation tools had to be adapted to scale to simulate these large networks. In this paper we analyze network performance for tori of up to 6 dimensions comprising up to 4096 nodes when dealing with both synthetic and HPC-specific workloads.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131146911","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}

引用次数: 3

Multidimensional elastic routing for next generation optical networks 面向下一代光网络的多维弹性路由

2012 IEEE 13th International Conference on High Performance Switching and Routing Pub Date : 2012-06-24 DOI: 10.1109/HPSR.2012.6260850

M. Cvijetic, I. Djordjevic, N. Cvijetic

{"title":"Multidimensional elastic routing for next generation optical networks","authors":"M. Cvijetic, I. Djordjevic, N. Cvijetic","doi":"10.1109/HPSR.2012.6260850","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260850","url":null,"abstract":"In this paper, we present and analyze a novel concept for multidimensional elastic routing based on spatial and spectral optical networking enabled by optical Multiple Input Multiple Output (MIMO) processing and Orthogonal Frequency Division Multiplexing (OFDM). These two techniques, complemented with dynamic adaptive coded-modulation are shown to form the three cornerstones of the multidimensional elastic routing concept, such that they can perform key functionality currently performed by optical crossconnects and/or Layer 2 optical switches. A statistical throughput analysis which relates key spatial and spectral components (e.g. aggregation overhead, spatial inputs/outputs, and number of spectral superbands), and identifies important practical scenarios is performed. Moreover, a performance evaluation of a flexible rate-adaptive Low Density Parity Check (LDPC)-based coded modulation scheme for multidimensional elastic networking is presented, revealing considerable gains compared to legacy approaches. By thus exploiting spatial and spectral domains in optical fiber to enable flexible routing and switching, the new scheme is promising for next-generation elastic optical networks.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115145073","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}

引用次数: 4