OBS网络竞争解决机制研究

作为下一代互联网关键技术之一的光突发交换(OBS)技术已受业界的广泛关注.结合国内外最新的研究动态,探讨了解决OBS网中突发包竞争的解决方案,并对这些技术的优缺点进行了分析比较.     

OBS网络信道分级竞争解决方法研究

通过分析光突发交换网络突发数据包产生竞争的原因和现有的几种解决机制,提出了信道分级竞争解决方法,并对其性能进行仿真研究,得出了不同信道配置下突发数据包丢包率和平均处理时延曲线.结果表明,该方法可以有效的降低数据包丢失率,支持不同的业务需求,是一种实用的方案.     

OBS网络中竞争解决机制研究

光突发交换是近几年出现的一种很有前途的新型光交换技术.突发包之间的竞争导致数据的丢失是光突发交换网络所面临的一个关键问题.文章综述了现有几种解决突发包竞争的机制,讨论了它们的优缺点,尤其对突发包分段丢弃机制进行了详细分析,提出了改进方案,并对今后OBS网络中可能采用的竞争解决机制表达了作者的观点.     

OBS网络中冲突解决方法研究

在OBS网络中,当两个或多个突发包要求在同一时刻,同一输出端口的同一波长上预留资源时．就会产生突发数据包的资源竞争。如何解决资源竞争问题是OBS技术能否最终走向实际应用的关键技术之一。文章首先介绍OBS的基本原理、网络结构、OBS网络的资源预约机制、边缘路由器的封装机制和资源调度机制,接着研究解决OBS网络中突发数据包之间争夺链路资源问题的竞争解决机制,随后详细的给出四种竞争解决方案：光缓存、波长转换、偏射路由和突发分段丢弃,并分析了它们的性能。在此基础上,文章最后提出了各种资源竞争解决方案相结合的联合解决机制的思想。     

OBS基于回退和信道分级的冲突解决算法

解决突发包的冲突问题是光突发交换网络的关键技术之一。为了降低突发包冲突时丢包率,提出了一种新型的基于信道分级和回退机制的冲突解决算法,该算法考虑突发业务优先级,将信道分成两个级别,有区别地对待高低优先级两种业务类型,并且增加了一部分回退信道作为保护和重发冲突数据包,能够有效地保证高优先级业务的传输可靠性。结果表明,当冲突发生时,网络能根据此时高低优先级业务量的比重配比,自适应地调节两个级别信道的数量,兼顾到低优先级业务的低丢包率,保证了较低的延时率。此算法相比以往的冲突解决算法具有较低的丢包率和相对小的延时率。     

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

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

一种基于突发分片技术的OBS竞争解决机制

介绍了基于光突发分片技术的竞争解决机制,着重对采用光突发分片技术与数据信道调度算法相结合的竞争解决机制进行了研究.通过建立相应的光突发交换网络仿真模型,对结合后的竞争解决方法与其他方法进行了性能比较.结果表明,将光突发分片技术与数据信道调度算法相结合能够有效地降低网络阻塞率,提高信道利用率,从而改善网络性能.     

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

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

突发分片技术在OBS网络中的应用及其性能分析

对基于光突发分片技术的光突发竞争解决机制进行了研究,重点分析了基于突发分片技术的光突发交换网络性能,理论分析和仿真结果均表明,相比于恰量时间模型,突发分片技术具有低阻塞率和高信道利用率等优点,能够有效地减少网络数据丢失。     

基于偏转路由与COCP的OBS网络竞争解决机制

主要研究解决光突发交换(OBS)网中突发数据包之间争夺链路资源问题的竞争解决机制.从时间域、波长域和空间域上探讨了解决冲突的方法,并给出了一种采用偏转路由机制和基于共享功能波长转换器的冲突部分转换方法(COCP)相结合的竞争解决方法.     

解决光突发交换竞争的新模型

针对光突发中的竞争问题，提出了一种分割反馈模型，相应地建立了数学分析模型，并进行了仿真与性能分析。结果表明这一模型是解决光突发交换中竞争问题的一个较佳方案。     

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

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

光突发交换网络中冲突性能分析

光突发交换(OBS)被认为是下一代光纤通信网络的典型代表.文章研究了在OBS核心节点中突发数据包由于竞争相同的输出数据信道而发生的冲突问题,对冲突时的网络性能进行了分析,得出了在不同网络负荷情况下的包丢失率情况,研究结果对OBS网络的实际建设有一定的理论指导意义.     

光突发交换网络中新型减小竞争冲突方案

光突发交换是下一代光网络中的有效核心交换技术之一,在光突发交换网络中数据突发的调度是影响交换性能的重要因素,如何有效地对数据突发进行合理调度,以减小丢包率正是关键问题所在.采用在波长域业务整形与边缘节点延迟调度相结合的方法对数据突发进行调度,与LAUC-VF算法进行仿真对比分析,该方法能有效地降低突发包丢失率.     

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.     

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.     

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 unified study of burst assembly in optical burst switching networks

This article presents a comprehensive study of burst assembly in optical burst switching (OBS) networks. This investigation aims to provide a unified study of burst assembly algorithms. After analyses of conventional assembly algorithms, we present an adaptive burst assembly algorithm: data-length time-lag product assembly algorithm. Numerical results show that the proposed algorithm takes the real-time traffic state into account to adapt burst length and its injected intervals. It obtains a more acceptable performance. Moreover, we investigated the impact of burst assembly applied at the edge of OBS networks. We analyze the Hurst parameter of the input traffic to the output traffic that results from the burst assembly. Two formulas are presented to describe changes of the Hurst parameter. Theoretical results are validated through extensive simulations in time-based, length-based, and adaptive assembly algorithms, respectively.     

A dynamic load-aware congestion control scheme in optical burst switching networks

The most important design goal in Optical Burst Switching (OBS) networks is to reduce burst loss resulting from resource contention. Especially, the higher the congestion degree in the network is, the higher the burst loss rate becomes. The burst loss performance can be improved by employing an appropriate congestion control. In this paper, to actively avoid contentions, we propose a dynamic load-aware congestion control scheme that operates based on the highest (called ‘peak load’) of the loads of all links over the path between each pair of ingress and egress nodes in an OBS network. We also propose an algorithm that dynamically determines a load threshold for adjusting burst sending rate, according to the traffic load in a network. Further, a simple signalling method is developed for our proposed congestion control scheme. The proposed scheme aims to (1) reduce the burst loss rate in OBS networks and (2) maintain reasonable throughput and fairness. Simulation results show that the proposed scheme reduces the burst loss rate significantly, compared to existing OBS protocols (with and without congestion control), while maintaining reasonable throughput and fairness. Simulation results also show that our scheme keeps signalling overhead due to congestion control at a low level.     

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

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