2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)最新文献

{"title":"Network initiated Wi-Fi — LTE handovers with multipath TCP","authors":"Á. Ladányi, Péter Olaszi, P. Varga, T. Cinkler","doi":"10.1109/HPSR.2015.7483097","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483097","url":null,"abstract":"The surge of mobile data traffic places strain on 3G/4G cellular networks. At high traffic density areas offloading to Wi-Fi costs less than the expansion of the marco network. However the addition of another (moreover non-3GPP) access technology raises interworking issues. One of them is the selection mechanism of the most suitable access technology and access network by the UE. This demo investigates the feasibility of a system where a network entity activates/deactivates cells and selects the point of access for each UE. The objective is to save power by turning off dispensable network elements while also considering QoS requirements.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115301182","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":"On connection control and traffic optimisation in FMC networks","authors":"Younes Khadraoui, X. Lagrange, S. Höst, T. Monath","doi":"10.1109/HPSR.2015.7483098","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483098","url":null,"abstract":"With the introduction of smartphones and tablets and the dramatical increase of the data traffic on the cellular network, operators are seeking for new solutions to provide the users with continuous connectivity while preserving a good quality of service. Since most of current user terminals are equipped with multiple interfaces, one solution is to take advantage of the different access networks. However, with the current network architectures and user application, it is not possible to use both accesses at the same time or even to switch from one to another without loosing current sessions. In this paper, we present and analyse the main mechanisms of the literature that allow a user to use multiple access networks at the same time or to move between the different networks. We show how a converged network can permit the deployment of new solutions and present some of them accompanied by use cases.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130194805","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":"Control theory based interface selection mechanism in Fixed-Mobile Converged network","authors":"Yue Li, Y. H. Aoul, P. Bertin, G. Rubino","doi":"10.1109/HPSR.2015.7483100","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483100","url":null,"abstract":"With the explosion of mobile data traffic as well as mobile devices' capability of connecting simultaneously to different access networks, we consider the need to evolve from legacy networks towards Fixed-Mobile Converged (FMC) networks. In FMC architectures, access network selection becomes an issue when mobile devices are under the coverage of distinct technologies. However, a bad selection may lead to network congestion and quality of experience degradation for the end user. In order to deal with this problem, we model and analyze the interface selection procedure using the control theory in FMC architecture. Based on our model, we design a scalable controller, which can help in directing the selection decision of mobile devices in a way to optimize the network resource utilization. Numerical results demonstrate that the number of mobile devices in each access network can converge to the target network occupation, which optimizes network resource utilization while preventing the network overload.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125618340","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":"“Don't let the stack get stuck#x201D;: A novel approach for designing efficient stackable routers","authors":"Jose Yallouz, G. Blocq, Yoram Revah, Aviran Kadosh, A. Orda","doi":"10.1109/HPSR.2015.7483081","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483081","url":null,"abstract":"Stackable Routers, i.e. a class of independent routing units operating together as a single router, constitute an affordable scalable approach for coping with the growing networking requirements of organizations. In this study, we investigate several design problems of stackable routers and develop novel schemes for improving their performance. First, we formalize a mathematical model for optimizing the network topology in terms of throughput and delay, while obeying constraints in the number of ports of each internal routing unit. We then consider the problem of minimizing the diameter of the interconnection topology, as a measure of maximum delay, and establish efficient near-to optimal (explicit) topologies. Furthermore, we also consider the problem of maximizing the throughput of a stackable router. We show its hardness and derive bounds for the optimal solution. While, traditionally, the different routing units of a stackable router are linked together in a ring topology, through simulations we show that a major improvement in the diameter of stackable routers can be accomplished even through the employment of randomly-generated topologies. Finally, we investigate the basic problem of constructing a feasible stackable router and establish some fundamental properties of the required structure of the routing units.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126913614","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":"MagicBox: An intelligent caching-enabled mobile router/server","authors":"Yaning Liu, Zhe Li, J. Point","doi":"10.1109/HPSR.2015.7483093","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483093","url":null,"abstract":"Information Centric Network (ICN) has been recently studied to support future content-oriented services by designing new network architectures and protocols. In this paper, we demonstrate our implementation of a mobile router/server built on a ICN platform. This demo called MagicBox enables content caching and prefetching for personal and professional uses. Particularly, we detail how our system will be showcased in big events where Internet access and media content can be efficiently shared.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130742654","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":"Optimal regenerator placement for path protection in impairment-aware WDM networks","authors":"R. Ramlall, Quazi Rahman, Y. Aneja, S. Bandyopadhyay","doi":"10.1109/HPSR.2015.7483111","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483111","url":null,"abstract":"This paper addresses the regenerator placement problem (RPP) when designing resilient, impairment aware WDM optical networks. For the RPP, we have proposed two solutions; an optimal solution for small networks (less than 10 nodes) and a near-optimal heuristic solution for practical-sized networks. The optimal solution uses an Integer Linear Program which can be implemented by any solver for mathematical programming. The heuristic makes use of an approach, proposed in a recent paper, that requires a formulation involving an exponential number of constraints. It was shown in that paper that this formulation can be solved very efficiently using a branch-and-cut algorithm and that the approach may be used to design resilient networks which guarantees restoration. In this paper we have shown that this branch-and-cut approach may be used as a part of a highly efficient heuristic which gave optimal results in an overwhelming number of cases that we tested.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122351151","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":"Performance optimization of load imbalanced workloads in large scale Dragonfly systems","authors":"B. Prisacari, G. Rodríguez, C. Minkenberg, Marina García, E. Vallejo, R. Beivide","doi":"10.1109/HPSR.2015.7483107","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483107","url":null,"abstract":"Dragonfly topologies are one of the most promising interconnect designs for enabling large, potentially exascale compute systems, particularly those envisioned to accommodate workloads that are sensitive to system diameter and end-to-end latency. They are cost-effective designs with a very low diameter and close to optimal performance for workloads which induce a balanced load across the network. However, these benefits are balanced by a reduced path diversity, which leaves Dragonflies vulnerable to certain adversarial traffic patterns. The performance of such workloads can be significantly improved using indirect routing approaches. However, the indirect routing approach that is most commonly used today exhibits in turn significant vulnerability to a subset of these traffic patterns for reasons that have not been, up to now entirely, understood. In exploring this vulnerability, we manage to provide a theoretical justification, based on inherent properties of the Dragonfly topology, of why performance degrades. Furthermore, we manage to isolate what specifically in the structure of a traffic pattern makes it a worst case in this context, and thus we are able to characterize the precise workload subset that will experience poor performance. By building upon the understanding of the interaction that causes sub-optimal behavior, we then show how simple changes to either the routing strategy or the process to node assignment can bring performance back close to ideal levels. Finally, we not only provide a theoretical justification for our performance models, but also validate them via comprehensive simulation-based studies of systems with up to 16,512 nodes.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129182325","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":"Multilayer network planning and operation using open-source tools (Tutorial)","authors":"J. Izquierdo-Zaragoza, P. Pavón-Mariño","doi":"10.1109/HPSR.2015.7483072","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483072","url":null,"abstract":"Continuous advances in network technologies challenge network architects in their attempt to foresee what new technologies deserve resources and investments, what existing infrastructure to keep, and their interplay during migration processes. Moreover, topics like energy efficiency, disaster resilience, or SDN/NFV are being intensively considered and investigated during the last years. As a result, R&D efforts have led to a number of solutions. Unfortunately, it is often difficult for operators to reproduce such results on their networks, maybe due to divergent philosophies between commercial planning tools used in the industry and academic tools. A paradigm shift to an open-source view of network planning could emphasize the power of peer-review and transparency to promote innovation at an accelerated pace and lower cost. This tutorial would focus on Net2Plan (http://www.net2plan.com), an open-source tool developed by the authors, and actively used in several courses (>200 students) and research projects since 2012. Built on top of a technology-agnostic multilayer network representation, Net2Plan is designed to assist users in the evaluation of built-in or original user-developed planning algorithms. In addition, users can analyze their designs using either reports or a simulation tool for in-operation scenarios like network resilience, connection-admission-control, time-varying traffic resource allocation, or even combinations of them. Besides, Net2Plan permits applying algorithms to orchestrate OpenFlow-enabled networks interacting with the northbound interface of OpenDaylight. Throughout the tutorial, attendees would have the opportunity to learn about the main features of Net2Plan, also discovering some of its applications. At the end of this tutorial, attendees would be guided through an intensive hands-on case study based on an IP-over-WDM network, e.g., including network dimensioning using built-in or user-developed algorithms, WDM line engineering (e.g., EDFA placement, impairment computations), automatic availability calculation under different failure patterns, and automatic simulation of the effects of time-varying traffic and assessment of energy-efficient switch-off techniques.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128894381","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":"Global synchronization protection for bandwidth sharing TCP flows in high-speed links","authors":"W. Lautenschlaeger, A. Francini","doi":"10.1109/HPSR.2015.7483103","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483103","url":null,"abstract":"In a congested network link, synchronization effects between bandwidth-sharing TCP flows cause wide queue length oscillations, which may translate into poor link utilization if insufficiently buffered. We introduce global synchronization protection (GSP), a simple extension to the ordinary operation of a tail-drop queue that safely suppresses the flow synchronization. Our minimalistic solution is well suited for scaling with leading-edge link rates: it adds only few extra operations in the fast path and does not require accelerated memory access compared to the line rate. GSP makes it easier to provide advanced control of TCP congestion in high-speed links and in low-power packet processing hardware. Using experiments with a Linux prototype of GSP we show that, despite its exclusive focus on removing global synchronization, the new scheme performs as well as far more complex active queue management (AQM) schemes like CoDel and PIE.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130245282","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":"Arbitrary packet matching in OpenFlow","authors":"Simon Jouet, Richard Cziva, D. Pezaros","doi":"10.1109/HPSR.2015.7483106","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483106","url":null,"abstract":"OpenFlow has emerged as the de facto control protocol to implement Software-Defined Networking (SDN). In its current form, the protocol specifies a set of fields on which it matches packets to perform actions, such as forwarding, discarding or modifying specific protocol header fields at a switch. The number of match fields has increased with every version of the protocol to extend matching capabilities, however, it is still not flexible enough to match on arbitrary packet fields which limits innovation and new protocol development with OpenFlow. In this paper, we argue that a fully flexible match structure is superior to continuously extending the number of fields to match upon. We use Berkeley Packet Filters (BPF) for packet classification to provide a protocol-independent, flexible alternative to today's OpenFlow fixed match fields. We have implemented a prototype system and evaluated the performance of the proposed match scheme, with a focus on the time it takes to execute and the memory required to store different match filter specifications. Our prototype implementation demonstrates that line-rate arbitrary packet classification can be achieved with complex BPF programs.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115097342","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}