OBS网络中的多BHP延迟调度算法

光突发交换 (Optical Burst Switching,OBS) 是下一代光网络中的有效核心交换技术之一。在OBS网络中,核心节点的调度方案是影响网络交换性能的重要因素。如何有效地对突发分组 (Burst) 进行合理调度,以减少丢包率正是关键问题所在。该文提出了一种多控制分组 (Burst Header Packet,BHP) 延迟调度算法,对于一个收集周期内到达的多个BHP所对应的突发数据,按照一定的方式对它们进行集中调度,实现对已预约资源的更改,使调度结果得到了优化。该算法根据不同的网络应用,可细化为4种具体的算法实现,以适用于不同的应用场景。仿真结果表明,该文提出的调度算法和已有算法相比,能够优化对突发分组的调度,提高对信道资源的有效使用,从而降低交换网络的丢包率。     

OBS网络数据信道调度算法性能比较

在光突发交换OBS（Optical Burst Switching）网络的数据信道调度算法的性能分析中，本论文以M／M／k／k模型为基础，给出了各种典型算法的理论性能模型，分别对这些算法从理论性能上进行分析与比较，介绍了LAUC、LAUC-VF和ODBR三种算法，并对ODBR进行了详细的流程说明，通过对比时间复杂度、和丢包率性能可知，ODBR算法具有类似于LAUC的低复杂度和LAUC-VF的低丢包率。     

OBS网络数据信道调度算法性能比较

光突发交换(OBS)网络中数据信道的调度算法是提高OBS网络性能的关键技术之一.文章给出了LAUC、LAUC-VF、BR和LAUC-VF-BS等几种数据信道调度算法的基本原理,通过仿真对这些调度算法进行了性能比较,结果表明LAUC-VF-BS算法能够更有效地降低突发丢失率,提高信道利用率,从而改善网络性能.     

OBS网络中的主动拥塞控制策略研究及性能分析

根据光突发交换(Optical Burst Switching--OBS)网络的结构和特点,分析了其核心节点在数据信道调度发生拥塞时拥塞控制策略的缺陷,提出了OBS网络中一种主动拥塞控制策略(ACC),详细讨论了该策略的具体实现过程.通过仿真验证,在OBS网络中采用该算法能减少突发数据包的丢包率,从而达到改善整个OBS网络性能的目的.     

光突发交换网络数据信道调度算法的研究

在OBS网络中,核心节点的调度算法是影响网络交换性能的重要因素。如何有效地对数据突发(Data Burst)分组进行合理调度,提高信道利用率,减少丢包率是关键问题所在。在讨论了几种数据信道调度算法的基础上提出了一种BHP收集调度算法,该算法在一个收集周期内对到达的多个BHP所对应的突发数据,按照一定的方式对它们进行集中调度,从而达到合理调度。仿真结果表明BHP收集调度算法比其他几种算法的突发丢失率性能都要好。     

基于阈值的光突发交换网络数据信道调度算法

光突发交换(OBS)是实现下一代光互联网中的一种极具前景的方案。该文提出了一种基于阈值的OBS网络数据信道调度算法,对于长度大于阈值的光突发数据包采用LAUC算法进行调度,对于长度小于阈值的光突发数据包采用LAUC-VF算法进行调度。仿真结果表明,该算法在调度时间方面与已有的LAUC算法很接近;而在光突发数据包丢失率性能方面要优于LAUC-VF算法。     

基于控制分组收集的数据信道调度算法

在OBS网络中,核心节点的调度算法是影响网络交换性能的重要因素.如何有效地对数据突发(Data Burst)分组进行合理调度,提高信道利用率,减少丢包率是关键问题所在.在讨论了两种数据信道调度算法的基础上提出了一种BHP收集调度算法,该算法在一个收集周期内对到达的多个BHP所对应的突发数据进行集中调度,从而达到合理调度.仿真结果表明BHP收集调度算法比其他两种算法的突发丢失率性能都要好.     

两种新型的OBS网络数据信道调度算法

光突发交换(OBS)是实现IP/DWDM网络的一种极有前途的方案。该文提出了两种新型的OBS网络数据信道调度算法:最少波长转换(MWCT)调度算法和区分服务(SD)调度算法。通过仿真,证明了这两种算法在减少OBS网络中的光信号的波长转换和保证高优先级数据可靠传输方面比已有的FF和LAUC调度算法具有更好的性能。     

光突发交换网络中突发组装办案研究

光突发交换（Optcal Burst Switching.OBS）被认为是在下一代光网络中起到至关重要作用的一种交换技术。边缘节点处突发包的组装作为业务接入OBS网络的第一步,是OBS研究的关键课题之一。 该文重点阐述了几种常用的突发组装方案：基于突发长度组装方案、基于组装时间组装方案、混合组装方案及自适应组装方案,并分析了它们的性能和优缺点。最后指出综合考虑网络业务流量、边缘节点的处理速度和信道带宽等因素的更加有效的突发组装算法是重点研究的内容。     

时隙光突发交换网络调度问题研究

光突发交换（OBS）是构造下一代全光网络的潜在技术之一,但存在网络参数设计困难和阻塞性能有限等问题。文章介绍了一种新型基于时隙的OBS网络体系,简要阐明了其各部分功能,并将其与常规OBS网络进行了对比。提出了网络节点中关键的时隙分配与调度问题,并给出相应的在线调度策略,仿真结果表明BF算法性能较优。     

在OBS网络中改进TCP性能的高效机制

Transmission Control Protocol (TCP) performance over Optical Burst Switching (OBS) is experimentally investigated on an OBS network testbed, concluding that burst losses will lead to a significant drop in the available TCP bandwidth. Two mechanisms are introduced to improve TCP performance. One is concerning the burst assembly optimization and another is based on the novel assembly and scheduling mechanism to reduce the burst losses.     

A NEW SCHEDULING ALGORITHM TO PROVIDE PROPORTIONAL QOS IN OPTICAL BURST SWITCHING NETWORKS

A new scheduling algorithm, which aims to provide proportional and controllable QoS （Quality of Service） in terms of burst loss probability for OBS （Optical Burst Switching） networks, is proposed on the basis of a survey of QoS schemes in current OBS networks. With simulations, performance analysis and comparisons are carried out in detail. The results show that, in the proposed scheme, burst loss probabilities are proportional to the given factors and the control of QoS performance can be achieved with better performance. This scheme will be beneficial to the OBS network management and the tariffpolicy making.     

Using multiple per egress burstifiers for enhanced TCP performance in OBS networks

Burst assembly mechanism is one of the fundamental factors that determine the performance of an optical burst switching (OBS) network. In this paper, we investigate the influence of the number of burstifiers on TCP performance for an OBS network. The goodput of TCP flows between an ingress node and an egress node traveling through an optical network is studied as the number of assembly buffers per destination varies. First, the burst-length independent losses resulting from the contention in the core OBS network using a non-void-filling burst scheduling algorithm, e.g., Horizon, are studied. Then, burst-length dependent losses arising as a result of void-filling scheduling algorithms, e.g., LAUC-VF, are studied for two different TCP flow models: FTP-type long-lived flows and variable size short-lived flows. Simulation results show that for both types of scheduling algorithms, both types of TCP flow models, and different TCP versions (Reno, Newreno and Sack), TCP goodput increases as the number of burst assemblers per egress node is increased for an OBS network employing timer-based assembly algorithm. The improvement from one burstifier to moderate number of burst assemblers is significant (15–50% depending on the burst loss probability, per-hop processing delay, and the TCP version), but the goodput difference between moderate number of buffers and per-flow aggregation is relatively small, implying that an OBS edge switch should use moderate number of assembly buffers per destination for enhanced TCP performance without substantially increasing the hardware complexity.

基于蚁群优化算法的网格OBS任务调度研究

本文采用蚁群优化算法（ACO）设计了基于光突发交换（OBS）网络的网格任务调度。该算法既考虑了网格用户的需求,同时结合了网格中计算资源和网络资源的分配。设计了基于ACO算法的两种通路选择规则,并在一个集中式的网格OBS仿真平台上对这两种选路规则的性能进行了对比分析。     

OBS网络数据信道调度算法性能比较与分析

光突发交换(0BS)网络中的数据信道调度算法是提高0BS网络性能的关键技术之一.首先介绍和分析了LAUC、LAUC-VF和0DBR基本原理和性能,结合国内外最新研究成果,介绍了四种支持QoS的数据信道调度算法,最后对其应用场合做出总结.     

Performance evaluation of high speed TCP over optical burst switching networks

Study of TCP performance over OBS networks has been an important problem of research lately and it was found that due to the congestion control mechanism of TCP and the inherent bursty losses in the Optical Burst Switching (OBS) network, the throughput of TCP connections degrade. On the other hand, High Speed TCP (HSTCP) was proposed as an alternative to the use of TCP in high bandwidth-delay product networks. HSTCP aggressively increases the congestion window used in TCP, when the available bandwidth is high and decreases the window cautiously in response to a congestion event. In this work, we make a thorough simulation study of HSTCP over OBS networks. While the earlier works in the literature used a linear chain of nodes as the network topology for the simulation, we use the popular 14-node NSFNET topology that represents an arbitrary mesh network in our study. We also study the performance of HSTCP over OBS for different bandwidths of access networks. We use two different cases for simulations where in the first HSTCP connections are routed on disjoint paths while in the second they contend for resources in the network links. These cases of simulations along with the mesh topology help us clearly distinguish between the congestion and contention losses in the OBS network and their effect on HSTCP throughput. For completeness of study, we also simulate TCP traffic over OBS networks in all these cases and compare its throughput with that of HSTCP. We observe that irrespective of the access network bandwidth and the burst loss rate in the network, HSTCP outperforms TCP in terms of the throughput and robustness against multiple burst losses up to the expected theoretical burst loss probability of 10⁻³.     

Reducing the impact of false time out on TCP performance in TCP over OBS networks

Random burst contention losses plague the performance of Optical Burst Switched networks. Such random losses occur even in low load network condition due to the analogous behavior of wavelength and routing algorithms. Since a burst may carry many packets from many TCP sources, its loss can trick the TCP sources to conclude/infer that the underlying (optical) network is congested. Accordingly, TCP reduces sending rate and switches over to either fast retransmission or slow start state. This reaction by TCP is uncalled-for in TCP over OBS networks as the optical network may not be congested during such random burst contention losses. Hence, these losses are to be addressed in order to improve the performance of TCP over OBS networks. Existing work in the literature achieves the above laid objective at the cost of violating the semantics of OBS and/or TCP. Several other works make delay inducing assumptions. In our work, we introduce a new layer, called Adaptation Layer, in between TCP and OBS layers. This layer uses burst retransmission to mitigate the effect of burst loss due to contention on TCP by leveraging the difference between round trip times of TCP and OBS. We achieve our objective with the added advantage of maintaining the semantics of the layers intact.     

多态OBS网络中基于信道整理的调度算法

多态光突发交换(POBS)网络能够有效地支持多种同步和异步业务的传输,但是其异步突发业务的丢失率较相同网络环境下的传统OBS丢失率要高。如何有效地对多态OBS中异步突发进行合理调度,是降低异步突发丢失率的关键所在。提出了一种基于信道整理的调度算法,将已经成功调度的突发重新调度到最合适的数据信道,使得信道资源得到充分的利用,从而降低了异步突发的丢失率。仿真结果表明,该算法能很好地降低多态OBS网络中异步突发的丢失率。