可调参数偏射路由:一种光突发竞争解决算法

为解决当前偏射算法在偏射控制上的问题,提出了可调参数偏射路由（TPDR）算法。其主要思想为：以可调参数“偏射概率”来控制竞争突发的偏射,并在非线性规划下,从突发丢失概率（BLP）和路径长度意义上寻找较优的偏射路径。仿真结果表明：与直接丢弃、无条件偏射和有限偏射等传统偏射算法相比较,TPDR算法具有：既能有效改善网络总的BLP,也能为不同优先级突发提供服务质量（QoS）保证;同时,在一定程度上它可有效地减轻偏移时间赤字对偏射突发QoS保证的压力。     

基于竞争控制的光突发交换条件偏射路由算法

光突发交换(OBS)网络中,偏射路由算法是有效地解决突发竞争、提高网络性能的一种重要措施,但通过分析发现,它可能会导致偏射路由上正常(非偏射)突发的丢失率上升.提出了一种基于竞争控制的条件偏射路由算法,根据定义的偏射条件检测函数,有条件的偏射或丢弃竞争突发来保证偏射路由上正常突发的QoS.仿真表明该算法可以很好地控制偏射突发对网络偏射路由上正常流量的影响.     

基于链路负载的光突发交换混合路由算法

偏射路由和丢弃重传都能够有效解决光突发交换(OBS)网络中的突发竞争问题.结合偏射路由和丢弃重传的优点,提出了一种基于链路负载的偏射和重传混合的路由算法(LHDR).它根据网络链路的流量负载来计算和存储偏射路由,同时通过链路的平均负载率和节点跳数来确定对竞争突发的偏射或重传.仿真结果表明,LHDR在网络流量负载很高的情况下,能获得很好的突发丢失和端到端延时性能.     

OBS网络中基于优先级与参数可调的偏射路由算法

为了保证OBS网络中不同优先级业务的服务质量和解决偏射算法在偏射控制上的问题,提出一种基于优先级与参数可调的偏射路由算法.该算法通过设置可调参数“偏射概率”来控制冲突突发包的偏射,并从可调丢包率和偏射路径长度意义上寻找最佳偏射路由.当冲突发生时,分割优先级低的突发包,并将分割突发包偏射到空闲的链路上;在空闲的链路中选择...     

基于阈值检测的光突发交换偏射路由算法

光突发交换是适合在当前技术条件下的新交换技术,它比电路交换灵活,带宽利用率高,又比光分组交换易于实现,将成为下一代光IP骨干网的核心技术。在光突发交换网络中,偏射路由算法是有效解决突发竞争、提高网络性能的一种重要措施。首先分析了发送端控制的偏射路由技术,在此基础上提出了一种基于阈值检测的偏射路由的改进算法。该算法通过跳数来控制无效偏射路由并通过有条件地丢弃偏射突发来保证正常突发的丢包率,从而减少偏射路由对网络负荷的影响,使整个网络的丢包率得到一定提高,改善网络性能。     

OBS中基于优先级与负载均衡的偏射路由算法

为了解决偏射算法在偏射控制七的问题,提出了一种基于优先级与负载均衡的偏射路由算法.当冲突发生时,分割优先级低的突发数据包;将冲突部分的突发包偏射到空闲的链路上,并在空闲的链路中选择若干条"当前最大剩余跳数小于源-目的节点的最大跳数"的路由作为候选路由;最后,在这些候选路由中选择一条可以使网络中各链路使用波长数的统计方差...     

OBS网络中偏射路由的研究

目前光突发交换（OBS）技术作为下一代光互联骨干网最有前途的交换方式受到广泛关注。偏射路由是一种有效的竞争解决方案。根据已有的研究,首先介绍了偏射路由的概念;然后探讨了偏射路由解决方案的关键问题,如偏射路由时间、控制分组的格式、节点的功能模块和实现算法;最后将偏射路由与其他竞争解决方案进行了比较。     

一种非循环的光突发交换网络偏射路由算法

文章提出了一种非循环的应用于光突发交换(OBS)网络的偏射路由算法．它基于各网络节点的路径度和平均跳转数来确定偏射路径．通过建立OBS网络仿真模型。从数据突发的丢失率、平均跳转次数和端到端延时等方面来对其进行评价．仿真结果表明，该算法能确定有效的非循环偏射路径，为OBS网络提供了公平的网络资源利用．     

OBS网络中一种基于优先级的偏射路由机制

提出了一种基于优先级的偏射路由机制,该机制通过分割偏射优先级低的突发包来保证高优先级突发包的QoS.仿真结果表明,高优先级突发包的丢失率比低优先级的要低,并且突发包的丢失率随数据信道数目的增加而降低.该机制不仅能够有效地降低突发包的丢失率,而且能够为高优先级突发包提供很好的QoS保障.     

光突发交换中冲突解决的GHA-TS机制

提出了一种新型的冲突解决机制--GHA-TS(priority-based grouping and hybrid-assembly with tail segment)机制,它采用基于优先级的分组复合封装策略,并根据偏射路由阀值选择尾部分段丢弃或偏射路由策略进行冲突解决.仿真结果表明,GHA-TS机制能够有效降低光突发交换网络的丢包率,尤其是高优先级IP报文的丢失率,较好地支持了光突发交换网络的QoS要求.     

A Limited Deflection Routing Algorithm Based on Burst Loss Threshold in OBS Networks

1 Introduction The increase in the demand of transport capacity duetothe explosive growth of the Internet IP-based traffichas fueled the development of high-speed transmissionsystems andthe emergence of Wavelength Division Mul-tiplexing ( WDM) technology[1].Soin the near future ,it will be possible to support hundreds of wavelengths ofseveral Gigabit/s each. A new approach called OpticalBurst Switching (OBS)[2]that combines the best of op-tical circuit switching and optical packet switch…     

Dynamic burst discarding scheme for deflection routing in optical burst switching networks

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.     

基于BD技术的光突发竞争解决方案

将BD法结合波长资源预留算法提出一种新的突发竞争解决方案。该方案通过在突发竞争时牺牲低优先级突发的传输完整性,以保证高优先级的业务的丢失率,同时降低了传输时延。最后对基于BD法的突发竞争解决方案进行了网络仿真,并和传统的传统基于额外偏置时间(JET)的方案比较,结果表明在平均数据丢失率相当的前提下,改进的BD法能有效的降低突发包的端对端时延。     

A novel contention solution strategy based on priority for optical burst switching networks

A fundamental issue in optical burst switching (OBS) networks is to solve the burst contention for the core node. In this paper, a novel priority-based contention solution strategy for OBS networks is proposed. When the contention occurs, the burst priority is considered firstly, and then the burst segmentation method is used for the low priority bursts in this strategy. Ensuring the integrity of high priority bursts, part of the segmented bursts can be transmitted to the destination node via combining wavelength conversion and optical buffer method. Simulation results show that the proposed scheme not only ensures the integrity of high priority bursts, but also reduces the packet loss rate of the low priority bursts maximally, so that it can support good quality of service (QoS) for the network.     

A distributed backoff-channel deflection algorithm with load balancing for optical burst switching networks

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.     

Burst scheduling for differentiated services in optical burst switching WDM networks

Optical burst switching (OBS) is one of the most important switching technologies for future optical wavelength division multiplexing (WDM) networks and the Internet. The model of differentiated services has been proposed to support quality of service (QoS) in the IP‐based Internet. It is also very important to have differentiated service support in OBS networks. When the burst scheduling in an OBS network is set up appropriately, network can support differentiated services. In this paper, we proposed a new burst scheduling scheme, called differentiated scheduling with identical priority offset time (DSIPO). In DSIPO, the same priority offset time is used for all the bursts destined to the same edge node regardless of their priorities. Differentiated services in terms of burst loss probability are achieved by processing the control packets of higher priority class bursts, thus reserving resources for their data bursts, more promptly upon their arrival than those of lower priority class bursts. Each intermediate (core) node can adjust the burst loss probabilities of various burst classes by choosing its own differentiated processing delay value for each priority class or its own differentiated processing delay difference value between any pair of adjacent priority classes. We model and analyse DSIPO in terms of the burst loss probability for each priority class with simulation validation. The performance of DISPO is evaluated by simulation. Copyright © 2004 John Wiley & Sons, Ltd.     

A Study on Deflection Routing in Optical Burst-Switched Networks

A major concern in optical burst-switched networks is contention,which occurs when multiple bursts contend for the same link. While a deflection routing protocol is proposed as one of the contention resolution techniques,there has been no appropriate deflection routing algorithm to find an alternate route. In this paper, we formulate a deflection routing problem based on the burst blocking rate resulting from resource contention in an optical burst-switched network. This algorithm minimizes the contention on the alternate path with the minimum distance. Furthermore, in this paper, we develop an analytical model for the deflection routing time when deflection routing is performed to resolve contention. In this model, we investigate the expected deflection routing time considering that the burst could be dropped even with deflection routing due to another contention on the alternate path. Simulations are conducted to show that there is an improvement in terms of burst loss rate and network throughput.