共查询到18条相似文献,搜索用时 62 毫秒
1.
2.
文章分析了偏射路由对网络性能的影响,在分析发送端控制偏射路由技术的基础上,提出了基于阈值检测和数据更新的改进方案.边缘节点快速更新状态信息,并通过特殊控制分组传递链路拥塞的分布特征等信息;交换节点进行阈值检测,动态决定竞争时突发的传送方式,减少偏射路由对网络负荷的影响,进一步降低网络阻塞率,改善网络性能。 相似文献
3.
4.
目前光突发交换(OBS)技术作为下一代光互联骨干网最有前途的交换方式受到广泛关注。偏射路由是一种有效的竞争解决方案。根据已有的研究,首先介绍了偏射路由的概念;然后探讨了偏射路由解决方案的关键问题,如偏射路由时间、控制分组的格式、节点的功能模块和实现算法;最后将偏射路由与其他竞争解决方案进行了比较。 相似文献
5.
6.
可调参数偏射路由:一种光突发竞争解决算法 总被引:4,自引:1,他引:3
为解决当前偏射算法在偏射控制上的问题,提出了可调参数偏射路由(TPDR)算法。其主要思想为:以可调参数“偏射概率”来控制竞争突发的偏射,并在非线性规划下,从突发丢失概率(BLP)和路径长度意义上寻找较优的偏射路径。仿真结果表明:与直接丢弃、无条件偏射和有限偏射等传统偏射算法相比较,TPDR算法具有:既能有效改善网络总的BLP,也能为不同优先级突发提供服务质量(QoS)保证;同时,在一定程度上它可有效地减轻偏移时间赤字对偏射突发QoS保证的压力。 相似文献
7.
8.
偏射路由作为一种行之有效的光突发交换竞争解决机制而被广泛加以研究,文章提出了一种改进的基于奖惩机制的偏射路由算法,通过查找代表链路实时拥塞状况的奖惩列表,选择负载最小的链路对竞争的突发包进行偏射处理,与传统的固定最短偏射路由算法相比,本算法达到了均衡网络负载的目的。仿真结果表明:本文所提出的算法在突发丢失率及平均链路利用率方面性能都有所提高。 相似文献
9.
一种基于门限的光突发交换受限偏射路由算法 总被引:6,自引:3,他引:6
提出了一种基于突发丢失门限的条件偏射路由算法(LDFD),该算法采用丢弃少量偏射的高优先级突发来保证偏射路由上较低优先级非偏射突发的服务质量(QoS)。当偏射的高优先级突发到达核心节点而该节点没有空闲数据信道时,就启用定义的偏射条件检测函数来判断是丢弃该突发还是允许其抢占非偏射的低优先级突发的资源,从而减少偏射突发与偏射路由上原有突发的竞争。仿真表明,该算法可以很好地控制偏射突发对偏射路由上正常流量的影响,并有效地提高整个网络的突发丢失性能。 相似文献
10.
11.
12.
Optical burst contention is one of the major factors that cause the burst loss in the optical burst switching (OBS) networks. So far, various contention resolution schemes have been proposed. Among them, the deflection path is more attractive due to its low requirement for optical buffer in capability and quantity. However, these deflection path algorithms do not consider the successful transmission rate of deflection traffic, and the deflection traffic??s impacts on the original traffic of the deflection path are not concerned. Meanwhile, the offset-time deficit problem for deflected bursts is ignored. Therefore, in order to reduce the burst loss probability in OBS networks, a Distributed Backoff-channel DeFlection algorithm with load balancing, for short DBDF-LB, is proposed. It consists of two parts, that is, the deflection with load balancing and the backoff-channel buffering scheme. Firstly, from the perspective of the network-wide load balancing, the optimal deflection path, on which the contention-failure burst is deflected with the minimum hops and the least burst loss probability, is selected. Secondly, the extra offset-time for the deflected burst is provided through the backoff-channel scheme. Finally, by numerical simulations, compared with the classical shortest path deflection algorithm, the DBDF-LB can obviously reduce the burst loss probability, about 50%, with a little extra overhead. 相似文献
13.
Hoang‐Linh To Suk‐Hwan Lee Won‐Joo Hwang 《International Journal of Communication Systems》2015,28(11):1729-1740
We consider optical delay line buffer as a solution to reduce the number of lost burst in optical burst switching, one of the promising candidates for future networks. Such network takes burst loss as an important performance criteria in the design step. Network performance, however, cannot be captured efficiently using traditional queueing models, because they often ignore the impatience of messages traveling through optical switches which is one of the popular issues in communication networks. In this paper, we develop an analytic model for this system using queueing theory and considering special impatience features. Simulation results show that (i) the developed model with impatience features can decrease burst loss probability ( ? 10%) compared with other approaches, and (ii) applying that model, we demonstrate that shared buffer architecture in optical burst switching network with optical buffer often achieves lower burst loss probability than dedicated buffer way in several different scenarios. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
14.
15.
This paper proposes a dynamic burst discarding scheme for deflection routing in optical burst switching networks. In general, deflection routing is effective in lightly loaded situations, whereas it has a contrary effect in congested networks because deflected bursts accelerate network congestion. Thus deflection routing should be employed in lightly loaded networks. Incoming traffic, however, varies in time and location, so that temporal and/or local congestion cannot be avoided. Our proposed scheme resolves this problem in the following way. Each node autonomously detects congestion with local information, and bursts to be deflected are discarded in a probabilistic manner, based on the degree of detected congestion and the numbers of elapsed and remaining hops of those bursts. Simulation experiments show that when congestion happens temporarily, the proposed scheme reduces the burst loss probability, and it utilizes network resources efficiently when local congestion happens. 相似文献
16.
The bufferless router emerges as an interesting option for cost-efficient in network-on-chip (NoC) design. However, the bufferless router only works well under low network load because deflection more easily occurs as the injection rate increases. In this paper, we propose a load balancing bufferless deflection router (LBBDR) for NoC that relieves the effect of deflection in bufferless NoC. The proposed LBBDR employs a balance toggle identifier in the source router to control the initial routing direction of X or Y for a flit in the network. Based on this mechanism, the flit is routed according to XY or YX routing in the network afterward. When two or more flits contend the same one desired output port a priority policy called nearer-first is used to address output ports allocation contention. Simulation results show that the proposed LBBDR yields an improvement of routing performance over the reported bufferless routing in the flit deflection rate, average packet latency and throughput by up to 13%, 10% and 6% respectively. The layout area and power consumption compared with the reported schemes are 12% and 7% less respectively. 相似文献
17.