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

筛选
英文 中文
Buffer-Aided Relaying for Two-Hop Secure Communication with Limited Packet Lifetime 有限包生存期的两跳安全通信的缓冲辅助中继
Ji He, Jia Liu, Yang Xu, Xiaohong Jiang
{"title":"Buffer-Aided Relaying for Two-Hop Secure Communication with Limited Packet Lifetime","authors":"Ji He, Jia Liu, Yang Xu, Xiaohong Jiang","doi":"10.1109/HPSR.2019.8807995","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8807995","url":null,"abstract":"A lot of works have been done to demonstrate that buffer-aided relaying can achieve a significant performance gain in cooperative wireless networks. However, the additional delay introduced by buffer has been largely neglected in available works, which is of significant importance for delay-sensitive networks. In this paper, we consider a two-hop buffer-aided relaying system suffering from eavesdropping, where every packet owns a limited lifetime. In order to satisfy a specific secrecy rate of the system, this paper proposes a novel security and lifetime (SELI)-aware relay selection scheme by balancing the security and lifetime constraints. Furthermore, to address the problem of the heterogeneous packets queuing in the buffer, the approach of Markov chain is embedded to model the packet occupancy process. With the help of this complete framework, we derive the exact expressions of performance metrics, including reliable outage probability, packet discarding probability and secrecy throughput. Finally, extensive simulation and numerical results are provided to validate our analysis and illustrate the proposed scheme can efficiently reduce the packet discarding ratio.","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-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129105092","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
Simple and Efficient Identification of Heavy Hitters Based on Bitcount 基于位计数的重击手简单高效识别
Feng Wang, Lixin Gao
{"title":"Simple and Efficient Identification of Heavy Hitters Based on Bitcount","authors":"Feng Wang, Lixin Gao","doi":"10.1109/HPSR.2019.8808101","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808101","url":null,"abstract":"Detecting and identifying heavy hitters on very high speed links is important for many network management applications, ranging from detecting network attacks and traffic anomalies, to relieving link congestion, planning network capacity and traffic engineering. Most existing solutions to the problem are based on sampling and sketch-based techniques. Sampling-based solutions use partial observations of packets or flow records to extract flow-level information. Sketch-based approaches use a compressed data structure to keep a summary of the original data and estimate traffic statistics such as flow size for all traffic flows. However, these approaches either induce information losses due to sampling or incur computational and space overheads for key recovery. In this paper, we propose a novel method, Bitcount, which uses a flexible counter array to detect and identify heavy hitters. Both theoretical analysis and experimental evaluations show that Bitcount can provide higher precision for identifying heavy hitters with low memory and computational overheads.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"67 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":"124544266","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}
引用次数: 9
Leveraging Domino to Implement RCP in a Stateful Programmable Pipeline 利用Domino在有状态可编程管道中实现RCP
Md Iftakharul Islam, J. Khan
{"title":"Leveraging Domino to Implement RCP in a Stateful Programmable Pipeline","authors":"Md Iftakharul Islam, J. Khan","doi":"10.1109/HPSR.2019.8808107","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808107","url":null,"abstract":"RCP is a router-assisted congestion control mechanism where routers allocate a feedback rate to each flow. Here sender nodes regulate their sending rates based on the feedback rates received from the routers. An RCP router calculates the feedback rate based on the queue occupancy, spare capacity and the average RTT of the on-going flows. This is why, an RCP router needs to execute a stateful packet processing program in the dataplane. However stateful packet processing in a very highspeed (e.g. Tb/s) router is particularly challenging. Currently there is no real deployment of RCP, to the best of our knowledge. This paper presents an implementation of RCP protocol in a programmable-pipeline based router. We use Domino programming language to implement the dataplane. Domino is a domain specific language that allows us to develop a packet processing program as well as the hardware pipeline on which the packet processing program would be executed. Domino programs are guaranteed to run at line rate. This is the first implementation of RCP using Domino. to the best of our knowledge.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"49 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":"121908368","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
Evaluating the Control and Management Traffic in OpenStack Cloud with SDN 基于SDN的OpenStack云控制与管理流量评估
Mu He, Alberto Martínez Alba, Ehab Mansour, W. Kellerer
{"title":"Evaluating the Control and Management Traffic in OpenStack Cloud with SDN","authors":"Mu He, Alberto Martínez Alba, Ehab Mansour, W. Kellerer","doi":"10.1109/HPSR.2019.8807989","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8807989","url":null,"abstract":"The performance of cloud computing depends heavily on the networking infrastructure, which carries the data traffic between the VMs, as well as the essential control and management traffic. Meanwhile, networks in data centers are becoming softwarized with the Software Defined Networking (SDN) paradigm to fuel their programmability and flexibility. However, since SDN switches need to contact the controller frequently for their configuration and flow rules setup, the overall data traffic forwarding performance can suffer, if the control and management plane gets congested. In order to proactively avoid such congestion, we need to study the involved traffic in detail. In this work, we perform an elaborate traffic evaluation on a real OpenStack cloud deployment and evaluate the types of exchanged messages in the control and management plane and their respective traffic volume. The evaluation reveals that the control and management traffic scales with the number of VMs and the VM-related events, and therefore provides guidelines for planning and operating the cloud networking infrastructure.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"12 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":"117114814","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}
引用次数: 7
Spatio-temporal human mobility prediction based on trajectory data mining for resource management in mobile communication networks 基于轨迹数据挖掘的移动通信网络人力资源管理时空迁移预测
Shingo Enami, K. Shiomoto
{"title":"Spatio-temporal human mobility prediction based on trajectory data mining for resource management in mobile communication networks","authors":"Shingo Enami, K. Shiomoto","doi":"10.1109/HPSR.2019.8808106","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808106","url":null,"abstract":"In the future mobile communication, communication based on various mobility models is expected. In 5G mobile communication network that can flexibly allocate network resources, it is necessary to predict traffic demands in order to appropriately allocate network resources. Therefore, it is important to predict the behavior of spatio-temporal mobility in order to appropriately allocate network resources. The pervasiveness of mobile devices based services leading to an increasing volume of spatiotemporal datasets and to the opportunity of discovering usable knowledge about mobility behavior. This knowledge is useful to provide stable communication to mobile networks expected to increase traffic flow. In this paper, we propose a method to grasp the behavior of the mobility in spatio-temporal by mining the trajectory data of the mobility obtained from the GPS data to predict the future mobility of the user from frequent patterns. We propose a mining and prediction algorithm that employs the huge amount of trajectory data. We apply sequential pattern mining algorithms including PrefixSpan and BIDE to obtain frequent trajectory patterns from trajectory database. We evaluate the proposed method using actual trajectory dataset, Geolife project, and demonstrate that the proposed method successfully extracts sufficient number of frequent trajectory patterns to predict the future trajectory of mobility.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"94 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":"127227795","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}
引用次数: 6
Design of an SNF Scheduling Method for Bulk Data Transfers over Inter-Datacenter WANs 数据中心间广域网上批量数据传输的SNF调度方法设计
Xiao Lin, Xiaoyu Wang, Shengnan Yue, Weiqiang Sun, M. Veeraraghavan, Weisheng Hu
{"title":"Design of an SNF Scheduling Method for Bulk Data Transfers over Inter-Datacenter WANs","authors":"Xiao Lin, Xiaoyu Wang, Shengnan Yue, Weiqiang Sun, M. Veeraraghavan, Weisheng Hu","doi":"10.1109/HPSR.2019.8808133","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808133","url":null,"abstract":"Increasingly bulk data transfers impose an unprecedented challenge on inter-datacenter (DC) wide area networks (WANs). To overcome this challenge, DC storage is exploited and introduced into the data-plane path so that delay-tolerant bulk data can be temporarily stored and forwarded (SnF) at a later time when network is less congested. However, the use of storage introduces additional complexity into the transfer process. In this paper, we evaluate the computational complexity of the SNF scheduling problem. Studies show that desirable performance can be attained by considering only a few alternate routes rather than dynamically routing over the entire network topology. Inspired by this finding, we propose a time-space decoupled (TSD) SNF scheduling method. By decoupling the problem into its spatial and temporal components and solving these components separately, the TSD method obtains good performance while maintaining low complexity. Simulations show that the TSD method can outperform the conventional joint method when the traffic load is medium or higher.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"40 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":"126263648","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}
引用次数: 8
Parallel Scheduling and Routing Algorithms for Large-scale High-speed Switching Systems 大规模高速交换系统的并行调度和路由算法
Lingkang Wang, Tong Ye, T. Lee
{"title":"Parallel Scheduling and Routing Algorithms for Large-scale High-speed Switching Systems","authors":"Lingkang Wang, Tong Ye, T. Lee","doi":"10.1109/HPSR.2019.8808123","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808123","url":null,"abstract":"The traffic of large-scale interconnection networks is increasingly showing high-speed and high-burst characteristics, which imposes a big challenge on the performance of switching systems. However, the existing scheduling and routing algorithms for the switching systems have either high computation complexity or high operation cost, which cannot keep up with the rapid development of the Internet. To cope with this problem, we present a parallel scheduling algorithm and a parallel routing algorithm for large-scale high-speed switching systems in this paper. Starting from the edge coloring problem of bipartite graphs, this paper first presents algebraic edge coloring approach, based on which we design the scheduling and routing algorithms. Our simulation results show that these algorithms possess the following features: 1) They have a low computation complexity; 2) They can provide 100% throughput; 3) They can achieve end-to-end delay in microseconds; 4) They do not require any hardware acceleration, and do not lead to packet out-of-sequence problem.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"64 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":"123870645","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
SAIL Based FIB Lookup in a Programmable Pipeline Based Linux Router 基于SAIL的基于可编程管道的Linux路由器FIB查找
Md Iftakharul Islam, J. Khan
{"title":"SAIL Based FIB Lookup in a Programmable Pipeline Based Linux Router","authors":"Md Iftakharul Islam, J. Khan","doi":"10.1109/HPSR.2019.8808129","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808129","url":null,"abstract":"This paper presents a programmable pipeline based Linux router. Here Linux kernel works as a control plane and the programmable pipeline works as a data plane. The Forwarding Information Base (FIB) lookup is performed using SAIL algorithm. SAIL consumes very large memory. Here we use population counting that reduces the memory consumption of SAIL by up to 80%. We have implemented SAIL in Linux kernel. We also have implemented SAIL using Domino programming language. Our implementation shows that a programmable pipeline can execute SAIL at line rate. We have evaluated our implementation with FIBs from real backbone routers. Our experimental results show that SAIL with population counting is suitable for implementing both dataplane and control plane of a high-speed router.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"35 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":"131236233","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
Privacy-Preserving Caching in ISP Networks ISP网络中的隐私保护缓存
Davide Andreoletti, Omran Ayoub, S. Giordano, G. Verticale, M. Tornatore
{"title":"Privacy-Preserving Caching in ISP Networks","authors":"Davide Andreoletti, Omran Ayoub, S. Giordano, G. Verticale, M. Tornatore","doi":"10.1109/HPSR.2019.8807997","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8807997","url":null,"abstract":"Content Providers (CPs) typically encrypt the content sent over the telecom network to improve security and privacy of their final users, as well as to protect business-critical information (e.g., contents' popularity). Due to this encryption, Internet Service Providers (ISPs) can not easily apply caching strategies that require the inspection of traffic traversing their networks to select the most popular contents. The most common approach to solve the conflict between privacy and caching consists in allowing a CP to manage the caches (e.g., by storing and delivering the contents) directly from inside the area of the ISP. However, in this way ISPs lose the legitimate control on a portion of traffic traversing their networks. An alternative approach is enabled by recently-proposed architectural solutions that allow a CP to encrypt the contents and associate pseudonyms to them, and the ISP to count the occurrences of such identifiers to infer popularity-related information without inspecting the original contents. However, we observe that ISPs can still obtain valuable information about contents' popularity that may threaten CPs' privacy. In this paper, we formalize a strategy of association between pseudonyms and contents that effectively improves privacy but leads to a degradation of caching performance. We formally define privacy in this context and study the trade-off between caching and privacy considering differerent metrics, such as the hit-rate and the retrieval latency. The results, obtained by means of simulations over both real and synthetic data, show that privacy can be significantly improved while accepting a minor impact on the hit-rate of caching and suggest the applicability of the considered architecture in a real scenario of content delivery.","PeriodicalId":404181,"journal":{"name":"2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)","volume":"87 6 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":"125721725","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
Intelligence Enabled SDN Fault Localization via Programmable In-band Network Telemetry 基于可编程带内网络遥测技术的智能SDN故障定位
Yongning Tang, Yangxuan Wu, Guang Cheng, Zhiwei Xu
{"title":"Intelligence Enabled SDN Fault Localization via Programmable In-band Network Telemetry","authors":"Yongning Tang, Yangxuan Wu, Guang Cheng, Zhiwei Xu","doi":"10.1109/HPSR.2019.8808121","DOIUrl":"https://doi.org/10.1109/HPSR.2019.8808121","url":null,"abstract":"Intelligent Fault localization for SDN becomes one of the most critical but difficult tasks. This paper proposes a new approach called Policy-Aware In-band Network Telemetry (PAINT) to tackle SDN fault localization. In the PAINT system, network operators define and deploy network services using a high-level Service Provisioning Language (SPL). Then, PAINT automatically parses the service policy to infer the causal relationship between service related network components and (end-to-end) service-level observable symptoms. Based on the causality model, PAINT deploys monitoring instruments for the symptoms. PAINT utilizes a dynamically created Symptom-Fault-Telemetry model to incorporate In-band Network Telemetry (INT) actions systematically into the fault reasoning process to improve the efficiency and accuracy of fault localization for SDN. PAINT has been extensively evaluated in a simulation environment for its accuracy and scalability with very positive results.","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-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122475288","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}
引用次数: 7
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学术官方微信
小红书