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

A hardware-accelerated infrastructure for flexible sketch-based network traffic monitoring 硬件加速的基础设施，用于灵活的基于草图的网络流量监控

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-08-01 DOI: 10.1109/HPSR.2016.7525661

Theophilus Wellem, Yu-Kuen Lai, Chao-Yuan Huang, Danny Wen-Yaw Chung

引用次数: 9

SDN path control experiment based on social information by network virtualization node on JGN-X JGN-X上基于社会信息的网络虚拟化节点SDN路径控制实验

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-08-01 DOI: 10.1109/HPSR.2016.7525651

Tsumugi Tairaku, Haruka Yanagida, Chihiro Maru, A. Nakao, Shu Yamamoto, Saneyasu Yamaguchi, M. Oguchi

引用次数: 0

Power matching method in smart grid considering user satisfaction by PIAX platform PIAX平台下考虑用户满意度的智能电网功率匹配方法

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-07-28 DOI: 10.1109/HPSR.2016.7525656

Kosuke Asami, Akira Yamashita, Ryo Kutsuzawa, Naoya Takemura, J. Matsumoto, H. Takeshita, N. Yamanaka

{"title":"Power matching method in smart grid considering user satisfaction by PIAX platform","authors":"Kosuke Asami, Akira Yamashita, Ryo Kutsuzawa, Naoya Takemura, J. Matsumoto, H. Takeshita, N. Yamanaka","doi":"10.1109/HPSR.2016.7525656","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525656","url":null,"abstract":"In Smart Grid, various kind of renewable energies have been rapidly introduced. Then, the structure of power grid has been shifting from the tree 1:N structure with centralized power plants to the M:N liked mesh structure with various kind of power resources. In this case, it is necessary that each power demand user determines to use a proper power source among a huge number of power supplies, and we call it as “Matching” in this paper. There are three issues to realize M:N matching control. The first issue is reducing calculation time. The second issue is the dynamic adjusting in spite of fluctuation of power demand and supply. The third issue is to control user satisfied matching such as power price or satisfaction to select renewable energy. In this paper, we propose the matching method that the demand and supply matching algorithm which solves above three issues by utilizing the P2P Interactive Agent eXtensions (PIAX) platform. The calculation time can be reduced by the autonomous distributed control by PIAX platform. The issues of dynamic adjusting of power demand and supply and to consider user satisfaction are solved by the proposed matching algorithm. Computer simulation results and evaluation results by PIAX platform show that the proposed method can reduce the matching calculation time, and maximize user satisfaction in power fluctuation of demand and supply.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121197230","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

Welcome message from technical program committee chairs 来自技术项目委员会主席的欢迎辞

2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2016-07-28 DOI: 10.1109/HPSR.2016.7525630

Eiji Oki, Andrea Fumagalli, Aleksandra Smiljanic

引用次数: 0

Measuring of failure switch-over time in software-defined network 软件定义网络中故障切换时间的测量

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

Hongbo Zhang, N. Kitsuwan

引用次数: 1

Designing VNT candidates robust against congestion due to node failures 设计对节点故障引起的拥塞具有鲁棒性的VNT候选者

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

O. Alparslan, S. Arakawa, M. Murata

{"title":"Designing VNT candidates robust against congestion due to node failures","authors":"O. Alparslan, S. Arakawa, M. Murata","doi":"10.1109/HPSR.2016.7525664","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525664","url":null,"abstract":"When wavelength division multiplexing with path (circuit) switching is used on an optical network, even the failure of a single link may tear down many lightpaths and cause abrupt and significant changes in the utilization of many links in the corresponding VNT (virtual network topology). In this paper, we propose an algorithm called MFLDA (Minimum Flow Logical topology Design Algorithm) for designing VNT candidates, which can accommodate a wide range of traffic patterns. Moreover, we show that the variant called MFLDA-FO (MFLDA with Failure Optimization) can design VNT candidates, which have lower probability of congestion right after the failure of multiple nodes compared to HLDA, which is one of the best performing VNT design algorithms in the literature. Furthermore, we show that when these VNT candidates are used as attractors in an attractor selection algorithm, the average time to recover from difficult failure scenarios is less than using the attractors designed by HLDA algorithm. Unlike HLDA, our VNT design algorithm and the attractor selection algorithm does not require the traffic matrix and the topology information after the failure.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"23 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":"126834908","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

FreeSurf: Application-centric wireless access FreeSurf:以应用为中心的无线访问

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

Zhen Cao, J. Fitschen, Panagiotis Papadimitriou

引用次数: 1

Method for measuring the packet processing time of Internet workstations with the detection of interrupt coalescence 用中断合并检测测量因特网工作站包处理时间的方法

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

Khondaker M. Salehin, R. Rojas-Cessa

{"title":"Method for measuring the packet processing time of Internet workstations with the detection of interrupt coalescence","authors":"Khondaker M. Salehin, R. Rojas-Cessa","doi":"10.1109/HPSR.2016.7525658","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525658","url":null,"abstract":"The packet processing time (PPT) of an end host (i.e., workstation) is the time elapsed between the arrival of a packet at the data-link layer and the time the packet is processed at the application layer (RFCs 2679). A recent work presented an active scheme to measure PPT over Internet paths using a packet-pair based probing structure considering its importance as a network parameter in the Internet. However, the existing scheme does not consider the effect of interrupt coalescence (IC) in network interface cards (NICs), which are configured with an IC under high transmission speeds. In this paper, we propose an enhancement to the existing scheme for measuring PPT when there is an IC available in the NIC of the workstation under test. The enhanced scheme first detects IC and then measures PPT using the measured gaps of the probing structure. We evaluated the enhanced scheme through testbed experiments using two different workstations and under different transmission speeds, i.e., 10, 100, and 1000 Mb/s. Our results show that the proposed scheme consistently measures PPT with high efficacy.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"35 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":"130616175","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 high-performance OpenFlow software switch 高性能OpenFlow软件交换机

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

Reza Rahimi, M. Veeraraghavan, Yoshihiro Nakajima, Hirokazu Takahashi, Yusuke Nakajima, S. Okamoto, N. Yamanaka

{"title":"A high-performance OpenFlow software switch","authors":"Reza Rahimi, M. Veeraraghavan, Yoshihiro Nakajima, Hirokazu Takahashi, Yusuke Nakajima, S. Okamoto, N. Yamanaka","doi":"10.1109/HPSR.2016.7525645","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525645","url":null,"abstract":"Software switches offer flexibility to service providers but potentially suffer from low performance. A software switch called Lagopus was implemented using Intel's Data Plane Development Kit (DPDK), which offers libraries for high-performance packet handling. Prior work on software switches focused on characterizing packet forwarding throughput. In this work, we evaluated the impact of certain parameters and settings in Lagopus on application performance and studied packet drop rates. The importance of receive-thread packet classification for load balancing and to send delay-sensitive flows to a different worker thread from high-throughput flows was first demonstrated. Next, we showed that a loop-count variable used to control packet batching should be kept small in case link utilization is low. Finally, we showed that packet drop rate could be non-zero when the OpenFlow table size is large and packet arrival rate is high, and interestingly, the packet drop rate was higher with four worker threads than with a single worker thread. This implies a need for careful calibration and planning of the parameters of parallelization.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 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":"125275871","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}

引用次数: 15

A data center virtualization framework towards load balancing and multi-tenancy 面向负载均衡和多租户的数据中心虚拟化框架

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

Jun Duan, Yuanyuan Yang

{"title":"A data center virtualization framework towards load balancing and multi-tenancy","authors":"Jun Duan, Yuanyuan Yang","doi":"10.1109/HPSR.2016.7525633","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525633","url":null,"abstract":"Virtualization is an essential step before a bare-metal data center being ready for commercial usage, because it bridges the foreground interface for cloud tenants and the background resource management on underlying infrastructures. A concept at the heart of the foreground is multi-tenancy, which deals with logical isolation of shared virtual computing, storage, and network resources and provides adaptive capability for heterogeneous demands from various tenants. A crucial problem in the background is load balancing, which affects multiple issues including cost, flexibility and availability. In this work, we propose a virtualization framework that considers these two problems simultaneously. Our framework takes advantage of the flourishing application of distribute virtual switch (DVS), and leverages the blooming adoption of OpenFlow protocols. First, the framework accommodates heterogeneous network communication pattern by supporting arbitrary traffic matrices among virtual machines (VMs) in virtual private clouds (VPCs). The only constraint on the network flows is the bandwidth of server's network interface. Second, our framework achieves load balancing using an elaborately designed link establishment algorithm. The algorithm takes the configurations of the bare-metal data center and the dynamic network environments as inputs, and dynamically applies a globally bounded oversubscription on every link. Our framework concentrates on the fat-tree architecture, which is widely used in today's data centers.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"185 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":"131482041","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