{"title":"Updating designed for fast IP lookup","authors":"Nataša Maksić, Zoran Chicha, A. Smiljanic","doi":"10.1109/HPSR.2012.6260829","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260829","url":null,"abstract":"Internet traffic is rapidly increasing, as well as the number of users. The increased link speeds result in smaller available time for the lookup and, hence, require faster lookup algorithms. There is a trade-off between complexities of the IP lookups and the IP lookup table updates. In this paper, we propose, implement and analyze lookup table updating for parallel optimized linear pipeline (POLP) lookup algorithm and balanced parallelized frugal lookup algorithm (BPFL). We compare POLP and BPFL update algorithms in terms of their execution times for real-world routing tables. In order to analyze the influence of updates on packet forwarding, we will observe the number of memory accesses when the lookup tables are updated due to the network topology changes. For both lookup algorithms, we measure the memory requirements as well. Our analysis will show that the BPFL update algorithm has the smaller memory requirements, while the POLP update algorithm is faster.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"30 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":"129229676","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}
A. Rostami, T. Jungel, Andreas Köpsel, H. Woesner, A. Wolisz
{"title":"ORAN: OpenFlow Routers for Academic Networks","authors":"A. Rostami, T. Jungel, Andreas Köpsel, H. Woesner, A. Wolisz","doi":"10.1109/HPSR.2012.6260853","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260853","url":null,"abstract":"We present the design and prototyping of an OpenFlow-enabled Gigabit Ethernet switch based on an ATCA industrial standard platform. Our work consists of an architectural design for introducing OpenFlow switch functionalities to the ATCA switching platform, design and development of an enhanced library for OpenFlow protocol stack, and porting the data-path functionalities and protocol end-point to the selected platform. We also carry out several performance evaluation tests on the developed switching platform and present selected results. The results demonstrate the successful introduction of OpenFlow protocol to the ATCA platform and contribute, among other things, to the identification of performance bottlenecks and crucial design issues in OpenFlow switches.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"37 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":"129090499","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}
{"title":"MPLS implementation for the Linux kernel","authors":"Igor Maravic, A. Smiljanic","doi":"10.1109/HPSR.2012.6260823","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260823","url":null,"abstract":"There is an increased demand for new functionalities of the network equipment. Smaller companies that develop such functionalities build their products based on the open-source solutions. Linux is currently the most popular open-source operating system and thus the majority of products are based on it. As MPLS is becoming indispensable in the network core, the need for more stable version of MPLS for Linux becomes evident. Thus, this work focuses on the improvement of MPLS implementation for Linux kernel. It presents architecture and performance of this implementation. Its performance is compared to the performance of IP packets forwarding and existing MPLS implementations.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"1 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":"129197029","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}
Yuji Yano, H. Iwamoto, Y. Kuroda, Shiro Ohtani, S. Ata, K. Inoue
{"title":"A slice structure using the management of network traffic prediction for green IT","authors":"Yuji Yano, H. Iwamoto, Y. Kuroda, Shiro Ohtani, S. Ata, K. Inoue","doi":"10.1109/HPSR.2012.6260858","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260858","url":null,"abstract":"Maintaining complete network service with the current infrastructure is an urgent task due to continuous growth in network traffic. It is expected that the energy consumption of network routers may become a global environmental problem, and therefore, research and development into power reduction is well desired. Our group proposes a unique structure embedded into routers, which consists of multiple slices and is dynamically controlled by the prediction of network traffic flow. In this paper, we examine this slice control and LSI architecture, and show the validity of a router. Also, the simulation used in this study is based on the true traffic in the university.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"28 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":"130748977","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}
G. M. Fernández, D. Larrabeiti, Juan A. de la Fuente
{"title":"On forwarding state control in VPN multicast based on MPLS multipoint LSPs","authors":"G. M. Fernández, D. Larrabeiti, Juan A. de la Fuente","doi":"10.1109/HPSR.2012.6260840","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260840","url":null,"abstract":"The demand for multicast-capable VPN services, like Virtual Private LAN Service (VPLS), has grown quickly in the last years. In order to save bandwidth, MPLS point-to-multipoint LSPs could be used, but the VPN-specific state information to be handled inside the network may exceed the capacity of core nodes. A well-known solution for this is to aggregate the multicast/broadcast traffic of multiple VPNs into shared p2mp LSP trees. In shared trees, although some bandwidth is wasted because a fraction of the packets are delivered to non-member leaves (either not in the VPN broadcast or multicast group), there is wide working range where a good state vs. bandwidth trade-off is achieved. In this paper we enhance and improve previous works that analyze this trade-off. We propose new techniques for multicast traffic aggregation of VPNs in MPLS-based networks, with the objective of observing the behavior of the aggregation philosophy for different aggregation degrees, which should be very useful for network design and deployment purposes. We assess the aggregation heuristics over different reference networks and VPN geographic distributions. Simulations give a quantitative indication of the relevance of intelligent aggregation, of geographical distribution and group sizes.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"57 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":"133761472","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}
{"title":"Multiple service load-balancing with OpenFlow","authors":"Marc Körner, O. Kao","doi":"10.1109/HPSR.2012.6260852","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260852","url":null,"abstract":"Load balancers have a decisive role in every enterprise network as they serve often as an entry point and have major impact on the performance and the availability of the network. While current load balancers are mostly implemented as specific hardware components, we developed a load balancer service based on the OpenFlow controllers to handle the load of multiple services without the necessity for a specific piece of hardware. This approach integrates the network and the load balancing functionality and reduces the maintenance effort. We increase the efficiency by providing dedicated and thus specifically adapted load balancing algorithms for the involved services. For example one controller handles the standard network traffic between the server nodes and other network components, while another controller handles the load-balancing of the web-servers and another one the load-balancing of e-mail servers. Furthermore experimental measurements in the local OpenFlow island using the FlowVisor and NOX controllers prove the performance capabilities of the developed prototype.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"27 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132335000","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}
{"title":"Single node protection without bouncing in IP networks","authors":"Takuya Yoshihiro, M. Jibiki","doi":"10.1109/HPSR.2012.6260833","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260833","url":null,"abstract":"Several approaches for IP fast rerouting have been proposed to augment resiliency of IP networks. For example, NotVia uses IP tunnels to avoid failure component, and FIFR prepares two routing tables to switch packets according to incoming interfaces. In this paper, for two-table approach such as FIFR, we propose to use 2-bit marking on packet header to overcome one of the problems called route bouncing. By preventing route bouncing, more efficient use of network resources are possible. We further show that our method not only prevents route bouncing but also prevents packet loops in case of multiple failure. Note that, although multiple failure occurs with low probability, once it occurs network performance significantly degrades since size of loops is far larger than microloops.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"46 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":"133012814","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}
{"title":"Exploiting Dynamic Voltage and Frequency Scaling in networks on chip","authors":"A. Bianco, P. Giaccone, Nanfang Li","doi":"10.1109/HPSR.2012.6260855","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260855","url":null,"abstract":"A Network on Chip (NoC) provides the interconnection among Processing Elements (PEs) through routers, which permit hop-by-hop communications between PEs. To cope with higher traffic demands, PEs and routers are running at increasingly higher clock frequencies. Thus the chip power consumption grows rapidly and limits NoC scalability. This paper considers a Manhattan-like mesh (grid) NoC topology. We show how to leverage the traffic unbalancing within the topology to fully exploit the classical technique of Dynamic Voltage and Frequency Scaling (DVFS) to minimize the power consumption. We model the optimal NoC power control problem, and we evaluate the maximum achievable power reduction. Furthermore, we propose three different load-balancing routing schemes, simple to implement, that approximate quite accurately the optimal solution. Simulation results show that, in most of the cases, it is enough to consider only two paths among PEs to balance the traffic and to approach the minimum possible power consumption.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"420 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":"124141497","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}
{"title":"Integration of look-ahead multicast and unicast scheduling for input-queued cell switches","authors":"Hao Yu, S. Ruepp, M. Berger, L. Dittmann","doi":"10.1109/HPSR.2012.6260828","DOIUrl":"https://doi.org/10.1109/HPSR.2012.6260828","url":null,"abstract":"This paper presents an integration of multicast and unicast traffic scheduling algorithms for input-queued cell switches. The multi-level round-robin multicast scheduling (ML-RRMS) algorithm with the look-ahead (LA) mechanism provides a highly scalable architecture and is able to reduce the head-ofline (HOL) blocking problem that the weight-based algorithm (WBA) suffers from. Leveraging the FILter & Merge (FILM) scheme, multicast and unicast traffic are independently scheduled based on their requests. Decisions are integrated following a specific policy. Remainder is looped back to the filtering module that filters out the conflicting requests to ensure fairness. Simulation results show that comparing with the scheme using WBA for the multicast scheduling, the scheme proposed in this paper reduces the HOL blocking problem for multicast traffic and provides a significant improvement in terms of latency.","PeriodicalId":163079,"journal":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing","volume":"26 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":"127123468","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}