2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)最新文献_第3页

Impact of spatial traffic variation on energy savings and devices lifetime in core networks 空间流量变化对核心网节能和设备寿命的影响

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525657

F. Idzikowski, F. Pfeuffer, A. Werner, L. Chiaraviglio

引用次数: 2

Route advertisement policies for border gateway protocol with provider aggregatable addressing 具有提供者聚合寻址的边界网关协议的路由发布策略

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525637

A. H. A. Muktadir, K. Fujikawa, H. Harai

{"title":"Route advertisement policies for border gateway protocol with provider aggregatable addressing","authors":"A. H. A. Muktadir, K. Fujikawa, H. Harai","doi":"10.1109/HPSR.2016.7525637","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525637","url":null,"abstract":"This paper proposes route advertisement policies (RAP) for the Border Gateway Protocol (BGP) with provider aggregatable (PA) addressing. The proposed RAP takes the advantage of address aggregation opportunity. If multiple address spaces are allocated to each of autonomous systems (ASes) that are multihomed to multiple upper ASes, reduction of the Forwarding Information Base (FIB) and quick convergence are achieved. However, multihoming based on PA addressing poses two limitations. One, more specific address information is hidden due to address aggregation. Two, multiple allocated address spaces per AS cause an address selection problem. To cope with these two limitations, we propose RAP to ensure connectivity among ASes with fewer routes installed in the FIB of each top layer AS. We implement the proposed RAP in an emulation environment with BGP (using the Quagga software suite) and our developed Hierarchical Automatic Number Allocation (HANA) protocols. We use HANA as a tool to automatically allocate hierarchical PA addresses to ASes. We confirm that with our proposed policies the FIB and RIB (Routing Information Base) sizes in top layer ASes do not change with the increase of stub ASes, and number of exchanged BGP update messages are reduced up to 67.3% than that of the case with conventional BGP RAP.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128263238","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

Multicast tree construction algorithm for stabilization of power quality in smart grid 面向智能电网电能质量稳定的组播树构建算法

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525655

J. Matsumoto

{"title":"Multicast tree construction algorithm for stabilization of power quality in smart grid","authors":"J. Matsumoto","doi":"10.1109/HPSR.2016.7525655","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525655","url":null,"abstract":"For stabilizing power frequency in the grid, demand-supply balancing capability by manipulating the demand side, known as Demand Response (DR), is getting attention because of the continuous increase in renewable energy resources and deferrable loads such as electric vehicles in addition to the traditional adjustment function by supply side such as thermal plants. In the future smart grid, it is imperative that in order to implement an effective communication system among a large number of smart devices in each home via a smart metering infrastructure, multicast in the back-bone network would be an appropriate choice. Due to the difference in the structure between a power network and a communication network, the effectiveness of DR would vary considerably with the constructed multicast tree. This paper proposes a new algorithm for multicast tree construction considering the tree cost, the communication delay, and DR capability in each destination. The proposed algorithm ensures the total cost of constructing multicast trees within the acceptable range, and improves the effect of DR capability giving priorities to destinations which have a larger DR capability. The performance of the proposed algorithm is evaluated by simulation in terms of total tree cost and stability of power frequency affected by sudden change in power demand.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133834160","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

Distributed-like optical path switch control approach for interconnect networks 互连网络的分布式光路开关控制方法

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525650

K. Ishii, S. Namiki

引用次数: 2

New challenges in network optimization 网络优化的新挑战

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525631

D. Papadimitriou

{"title":"New challenges in network optimization","authors":"D. Papadimitriou","doi":"10.1109/HPSR.2016.7525631","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525631","url":null,"abstract":"This document provides a detailed description of the tutorial lecture on Challenges in Network Optimization provided at the 2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR). This lecture is motivated by the recent evolutions of communication networks which have induced new challenges in mixed-integer network optimization ranging from problem formulation to computational methods. Indeed, paradigms such as information-oriented networks, resource abstraction (at the heart of virtualization and other cloudification), and programmability of network functions lead to combine well-established optimization problems with network optimization problems (network design, resource placement/allocation and other multi-commodity flow problems). Beyond dimensioning, provisioning/configuring and scheduling/ planning, the combination of conventional network optimization problems with the facility-location or the hub-location problem for instance, provides guidelines for the design of unified processes that address these evolutions. In this tutorial, we exploit mixed-integer programming as a tool for driving early design decisions (thus, not only for the traditional application of network optimization) together with associated requirements such as congestion awareness but also reliability by extending the combined problems to their reliable variant. We compare how the selection of the appropriate routing strategies may also be determined by means of this approach. Finally, in order to cope with demand uncertainty, we extend these formulations to their set-induced robust counterpart. Indeed, robust optimization enables to accommodate spatio-temporal variations in demands and associated traffic for instance without compromising on the solution quality. We conclude this lecture by outlining some of the main research challenges in network optimization at both modeling and computational level.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124012269","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

A recursively constructed low-cost interconnect 递归构造的低成本互连

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525635

Jun Duan, Yuanyuan Yang

{"title":"A recursively constructed low-cost interconnect","authors":"Jun Duan, Yuanyuan Yang","doi":"10.1109/HPSR.2016.7525635","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525635","url":null,"abstract":"Interconnects play a critical role in various networking environments including data center networks, high performance computing systems, networks-on-chip, etc. An important design concern of interconnects is the hardware cost, especially when the scale increases. In order to achieve lower hardware cost, a lot of previous work leverages a tradeoff between the cost and the performance. In this paper, we alternatively propose a new type of recursively constructed multi-stage interconnect which is both cost efficient and performance guaranteed. The proposed interconnect can deliver the same communication pattern support and path availability as previous designs, yet at the same time achieves lower hardware complexity. We first design a prototype (or base case) for the new interconnect, which consists of three stages of switching modules. Then we use this prototype to decompose and replace the switching modules repeatedly and obtain the recursive case of our interconnect. The hardware cost of the recursively constructed interconnect can be significantly reduced, meanwhile the communication pattern support and path availability are perfectly preserved. For both the base case and the recursive case, we study the properties of the network topology, propose routing algorithms, give performance analysis and calculate cost. We show that the interconnect reduces the hardware cost from the previously best known result O(N3/2), where N is the number of input or output nodes of the interconnect, to O(N11/1-2δ log1.585N), where δ is a small value approaching zero when N increases.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123439680","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

On-chip order-exploiting routing table minimization for a multicast supercomputer network 片上顺序利用路由表最小化的多播超级计算机网络

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525659

Andrew Mundy, J. Heathcote, J. Garside

{"title":"On-chip order-exploiting routing table minimization for a multicast supercomputer network","authors":"Andrew Mundy, J. Heathcote, J. Garside","doi":"10.1109/HPSR.2016.7525659","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525659","url":null,"abstract":"SpiNNaker is a many-core supercomputer - designed for the simulation of large neural-networks - in which cores communicate with multicast packets. Routing within SpiNNaker is controlled by Ternary Content Addressable Memories (TCAMs) of quite limited size. As not all neural-network applications will result in routing tables sufficiently small to fit in TCAM some minimization is necessary. In this paper we argue that existing techniques neither result in sufficiently minimized tables nor can be implemented within the small code and memory footprint available to a SpiNNaker core. To resolve these issues we present a new algorithm, Ordered-Covering (OC), which exploits the ordered nature of TCAMs to achieve good compression of routing tables while meeting the code-space and memory constraints of the SpiNNaker platform. We show that, for one benchmark, on-chip routing table minimization using OC results in a 64.5 χ speed-up compared with performing the minimization off-chip. For a second, more challenging, benchmark we show that a 2.8 χ speed-up in table minimization time is achieved by combined on- and off-chip minimization.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128311815","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}

引用次数: 5

Task allocation scheme based on computational and network resources for heterogeneous Hadoop clusters 基于计算资源和网络资源的异构Hadoop集群任务分配方案

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525667

Tomohiro Matsuno, Bijoy Chand Chatterjee, E. Oki, M. Veeraraghavan, S. Okamoto, N. Yamanaka

引用次数: 5

Providing performance guarantees in data center network switching fabrics 为数据中心网络交换结构提供性能保障

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525660

Fadoua Hassen, L. Mhamdi

引用次数: 0

Adaptive VNE method based on Yuragi principle for software defined infrastructure 基于Yuragi原理的软件定义基础结构自适应VNE方法

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-06-14 DOI: 10.1109/HPSR.2016.7525665

Koki Inoue, S. Arakawa, Satoshi Imai, T. Katagiri, M. Murata

{"title":"Adaptive VNE method based on Yuragi principle for software defined infrastructure","authors":"Koki Inoue, S. Arakawa, Satoshi Imai, T. Katagiri, M. Murata","doi":"10.1109/HPSR.2016.7525665","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525665","url":null,"abstract":"SDI (Software Defined Infrastructure) provides virtualized infrastructures to customers by slicing computing resources and network resources. One of the important problems for deploying SDI framework is to control the assignment of physical resources to a virtual network against changes of traffic demand and service demand. For this problem, VNE (Virtual Network Embedding) problem that maps a virtual network to physical resources has been addressed, but a centralized calculation was assumed. It is difficult to adopt the centralized approaches as a size of infrastructure increases and a number of VN requests increases. This is because the identification of current situation becomes more complicated. In this paper, we present a VNE method that works with a little information for the large, complicated, and uncertain SDI frameworks. To achieve this, the proposed method applies biological “Yuragi” principle. The term Yuragi is a Japanese word whose English translation means a small perturbation to the system. Yuragi is a mechanism of adaptability of organisms and is often expressed as attractor selection model. This paper develops Yuragi-based VNE method that deals with node attribute and has a generality of a performance objective and runs in multi-slice environments. Simulation results show that the Yuragi-based method decreases VN migrations by about 29% than a heuristic method to adapt the fluctuations in resource requirements.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130458883","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