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

筛选
英文 中文
Two-phase routing for load balancing in lossless and lossy networks 无损和有损网络中用于负载平衡的两相路由
A. Smiljanic, Nataša Maksić, Marija Antic
{"title":"Two-phase routing for load balancing in lossless and lossy networks","authors":"A. Smiljanic, Nataša Maksić, Marija Antic","doi":"10.1109/HPSR.2015.7483077","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483077","url":null,"abstract":"Shortest path routing algorithms dominate the Internet, but have their limitations that degrade the network performance as the traffic load is increasing. Shortest path routing may cause congestion on certain links while other links remain underutilized. Two-phase routing algorithms can reduce congestion due to adverse traffic patterns by means of load balancing. In this paper, we present the performance of two-phase routing algorithms in real wide area network topologies, and regular topologies typical for data centers. Also, we will analyze the influence of load balancing on goodput of TCP transport protocols in datacenter networks.","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":"115576264","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
Approximation of blocking probabilities in mobile cellular networks with channel borrowing 带信道借用的移动蜂窝网络阻塞概率逼近
Jingjin Wu, Jun Guo, E. Wong, M. Zukerman
{"title":"Approximation of blocking probabilities in mobile cellular networks with channel borrowing","authors":"Jingjin Wu, Jun Guo, E. Wong, M. Zukerman","doi":"10.1109/HPSR.2015.7483075","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483075","url":null,"abstract":"Channel borrowing has been widely adopted in mobile cellular networks as a compromise between fixed channel assignment and dynamic channel assignment. Various channel borrowing schemes have been proposed in the literature with their performance, typically in terms of blocking probability, obtained by computer simulations. However, analytical approximation methods are much more computationally effective and practically useful for performance analysis of mobile cellular networks. In this paper, we model mobile cellular networks with channel borrowing as overflow loss systems. We present two methods for approximation of blocking probabilities in such systems, one based on the classical Erlang fixed point approximation (EFPA) approach, and the other derived from the recently established information exchange surrogate approximation (IESA) framework. Comprehensive results of both EFPA and IESA are provided and compared against simulation results. We demonstrate for a wide range of scenarios that IESA is more accurate in evaluating blocking probabilities than EFPA. To the best of our knowledge, our proposed approximation framework is the first workable approach in terms of accuracy and computational efficiency for cellular networks with consideration to mobility of calls and a channel borrowing mechanism.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"40 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":"123366498","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
Investigating structure of modern web traffic 研究现代网络流量的结构
N. Kamiyama, Yuusuke Nakano, K. Shiomoto, G. Hasegawa, M. Murata, H. Miyahara
{"title":"Investigating structure of modern web traffic","authors":"N. Kamiyama, Yuusuke Nakano, K. Shiomoto, G. Hasegawa, M. Murata, H. Miyahara","doi":"10.1109/HPSR.2015.7483102","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483102","url":null,"abstract":"Modern websites consist of many rich objects dynamically produced by servers and client terminals at diverse locations. Consequently, we face complications in understanding the communication structure generated when accessing websites. To reduce the response time at browsed websites, many website objects are delivered using content delivery networks (CDNs), in which data objects are delivered from cache servers located close to user terminals. Although the use of CDNs have been assumed to reduce web response time, the actual effect of CDNs on this reduction has not been clarified. To answer this fundamental question, we measured the communication structure of traffic generated when accessing the 1,000 most popular websites from 12 locations worldwide. We found, for example, that it will be desirable to give high priority to entertainment websites at night and to business-related websites during the day.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"82 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":"126258898","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
Topology analysis of multi-hop wireless networks 多跳无线网络拓扑分析
A. Faragó
{"title":"Topology analysis of multi-hop wireless networks","authors":"A. Faragó","doi":"10.1109/HPSR.2015.7483113","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483113","url":null,"abstract":"We survey some mathematical models and tools that can be useful in the analysis and design of multi-hop wireless networks.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"350 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":"125626972","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
Tutorial on “Switching and routing for spatially and spectrally flexible elastic optical networking” “空间和频谱柔性弹性光网络的交换和路由”教程
Ioannis Tomkos
{"title":"Tutorial on “Switching and routing for spatially and spectrally flexible elastic optical networking”","authors":"Ioannis Tomkos","doi":"10.1109/HPSR.2015.7483117","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483117","url":null,"abstract":"The traffic carried by core optical networks as well as the per-channel interface rates required by IP routers are growing at a remarkable pace year-over-year. This trend is due to the widespread deployment of fixed and wireless broadband networks as well as huge growth of video-based traffic supported via internet and social media applications. Optical transmission and switching advancements have so far satisfied this huge traffic growth by delivering the content over the network infrastructure in a cost and energy efficient manner utilizing to the maximum extend the capabilities of optoelectronic and photonic subsystems and the available bandwidth of deployed optical fibers. However, we are approaching fast fundamental spectral efficiency limits of single-mode fibers and the scientific and industrial telecommunications community foresees that the growth capabilities of conventional WDM networks operating on a fixed frequency grid are quite limited.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"19 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":"131369435","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}
引用次数: 0
ERFS: The fastest x86 OpenFlow dataplane in the world ERFS:世界上最快的x86 OpenFlow数据平面
Gergely Pongrácz
{"title":"ERFS: The fastest x86 OpenFlow dataplane in the world","authors":"Gergely Pongrácz","doi":"10.1109/HPSR.2015.7483094","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483094","url":null,"abstract":"In this demo we show a fully-optimized, high-performance OpenFlow datapath with virtual execution environment support. With this we want to show that an OpenFlow based, configurable, flexible software datapath can perform as well as purpose-written software and its performance is also comparable to hardware solutions. This way flexibility and performance will come hand in hand unlike today where one have to choose between them.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"20 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":"123949958","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}
引用次数: 0
Disaster-resilient control plane design and mapping in software-defined networks 软件定义网络中容灾控制平面的设计与映射
S. Savas, M. Tornatore, M. F. Habib, P. Chowdhury, B. Mukherjee
{"title":"Disaster-resilient control plane design and mapping in software-defined networks","authors":"S. Savas, M. Tornatore, M. F. Habib, P. Chowdhury, B. Mukherjee","doi":"10.1109/HPSR.2015.7483086","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483086","url":null,"abstract":"Communication networks, such as core optical networks, heavily depend on their physical infrastructure, and hence they are vulnerable to man-made disasters, such as Electromagnetic Pulse (EMP) or Weapons of Mass Destruction (WMD) attacks, as well as to natural disasters. Large-scale disasters may cause huge data loss and connectivity disruption in these networks. As our dependence on network services increases, the need for novel survivability methods to mitigate the effects of disasters on communication networks becomes a major concern. Software-Defined Networking (SDN), by centralizing control logic and separating it from physical equipment, facilitates network programmability and opens up new ways to design disaster-resilient networks. On the other hand, to fully exploit the potential of SDN, along with data-plane survivability, we also need to design the control plane to be resilient enough to survive network failures caused by disasters. Several distributed SDN controller architectures have been proposed to mitigate the risks of overload and failure, but they are optimized for limited faults without addressing the extent of large-scale disaster failures. For disaster resiliency of the control plane, we propose to design it as a virtual network, which can be solved using Virtual Network Mapping techniques. We select appropriate mapping of the controllers over the physical network such that the connectivity among the controllers (controller-to-controller) and between the switches to the controllers (switch-to-controllers) is not compromised by physical infrastructure failures caused by disasters. We formally model this disaster-aware control-plane design and mapping problem, and demonstrate a significant reduction in the disruption of controller-to-controller and switch-to-controller communication channels using our approach.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"25 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":"129510382","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}
引用次数: 33
C-GEP: 100 Gbit/s capable, FPGA-based, reconfigurable networking equipment C-GEP: 100 Gbit/s的、基于fpga的、可重构的网络设备
P. Varga, László Kovács, Tamás Tóthfalusi, P. Orosz
{"title":"C-GEP: 100 Gbit/s capable, FPGA-based, reconfigurable networking equipment","authors":"P. Varga, László Kovács, Tamás Tóthfalusi, P. Orosz","doi":"10.1109/HPSR.2015.7483084","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483084","url":null,"abstract":"Programmable networking platforms are in the spotlight since the advent of SDN (Software Defined Networking). It is a great challenge to create such a platform - especially with reconfigurable hardware and line-rate capabilities reaching and exceeding 100 Gbit/s. These requirements together put FPGA (Field Programmable Gate Array) technology into the focus of high performance networking. In this paper, we introduce a highly flexible, programmable, multi-purpose networking platform, which is capable of hosting multiple 1 and 10 Gbit/s Ethernet interfaces - beside their 40 or 100 Gbit/s interface. The hardware of the introduced C-GEP platform is reconfigurable, even on-the-fly; due to the FPGA technology. C-GEP can host a wide range of high-speed network specific applications - including monitoring, switching and media conversion -, and it is aligned with the SDN principles. The system consists of two main building blocks: a high performance FPGA-based custom specific hardware platform and the firmware tailored to the actual task. The architecture is briefly introduced by its hardware and firmware setup, then some of the core functionalities, such as packet processing, filtering, and switching are presented.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"109 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":"129656287","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
Robust network flow against attackers with knowledge of routing method 稳健的网络流量与路由方法的知识攻击者
Vorapong Suppakitpaisarn, Wenkai Dai, Jean-François Baffier
{"title":"Robust network flow against attackers with knowledge of routing method","authors":"Vorapong Suppakitpaisarn, Wenkai Dai, Jean-François Baffier","doi":"10.1109/HPSR.2015.7483079","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483079","url":null,"abstract":"Recently, many algorithms are proposed to find a communication flow that is robust against k-edges failures. That flow can be weaker, if attackers can obtain forwarding information in each router. In this paper, we propose an algorithm that find a forwarding algorithm maximizing the remaining flow in that situation. We show that Kishimoto's multiroute flow is a (k + 1)-approximation algorithm for the problem, when the route number is k + 1. When the route number is optimally chosen, we show that the multiroute flow is a 2-approximation algorithm for most of randomly generated graphs. Our experimental results show that our algorithm has 15%-37% better performance than max-flow algorithm.","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":"121732572","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
Net2Plan: An open-source multilayer network planning tool and in-operation simulator (Demo paper) Net2Plan:一个开源的多层网络规划工具和运行中的模拟器(演示论文)
J. Izquierdo-Zaragoza, P. Pavón-Mariño
{"title":"Net2Plan: An open-source multilayer network planning tool and in-operation simulator (Demo paper)","authors":"J. Izquierdo-Zaragoza, P. Pavón-Mariño","doi":"10.1109/HPSR.2015.7483095","DOIUrl":"https://doi.org/10.1109/HPSR.2015.7483095","url":null,"abstract":"In this paper we describe the main features of the open-source Net2Plan tool. Built on top of a technology-agnostic vendor-neutral 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, using built-in or custom event generators or reaction algorithms. We motivate how a paradigm shift to an open-source view of network planning emphasizes the power of distributed peer-review, collaboration cycles and transparency to create high-quality software at an accelerated pace and lower cost.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"58 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":"133312306","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信