共查询到20条相似文献,搜索用时 531 毫秒
1.
2.
3.
4.
5.
6.
在智能电网中,如何有效降低电力通信安全风险成为电力系统亟需解决的问题之一.而业务路由是影响通信风险的重要决定因素,但是现有的路由算法中没有考虑电力通信业务的特殊性,会引起通道段中业务分布不均衡,进一步导致通道段和网络的整体风险增大.为此,该文提出面向业务的风险均衡路由分配机制来降低通道段和网络整体风险.首先,该机制综合业务重要度和通道可用性等因素,建立了面向业务的风险均衡问题模型.其次,基于该模型提出一个面向业务的路由风险均衡机制.最后,通过基于某省电力通信网拓扑数据进行仿真,相对于传统的可用性路由(ARR)和负载均衡(LB)算法,该文所提机制能将业务通道风险均衡度提高30%以上,并将网络总体风险度降低至少6%,具有很强的现实意义. 相似文献
7.
时延和时延抖动约束的低费用多播路由算法 总被引:3,自引:0,他引:3
为了有效支持交互式实时组播业务,不仅要考虑时延约束,而且要考虑时延抖动约束,同时还需高效管理网络资源,以降低多播费用。本文提出了一种新的时延和时延抖动约束的低费用我播路由启发式算法,仿真结果表明该算法复杂度较低,时延抖动较小,又降低了网络费用,是一种快速有效的多播路由算法。 相似文献
8.
随着无线Mesh网络传输多媒体业务需求的增加,要求网络支持服务质量(QoS),本文基于DSR协议设计了一个支持QoS的路由协议算法QDSR(QoS-DSR)。该算法保证了数据流的带宽、时延的QoS需求,根据路径跳数和节点拥塞情况定义路由代价函数,选择最优路径。仿真结果表明,与DSR相比,QDSR提高了网络吞吐量,降低了平均端到端延时,提高了网络利用率,更好地满足业务的QoS需求,并且具有更强的适用性和可扩展性。 相似文献
9.
随着互联网业务数据的爆炸性增长,网络中的关键节点——交换机的“电子瓶颈”问题成为限制网络吞吐能力的重要原因.设计了一种适用于Clos交换结构的平面间路由算法,按照业务传输路径的特性和业务之间的位置关系,为业务快速选择最合适的传输路径.仿真表明,该算法在减少业务阻塞率、降低时延方面表现出色,有效改善了交换设备的路由性能. 相似文献
10.
11.
P. G. Sarigiannidis G. I. Papadimitriou A. S. Pomportsis 《Photonic Network Communications》2006,11(2):211-227
In this paper a new packet scheduling algorithm for WDM star networks is introduced. The protocol adopted is pre-transmission
coordination-based and packet collisions have been eliminated due to predetermination of the timeslots each node transmits
in a demand matrix. The requests of the transmitted packets are predicted through Markov chains in order to reduce the calculation
time of the final scheduling matrix. This is accomplished by pipelining the schedule computation. The innovation that this
algorithm introduces is to modify the service sequence of the node. The proposed algorithm is studied via extensive simulation
results and it is proved that changing the sequence that nodes transmit, from the node with the largest number of requests
to the node with the fewest requests, that there is an increase in the throughput of the network, with a minimum (almost zero)
cost in mean time delay and in delay variance. 相似文献
12.
卫星网络是一种特殊的时变网络,其QoS路由问题比地面网络QoS路由问题更为复杂.本文利用卫星拓扑的可预测性,通过引入业务的中断概率和费用模型来描述链路切换对业务QoS以及网络的影响,并给出时延受限最小费用路由(SDCMCR)算法来解决在卫星链路时延长的情况下寻找满足时延限制条件且受切换影响最小的路径的问题,该算法可兼顾网络业务中断率和业务阻塞率等性能,且计算复杂度低,可适应星上设备处理能力的要求.仿真表明算法在计算复杂性、业务请求被阻塞的概率等方面都优于同类算法. 相似文献
13.
5G通信时代的到来使城域波分系统从传统的环形向mesh形演进,OXC技术的引入让mesh形组网变得更加便捷。本文通过利用Dijkstra算法和偏离路径Yen算法解决城域mesh波分系统中最短路由和备用路由的规划选择问题,让业务在城域传送网中的时延得到优化以满足5G业务大带宽低时延的要求。 相似文献
14.
日益增长的数据量对数据处理的要求越来越高,于是出现了数据密集型服务。在解决复杂问题时,多个数据密集型服务通常会形成一个服务组合。由于服务组件之间存在大量的数据传输,巨大的传输时延会对系统的整体性能造成影响。在边缘计算环境中,基于否定选择算法,为降低服务组合中的数据传输时间提出了一种优化部署策略。首先,给出了此类数据密集型服务组件部署问题的定义,并为该部署问题构建优化模型;然后,设计了一种否定选择算法来获取最佳的部署方案;为了评估该算法的适用性和收敛性,使用遗传算法和模拟退火算法与其对比,结果显示,提出的算法在这种数据密集型服务组件的部署问题中表现得更为出色。 相似文献
15.
针对5G环境下服务功能链(SFC)端到端时延无法满足时延敏感型应用需求的问题,将传统虚拟网络功能(VNF)拆分成粒度不一的映射单元,提出了基于微服务架构的粒度可变服务功能链映射(VG-SFCM)算法。首先将传统粗粒度的VNF解耦成细粒度的微服务单元,随后通过SFC内冗余微服务单元的合并及SFC间微服务单元的复用,减少微服务单元的实例化,降低SFC的处理时间。仿真结果表明,所提算法在降低平均部署网络成本的同时,其SFC端到端时延相较于传统的映射算法降低了14.81%。 相似文献
16.
以基于WiFi的自组织网络为应用背景,本文利用仿真平台OPNET对四种经典自组网路由协议的性能进行了仿真比较。实验结果表明,反应式路由协议的性能总体优于先应式路由算法,而AODV协议由于其备份路由的特性,性能更优。为满足战场环境下车载自组织网的大规模组网要求,以及火控数据的时延传输要求,结合AODV算法的优势,本文提出了一种新的分层自组网路由算法CRP,其分簇结构的设计减少了网络拓扑变化对寻由过程的影响和路由发现过程中的洪泛开销,加速了路由的查找过程,仿真结果显示该算法的综合性能优于AODV算法及经典分簇路由协议ZRP算法,端到端传输时延明显减小。 相似文献
17.
Yanjing Sun Jianguang Sun Fangfang Zhao Zhuoxian Hu 《International Journal of Communication Systems》2016,29(1):210-225
According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
18.
To guarantee the quality of service (QoS) of a wireless network, a new packet scheduling algorithm using cross-layer design technique is proposed in this article. First, the demand of packet scheduling for multimedia transmission in wireless networks and the deficiency of the existing packet scheduling algorithms are analyzed. Then the model of the QoS-guaranteed packet scheduling (QPS) algorithm of high speed downlink packet access (HSDPA) and the cost function of packet transmission are designed. The calculation method of packet delay time for wireless channels is expounded in detail, and complete steps to realize the QPS algorithm are also given. The simulation results show that the QPS algorithm that provides the scheduling sequence of packets with calculated values can effectively improve the performance of delay and throughput. 相似文献
19.
Yufei Wang Jun Liu Yu Tong Qingwen Yang Yanyi Liu Hanbo Mou 《International Journal of Satellite Communications and Networking》2023,41(4):331-356
With the development of space information network (SIN), new network applications are emerging. Satellites are not only used for storage and transmission but also gradually used for calculation and analysis, so the demand for resources is increasing. But satellite resources are still limited. Mobile edge computing (MEC) is considered an effective technique to reduce the pressure on satellite resources. To solve the problem of task execution delay caused by limited satellite resources, we designed Space Mobile Edge Computing Network (SMECN) architecture. According to this architecture, we propose a resource scheduling method. First, we decompose the user tasks in SMECN, so that the tasks can be assigned to different servers. An improved ant colony resource scheduling algorithm for SMECN is proposed. The heuristic factors and pheromones of the ant colony algorithm are improved through time and resource constraints, and the roulette algorithm is applied to route selection to avoid falling into the local optimum. We propose a dynamic scheduling algorithm to improve the contract network protocol to cope with the dynamic changes of the SIN and dynamically adjust the task execution to improve the service capability of the SIN. The simulation results show that when the number of tasks reaches 200, the algorithm proposed in this paper takes 17.52% less execution time than the Min-Min algorithm, uses 9.58% less resources than the PSO algorithm, and achieves a resource allocation rate of 91.65%. Finally, introducing dynamic scheduling algorithms can effectively reduce task execution time and improve task availability. 相似文献
20.
This paper proposes urgency-based packet scheduling and routing algorithms to effectively deliver delay-sensitive data over a multi-hop mobile ad hoc networks supporting IEEE 802.11 multi-rate service. First, packet urgency, node urgency, and route urgency are defined on the basis of the end-to-end delay requirement. Based on these urgency metrics and the estimated transmission delay of each packet by Kalman filter, the proposed packet scheduling algorithm determines the transmission order and drop policy to minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize the derivative of route urgency in order to maximize the number of packets delivered within the required end-to-end delay. Finally, experimental results are presented to evaluate the performance of the proposed joint working algorithms. 相似文献