OBS网络中一种新型的避免冲突方法

突发包冲突在无光缓存能力的光突发交换(OBS)网络中是一个尚未解决的问题.在对JET协议进行改进的基础上,文章首次提出了一种新型的突发包冲突解决方案,分析了其可行性及相对传统算法的优势.     

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考虑优先级的突发包碎片可控合并重传算法

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

Optimized Combination of Converter Pools and FDL Buffers for Contention Resolution in Optical Burst Switching

Optical burst switching (OBS) has attracted interest as a transport network architecture for the future optical Internet. As OBS relies on statistical multiplexing efficient contention resolution is a key issue in order to achieve a low burst loss probability. First, this paper discusses options and key design parameters for contention resolution in OBS. Then, it evaluates the performance of OBS nodes which employ shared wavelength converter pools and simple fiber delay line (FDL) buffers. Finally, optimized strategies for the order of probing a wavelength converter pool and an FDL buffer for contention resolution are presented and compared. It is shown that these strategies can be used to optimize performance for a given, for example, minimal cost, dimensioning of the wavelength converter pool and the FDL buffer.     

Traffic statistics and performance evaluation in optical burst switched networks

Optical burst switching (OBS) is a promising switching technology to exploit the potential benefits of optical communication and, at the same time, support statistical multiplexing of data traffic at a fine granularity. To quantify its benefits, the paper describes several typical burst assembly algorithms and studies their impact on the assembled burst traffic characteristics as well as the performance of TCP traffic. Also described is a proactive burst scheduling algorithm, called burst overlap reduction algorithm (BORA), which schedules locally assembled bursts in such a way as to reduce burst contention at downstream nodes in OBS networks. Furthermore, to provide analytical insights into performance evaluation of OBS networks, a burst loss model at an OBS node and its extension to different reservation protocols are presented.     

An introduction to optical burst switching

Optical burst switching is a promising solution for all-optical WDM networks. It combines the benefits of optical packet switching and wavelength routing while taking into account the limitations of the current all-optical technology. In OBS, the user data is collected at the edge of the network, sorted based on a destination address, and grouped into variable sized bursts. Prior to transmitting a burst, a control packet is created and immediately sent toward the destination in order to set up a bufferless optical path for its corresponding burst. After an offset delay time, the data burst itself is transmitted without waiting for a positive acknowledgment from the destination node. The OBS framework has been widely studied in the past few years because it achieves high traffic throughput and high resource utilization. However, despite the OBS trademarks such as dynamic connection setup or strong separation between data and control, there are many differences in the published OBS architectures. In this article we summarize in a systematic way the main OBS design parameters and the solutions that have been proposed in the open literature.     

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 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.     

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

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

光突发交换网中的智能组包研究

光突发交换(OBS)相对传统的电路交换方式具有更高的传输效率和更短的网络时延,而相对于未来网络的发展趋势光分组交换,光突发交换具备更现实的可行性.在OBS中,突发汇聚是一个很关键的技术,它对OBS网络的性能有着重要的影响,在本文中,我们对突发汇聚机制进行了较深入的研究,并提出了一种新的突发汇聚算法,它对抑制网络流量的自相似性,提高突发传输效率和避免在不同节点由于突发同步所引起的带宽资源竞争都有较好的结果.     

光突发交换网络新型偏射路由方案研究

光突发交换(OBS)被认为是下一代光网络中的有效核心交换技术之一,设计OBS网络的最初目的之一是减小突发包丢失率.解决突发竞争的方法主要包括光缓存、波长变换、偏射路由和突发分段.提出一种改进偏射路由方案,并建立了数学模型,对改进方案的性能进行了仿真分析,结果表明改进方案能更好的提高网络整体性能.     

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

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

A tree-based slot allocation algorithm for loss-free slotted OBS networks

Optical burst switching (OBS) is regarded as one of the most promising switching technologies for next generation optical networks. However, the data burst contention problem is still unresolved thoroughly even though slotted OBS (SOBS) is studied as a new paradigm reducing the blocking rate. In this article, we propose a tree-based slot allocation (TSA) algorithm for loss-free SOBS networks, where the TSA algorithm originally avoids contention of the time-slots by reserving the time-slots with different time-slot positions for the source nodes, respectively. In order to manage the time-slots efficiently, we also propose an OBS superframe, which is a cyclic period and consists of multiple time-slots transmitted by the source nodes toward the same incoming port of a destination node. In addition, we attempt to optimize multiplexing of the OBS superframes to reduce wavelength consumption. On the other hand, when incoming traffic is beyond expectation, a source node may need more time-slots to prevent packet loss because of buffer overflow. For reallocation of the time-slots, we propose a flow control scheme managing some number of shared time-slots, where a control node adaptively allocates (or redeems) the time-slots to (or from) source nodes by utilizing the shared time-slots based on fluctuating traffic condition. Simulation results show that the blocking rate of the proposed TSA–OBS scheme is zero with acceptable queueing delay at moderate traffic offered loads. In addition, multiplexing optimization simulated in the 14-node NSFNET achieves a 63% reduction of wavelength consumption. Moreover, the proposed flow control scheme assisting the TSA algorithm maintains a target upper-bound of queueing delay at the source node, so that packet loss caused by buffer overflow is prevented.     

光突发交换网络中冲突解决方法研究

光突发交换（OBS）网络被认为是下一代光因特网的典型代表,其中,光突发数据包在节点的竞争问题是OBS网络中需要解决的关键问题之一。该文重点研究了突发数据包之间因争夺链路资源而导致冲突的四种竞争解决方案：波长转换、光缓存、偏射路由和突发包分割,并分析了它们的优缺点。在此基础上,提出了OBS网络中冲突解决方法的发展趋势——...     

OBS网络核心节点冲突性能分析

对光突发交换(OBS)核心节点中突发数据包的冲突问题进行了性能分析,比以往同类研究改进之处在于,不仅给出了包阻塞率情况,还给出了OBS系统数据通过能力以及系统被占用均值等性能,结果对0BS冲突领域的研究进行了有益的补充和完善.     

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).     

Pre‐reservation of Resources and Controlled Loops for Contention Resolution in OBS Networks

A new scheme to alleviate contention in optical burst switching networks is proposed. It consists of preventively reserving resources in a node, to be used if resources are busy on the next hop node. The burst is sent back to the preceding node and then resent forward. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution based on deflection routing.     

基于连通支配集的OBS网络多粒度业务疏导机制

针对目前光网络核心节点的交换速度无法匹配单波长的传输速度难以满足大量的业务请求而拥塞,为了提高核心节点交换效率使其具有大容量数据交换的能力,本文提出了一种基于连通支配集(CDS)的光突发交换(OBS)网络稀疏节点疏导机制(CDS-TG).主要思路是:首先在OBS核心网络中根据改进的连通支配集算法选取疏导节点;其次在疏导...     

A Data Burst Assembly Algorithm in Optical Burst Switching Networks

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self‐similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.