共查询到20条相似文献,搜索用时 15 毫秒
1.
本文介绍了光突发交换(OBS)网络中的一种操作维护管理(OAM)方案,包括这种OAM方案的结构、功能、分组过程和分组格式。此方案可以实现光通道连接顺畅,并可检查OBS网络状态和突发包的功能。 相似文献
2.
3.
BM-VF-SBD:一种支持QoS的光突发交换数据信道调度算法 总被引:1,自引:0,他引:1
在光突发交换(OBS)网络中,数据信道的调度算法是一个关键问题。然而,当前的调度算法大多只强调带宽利用效率,而忽略了QoS支持。该文提出了一个算法BM-VF-SBD,其基本思想为:若所有信道上没有一个Void能容纳新突发,则搬移一些突发到别的信道后,再为新突发分配信道资源;若还失败,则再选择性地丢弃一些低优先级的突发,重复前面操作,它是利用BM,VF和SBD 3种机制减少带宽碎片,支持QoS。若以平衡二叉树组织Void和突发相关信息,它的计算复杂度与LAUC-VF和ODBR接近,小于O((2w+1)log w)。仿真表明它在带宽碎片率和突发损失率(包括总的和各个优先级的)上优于LAUC-VF和ODBR。 相似文献
4.
Burst Assembly Schemes and Performance Evaluation in Optical Burst Switching Networks 总被引:2,自引:0,他引:2
1 Introduction TheopticalInternethasbeenemergedasanefficientsolutionforsupportingever increasingInternettrafficbytakingadvantageofpotentiallyhugebandwidthofWavelength DivisionMultiplex (WDM )opticalnet works.Tomeettheincreasingbandwidthdemandsandreducecosts ,severalopticalnetwork paradigmshavebeenunderintensiveresearch .Ofalltheseparadigms,OpticalCircuitSwitching (OCS[1~ 3] )isrelativelyeasytoimplementbutlacksflexibilitytocopewiththefluc tuatingtrafficandthechanginglinkstate ,andrequi… 相似文献
5.
使用泊松业务流模型对光突发交换网络进行性能分析不能准确地反映网络状态。该文从理论上对突发包长度进行了推导,对基于时间门限汇聚机制下突发包数据流自相似程度进行了计算机仿真测量,并利用自相似业务流模型对光突发交换网络中比较常用的LAUC和LAUC-VF调度算法进行了性能仿真。仿真结果表明:基于时间门限的汇聚机制能够有效地降低数据流自相似程度,数据流的自相似特性对LAUC算法的影响并不非常明显,但对LAUC-VF算法的性能则产生了比较严重的影响,其突发包丢失率较泊松流平均增加了近3个百分点。 相似文献
6.
This paper proposes a priority‐based duplicate burst transmission mechanism in an optical burst switching network to enhance the probability of successful reception of bursts. The performance of the proposed mechanism is evaluated by NS2 simulations. Our results show that the burst loss rate is improved especially under light traffic loads. 相似文献
7.
8.
9.
光突发交换(OBS)是IP over WDM核心网络采用的交换技术。在OBS网络中,送往同一边缘节点的IP分组汇聚成传输和交换的基本单元———数据突发(DB),DB丢弃会导致大量IP分组丢失,显著影响传输层的性能。文中分析OBS网络的参数对传输控制协议(TCP)吞吐量和时延的影响。仿真结果表明,DB丢包率越高,TCP性能越差。在低丢包率情况下,随着DB长度的增加,TCP吞吐量和端到端时延明显增加,高丢包率情况下则不明显;随着汇聚周期的增加,TCP吞吐量逐渐下降,端到端时延逐渐增加。 相似文献
10.
11.
12.
13.
14.
So Won-Ho Lee Hae-Chong Kim Young-Chon Roh Sun-Sik 《Photonic Network Communications》2003,5(2):147-162
In this paper, we propose a protocol architecture and quality of service (QoS) supporting algorithms for optical Internet based on optical burst switching (OBS) technology. Firstly, the function of each layer of the protocol architecture and the formats of control packets are defined in order to adopt GMPLS to the control plane of OBS. Then, the offset time decision (OTD) algorithm to cooperate with the proposed protocol architecture is designed for optical Internet. A new burst loss formula taking into account the effect of offset time is introduced to design the OTD algorithm. This algorithm can decide on the appropriate priority-offset time according to the required QoS by using the reversed equation of the so-called heuristic loss formula (HLF) which is approximated as a proportional equation of our new loss formula. Finally, we propose a CAC algorithm based on the OTD algorithm for the purpose of increasing the availability of wavelength resources and supporting the QoS of established connections in optical Internet. The performance of the proposed algorithms is evaluated in terms of burst loss rate and the number of connections through simulation. 相似文献
15.
16.
光突发交换(OBS)网络被认为是下一代光因特网的典型代表,其中,光突发数据包在节点的竞争问题是OBS网络中需要解决的关键问题之一。该文重点研究了突发数据包之间因争夺链路资源而导致冲突的四种竞争解决方案:波长转换、光缓存、偏射路由和突发包分割,并分析了它们的优缺点。在此基础上,提出了OBS网络中冲突解决方法的发展趋势——... 相似文献
17.
OBS网络中的多BHP延迟调度算法 总被引:2,自引:0,他引:2
光突发交换 (Optical Burst Switching,OBS) 是下一代光网络中的有效核心交换技术之一。在OBS网络中,核心节点的调度方案是影响网络交换性能的重要因素。如何有效地对突发分组 (Burst) 进行合理调度,以减少丢包率正是关键问题所在。该文提出了一种多控制分组 (Burst Header Packet,BHP) 延迟调度算法,对于一个收集周期内到达的多个BHP所对应的突发数据,按照一定的方式对它们进行集中调度,实现对已预约资源的更改,使调度结果得到了优化。该算法根据不同的网络应用,可细化为4种具体的算法实现,以适用于不同的应用场景。仿真结果表明,该文提出的调度算法和已有算法相比,能够优化对突发分组的调度,提高对信道资源的有效使用,从而降低交换网络的丢包率。 相似文献
18.
19.
Saravut Charcranoon Tarek S. El-Bawab Jong-Dug Shin Hakki C. Cankaya 《Photonic Network Communications》2006,11(1):99-110
We propose a new burst scheduling mechanism for Optical Burst-Switched (OBS) networks. The new approach is made possible by
gathering data bursts into groups and performing the scheduling decision for each group collectively. In OBS group-scheduling,
bursts will not be considered for scheduling until a pre-defined time period elapses, during which the group of burst header
packets would be gathered. By transforming a set of data bursts into a set of corresponding time intervals, the problem of
scheduling these bursts is transformed into a combinatorial optimization problem. Graph algorithms are applied to obtain the
maximum number of non-overlapping bursts. The proposed OBS group-scheduling scheme is shown to improve the performance of
OBS networks over existing scheduling schemes in terms of burst loss probability and channel utilization. With an extension
through a sequential optimization, using a Branch-and-Bound technique, the proposed scheme can support multiple classes of
service. It is shown that the new scheduling approach has several desired characteristics including fairness and service differentiability
among classes in terms of burst loss probability and channel utilization. 相似文献
20.
A new method is proposed for determining protection paths in an optical network where users have different characteristics
in terms of reliability needs and security restrictions. Survivability is achieved by distributed mesh protection. Over the
preplanned primary and backup capacity, optimal routing and wavelength assignment is carried out. In case of a network failure,
protection routes and optimum flow values on these protection routes are extracted from a previously trained feed-forward
neural network which is distributed over the optical data communications network. 相似文献