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

筛选
英文 中文
Minimizing Network Resources Consumed for Link Latency Measurements in SDNs 最小化sdn中链路延迟测量所消耗的网络资源
Yang Tian, Weiwei Chen, C. Lea
{"title":"Minimizing Network Resources Consumed for Link Latency Measurements in SDNs","authors":"Yang Tian, Weiwei Chen, C. Lea","doi":"10.1109/HPSR.2019.8808113","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808113","url":null,"abstract":"Accurate link latency information is required for solving many traffic engineering problems, such as congestion avoidance routing and load balancing. Many link latency measurement schemes have been proposed for Software-Defined Networks (SDNs), and many of these require the SDN controllers to inject and remove entries into and from flow tables dynamically. If done frequently, this process can generate a large amount of traffic overhead and consume a lot of processing and computation resources. In this paper, we present a link latency measurement scheme, where entries for latency measurement are already embedded inside flow tables. The main challenge in designing such a scheme lies in how to select measurement paths that can minimize the number of entries added to the expensive TCAM-based flow tables and the amount of traffic generated for latency measurement. We present solutions that can minimize both in this paper.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131516479","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
Optimization of Network Service Scheduling with Resource Sharing and Preemption 资源共享和抢占的网络服务调度优化
Yuncan Zhang, Fujun He, Takehiro Sato, E. Oki
{"title":"Optimization of Network Service Scheduling with Resource Sharing and Preemption","authors":"Yuncan Zhang, Fujun He, Takehiro Sato, E. Oki","doi":"10.1109/HPSR.2019.8808118","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808118","url":null,"abstract":"This paper proposes an optimization model to schedule network services (NSes) in virtual networks with resource sharing and preemption. Inefficient NS scheduling can severely degrade the acceptance ratio of arriving NSes of the network. Conventional NS scheduling models do not consider sharing computational resources of a node among different virtual network function (VNF) instances deployed on this node. In the proposed model, NSes mapped to the same VNF instance on the same node share computational resources of the VNF instance, and VNF instances deployed on the same node share computational resources of the node. The proposed model allows preemption, which means that rescheduling the process order of NSes in runtime is possible and the process duration of each function of an NS is allowed to be discrete. We formulate the proposed model as an integer linear programming problem to maximize the number of admissible NSes. The numerical results show that the proposed model outperforms conventional models in terms of the acceptance ratio of arriving NSes.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126138744","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
Longest Prefix Matching with Pruning 最长前缀匹配与修剪
Lingtong Liu, Jun Hu, Yibo Yan, Siang Gao, Tong Yang, Xiaoming Li
{"title":"Longest Prefix Matching with Pruning","authors":"Lingtong Liu, Jun Hu, Yibo Yan, Siang Gao, Tong Yang, Xiaoming Li","doi":"10.1109/HPSR.2019.8808125","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808125","url":null,"abstract":"Nowadays, an explosive increase of the size of Forwarding Information Base (FIB) in backbone router makes IP lookup a challenging issue. An effective solution is to use Bloom filter. Because of its false positive, to boost longest prefix matching (LPM), sophisticated Bloom filter-based algorithms were proposed, which makes FIB updating extremely difficult. To address this issue, in this paper, we propose a novel IP lookup algorithm which prunes unneeded prefix probes incurred by false positive and supports FIB updating. Experimental results show that our algorithm can save approximately 7 ~ 24% on-chip memory space than the well-known PBF (longest Prefix matching using Bloom Filters) while keeping the same average number of probes of 1.003 per IP lookup. In other words, given a limited on-chip memory budget, our proposed algorithm can handle FIB 7 ~ 24% bigger than PBF. The source code can be found in [1].","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124665816","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
Trajectory Tracking for Autonomous Underwater Vehicle Based on Model-Free Predictive Control 基于无模型预测控制的自主水下航行器轨迹跟踪
Weiwei Xu, Yuchen Xiao, Hongran Li, Jian Zhang, Heng Zhang
{"title":"Trajectory Tracking for Autonomous Underwater Vehicle Based on Model-Free Predictive Control","authors":"Weiwei Xu, Yuchen Xiao, Hongran Li, Jian Zhang, Heng Zhang","doi":"10.1109/HPSR.2019.8807991","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8807991","url":null,"abstract":"Model-free predictive control is a novel data-driven control approach. It can calculate directly the control input by using a great deal of input and output datasets. Moreover, compared with the conventional model predictive control, it does not need to construct a precise mathematical model. In this work, we propose the model-free predictive control to the motion control of the autonomous underwater vehicle(AUV). The nonlinear motion control problem of AUV is effectively solved and the proposed approach can enhance the performance of trajectory tracking for AUV. At last, we demonstrate the availability of this method by the numerical simulations of trajectory tracking.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128904465","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
Joint Energy and Spectrum Efficient Virtual Optical Network embedding in EONs 联合能谱高效虚拟光网络嵌入eon
Wenting Wei, Huaxi Gu, A. Pattavina, Jiru Wang, Yi Zeng
{"title":"Joint Energy and Spectrum Efficient Virtual Optical Network embedding in EONs","authors":"Wenting Wei, Huaxi Gu, A. Pattavina, Jiru Wang, Yi Zeng","doi":"10.1109/HPSR.2019.8808122","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808122","url":null,"abstract":"Network virtualization facilitates the deployment of diversified services and flexible resource management in elastic optical networks (EONs). However, due to the explosive growth of traffic, considerable energy consumption and spectrum usage have restricted the sustainable development of cloud services. This paper addresses joint energy and spectrum efficient problem for virtual optical network embedding (VONE) over EONs. We propose a heuristic algorithm to improve energy and spectrum efficiency while keeping a high acceptance rate. With consideration of factors influencing energy and spectrum efficiency, a feasible shortest path is preferred; meanwhile, an appropriate modulation format is dynamically selected according to transmission distance and the trade-off between energy and spectrum consumption. To improve the acceptance rate of virtual network requests, a dual mapping is employed to reinforce the embedding process by multi-dimensional resources integrated mapping. The simulation results show that the proposed algorithm can achieve a joint energy and spectrum efficiency with a much lower blocking probability compared with the baseline approach.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121266173","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 Reputation Management Scheme for Identifying Malicious Nodes in VANET 一种用于VANET恶意节点识别的信誉管理方案
Changhui Gong, Changqiao Xu, Zan Zhou, Tao Zhang, Shujie Yang
{"title":"A Reputation Management Scheme for Identifying Malicious Nodes in VANET","authors":"Changhui Gong, Changqiao Xu, Zan Zhou, Tao Zhang, Shujie Yang","doi":"10.1109/HPSR.2019.8808102","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808102","url":null,"abstract":"In vehicular ad-hoc network (VANET), vehicles exchange information on road conditions which guarantees safety. However, there exists malicious nodes which interfere the communication between vehicles. Thus, it is vital to identify malicious vehicles in VANET. Reputation-based schemes are one of the most promising schemes to identify malicious nodes in time. However, existing methods can only identify malicious nodes of a specific attack. Additionally, the efficiency and effectiveness of existing work in solving advanced attacks are unsatisfactory. In this paper, we propose a scheme to identify malicious nodes in VANET based on collaborative filtration. Distinguished from the existing solutions, we consider a variety of attacks in VANET, instead of a specific attack. In addition, our scheme updates the reputation of nodes in time according to the result of each communication, which brings better efficiency and effectiveness. The superiority of our proposed scheme has been demonstrated through simulation experiments.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115887681","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
Packet Processing Architecture With Off-Chip LLC Using Interleaved 3D-Stacked DRAM 采用交错3d堆叠DRAM的片外LLC包处理架构
T. Korikawa, Akio Kawabata, Fujun He, E. Oki
{"title":"Packet Processing Architecture With Off-Chip LLC Using Interleaved 3D-Stacked DRAM","authors":"T. Korikawa, Akio Kawabata, Fujun He, E. Oki","doi":"10.1109/HPSR.2019.8807993","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8807993","url":null,"abstract":"The performance of packet processing applications is dependent on memory accesses speed of network systems. Table lookup requires fast memory accesses and is one of the most common processes in various packet processing applications, which can be a dominant performance bottleneck. Therefore, in Network Function Virtualization (NFV)-aware environment, on-chip fast cache memories of a CPU of general-purpose hardware become critical to achieve high performance packet processing over tens of Gbps. In addition, multiple types of applications and complex applications are executed in the same system simultaneously in carrier network systems, which require the capacity of cache memories as well. In this paper, we propose a packet processing architecture that utilizes interleaved 3 Dimensional (3D)-stacked Dynamic Random Access Memory (DRAM) devices as off-chip Last Level Cache (LLC) in addition to several levels of dedicated cache memories of each CPU core. Entries of a lookup table are distributed in every bank and vaults to utilize both bank interleaving and vault-level memory access parallelism. Frequently accessed entries in 3D-stacked DRAM are also cached in dedicated on-chip cache memories of each CPU core. The evaluation results show that the proposed architecture reduces the memory access latency by 57 % and increases the throughput by 100 % with reducing blocking probability about 10 % compared to the conventional architecture with common on-chip LLC. These results indicate that 3D-stacked DRAM can be practical as off-chip LLC in parallel packet processing running on multiple CPU cores simultaneously.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943060","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
A Novel Single Anchor Localization Mechanism Employing Target Movement 一种利用目标运动的单锚定位机制
Fei Tong, Guanghui Wang, Xiufang Shi
{"title":"A Novel Single Anchor Localization Mechanism Employing Target Movement","authors":"Fei Tong, Guanghui Wang, Xiufang Shi","doi":"10.1109/HPSR.2019.8807994","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8807994","url":null,"abstract":"Unlike traditional multilateration techniques which usually require multiple anchor nodes to participate in localization process, this paper proposes a novel Single Anchor Localization (SAL) scheme employing target movement. The scheme requires the anchor node to only measure its distance to the target node and the target node to measure its moving distance along straight lines. Two algorithms, i.e., SAL based on two rectilinear movings and a triangular moving, are proposed depending on whether the target node also needs to measure its turning angle or not. The moving distance of the target can be estimated using human step or height, geographical indication, vehicle wheel, etc. Some targets may be able to exactly measure its moving distance, e.g., a vehicle equipped with speed sensors. The turning angle of the target can be obtained by using an angle measurement or compass application installed in a mobile phone or a steering wheel angle sensor installed in a vehicle. Especially, a 90° turning angle can be easily achieved through human eye estimation if the terrain allows a right-angle turn. Extensive simulations are conducted to evaluate the performance of the algorithms, investigating the effects of a set of parameters. The proposed SAL scheme not only reduces the complexity and cost of the localization system, but also provides targets with a localization opportunity in a harsh environment where only one anchor can be attached.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131029348","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
Wide-Sense Nonblocking Converting-Space-Converting Switching Node Architecture under Xs VarSLOT Algorithm 基于Xs VarSLOT算法的广义非阻塞转换-空间转换交换节点架构
M. Abdulsahib, W. Kabaciński
{"title":"Wide-Sense Nonblocking Converting-Space-Converting Switching Node Architecture under Xs VarSLOT Algorithm","authors":"M. Abdulsahib, W. Kabaciński","doi":"10.1109/HPSR.2019.8808115","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808115","url":null,"abstract":"In this paper, we study the wide-sense nonblocking operation for the Converting-Space-Converting switching fabric architecture. The investigated switching fabric is suitable for all kinds of slot-operating switches, no matters the slots are wavelengths, time, or others. One control algorithm for the mentioned architecture is proposed. The control algorithm decomposes the slots in the interstage links into $X$ subsets. The proposed algorithm can reduce the required number of slots in the interstage links by almost 84%, as compared to the number of slots required in the strict sense.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131099503","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
Dynamic Network Slicing Based on Tidal Traffic Patterns in Metro-Core Optical Networks 城域核心光网络中基于潮流流量模式的动态网络切片
Sebastian Troia, Alberto Cibari, R. Alvizu
{"title":"Dynamic Network Slicing Based on Tidal Traffic Patterns in Metro-Core Optical Networks","authors":"Sebastian Troia, Alberto Cibari, R. Alvizu","doi":"10.1109/HPSR.2019.8808116","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808116","url":null,"abstract":"Nowadays networks are the basis of our communication providing a great number of services. As a consequence, the number of networks is increasing as well as the traffic routed over them. There is an increasing demand for new services that require stringent constraints on capacity, latency and jitter to provide an appropriate Quality of Service (QoS) to end users. In order to cope with those requirements, network infrastructure needs to evolve from a static and closed architecture towards a more scalable, dynamic and agile one. SDN and NFV allows to provide different services, each one with its own QoS constraints, independent and secure, thanks to the network slicing concept, the main subject of this work. Network slicing allows to segment the underlying physical network into different logical networks to provide data transport customized to specific services. In this paper, we propose and early stage work with the aim to provide two mathematical models able to dynamically provision network slices on the physical network, complying with their QoS and reducing the power consumption for their instantiation and routing of traffic.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126105572","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
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学术官方微信
小红书