动态业务条件多颗粒度交换光网络性能研究

本文研究了动态业务条件下基于波带、波长两级交换的多颗粒度光交叉连接节点(MG-OXC)的优化设计,并提出了一种适用于多颗粒度交换光网络(MG-ON)的动态路由、波长分配和业务分组(Traffic Grouping)算法.利用实际网络拓扑对上述MG-ON方案进行了数值仿真实验,比较研究了MG-ON与传统OXC节点构成的波长路由光网络(WRON)的动态业务阻塞率性能,结果表明MG-ON的网络性能可以满足动态业务的要求.     

支持突发粒度的多粒度光交换研究

现有的多粒度光交换一般只支持光纤、波带和波长这三种粒度的光交换,其最小粒度通常为波长粒度.针对这种缺陷,提出了一种支持突发粒度的多粒度光交换方案,包括支持突发粒度的多粒度光交换的节点结构、路由策略、波带分配算法.这种方案利用了光突发交换的交换粒度小、统计复用特性等优点来提高链路利用率,同时利用多粒度先交换减少光交叉连接(OXC)的端口数和降低OXC的成本.仿真结果表明,所提出的支持突发粒度的多粒度光交换能有效降低包丢失率和端对端时延.     

多相位粒度萤火虫同步算法

该文针对分布式时间同步算法中,低耦合系数的分组同步问题和大耦合系数的相位振荡失稳现象,提出一种多粒度一致分布式时间同步算法,采用离散多相位粒度模型,将报文交换的相位信息采用多个相位分辨力进行耦合同步,有效地减少了分组现象,加快了同步进程,并提高了算法的执行效率。最后利用仿真实验和传统的MS仿生算法进行对比实验,验证了其在非全连接网络中,可以取得比传统算法更好的同步效果。     

基于混合遗传算法的正交相位编码波形设计

提出一种混合遗传算法来设计可以应用于MIMO(多输入多输出)雷达系统的正交相位编码信号.该算法将模拟退火的思想引入遗传算法并加入了最优保存策略、小范围竞争择优交叉操作和过滤相同个体并动态补充新个体的操作,避免了遗传算法中的早熟问题,增强了算法的全局搜索能力,提高了算法的收敛速度.仿真结果表明,该算法可行且高效.     

WDM多粒度网络中的波带通道分配算法

文章提出了一种波分复用(WDM)多粒度网络中的静态波带通道分配算法--平衡路由双向首次命中算法(BBFF,Balanced-routing-Bidirectional-First-fit).该算法旨在减少全网多粒度全光域光交叉连接器(MG-PXC)的端口数,降低网络成本和控制复杂度.算法在路由选择阶段尽量保证全网负载平衡;在波长分配阶段采用改进了的首次命中(FF)算法,减少了因配置零散波长通道而无法建立波带通道的可能.仿真结果表明,BBFF算法的两个特征,都有效地减少了MG-PXC的端口数,降低了网络成本.     

一种提高组网雷达目标定位精度的算法

组网雷达中通过协方差交叉进行目标定位可以提高目标定位精度,首先从理论上对多雷达数据融合定位精度进行了误差分析,提出了一种可应用于工程实践的提高目标定位精度的算法。该算法利用多部雷达协方差交叉缩小目标定位误差,使目标定位精度得以提高。仿真数据及工程实践验证了它的正确性及合理性,在雷达组网工程中也得到良好的应用。     

多粒度全光网中的多层联合路由

多粒度交换技术利用波带级路由以及光纤级路由,可有效降低光交叉连接器的复杂度.但多粒度交换增加了光网络的逻辑层次结构,使得网络中的路由与资源分配问题更为复杂,因此,在多粒度全光网中实现多层联合路由是提高网络性能的关键.本文对多粒度交叉连接结构进行了分析,并对多粒度全光网中的多层联合路由问题进行了研究.     

一种TD-SCDMA系统的动态信道分配策略

提出了一种适用于TD-SCDMA系统的动态信道分配算法.该算法在进行资源整合的基础上将信道条件较好的用户分配于交叉时隙,从而达到减少交叉时隙干扰,提高频谱效率的目的.仿真结果表明该算法能够有效增加系统容量,改善系统性能.     

一种新的测向交叉定位算法

为了解决测向交叉定位系统在基线附近定位精度较低的问题,介绍了一种基于最小方差法的测向交叉新算法.该方法对于每个空间点,都以定位误差最小的算法和参数来计算目标位置.首先研究了3种测向交叉定位算法及距离解算误差,然后给出了基于最小方差的新算法流程图,最后对算法进行了仿真和性能分析.仿真结果表明,新算法明显地改善了基线附近的定位精度,提高了系统的抗干扰能力.该算法可适用于某些雷达组网系统的目标指示阶段.     

一种改进的多粒度光交叉连接结构

多粒度光交叉连接能够提供光纤、波带和波长三种粒度的光交换,这一机制能有效提高交换性能,同时通过交换端口数的减少来降低光交换的成本。在这种交换结构中,需要在下层进行交换的信号需要首先经过上层的交换,或者所有信号都需要被不加区分地解复用出来进行交换,这造成了信号的过大损耗和失真,以及交换端口的浪费。我们在介绍了现有的研究以后,提出一种改进后的多粒度光交叉连接结构。通过仿真分析,可以看出这一新结构能够比其他结构更灵活地配置交换端口,同时能够避免不必要的信号损耗和失真,降低交换成本。     

Multi-domain grooming algorithm based on hierarchical integrated multi-granularity auxiliary graph in optical mesh networks

With the size of traffic demands ranges from sub-wavelength-level to wavelength-level, traffic demands need to be aggregated and carried over the network in a cost-effective manner to make sure that the resources are utilized effectively. Therefore, the technique called multi-granularity grooming is proposed to save the cost by reducing the number of switching ports in optical cross-connects. However, the existing multi-granularity grooming algorithms are mostly limited in single-domain optical networks. Since the current optical backbone keeps enlarging and is actually divided to multiple independent domains for achieving the scalability and the confidentiality, it is necessary to study the multi-granularity grooming in multi-domain optical networks. In this paper, we propose a new heuristic algorithm called hierarchical multi-domain multi-granularity grooming (HMMG) based on hierarchical integrated multi-granularity auxiliary graph (H-IMAG) to reduce the total number of optical switching ports. The H-IMAG is composed of the inter-domain virtual topology graph (VTG) and the intra-domain integrated layered auxiliary graph (ILAG), where VTG includes a wavelength virtual topology graph (WVTG) and a waveband virtual topology graph (BVTG), and ILAG includes a wavelength layered auxiliary graph (WLAG) and a waveBand layered auxiliary graph (BLAG). Then, we can groom the sub-wavelength-level demands into lightpaths based on WVTG and WLAG and groom the wavelength-level demands into high-capacity wavebands based on BVTG and BLAG. Simulation results show that performances of H-IMAG can be significantly improved compared with previous algorithm.     

一种基于虚拟突发的OBS网络业务疏导机制

提出了一种基于虚拟突发光突发交换的(OBS)网络业务疏导机制TG-VB(traffic grooming based on virtual burst)。作为一种多粒度动态业务疏导机制,TG-VB将常规突发通过"逻辑汇聚"组成虚拟突发,增大核心网中业务传输粒度;同时,TG-VB根据虚拟突发整体传输、整体调度的特点,为汇聚的常规突发动态地选择最优的共用传输路径。仿真结果表明,与采用传统疏导机制的OBS网络相比,TG-VB能够有效地减轻核心节点的通信处理开销,降低对网络节点端口数量的需求;在相同负载条件下,TG-VB可极大地提高波长信道利用率。     

支持OTDM的多粒度光交换结构研究

多粒度光交换能减小光交叉连接矩阵的规模,降低光节点的成本,然而现有多粒度光交换结构的最小交换粒度常为波长,该交换粒度太大,会导致核心节点的链路利用率低.文章在多层MG-OXC基础上,提出了一种新型多粒度交换结构,实现了波带交换和OTDM的结合.该新型MG-OXC结构端口较少,并且可以提高传输速率,同时也因此降低了同等信息量下波长的使用教量,为网络提供了更大的传输容量,能够很好地适应光网络发展的需要.     

Survivable integrated grooming in multi-granularity optical networks

Survivability is an important issue to ensure the service continuity in optical network. At the same time, with the granularity of traffic demands ranging from sub-wavelength-level to wavelength-level, traffic demands need to be aggregated and carried over the network in order to utilize resources effectively. Therefore, multi-granularity grooming is proposed to save the cost and reduce the number of switching ports in Optical-Cross Connects (OXCs). However, current works mostly addressed the survivable wavelength or waveband grooming. Therefore, in this paper, we propose three heuristic algorithms called Multi-granularity Dedicated Protection Grooming (MDPG), Multi-granularity Shared Protection Grooming (MSPG) and Multi-granularity Mixed Protection Grooming (MMPG), respectively. All of them are performed based on the Survivable Multi-granularity Integrated Auxiliary Graph (SMIAG) that includes one Wavelength Integrated Auxiliary Graph (WIAG) for wavelength protection and one waveBand Integrated Auxiliary Graph (BIAG) for waveband protection. Numerical results show that MMPG has the lowest average port-cost, the best resource utilization ratio and the lowest blocking probability among these three algorithms. Compared with MDPG, MSPG has lower average port-cost, better resource utilization ratio and lower blocking probability.     

Performance analysis of an optical network employing waveband and traffic grooming

This paper analyses an optical network architecture composed by an arrangement of nodes equipped with multi-granular optical cross-connects (MG-OXCs) in addition to the usual optical cross-connects (OXCs). Then, selected network nodes can perform both waveband as well as traffic grooming operations and our goal is to assess the improvement on network performance brought by these additional capabilities. Specifically, the influence of the MG-OXC multi-granularity on the blocking probability is evaluated for 16 classes of service over a network based on the NSFNet topology. A mechanism of fairness in bandwidth capacity is also added to the connection admission control to manage the blocking probabilities of all kind of bandwidth requirements. Comprehensive computational simulation are carried out to compare eight distinct node architectures, showing that an adequate combination of waveband and single-wavelength ports of the MG-OXCs and OXCs allow a more efficient operation of a WDM optical network carrying multi-rate traffic.     

Waveband Grooming based on Layered Auxiliary Graph in multi-domain optical networks

With the number of wavelengths on fibers keeps increasing, the size and the cost of Optical Cross-Connect (OXC) are greatly enhanced and then the control and management of optical switches become more and more complicated. Therefore, the technique called waveband switching is proposed to reduce the size and the cost of OXC; that is, to save the All-Optical (OOO) switching ports in OXC. However, the existing waveband switching algorithms are all limited in single-domain optical networks. Actually, with the scale of optical backbone keeps enlarging, the network is divided to multiple independent domains to perform the hierarchy routing for achieving the scalability. In order to reduce the size and the cost of OXC meanwhile to achieve the scalability in multi-domains, in this paper we propose a new heuristic algorithm called Waveband Grooming with Layered Auxiliary Graph (WGLAG) since the waveband grooming problem is the NP-hard to perform the inter-domain routing based on the virtual topology of multi-domain network and the intra-domain routing based on the physical topology of single-domain network. In intra-domain routing with waveband grooming of each single-domain, we propose the Layered Auxiliary Graph (LAG) that includes one virtual topology layer and multiple waveband-plane layers to compute a single-hop, or multi-hop or hybrid waveband route for each connection request based on the sub-path waveband grooming scheme. Simulation results show that, WGLAG not only can effectively save more switching ports to reduce the cost of OXC but also can obtain lower blocking probability than other algorithm.     

A new integrated auxiliary graph based routing algorithm in waveband switching optical networks

In this letter, we propose a new routing algorithm based on integrated auxiliary graph (RA-IAG) to reduce switching ports in waveband switching optical networks. The IAG is compared of a single virtual topology layer (VTL) and multiple waveband-plane layers (WPLs). For each demand, RA-IAG first computes a single-hop or multi-hop route on VTL. If the route cannot be found on VTL, RA-IAG then computes a hybrid multi-hop route by jointing VTL and WPLs. Simulation results show that, compared with previous algorithm, RA-IAG can obtain better performance.     

An efficient dynamic multicast traffic-grooming algorithm for WDM networks

With the growth of multi-granularity multicast applications, there comes into being a huge gap between the bandwidth of a wavelength provided and a multicast traffic required in the wavelength division multiplexing (WDM) networks. The dynamic multicast traffic-grooming is an effective way for WDM networks to improve the wavelength utilization and decrease the traffic blocking probability. A novel switching node architecture with the multicast switching matrix and traffic-grooming fabric is studied in the paper. Then, an efficient dynamic multicast traffic-grooming algorithm is proposed for the architecture. According to the ratio of network available grooming port number to network transceiver number, the proposed algorithm estimates whether the traffic-grooming port is a scarce resource for input traffic and chooses the appropriate grooming strategy. If the traffic-grooming port is scarce, the minimized use grooming port strategy is designed for the coming traffic. On the contrary, the minimized use node transceiver strategy is applied for the coming traffic. Simulation results show that the proposed algorithm can groom traffic efficiently with low blocking probability and high network throughput constraint by limiting number of node transceivers and grooming ports.     

Waveband grooming and IP aggregation in optical networks

An automatically switched optical network (ASON) can be used as the transport layer of generalized multiprotocol label switching (GMPLS) networks. The design of an ASON involves determining the number of optical cross-connects (OXC) in the network, the required number of ports per OXC, and the interconnection topology of the OXCs. Given the number of ports per OXC, we present a linear algorithm to find the number of OXCs and to identify a cost-effective topology. We then develop a scheme that can be used to perform waveband grooming for several different topologies of an ASON that uses single-layer multigranular OXCs. We identify the bottlenecks and investigate the effect of traffic grooming schemes in the design of an ASON as a function of the peak access rate per customer. We evaluate the topologies and architectures for a national trunk network.