发布求助
文献互助 智能选刊 最新文献

2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)最新文献

筛选
英文 中文
Performance Evaluation of 5G mmWave Networks with Physical-Layer and Capacity-Limited Blocking 具有物理层和容量限制阻塞的5G毫米波网络性能评估
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098993
Jingjin Wu, Meiqian Wang, Yin-Chi Chan, E. Wong, Taejoon Kim
{"title":"Performance Evaluation of 5G mmWave Networks with Physical-Layer and Capacity-Limited Blocking","authors":"Jingjin Wu, Meiqian Wang, Yin-Chi Chan, E. Wong, Taejoon Kim","doi":"10.1109/HPSR48589.2020.9098993","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098993","url":null,"abstract":"We propose a versatile cross-layer framework to analyze performance metrics for mobile traffic in fifth-generation (5G) millimeter wave (mmWave) networks. Our proposed framework is based on stochastic geometry, teletraffic models, and the classical Erlang Fixed Point Approximation method, with the objective of evaluating blocking probability, mean service time of user requests, and utilization rate of base stations by taking into account practical concerns in mmWave networks including blockages encountered by mmWaves in the physical layer, capacity constraints in the network layer, and the stochastic nature of mobile traffic. We demonstrate by numerical results that our analytical method is accurate and computationally-efficient.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129929020","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
PEQ: Scheduling Time-Sensitive Data-Center Flows using Weighted Flow Sizes and Deadlines PEQ:使用加权流量大小和截止日期调度时间敏感的数据中心流
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098992
Vinay K. Gopalakrishna, Yagiz Kaymak, Chuan-Bi Lin, R. Rojas-Cessa
{"title":"PEQ: Scheduling Time-Sensitive Data-Center Flows using Weighted Flow Sizes and Deadlines","authors":"Vinay K. Gopalakrishna, Yagiz Kaymak, Chuan-Bi Lin, R. Rojas-Cessa","doi":"10.1109/HPSR48589.2020.9098992","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098992","url":null,"abstract":"We propose a deadline-aware flow scheduling scheme, called Preemptive Efficient Queuing (PEQ), which takes both the deadlines and sizes of the flows into account for efficient flow scheduling of flows in a data-center network in this paper. PEQ benefits from evaluating the deadlines and flow sizes of flows to improve application throughput. Our results show that PEQ outperforms the state-of-the-art deadline-aware transport schemes in terms of the application throughput and average flow completion time, under traffic with different deadline distributions. Results also show that PEQ yields a near-optimal application throughput in cases where short flows have long deadlines and long flows have strict deadlines. In other words, PEQ attains higher performance than the counterpart schemes on traffic with broader distribution of deadlines and flow sizes.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125988189","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
i-CEON: Information-centric Elastic Optical Transport Network for Efficient Content Delivery i-CEON:以信息为中心的弹性光传输网络，用于高效的内容传输
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098990
T. Miyamura, A. Misawa
{"title":"i-CEON: Information-centric Elastic Optical Transport Network for Efficient Content Delivery","authors":"T. Miyamura, A. Misawa","doi":"10.1109/HPSR48589.2020.9098990","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098990","url":null,"abstract":"We developed a network architecture called information-centric elastic optical transport network (i-CEON) that enables efficient content delivery. The increasing volume of video traffic consumes network resources, so it is necessary to establish optical transport network architectures suitable for content delivery. For this purpose, we extend existing information-centric networking to be applicable to elastic optical networks. The main focus of this paper is presenting the method in i-CEON of optimizing optical-path routing by effectively using an in-network cache function to efficiently accommodate content traffic. This reduces redundant use of network resources. We formulate the joint optimization problem of elastic optical-path routing and content-replication placement as a mixed integer linear programming problem. We conducted intensive numerical experiments to demonstrate the effectiveness of our method and confirmed that it reduced network cost by 20% and server load by 33%.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121695445","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
Energy-Efficient Drone Coverage Path Planning using Genetic Algorithm 基于遗传算法的节能无人机覆盖路径规划
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098989
Rutuja Shivgan, Z. Dong
{"title":"Energy-Efficient Drone Coverage Path Planning using Genetic Algorithm","authors":"Rutuja Shivgan, Z. Dong","doi":"10.1109/HPSR48589.2020.9098989","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098989","url":null,"abstract":"Unmanned Aerial Vehicles (UAVs) have been increasingly used in environmental sensing and surveying applications. Coverage path planning to survey an area while following a set of waypoints is required to complete a task. Due to the battery capacity, the UAV flight time is often limited. In this paper, we formulate the UAV path planning problem as a traveling salesman problem in order to optimize UAV energy. We propose a genetic algorithm to solve the optimization problem i.e. to minimize the energy consumption for the UAV to complete a task. We also consider reducing the number of turns to allow the UAV to optimize the flight path and to minimize its energy consumption. We compare the energy consumption of the proposed genetic algorithm to the greedy algorithm with different number of waypoints. Results show that our proposed algorithm consumes 2–5 times less energy than that of the greedy algorithm by reducing the number of turns while covering all the waypoints.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122198070","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}
引用次数: 47
SERENADE: A Parallel Iterative Algorithm for Crossbar Scheduling in Input-Queued Switches 基于并行迭代算法的输入排队交换机交叉排程
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098995
Long Gong, Liang Liu, Sen Yang, Jun Xu, Yi Xie, Xinbing Wang
{"title":"SERENADE: A Parallel Iterative Algorithm for Crossbar Scheduling in Input-Queued Switches","authors":"Long Gong, Liang Liu, Sen Yang, Jun Xu, Yi Xie, Xinbing Wang","doi":"10.1109/HPSR48589.2020.9098995","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098995","url":null,"abstract":"Most of today’s high-speed switches and routers adopt an input-queued crossbar switch architecture. Such a switch needs to compute a matching (crossbar schedule) between the input ports and output ports during each switching cycle (time slot). A key research challenge in designing large (in number of input/output ports N) input-queued crossbar switches is to develop crossbar scheduling algorithms that can compute “high quality” matchings – i.e., those that result in high switch throughput (ideally 100%) and low queueing delays for packets – at line rates. SERENA is one such algorithm: it outputs excellent matching decisions that result in 100% switch throughput and reasonably good queueing delays. However, since SERENA is a centralized algorithm with O(N) time complexity, it cannot support switches that both are large and have a very high line rate per port. In this work, we propose SERENADE (SERENA, the Distributed Edition), a parallel iterative algorithm that provably precisely emulates SERENA in only O(logN) iterations between input ports and output ports, and hence has a time complexity of only O(logN) per port.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116914437","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
Anonymous blockchain Based Routing For Moving-target Defense Across Federated Clouds 基于匿名区块链的跨联邦云移动目标防御路由
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098983
Yousra Magdy, Mona S. Kashkoush, M. Azab, M. Rizk
{"title":"Anonymous blockchain Based Routing For Moving-target Defense Across Federated Clouds","authors":"Yousra Magdy, Mona S. Kashkoush, M. Azab, M. Rizk","doi":"10.1109/HPSR48589.2020.9098983","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098983","url":null,"abstract":"Cloud federation is the evolution of modern cloud computing. It provides better resource-sharing, perfect resourceutilization, and load-balancing. However, the heterogeneity of security policies and configurations between cloud service providers makes it hard for users to totally trust them. Further, the severe impact of modern cloud attacks such as cross-side channels on federated environments is a major roadblock against such evolution. Securing users’ capsules (Virtual Machines and containers) against cross-side channel attacks is considered as a big challenge to cloud service providers. Moving-target Defense (MtD) by live capsule migration was introduced as an effective mechanism to overcome such challenge. However, researchers noted that even with MtD, migrated capsules can still be tracked via routing information. In this paper, we propose a novel Blockchain-based routing mechanism to enable trace-resistant Moving-target Defence (BMtD) to enable anonymous live cross-cloud migrations of running capsules in federated cloud environments. Exploiting the Vulnerable, Exposed, Attacked, Recovered (VEAR) model, simulation results demonstrated the effectiveness of BMtD in minimizing viral attack dispersion.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122901229","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
Dynamic Network Slicing Using Utility Algorithms and Stochastic Optimization 基于效用算法和随机优化的动态网络切片
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098981
Sidharth Sharma, A. Gumaste, M. Tatipamula
{"title":"Dynamic Network Slicing Using Utility Algorithms and Stochastic Optimization","authors":"Sidharth Sharma, A. Gumaste, M. Tatipamula","doi":"10.1109/HPSR48589.2020.9098981","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098981","url":null,"abstract":"Network slicing is a key enabler for next-generation 5G services. Slices are designed to offer different services by conjoining virtual network functions (VNFs) through a logical network. We propose a dynamic slicing algorithm, which is based on utility theory and facilitates the growth, provisioning, dimensioning and deletion of network slices. The proposed algorithm is based on a utility model that regulates the virtual topology of VNFs in data-centers. The algorithm optimizes the number of slices as well as instantiated VNFs, thereby creating/modifying and destroying network slices of appropriate granularity. In addition, we also propose a stochastic optimization formulation, which handles uncertainty in service requests. We simulate the algorithm for a multi-data-center model with a large set of slices. Our results indicate dynamism, robustness and scalability of the proposed algorithm.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132855471","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
Analyzing Service Chaining of Virtualized Network Functions with SR-IOV 利用SR-IOV分析虚拟化网络功能的业务链
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098975
Aris Leivadeas, M. Falkner, Nikolai Pitaev
{"title":"Analyzing Service Chaining of Virtualized Network Functions with SR-IOV","authors":"Aris Leivadeas, M. Falkner, Nikolai Pitaev","doi":"10.1109/HPSR48589.2020.9098975","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098975","url":null,"abstract":"Network Function Virtualization (NFV) along with Service Function Chaining (SFC) has proliferated the way that network functions and services are introduced, offered, and deployed. In particular, NFV and SFC are the basic components of the so called network softwarization era, promoting significant cost reductions and agility. Nonetheless, a constant debate exist regarding the network performance achieved and the holistic establishment of NFV as the key and sole component of the network infrastructure. To this end, this paper tries to shed light in remedy solutions when chaining Virtualized Network Functions (VNFs) internally on a standard x86 server using the Single-Root Input Output Virtualization (SR-IOV) technology, in order to maximize the throughput and delay achieved.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133895767","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
HPSR 2020 Table of Contents HPSR 2020目录
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/hpsr48589.2020.9098985
{"title":"HPSR 2020 Table of Contents","authors":"","doi":"10.1109/hpsr48589.2020.9098985","DOIUrl":"https://doi.org/10.1109/hpsr48589.2020.9098985","url":null,"abstract":"","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116014784","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
Impact of Large-Scale Correlated Failures on Multilevel Virtualized Networks 大规模相关故障对多层虚拟化网络的影响
2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR) Pub Date : 2020-05-01 DOI: 10.1109/HPSR48589.2020.9098972
Max G. Medina, Mohammed J. F. Alenazi, Egemen K. Çetinkaya
{"title":"Impact of Large-Scale Correlated Failures on Multilevel Virtualized Networks","authors":"Max G. Medina, Mohammed J. F. Alenazi, Egemen K. Çetinkaya","doi":"10.1109/HPSR48589.2020.9098972","DOIUrl":"https://doi.org/10.1109/HPSR48589.2020.9098972","url":null,"abstract":"Communication network architectures have been evolving with increased programmability and virtualization of physical infrastructures. While this evolution enables a faster introduction of new services and efficient utilization of resources, the complexities and interdependencies among the physical and virtual infrastructures, as well as the control and management planes, hinder a complete understanding of the system at hand. It is imperative, therefore, to model and study these evolving virtualized infrastructures. We propose a multilevel virtualized network embedding model and study its performance against correlated failures. Our analysis of multiple synthetic network models identified that grid-like infrastructures capture the realistic Internet2 structure the best.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114892771","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学术文献互助群
群 号：481959085
Book学术官方微信