共查询到16条相似文献,搜索用时 109 毫秒
1.
波长路由在并行计算机光互连中的应用 总被引:2,自引:0,他引:2
提出了一种波长路由并行光互连技术,其路由直接在源端用目标地址选择波长来建立,各波长有独立传输路径并采用光通道复用,路由变换节点为全光结构,光信号在变换节点处无转发延迟。此技术可应用于并行计算机互连网络和分布式高性能计算机群的互连网络。 相似文献
2.
讨论了WDM光网中,在动态业务流量和有限范围波长变换情况下的动态路由和波长分配问题。基于Moone-Dijkstra算法,考虑到动态波长变换的可能和限制,提出了一种新型的、可实现动态最小代价路由和最佳虚波长通道的综合启发式算法(DMC-OVWP)。该算法对路由子问题和波长分配子问题既相互独立,又相互结合,优化了RWA。以中国教育和科研计算机网(CERNET)为拓扑背景,基于本算法进行了计算机仿真,并对实验结果进行了比较分析,证明本算法可充分利用网络信息获取较低的阻塞率。 相似文献
3.
4.
5.
采用波长间隔为10-20nm的CWDM(coarse wavelength division multiplexing)技术,设计完成了高性能波分复用计算机局域网。采用该设计方案可把现有的单波长光纤局域网无缝升级为多波长网络,不仅提供网络带宽的升级,同时实现网络结点间的波长路由功能,减小了数据包在网络中的通信延迟。为实现网络规模的扩展,本文同时在850nm和1300nm窗口设计了两种光纤网卡,实验证明,CWDM技术可以在两个波长窗口同时实现。 相似文献
6.
针对前期工作中讨论的多阶段虚通道(VP)控制和VP拓扑优化问题,以及基于在每一个源目(SD)节点对之间存在一组备选路由集这一假设的相应的优化算法,提出了一个补充算法,它能够求出任意两节点间的所有可能路径。在此基础上,进一步研究了一种动态虚通路(VC)路由策略。与其它路由策略不同,它是在更一般的网络环境中加以考虑的。最后,给出了一个动态VP路由算法,这是动态VC路由策略中的一个重要组成部分。理论分析和试验结果表明,这些算法是正确的,且有极高的实用价值。 相似文献
7.
8.
在波带交换的基础上加入光码粒度,构成包括光纤、波带、波长、光码粒度的四层多粒度光交叉连接(MG-OXC)结构,并应用码群路由(CGRE)技术使多个波长通道级联,构成波带交换和CGRE共存的混合捆绑体系,提出混合算法以缓解端口数目过多和波长利用率较低的问题,使业务在各个粒度灵活上下路。将基于通用多协议标签交换(GMPLS)的四层多粒度光交叉连接结构体系作为软件定义网络(SDN)体系中数据转发层的一部分,由软件定义网络控制器进行集中管理,可优化网络结构。通过对波长利用率、端口需求数目和系统丢包率3方面的仿真分析,验证了该网络体系的优秀性能。 相似文献
9.
为适应网络中不同服务质量(QoS)的光路建立请求具有不同的优先级的情况,提出了一种用于部分波长可变网络中支持QoS的动态波长分配算法。该算法对网络中的业务请求分高、低两个优先级进行处理。对于高优先级的光路建立请求,通过充分利用网络中已配置的波长转换器实时改变可用波长集,以降低高优先级业务请求的阻塞率。对低优先级的光路建立请求,只考虑所选路径的当前位置是否有波长转换器来改变可用波长集,保证了低优先级的光路建立请求速度。仿真结果表明,该算法既能保证较高优先级的光路建立请求具有较低的阻塞率,又充分利用了有限的网络资源,实现了对波长转换器的最优利用。 相似文献
10.
通过引入分布式结构+反馈回路+波长分组的方法,提出了一种新的波长三次重用的多波长星形光网络。这种新的网络通过多耦合器内连和网络所有信道波长的三次重用,使网络规模和网络最大吞吐量都达到常规WDM星形网的4倍;通过单纤双向传输,在网络节点数相同的条件下,可节省光纤50%;通过采用分布式结构,使网络的抗毁性得到大幅度提高。 相似文献
11.
介绍了一种新颖的干涉波和探测方法,该方法可用于光学传感系统中测量波长的漂移。在本文法中,采用了另一已知波长的参江与被测光波长的光一起注入探测系统中,其中参考波长用于稳定干涉仪的光程差,以保证波长探测系统对环境扰动(如温度波动、机械振动)的不敏感。初步实验表明,使用本可将系统的信噪比提高25dB。 相似文献
12.
A mobile agent based on-demand quality of service (QoS) unicast routing scheme for supporting multimedia applications is proposed that considers bandwidth, delay and packet loss as QoS metrics for feasible path computation. A mobile agent is employed to find multiple QoS paths and select a best path among them to preserve resources so as to increase call success ratio and network bandwidth utilisation as well as adapt to network dynamics. The scheme is simulated in various network scenarios (sparse and dense networks) to verify performance and operation effectiveness, and compared with RSVP-based QoS routing by using an internet routing protocol. The results demonstrate significant improvements in call success ratio and network bandwidth utilisation compared with RSVP-based QoS routing, both in case of sparse and dense networks. Benefits of the agent-based scheme are adaptability, flexibility, and support for component-based software engineering features such as software reuse, customisation and maintainability 相似文献
13.
14.
The authors proposed a selective assign shortest path first (SASPF) algorithm for routing and wavelength assignment in the presence of four wave mixing (FWM) in wavelength division multiplexing network with a design parameter Vm. In order to maintain a reasonably good performance in terms of blocking probability to fulfil the connection requests but also to allow acceptable FWM effects, Vm is an important design parameter (number of established optical channels to fulfil the connection requests but also to allow acceptable FWM effects). If its value is too low, many connection requests will not be able to establish, which may lead to higher blocking probability. On the other hand, if its value is too high, it may lead to obvious FWM effects that will affect the network performance. Thus, Vm must be optimum to balance the requirement of the connection requests and also the induced FWM crosstalks. Performance results show that SASPF algorithm outperforms the comparison scheme such as traditional assign shortest path first resulting in low blocking probability with a specific value of Vm. 相似文献
15.
Maryam Shafiq Humaira Ashraf Ata Ullah Mehedi Masud Muhammad Azeem N. Z. Jhanjhi Mamoona Humayun 《计算机、材料和连续体(英文)》2021,67(3):3505-3521
The Internet of Things (IoT) is gaining attention because of its broad applicability, especially by integrating smart devices for massive communication during sensing tasks. IoT-assisted Wireless Sensor Networks (WSN) are suitable for various applications like industrial monitoring, agriculture, and transportation. In this regard, routing is challenging to find an efficient path using smart devices for transmitting the packets towards big data repositories while ensuring efficient energy utilization. This paper presents the Robust Cluster Based Routing Protocol (RCBRP) to identify the routing paths where less energy is consumed to enhances the network lifespan. The scheme is presented in six phases to explore flow and communication. We propose the two algorithms: i) energy-efficient clustering and routing algorithm and ii) distance and energy consumption calculation algorithm. The scheme consumes less energy and balances the load by clustering the smart devices. Our work is validated through extensive simulation using Matlab. Results elucidate the dominance of the proposed scheme is compared to counterparts in terms of energy consumption, the number of packets received at BS and the number of active and dead nodes. In the future, we shall consider edge computing to analyze the performance of robust clustering. 相似文献
16.
一种新的基于移动预测的MANET路由协议 总被引:7,自引:0,他引:7
移动自组网是一种由一系列可以自由移动的节点主机聚集而成的一个临时性动态网络。它没有固定基站,也没有作为控制管理中心的节点主机,由于其拓扑的动态性,其路由协议与其他传统网络有很大的区别。为了能更有效地移动自组网中实现数据的传送,本文提出了一种基于移动预测下的MANET路由协议,该协议综合考虑了传输路径的延时和稳定性,选择在延时限制下平均拥有最稳特性的传输路径,模拟结果表明,这种方法比基于移动预测量稳路径路由协议的传输时延要短,传送成功概率要高,而控制开销却相关不大。 相似文献