首页 > 最新文献

Optical Switching and Networking最新文献

英文 中文
Dynamic multiple multicasts routing and wavelength assignment for realizing modified artificial fish model in mesh-based ONoC 基于网格的ONoC中实现改进人工鱼模型的动态多组播路由和波长分配
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-08-01 DOI: 10.1016/j.osn.2023.100744
Fei Gao , Cui Yu , Boyong Gao , Yawen Chen , Hao Zhang

Dynamic multiple multicasts widely exist in several applications of optical network-on-chip. However, there is no good solution for routing and wavelength assignment for multiple multicasts in the mesh-based network. This paper proposes a new routing strategy based on a modified artificial fish swarm algorithm. The modified artificial fish model can support unicast and multicast in the mesh-based network. The routing and wavelength assignment for multiple multicasts can be solved based on this model. Then, we design a layer-based algorithm to assign wavelength for multiple multicasts, which can utilize wavelength and area resources more effectively. Simulation results show that our scheme works better than the other tree-based schemes regarding average communication latency and power consumption. In general, our modified artificial fish swarm algorithm provides a universal platform to study different aspects of routing and wavelength assignment in mesh-based ONoC.

动态多播广泛存在于片上光网络的多种应用中。然而,在基于网格的网络中,对于多个多播的路由和波长分配没有很好的解决方案。本文提出了一种基于改进的人工鱼群算法的新路由策略。改进后的人工鱼模型可以在基于网格的网络中支持单播和多播。基于该模型可以求解多个组播的路由和波长分配问题。然后,我们设计了一种基于层的算法来为多个多播分配波长,这样可以更有效地利用波长和区域资源。仿真结果表明,在平均通信延迟和功耗方面,我们的方案比其他基于树的方案效果更好。一般来说,我们改进的人工鱼群算法提供了一个通用的平台来研究基于网格的ONoC中路由和波长分配的不同方面。
{"title":"Dynamic multiple multicasts routing and wavelength assignment for realizing modified artificial fish model in mesh-based ONoC","authors":"Fei Gao ,&nbsp;Cui Yu ,&nbsp;Boyong Gao ,&nbsp;Yawen Chen ,&nbsp;Hao Zhang","doi":"10.1016/j.osn.2023.100744","DOIUrl":"https://doi.org/10.1016/j.osn.2023.100744","url":null,"abstract":"<div><p><span>Dynamic multiple multicasts widely exist in several applications of optical network-on-chip. However, there is no good solution for routing and wavelength assignment<span> for multiple multicasts in the mesh-based network. This paper proposes a new routing strategy based on a modified artificial fish swarm algorithm. The modified artificial fish model can support unicast and multicast in the mesh-based network. The routing and wavelength assignment for multiple multicasts can be solved based on this model. Then, we design a layer-based algorithm to assign wavelength for multiple multicasts, which can utilize wavelength and area resources more effectively. Simulation results show that our scheme works better than the other tree-based schemes regarding average </span></span>communication latency<span> and power consumption. In general, our modified artificial fish swarm algorithm provides a universal platform to study different aspects of routing and wavelength assignment in mesh-based ONoC.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"50 ","pages":"Article 100744"},"PeriodicalIF":2.2,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49754167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A symmetry-free spectrum allocation heuristic for elastic optical networks 弹性光网络的无对称性频谱分配启发式算法
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-05-01 DOI: 10.1016/j.osn.2023.100742
George N. Rouskas

We revisit spectrum allocation (SA), a fundamental problem in optical network design, and we explain that it can be modeled as a permutation problem. This new model eliminates spectrum symmetry, a property that presents a significant challenge to conventional spectrum allocation solutions. Accordingly, we develop parameterized first-fit (PFF), a new symmetry-free heuristic for the SA problem that has several desirable features: it explores a pre-defined subset of the solution space whose size is tailored to the available computational budget; it constructs this subset by sampling from diverse areas of the solution space rather than from the neighborhood of an initial solution; it finds solutions by applying the well-known first-fit (FF) algorithm and thus it can be deployed readily; its execution can be easily parallelized; and it is effective and efficient in finding good quality solutions.

我们重新审视了光谱分配(SA),这是光网络设计中的一个基本问题,并解释了它可以被建模为一个排列问题。这种新模型消除了频谱对称性,这一特性对传统的频谱分配解决方案提出了重大挑战。因此,我们开发了参数化首次拟合(PFF),这是SA问题的一种新的无对称启发式算法,具有几个理想的特征:它探索了解空间的预定义子集,其大小根据可用的计算预算进行调整;它通过从解空间的不同区域而不是从初始解的邻域进行采样来构造该子集;它通过应用众所周知的第一拟合(FF)算法来找到解决方案,因此它可以很容易地部署;其执行可以容易地并行化;并且它在寻找高质量的解决方案方面是有效和高效的。
{"title":"A symmetry-free spectrum allocation heuristic for elastic optical networks","authors":"George N. Rouskas","doi":"10.1016/j.osn.2023.100742","DOIUrl":"https://doi.org/10.1016/j.osn.2023.100742","url":null,"abstract":"<div><p>We revisit spectrum allocation (SA), a fundamental problem in optical network<span> design, and we explain that it can be modeled as a permutation problem. This new model eliminates spectrum symmetry, a property that presents a significant challenge to conventional spectrum allocation solutions. Accordingly, we develop parameterized first-fit (PFF), a new symmetry-free heuristic for the SA problem that has several desirable features: it explores a pre-defined subset of the solution space whose size is tailored to the available computational budget; it constructs this subset by sampling from diverse areas of the solution space rather than from the neighborhood of an initial solution; it finds solutions by applying the well-known first-fit (FF) algorithm and thus it can be deployed readily; its execution can be easily parallelized; and it is effective and efficient in finding good quality solutions.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"49 ","pages":"Article 100742"},"PeriodicalIF":2.2,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49727561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Joint optimization of optical path provisioning and VNF placement in vCDN vCDN中光路配置与VNF放置的联合优化
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-05-01 DOI: 10.1016/j.osn.2023.100740
Takashi Miyamura , Akira Misawa

We consider a joint optimization problem of optical network resources and virtual network function (VNF) placement for efficient content distribution. Current content distribution networks (CDNs) are tightly coupled with network function virtualization (NFV) technologies. A virtual CDN (vCDN) has been intensively investigated to efficiently cope with unpredictable traffic demand. In vCDN, CDN functions are virtually provided as VNF, and we can provide sufficient flexibility regarding the usage of compute resources under traffic demand changes. For the cost-effective CDN services, we must reduce the redundant usage of network resources while improving the efficiency of compute resources. However, a conventional optimal VNF placement technique in vCDN was focused on the efficiency of compute resources, and this can lead to an increase in network cost. To address this issue, we formulate the optimization problem as mixed integer linear programming and then propose a heuristic algorithm called a light-weight VNF placement algorithm in vCDN (LP-vCDN) for reducing network cost while effectively utilizing compute resources. We conducted intensive numerical experiments and demonstrated that LP-vCDN always found solutions of sufficient quality with practical computational overhead.

我们考虑了一个光网络资源和虚拟网络功能(VNF)布局的联合优化问题,以实现高效的内容分发。当前的内容分发网络(CDN)与网络功能虚拟化(NFV)技术紧密结合。虚拟CDN(vCDN)已被深入研究,以有效地应对不可预测的流量需求。在vCDN中,CDN功能实际上是以VNF的形式提供的,我们可以在流量需求变化的情况下提供足够的计算资源使用灵活性。对于具有成本效益的CDN服务,我们必须在提高计算资源效率的同时减少网络资源的冗余使用。然而,vCDN中的传统优化VNF放置技术侧重于计算资源的效率,这可能导致网络成本的增加。为了解决这个问题,我们将优化问题公式化为混合整数线性规划,然后提出了一种启发式算法,称为vCDN中的轻量级VNF放置算法(LP-vCDN),以在有效利用计算资源的同时降低网络成本。我们进行了密集的数值实验,并证明LP-vCDN总是能找到具有实际计算开销的足够质量的解决方案。
{"title":"Joint optimization of optical path provisioning and VNF placement in vCDN","authors":"Takashi Miyamura ,&nbsp;Akira Misawa","doi":"10.1016/j.osn.2023.100740","DOIUrl":"https://doi.org/10.1016/j.osn.2023.100740","url":null,"abstract":"<div><p><span><span><span>We consider a joint </span>optimization problem<span> of optical network resources and virtual network function (VNF) placement for efficient content distribution. Current content </span></span>distribution networks<span> (CDNs) are tightly coupled with network function virtualization (NFV) technologies. A virtual CDN (vCDN) has been intensively investigated to efficiently cope with unpredictable traffic demand. In vCDN, CDN functions are virtually provided as VNF, and we can provide sufficient flexibility regarding the usage of compute resources under traffic demand changes. For the cost-effective CDN services, we must reduce the redundant usage of network resources while improving the efficiency of compute resources. However, a conventional optimal VNF placement technique in vCDN was focused on the efficiency of compute resources, and this can lead to an increase in network cost. To address this issue, we formulate the optimization problem as </span></span>mixed integer linear programming<span><span> and then propose a heuristic algorithm called a light-weight VNF </span>placement algorithm in vCDN (LP-vCDN) for reducing network cost while effectively utilizing compute resources. We conducted intensive numerical experiments and demonstrated that LP-vCDN always found solutions of sufficient quality with practical computational overhead.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"49 ","pages":"Article 100740"},"PeriodicalIF":2.2,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49727560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
In memoriam - Professor Ahmed Kamal 纪念艾哈迈德·卡迈勒教授
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-05-01 DOI: 10.1016/j.osn.2023.100743
{"title":"In memoriam - Professor Ahmed Kamal","authors":"","doi":"10.1016/j.osn.2023.100743","DOIUrl":"https://doi.org/10.1016/j.osn.2023.100743","url":null,"abstract":"","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"49 ","pages":"Article 100743"},"PeriodicalIF":2.2,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49755759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Flat Ball: Dynamic topology for energy management of optical interconnection networks in data centers 平球:数据中心光互连网络能量管理的动态拓扑结构
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-01 DOI: 10.1016/j.osn.2023.100730
Negar Rezaei, Somayyeh Koohi

Cloud computing and web applications have further highlighted the need for powerful data centers with large bandwidth and low power consumption. In order to provide such a large bandwidth, today's electronic data centers require high power levels. Furthermore, communications and devices are not always used to their full potential. Optical networks can be a proper option for data centers, as they can offer large and variable bandwidth with lower power consumption compared to their electronic counterparts. In this regard, a dynamic all-optical network architecture is proposed in this paper, with bandwidth reconfiguration capability and low latency to reduce energy consumption. This proposed architecture, called Flat Ball, offers dynamic bandwidth utilizing passive optical devices with low power consumption and latency. Under realistic data center traffic scenarios, the latency of this network is up to 50% lower than its electrical counterpart, while providing a much higher throughput and consuming up to 60% less power.

云计算和网络应用进一步突出了对具有大带宽和低功耗的强大数据中心的需求。为了提供如此大的带宽,当今的电子数据中心需要高功率水平。此外,通信和设备并不总是能够充分发挥其潜力。对于数据中心来说,光网络是一个合适的选择,因为与电子网络相比,它们可以提供大而可变的带宽,功耗更低。为此,本文提出了一种动态全光网络架构,该架构具有带宽重构能力和低延迟,以降低能耗。这种被称为Flat Ball的架构利用低功耗和低延迟的无源光学设备提供动态带宽。在现实的数据中心流量场景下,该网络的延迟比电气网络低50%,同时提供更高的吞吐量,功耗低60%。
{"title":"Flat Ball: Dynamic topology for energy management of optical interconnection networks in data centers","authors":"Negar Rezaei,&nbsp;Somayyeh Koohi","doi":"10.1016/j.osn.2023.100730","DOIUrl":"https://doi.org/10.1016/j.osn.2023.100730","url":null,"abstract":"<div><p><span><span><span>Cloud computing and web applications have further highlighted the need for powerful </span>data centers with large bandwidth and </span>low power consumption<span>. In order to provide such a large bandwidth, today's electronic data centers require high power levels. Furthermore, communications and devices are not always used to their full potential. Optical networks can be a proper option for data centers, as they can offer large and variable bandwidth with lower power consumption compared to their electronic counterparts. In this regard, a dynamic all-optical network architecture is proposed in this paper, with bandwidth reconfiguration capability and low latency to reduce energy consumption. This proposed architecture, called Flat Ball, offers </span></span>dynamic bandwidth<span> utilizing passive optical devices<span> with low power consumption and latency. Under realistic data center traffic scenarios, the latency of this network is up to 50% lower than its electrical counterpart, while providing a much higher throughput and consuming up to 60% less power.</span></span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"48 ","pages":"Article 100730"},"PeriodicalIF":2.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49755113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Light Fidelity for Internet of Things: A survey 物联网的光保真度:调查
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-01 DOI: 10.1016/j.osn.2023.100732
Antonio Petrosino , Domenico Striccoli , Oleksandr Romanov , Gennaro Boggia , Luigi Alfredo Grieco

Light-Fidelity (LiFi) is quickly emerging as the next-generation communication technology thanks to its unique benefits, such as available spectrum, high data rates, low implementation costs, and inherent beamforming capabilities. As a consequence, it is endorsed by the scientific literature as an appealing innovation for disclosing disruptive services. The wavefront of LiFi technology is very wide: in this manuscript, we focus our attention on the interplay with the Internet of Things. Essentially, LiFi can assist the IoT in interconnecting a massive number of heterogeneous devices by addressing the current Radio Frequency spectrum bottleneck. Moreover, by investigating LiFi and IoT individually, several surveys and review papers testify to the noteworthiness of both technologies. However, to the best of the authors’ knowledge, a comprehensive investigation of contributions where both of them interplay is missing. To fill this gap, this survey provides a thorough investigation of all the research areas in which LiFi key features might enhance the upcoming IoT networks. The evaluation of existing literature on LiFi adopted in the IoT domain can be valuable in identifying missing gaps arising from the interaction of these two technologies, as well as proficiently pinpointing future research directions.

由于其独特的优势,如可用频谱、高数据速率、低实现成本和固有的波束形成能力,光保真(LiFi)正迅速成为下一代通信技术。因此,它被科学文献认可为披露颠覆性服务的一项有吸引力的创新。LiFi技术的前沿非常广泛:在这份手稿中,我们将注意力集中在与物联网的相互作用上。从本质上讲,LiFi可以通过解决当前的射频频谱瓶颈,帮助物联网互连大量异构设备。此外,通过对LiFi和IoT的单独调查,几份调查和综述文件证明了这两种技术的显著性。然而,据作者所知,缺乏对两者相互作用的贡献的全面调查。为了填补这一空白,本次调查对LiFi关键功能可能增强即将到来的物联网网络的所有研究领域进行了彻底调查。对物联网领域采用的LiFi现有文献的评估,对于识别这两种技术相互作用所产生的缺失缺口,以及熟练地确定未来的研究方向,都很有价值。
{"title":"Light Fidelity for Internet of Things: A survey","authors":"Antonio Petrosino ,&nbsp;Domenico Striccoli ,&nbsp;Oleksandr Romanov ,&nbsp;Gennaro Boggia ,&nbsp;Luigi Alfredo Grieco","doi":"10.1016/j.osn.2023.100732","DOIUrl":"https://doi.org/10.1016/j.osn.2023.100732","url":null,"abstract":"<div><p><span><span>Light-Fidelity (LiFi) is quickly emerging as the next-generation communication technology thanks to its unique benefits, such as available spectrum, high data rates, low implementation costs, and inherent beamforming capabilities. As a consequence, it is endorsed by the scientific literature as an appealing innovation for disclosing disruptive services. The wavefront of LiFi technology is very wide: in this manuscript, we focus our attention on the </span>interplay with the </span>Internet of Things<span>. Essentially, LiFi can assist the IoT in interconnecting a massive number of heterogeneous devices by addressing the current Radio Frequency spectrum bottleneck. Moreover, by investigating LiFi and IoT individually, several surveys and review papers testify to the noteworthiness of both technologies. However, to the best of the authors’ knowledge, a comprehensive investigation of contributions where both of them interplay is missing. To fill this gap, this survey provides a thorough investigation of all the research areas in which LiFi key features might enhance the upcoming IoT networks. The evaluation of existing literature on LiFi adopted in the IoT domain can be valuable in identifying missing gaps arising from the interaction of these two technologies, as well as proficiently pinpointing future research directions.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"48 ","pages":"Article 100732"},"PeriodicalIF":2.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49754791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Self-adaptive anti-misalignment model for transceivers in hybrid (RF/VLC)-V2V network 混合(RF/VLC)-V2V网络中收发器自适应抗失调模型
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-01 DOI: 10.1016/j.osn.2022.100729
Yitong Chen, Chaoqin Gan, Xiaoqi Wang, Yixin Chen

In this paper, a self-adaptive anti-misalignment model for transceivers in hybrid radio frequency (RF) communication and visible light communication (VLC) vehicle-to-vehicle (V2V) network is firstly proposed to solve the transceiver misalignment (TM) between vehicles in adjacent lanes caused by vehicle states' changes. By the information on roads and the state of vehicles, traffic scenarios are divided into three categories: the static traffic scenario, the low-speed traffic scenario and the high-speed traffic scenario. By the vehicle behavior characteristics, the relationship between TMs and vehicle states in different traffic scenarios is established. By the relationship, the self-adaptive anti-misalignment model for transceivers is constructed. By the model, the TM can be predicted and the communication mode can be selected. By simulation, the effectiveness of the model is demonstrated. The simulation results show that the model has comparative advantages of preventing the VLC links' interruption and reducing communication modes’ handover numbers in different traffic scenarios.

本文首次提出了一种适用于射频(RF)和可见光通信(VLC)混合车对车(V2V)网络中收发器的自适应抗错位模型,以解决车辆状态变化导致相邻车道车辆之间收发器错位的问题。根据道路信息和车辆状态,交通场景分为三类:静态交通场景、低速交通场景和高速交通场景。根据车辆行为特征,建立了不同交通场景下TMs与车辆状态之间的关系。根据这种关系,建立了收发信机的自适应抗错位模型。通过该模型,可以预测TM并选择通信模式。通过仿真验证了该模型的有效性。仿真结果表明,在不同的业务场景下,该模型在防止VLC链路中断和减少通信模式切换次数方面具有比较优势。
{"title":"Self-adaptive anti-misalignment model for transceivers in hybrid (RF/VLC)-V2V network","authors":"Yitong Chen,&nbsp;Chaoqin Gan,&nbsp;Xiaoqi Wang,&nbsp;Yixin Chen","doi":"10.1016/j.osn.2022.100729","DOIUrl":"https://doi.org/10.1016/j.osn.2022.100729","url":null,"abstract":"<div><p>In this paper, a self-adaptive anti-misalignment model for transceivers<span><span> in hybrid radio frequency (RF) communication and visible light communication (VLC) vehicle-to-vehicle (V2V) network is firstly proposed to solve the transceiver misalignment (TM) between vehicles in adjacent lanes caused by vehicle states' changes. By the information on roads and the state of vehicles, traffic scenarios are divided into three categories: the static traffic scenario, the low-speed traffic scenario and the high-speed traffic scenario. By the vehicle behavior characteristics, the relationship between TMs and vehicle states in different traffic scenarios is established. By the relationship, the self-adaptive anti-misalignment model for transceivers is constructed. By the model, the TM can be predicted and the communication mode can be selected. By simulation, the effectiveness of the model is demonstrated. The simulation results show that the model has comparative advantages of preventing the VLC links' interruption and reducing communication modes’ </span>handover numbers in different traffic scenarios.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"48 ","pages":"Article 100729"},"PeriodicalIF":2.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49754868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Enhancement of failure independent path protection preconfigured cycles for electric power communication networks 电力通信网故障独立路径保护预配置周期的增强
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-03-01 DOI: 10.1016/j.osn.2023.100731
Bin Li , Chao Lu , Bing Qi , Yi Sun , Jian Han

For the purpose of improving the resources utilization efficiency and decrease network redundancy of electric power communication network (EPCN), the paper explores using failure independent path protection preconfigured cycle (FIPP p-Cycle) to provide backup paths for electric communication service and presents a protection algorithm of enhanced FIPP p-Cycle with traffic grooming (EFIPP-TG). Firstly, the multiplexing conditions of FIPP p-Cycle are analyzed specifically, and we propose a FIPP p-Cycle multiplexing algorithm to improve the utilization efficiency of backup resources. Then segment protection algorithm for working path is designed to decrease service blocking ratio as much as possible. In addition, by taking advantage of traffic grooming strategy, the routing paths of services are optimized, yielding effective decrease of network blocking probability. Simulation results from different topologies demonstrate that compared with traditional FIPP p-Cycle scheme, other p-Cycle based protection algorithms and shared backup path protection algorithm, the proposed EFIPP-TG algorithm can significantly reduce the redundancy and blocking probability of networks, shorten the length of backup path and hence improve the reliability of service and performance of network survivability.

为了提高电力通信网络(EPCN)的资源利用效率,减少网络冗余,本文探讨了使用故障无关路径保护预配置循环(FIPP p-cycle)为电力通信服务提供备份路径,并提出了一种具有流量疏导的增强型FIPP p-cycle保护算法(EFIP-TG)。首先,具体分析了FIPP p-Cycle的复用条件,提出了一种FIPP p-Cycle复用算法,以提高备份资源的利用效率。然后设计了工作路径的分段保护算法,以尽可能降低业务阻塞率。此外,利用流量疏导策略,优化了服务的路由路径,有效降低了网络阻塞概率。不同拓扑的仿真结果表明,与传统的FIPP p-Cycle方案、其他基于p-Cycle的保护算法和共享备份路径保护算法相比,所提出的EFIP-TG算法可以显著降低网络的冗余和阻塞概率,缩短了备份路径的长度,从而提高了服务的可靠性和网络生存性能。
{"title":"Enhancement of failure independent path protection preconfigured cycles for electric power communication networks","authors":"Bin Li ,&nbsp;Chao Lu ,&nbsp;Bing Qi ,&nbsp;Yi Sun ,&nbsp;Jian Han","doi":"10.1016/j.osn.2023.100731","DOIUrl":"https://doi.org/10.1016/j.osn.2023.100731","url":null,"abstract":"<div><p><span>For the purpose of improving the resources utilization efficiency and decrease network redundancy of electric power communication network (EPCN), the paper explores using failure independent path protection preconfigured cycle (FIPP p-Cycle) to provide backup paths for electric communication service and presents a protection algorithm of enhanced FIPP p-Cycle with traffic grooming (EFIPP-TG). Firstly, the multiplexing conditions of FIPP p-Cycle are analyzed specifically, and we propose a FIPP p-Cycle multiplexing algorithm to improve the utilization efficiency of backup resources. Then segment protection algorithm for working path is designed to decrease service blocking ratio as much as possible. In addition, by taking advantage of traffic grooming strategy, the routing paths of services are optimized, yielding effective decrease of network </span>blocking probability<span><span>. Simulation results from different topologies demonstrate that compared with traditional FIPP p-Cycle scheme, other p-Cycle based protection algorithms and shared backup path protection algorithm, the proposed EFIPP-TG algorithm can significantly reduce the redundancy and blocking probability of networks, shorten the length of backup path and hence improve the reliability of service and performance of network </span>survivability.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"48 ","pages":"Article 100731"},"PeriodicalIF":2.2,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49754620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A fast data synchronization technique in optical inter-connected data centers 光互联数据中心的快速数据同步技术
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-02-01 DOI: 10.1016/j.osn.2022.100698
Yang Lu, Lufang Cao, Kaiqiang Xu, Xuemeng Li, Hongsheng Deng, Yunxin Lv, Yanrong Zhai

A fast data synchronization method in optical inter-connected data center is proposed. The origin data are combined to fewer coded data to reduce the synchronization slots. The coded data are broadcast to other nodes. Each node decodes the coded data to recover its missing data. A coding strategy based on coding matrices is proposed for various data distribution. The parity-check matrices in error-control coding theory can be used as coding matrices. The synchronization slots are reduced by the proposed coding method, especially when the missing ratio is low. The slots can be further reduced when the coding field is extended to high-order galois fields.

提出了一种光互连数据中心的快速数据同步方法。将原始数据组合成更少的编码数据以减少同步时隙。编码数据被广播到其他节点。每个节点对编码数据进行解码以恢复其丢失的数据。针对各种数据分布,提出了一种基于编码矩阵的编码策略。差错控制编码理论中的奇偶校验矩阵可以用作编码矩阵。所提出的编码方法减少了同步时隙,尤其是在丢失率较低的情况下。当编码字段扩展到高阶伽罗瓦字段时,可以进一步减少时隙。
{"title":"A fast data synchronization technique in optical inter-connected data centers","authors":"Yang Lu,&nbsp;Lufang Cao,&nbsp;Kaiqiang Xu,&nbsp;Xuemeng Li,&nbsp;Hongsheng Deng,&nbsp;Yunxin Lv,&nbsp;Yanrong Zhai","doi":"10.1016/j.osn.2022.100698","DOIUrl":"https://doi.org/10.1016/j.osn.2022.100698","url":null,"abstract":"<div><p><span>A fast data synchronization method in optical inter-connected </span>data center<span> is proposed. The origin data are combined to fewer coded data to reduce the synchronization slots. The coded data are broadcast to other nodes. Each node decodes the coded data to recover its missing data. A coding strategy based on coding matrices is proposed for various data distribution. The parity-check matrices in error-control coding theory can be used as coding matrices. The synchronization slots are reduced by the proposed coding method, especially when the missing ratio is low. The slots can be further reduced when the coding field is extended to high-order galois fields.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"47 ","pages":"Article 100698"},"PeriodicalIF":2.2,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49753939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Scalable multicast control-plane for optical packet forwarding engines: A multiway SVRF approach 用于光分组转发引擎的可扩展多播控制平面:一种多路SVRF方法
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2023-02-01 DOI: 10.1016/j.osn.2022.100713
Wen-Kang Jia , Yaw-Chung Chen , Zhu Jin , Weihao Geng

In control-plane of optical packet forwarding engines (OPFEs), the group-membership query algorithm determines the egress through which a packet should be forwarded. To implement a high-performance multicast-enabled switch/router, a super-fast group-membership query algorithm is the key element within the PFEs which require the following essential properties: high link-bandwidth, high port-density, high forwarding speed, high scalability, and affordable cost. Current group-membership query approaches such as Bloom filter (BF) and Scalar-Pair Vectors Routing and Forwarding (SVRF) still suffer from serious weaknesses in terms of the space/time inefficiency, false-positive error, and low maintainability, etc. To accommodate these weaknesses, we propose an improved forwarding scheme–M-way Scaler-matrix and Vectors Routing and Forwarding (M-way SVRF) by re-examining the idea of the original SVRF. The M-way SVRF divides a ρ-bit port identifier into M-sub-blocks in the memory unit, thus element's keys belonging to distinct sub-blocks are able to reuse relatively smaller identical prime keys. Compared to previous works, simulation results show that the membership queries can be partitioned to leverage task parallelism, and better performance in the aspects of memory consumption and computational complexity, especially when the port-density of optical PFE is sufficiently high.

在光分组转发引擎(OPFE)的控制平面中,组成员身份查询算法确定分组应该通过其转发的出口。为了实现高性能的支持多播的交换机/路由器,超快的组成员身份查询算法是PFE中的关键元素,PFE需要以下基本特性:高链路带宽、高端口密度、高转发速度、高可扩展性和可承受的成本。当前的组成员查询方法,如Bloom filter(BF)和标量对向量路由和转发(SVRF),在空间/时间效率低、误报和可维护性低等方面仍然存在严重的弱点。为了适应这些弱点,我们通过重新审视原始SVRF的思想,提出了一种改进的转发方案——M路缩放器矩阵和矢量路由和转发(M路SVRF)。M路SVRF将ρ位端口标识符划分为存储单元中的M个子块,因此属于不同子块的元素密钥能够重用相对较小的相同素数。与以前的工作相比,仿真结果表明,成员查询可以进行分区以利用任务并行性,并且在内存消耗和计算复杂度方面具有更好的性能,特别是当光PFE的端口密度足够高时。
{"title":"Scalable multicast control-plane for optical packet forwarding engines: A multiway SVRF approach","authors":"Wen-Kang Jia ,&nbsp;Yaw-Chung Chen ,&nbsp;Zhu Jin ,&nbsp;Weihao Geng","doi":"10.1016/j.osn.2022.100713","DOIUrl":"https://doi.org/10.1016/j.osn.2022.100713","url":null,"abstract":"<div><p><span>In control-plane of optical packet forwarding<span> engines (OPFEs), the group-membership query algorithm determines the egress through which a packet should be forwarded. To implement a high-performance multicast-enabled switch/router, a super-fast group-membership query algorithm is the key element within the PFEs which require the following essential properties: high link-bandwidth, high port-density, high forwarding speed, high scalability, and affordable cost. Current group-membership query approaches such as Bloom filter (BF) and Scalar-Pair Vectors Routing and Forwarding (SVRF) still suffer from serious weaknesses in terms of the space/time inefficiency, false-positive error, and low maintainability, etc. To accommodate these weaknesses, we propose an improved forwarding scheme–</span></span><em>M</em>-way Scaler-matrix and Vectors Routing and Forwarding (<em>M</em>-way SVRF) by re-examining the idea of the original SVRF. The M-way SVRF divides a <em>ρ</em><span><span>-bit port identifier into M-sub-blocks in the memory unit, thus element's keys belonging to distinct sub-blocks are able to reuse relatively smaller identical prime keys. Compared to previous works, simulation results show that the membership queries can be partitioned to leverage task parallelism, and better performance in the aspects of memory consumption and </span>computational complexity, especially when the port-density of optical PFE is sufficiently high.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"47 ","pages":"Article 100713"},"PeriodicalIF":2.2,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49754049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
期刊
Optical Switching and Networking
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1