一种基于门限的光突发交换受限偏射路由算法

提出了一种基于突发丢失门限的条件偏射路由算法（LDFD），该算法采用丢弃少量偏射的高优先级突发来保证偏射路由上较低优先级非偏射突发的服务质量（QoS）。当偏射的高优先级突发到达核心节点而该节点没有空闲数据信道时，就启用定义的偏射条件检测函数来判断是丢弃该突发还是允许其抢占非偏射的低优先级突发的资源，从而减少偏射突发与偏射路由上原有突发的竞争。仿真表明，该算法可以很好地控制偏射突发对偏射路由上正常流量的影响，并有效地提高整个网络的突发丢失性能。     

基于部分冗余合并的OBS网络冲突解决机制

为了降低光突发交换网络中突发包的丢失率、减小网络延时、提高网络信道的利用率,采用了一种新型考虑优先级的基于冗余合并的突发包冲突解决机制。算法增加了回退信道作为保护信道,根据业务的优先级对冲突的突发包进行分段,使无法顺利传送的突发包碎片进入到回退信道;同时,考虑到网络中存在着很多短小而难以利用的信道资源,算法将回退信道里的突发包碎片进行多次克隆,多个克隆碎片和由上游节点到来的突发包合并成粒度可变的虚拟突发包发送,克隆碎片的优先级定义为最低,以保证不抢占正常突发包的信道资源。结果表明,相比以往的冲突解决算法,此算法具有较低的丢包率、相对小的延时率和优越的信道利用率。     

Dropping Policy with Burst Retransmission to Improve the Throughput of TCP Over Optical Burst-switched Networks

A major concern in optical burst-switched (OBS) networks is contention, which occurs when more than one bursts contend for the same data channel at the same time. Due to the bufferless nature of OBS networks, these contentions randomly occur at any degree of congestion in the network. When contention occurs at any core node, the core node drops bursts according to its dropping policy. Burst loss in OBS networks significantly degrades the throughput of TCP sources in the local access networks because current TCP congestion control mechanisms perform a slow start phase mainly due to contention rather than heavy congestion. However, there has not been much study about the impact of burst loss on the performance of TCP over OBS networks. To improve TCP throughput over OBS networks, we first introduce a dropping policy with burst retransmission that retransmits the bursts dropped due to contention, at the ingress node. Then, we extend the dropping policy with burst retransmission to drop a burst that has experienced fewer retransmissions in the event of contention at a core node in order to reduce the number of events that a TCP source enters the slow start phase due to contention. In addition, we propose to limit the number of retransmissions of each burst to prevent severe congestion. For the performance evaluation of the proposed schemes, we provide an analytic throughput model of TCP over OBS networks. Through simulations as well as analytic modeling, it is shown that the proposed dropping policy with burst retransmission can improve TCP throughput over OBS networks compared with an existing dropping policy without burst retransmission.     

OBS网络中基于优先级的先分割后缓存冲突解决方法

为了有效地降低突发包的丢失率和保证OBS网络中不同优先级业务的服务质量,提出了一种基于优先级的先分割后缓存冲突解决方法。该方法通过在多波长信道系统的输出数据信道上设置光纤延迟线组来缓存被分割的冲突突发包。当冲突发生时,首先基于突发包的优先级和处理完毕时间进行"竞争突发包头部分割或者原突发包尾部分割"处理;无冲突部分进行交换或者直接在事先预留的输出数据信道上处理,冲突部分的分割突发包进行光缓存。仿真结果表明,多波长信道系统中,高优先级突发包的丢失率低于低优先级突发包的丢失率。同时该方法在一定程度上可以有效地减少端到端的传输时延和整个网络的丢包率,从而提高整个OBS网络的性能。     

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

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

Contention resolution considering multicast traffic in optically burst-switched WDM networks

This paper proposes a contention resolution scheme considering multicast traffic in optical burst switching (OBS) networks. In OBS networks, for unicast bursts, contention can be avoided by deflection routing. However, deflection routing cannot be applied to multicast bursts because multicast bursts are transmitted along light-trees which are fixed, tree-shaped routes. Therefore, the loss probability of multicast bursts is generally high. To resolve this problem, the proposed scheme introduces an ingenious offset time assignment strategy which completely avoids contention of multicast bursts due to transmissions of unicast bursts by strategically assigning additional offset times. Furthermore, in the proposed scheme, unicast bursts avoid contention with deflection routing. Through simulation experiments, we show that the proposed scheme improves the loss probabilities of both of unicast bursts and multicast bursts.     

OBS网络中一种基于突发包优先级分割的可控重传方案

在光突发交换(OBS)网络中,突发包会由于竞争OBS核心节点输出端口的有限波长资源而发生冲突。突发包重传能够在一定程度上减少由于突发包在核心节点冲突而导致的数据损失,但重传次数的增加可能会加重网络负荷,反而增加数据丢失率。并且,在多业务存在的OBS网络中,重传方案需要能够实现区分服务以保证网络的服务质量(QoS)。据此,本文提出一种基于突发包优先级分割的可控重传方案,在实施优先级分割的同时,根据网络负荷赋予每次重传不同的概率,并对重传次数加以控制。最后,仿真分析了路径阻塞率和不同优先级业务的字节丢失率(ByLP,byte loss probability)性能。     

A new composite assembly mechanism for supporting QoS in OBS networks

To provide the differential quality of service（QoS）for different classes of packets and reduce the packet loss probabil ity（PLP）,a novel priority-based composite assembly scheme for optical burst switching（OBS）networks is proposed The low and high packet classes are aggregated into a single burst simultaneously,and the highest-priority packets ar placed in the middle,while the low-priority packets are at the tail and head of the burst.The priority is lowered gradu ally from the middle to the ends.Simulation results demonstrate that the proposed assembly strategy not only guaran tees the integrity of the high-priority bursts,but also significantly reduces the average end-to-end delay of the burst and the PLP of network.So it can adapt to the flexible network with QoS requirement.     

基于窗口的光突发交换调度算法

针对光突发交换网(OBS)中的资源竞争和QoS支持等问题，提出了一种新型的基于窗口的调度算法。该算法利用边缘节点的电缓存，对调度窗口中的突发数据包进行批量BORA调度，可以有效地降低网络中发生资源竞争的概率；同时调度窗口中的优先级策略还可以进一步增强QoS。网络仿真结果表明，通过选择合适的调度窗口和最大允许时延，该调度算法在0．8的网络负载下使得高优先级突发数据包的阻塞率下降一个量级，信道利用率提高3．5％。     

Node dimensioning in optical burst switching networks

Network dimensioning should be progressed for pursuing the ultimate efficiency of network system resources in order to satisfy target performance. This article studies node dimensioning as a method of resource optimization in optical burst switching (OBS) networks. OBS is a new switching technology for pursuing bufferless transparent optical networks by sending control packets prior to data burst in order to provision resources for the burst. However, the basic assumption of a bufferless node implies burst contention at a core node when more than two bursts attempt to move forward the same output simultaneously. Thus, burst contention is a critical performance metric and this article takes it into account as a constraint on node dimensioning and target performance. In this article, we first present node dimensioning issues for OBS networks. Two constraints from the transport plane and the control plane which affect burst contention are then introduced. The effect of the burst assembly process on node dimensioning is also presented. From numerical analysis, the optimal number of wavelengths in a link, which provides the lowest blocking probability, is obtained to suggest a guideline for node dimensioning.     

OBS考虑优先级的突发包碎片可控合并重传算法

为了降低光突发交换网络中突发包的丢失率、降低网络路径的阻塞率、减小突发包冲突的概率,提出了考虑优先级的突发包碎片可控合并重传算法。当网络中数据通信发生冲突时,该算法能根据优先级进行突发包的分片,核心节点将这一信息反馈给边缘节点,边缘节点根据突发碎片的优先级以一定的概率重传被丢弃的突发包分片;同时,针对由于多次重传导致的突发包碎片过多的问题,该算法还按照突发包碎片的优先级顺序进行碎片重组,大大降低了网络的阻塞率。结果表明,相比以往的冲突解决算法,此算法在网络业务繁忙时的数据丢比特率和网络阻塞率方面的改善作用有比较明显的优势。这一结果对光突发交换网络的网络的性能改善方面是有帮助的。     

Dynamic wavelength selection and delayed burst assignment schemes for Optical Burst Switching networks

Optical Burst Switching (OBS) has been proposed as a promising switching technology for the next generation of optical transport networks. In this paper, we address the issue of how to provide proportional differentiated services in OBS networks. Firstly, a Dynamic Wavelength Selection (DWS) scheme is introduced to provide proportional differentiated services in bufferless OBS networks by dynamically assigning more and longer periods of wavelengths to high priority classes. This scheme can also utilize wavelengths efficiently because the wavelengths are shared among different classes. Next, a Delayed Burst Assignment (DBA) scheme is introduced, by which bursts of the high priority class are given a higher probability for reserving wavelengths by scheduling the bursts of the low priority class with a delay to provide quality of service (QoS) in OBS networks. The integration of these two schemes provides proportional differentiated services and improves the burst loss performance by giving the burst head packet (BHP) two opportunities of scheduling its data burst (DB).     

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 novel transfer mode to reduce burst loss rate for optical burst switching networks

A crucial issue in optical burst switching (OBS) networks is burst loss caused by resource contention. As a result, many methods are currently being proposed to reduce burst loss rate. These methods can be summed up into two categories: burst scheduling algorithms and contention resolutions. Both categories of methods can reduce burst loss rate to a certain degree. However, to make OBS to become a viable solution, the burst loss rate needs to be further reduced. Furthermore, almost all methods ignore the fact that an unfortunately scheduled, locally generated single-hop burst could block a number of future incoming transit bursts, though the burst just travels to its next downstream node. This phenomenon becomes more evident when links are heavily loaded in mesh OBS networks. To eliminate contention caused by single-hop traffic completely, this paper proposes a novel transfer mode called packet calking by differentiating between single-hop traffic from multihop traffic for OBS networks. An analysis model is developed to evaluate the performance of packet calking. Theoretical results are validated through extensive simulations in both ring and mesh networks. These results show that packet calking outperforms the transfer mode without packet calking in terms of burst loss rate and link utilization.     

Analysis of Burst Segmentation in Optical Burst Switching Networks Considering Path Correlation

One of the key problems hindering the realization of optical burst switching (OBS) technology in the core networks is the losses due to contention among the bursts at the core nodes. Such contention losses do not necessarily indicate a situation of congestion. Burst segmentation is an effective contention resolution technique used to reduce the number of packets lost due to the burst losses. In this work, we propose a method of analyzing the benefit of burst segmentation considering the effect of correlation in traffic across multiple paths. Starting with the cumulative distribution function (cdf) of the length of the bursts at the ingress node destined to a particular egress node, we evaluate the cdf of the burst length at each node along the path considering the probability of segmentation and the traffic on the adjoining paths. Comparing the burst length at the egress node with that at the ingress node, we evaluate the byte loss probability (ByLP) along the path and also the network-wide average ByLP. The proposed analytical framework studies the impact of segmentation on packet loss rate considering the effect of the length of a path, the number of paths adjoining a path (extent of path correlation), the effect of load on a path and other correlated paths, and the burst assembly algorithm. Analytical and simulation results in this work show that the proposed method of analysis gives a good understanding of the influence of aforementioned factors on the benefit of segmentation in OBS networks.      

Delay-on-Demand: A Signaling Protocol to Reduce Blocking Probability in Optical Burst-Switching Networks

Optical burst switching (OBS) is emerging as one promising switching paradigm for the next generation optical networks. To support multiple services in burst-switching networks, the OBS paradigm should support some quality-of-service (QoS) provisioning. A major design issue in such networks is to reduce the blocking probability of the bursts arising due to resource contention at the intermediate core router. In this paper, we propose a signaling protocol which we call ‘Delay-on-Demand’ (OBS-DoD), to reduce blocking probability and support QoS in optical burst-switching networks. The proposed scheme guarantees that at least one of the bursts succeeds depending on its priority, propagation delay from the ingress router, and the burst-size when contention occurs at the core router. For this, we use a control packet to delay, in case of a contention, the transmission of bursts at the ingress router. We compare the performance of our proposal, by simulation, with an earlier proposed scheme, and show that the proposed OBS-DoD outperforms the earlier scheme in reducing the blocking probability. For simulation, we generated bursty traffic using an M/Pareto distribution.     

A burst segmentation-deflection routing contention resolution mechanism in OBS networks

One of the key problems to hinder the realization of optical burst switching(OBS) technology in the core networks is the losses due to the contention among the bursts at the core nodes.Burst segmentation is an effective contention resolution technique used to reduce the number of packets lost due to the burst losses.In our work,a burst segmentation-deflection routing contention resolution mechanism in OBS networks is proposed.When the contention occurs,the bursts are segmented according to the lowest packet loss probability of networks firstly,and then the segmented burst is deflected on the optimum routing.An analytical model is proposed to evaluate the contention resolution mechanism.Simulation results show that high-priority bursts have significantly lower packet loss probability and transmission delay than the low-priority.And the performance of the burst lengths,in which the number of segments per burst distributes geometrically,is more effective than that of the deterministically distributed burst lengths.     

OBS网络中的新型竞争解决方案

提出一种解决光突发交换(OBS)网络节点中突发数据包冲突的方案.发生冲突时,在OBS层重传被丢弃突发数据包,然后给出评估这种重传机制丢包率的方法,并与偏射路由策略的性能进行比较,结果表明突发重传机制显著改善了丢包率.可以很好地实现服务质量(QoS)机制.     

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

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

A framework of prioritized burst segmentation supporting controlled retransmission in OBS networks

In optical burst switching (OBS) networks, burst contentions in OBS core nodes may cause data loss. To reduce data loss, retransmission scheme has been applied. However, uncontrolled retransmission may increase network load significantly and data loss probability defeating the retransmission purpose. In addition, in a priority traffic existing OBS network, OBS nodes may apply different retransmission mechanisms to priorities bursts for quality-of-service (QoS) support. This study has developed a controlled retransmission scheme for prioritized burst segmentation to support QoS in OBS networks. Unlike previous works in the literature, we have set a different value to retransmission probability at each contention and propose a retransmission analytical model for burst segmentation contention resolution scheme. In addition, we have applied the proposed retransmission scheme to the prioritized burst segmentation for QoS support. We have taken into account the load at each link due to both fresh and retransmitted traffic, and have calculated the path blocking probability and byte loss probability (ByLP) for high-priority and low-priority burst to evaluate network performance. An extensive simulation has been proposed to validate our analytical model.