一种混合WDM网络的实时传输策略

波分复用(Wavelength Division Multiplexing,WDM)网络应用于实时性网络环境的关键因素是实时传输策略。在混合式WDM网络结构中,研究了子网内的实时调度和子网间的路由策略。其中子网内为星形耦合式WDM网络,分析了区分丢弃-最早时限优先调度法(DDS-EATS)的不足,针对多消息多次调度的问题提出了改进方案。子网间网络采用洗牌型WDM波长路由网,消息路由采用轻载固定路由,重载流量疏导的方法。最后在OPNET仿真平台上,验证了该传输策略下消息的实时传输性能和多次消息调度中改进算法的网络延迟和网络利用率的网络性能。     

保证航电波分复用网络实时性的虚拓扑设计

针对航空电子波分复用网络消息的实时性要求,对航空电子网络的结构进行了研究,分析了在该网络中造成消息延迟的主要因素为转发延迟。进而对航空电子网络建模,根据WDM网络的资源特性进行拓扑的约束,提出了基于综合考虑虚拓扑跳数以及消息的带宽保证为目标的线性规划算法,在此基础上给出了大型网络的一个启发式算法,采用该线性规划算法对NSFNet网络拓扑进行了仿真验证。仿真结果表明,综合考虑虚拓扑跳数和消息带宽能减少消息的延迟,保证了网络实时性。     

WDM光网络中的动态流量疏导

针对波分复用光网络中的业务疏导问题,文章基于通道组交换网络模型,采用波分复用网络中的相对容量算法来解决业务疏导的路由、波长分配和时隙分配问题.基于该模型的算法能够将波长和时隙分配这两个通常分开解决的问题一步解决,因此比现有方法具有更好的效能,仿真也验证了这一点.     

一种新的基于集成图模型的综合疏导算法

在IP over WDM网络的业务疏导中,针对现有图模型的缺陷、设计了一种可用于各种疏导策略计算的集成图模型.它克服了分层图不能量化资源占用的缺点,以及LBAG图不能满足光路的波长连续要求的缺点.基于集成图模型,提出了一种考虑光收发器资源、波长资源以及路径上O/E/O次数等信息的综合疏导算法(Integrated Grooming Algorithm,IGA).仿真结果表明,相比VT-first和PT-first等只侧重于减少某种资源占用的疏导算法,IGA能提高网络吞吐量,减少O/E/O处理次数.     

多媒体卫星通信系统中的时隙分配方法

论文针对VoIP实时通信业务,根据其对延迟性能的需求,分析了时隙分配对延迟性能的影响,并对其进行了建模分析.结果表明,与传统的时隙位置连续分配相比,时隙均匀分配能显著提高业务的延迟性能.文中给出了MF-TDMA的通信系统中,提高延迟性能的解决方案,分析了两种业务下时隙均匀分配和时隙连续分配的延迟性能和丢包率.     

一种新型动态流量疏导策略

在WDM光网络中业务流量疏导能够有效地降低网络建设成本.为了疏导网络中的动态业务,提出动态业务流量的可重构疏导方案,并给出相应快速在线算法.此算法通过动态调整网络的虚拟拓扑结构,可使网络适应各种动态业务.计算机模拟结果表明,该算法能得到较优的疏导结果.     

WDM疏导网络中一种新的多播业务路由算法

研究了波分复用(WDM)网状网中动态多播业务量疏导,提出一种新的辅助疏导模型,其可以描述当前网络资源状况和节点分光特点,并动态更新.进而提出一种有效的多播业务量疏导启发式算法(MGA),将业务的多播选路和波长分配同时完成.仿真表明,该算法在波长连续性限制、网络波长和节点收发器数目有限的情况下,具有较低网络阻塞率.     

一种WDM网状网中基于共享保护的业务量疏导算法

在WDM网络中业务的带宽需求远低于一个波长所提供的带宽,业务量疏导可以聚集低速业务到大容量的光路中从而有效地利用波长带宽资源.目前大多数业务量疏导的研究限于环形网,考虑对WDM网状网中低速业务可靠疏导的文献更少.该文综合考虑WDM网状网生存性及业务量疏导,提出了基于波长分层图的共享保护业务量疏导算法(SPTG-LG,Shared Protection Traffic Grooming algorithm ba,sed on wavelength Layered-Graph),并对算法进行了仿真和分析.     

波分系统链、环状网络动态业务疏导的波长选择算法及仿真

针对基于业务疏导的WDM网络模型的两种不同的网络优化目标,提出并仿真了在已用波长优先情况下6种波长选择算法方案,计算机仿真结果表明,基于概率模型的业务疏导波长选择算法和基于业务起止位置的带宽负载度算法具有较好的性能。最后指出了这些算法的应用领域。     

基于排队论的数据链网络节点入退网时隙分配算法研究

随着现代战争的作战需求提高,数据链作为信息化时代战场上战斗力的"倍增器",网络节点入退网时隙资源分配问题日益突出.因此,基于排队论理论提出节点入退网时隙分配算法,建立数据链网络节点入退网的时隙分配模型.使用OPNET仿真软件对算法模型和传统的轮询机制时隙分配算法模型进行了仿真,仿真结果表明,设计算法的网络吞吐量、队列时...     

Adaptive load-balancing in WDM mesh networks with performance guarantees

In nowadays, wavelength-division multiplexing (WDM) networks, on the one hand, increasingly more users expect the network to provide high-priority QoS services demanding no congestion and low latency. On the other hand, it is significantly more difficult for network operators to forecast future traffic demands, as the packet traffic running over WDM networks fluctuates over time for a variety of reasons. Confronted with a rough understanding of traffic patterns as well as the increasing number of time-sensitive applications, most networks today are grossly over-provisioned. Thus, designing cost-effective WDM networks in an uncertain traffic environment, which includes network planning and robust routing, is both an important and a challenging task. In this paper, we explore adaptive load-balancing to investigate the problems of network planning and robust routing for WDM mesh networks under varying traffic matrices. We first propose an efficient heuristic algorithm called Maximizing Network Capability (MNC) to provision congestion-free and cost-effective WDM networks based on load-balancing to deal with traffic uncertainty. Then, a novel traffic grooming algorithm called Adding Direct Traffic (ADT) is proposed to implement robust routing with partial traffic information. Finally, we demonstrate by simulation that MNC consumes less resources than previous methods and performs quite close to the optimal solution, while ADT achieves the desirable performance in delay, jitter (delay variation), and throughput compared with existing robust routing and traffic grooming algorithms.     

IP over WDM网络中能耗自感知的混合疏导专有保护算法

针对绿色生存性IP over WDM网络中资源开销大、网络阻塞率高的问题,提出一种能耗自感知的混合疏导专有保护(HG-PA-DPP)算法。首先在IP层的核心路由器对低粒度业务请求集中疏导;然后通过实时感知WDM层的链路负载和双层器件带来的链路能耗状态定义链路权值,基于分层图在不同波长平面上为各业务请求寻找权值小且链路分离的工作路径和保护路径,同时在业务的中间节点处对不需要光-电-光转换的光路进行光旁路处理;最后,将空闲或保护资源设置为休眠模式以实现节能。仿真结果表明,所提算法在高负载时有着更好的节能效果,且在大网络拓扑下资源开销(RO)为传统算法的76.5%,阻塞率(BP)仅为传统算法的61.1%。     

An Algorithm for Traffic Grooming in WDM Optical Mesh Networks with Multiple Objectives

This paper studies a traffic grooming in wavelength-division multiplexing (WDM) mesh networks for the SONET/SDH streams requested between node pairs. The traffic could be groomed at the access node before converting to an optical signal carried in the all-optical network. We design a virtual topology with a given physical topology to satisfy multiple objectives and constraints. The grooming problem of a static demand is considered as an optimization problem. The traditional algorithms found in the literatures mostly focus on a single objective either to maximize the performance or to minimize the cost. We propose a multi-objective evolutionary algorithm to solve a grooming problem that optimizes multiple objectives all together at the same time. In this paper we consider the optimization of three objectives: maximize the traffic throughput, minimize the number of transceivers, and minimize the average propagation delay or average hop counts. The simulation results show that our approach is superior to an existing heuristic approaches in an acceptable running time.     

IPoverWDM光网络中基于滑动调度业务模型的节能业务量疏导算法研究(英文)

In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core network.We present a two-layer auxiliary graph model and propose a new energyefficient traffic grooming heuristic named Two-Dimension Green Traffic Grooming(TDGTG) algorithm,which takes both space and time factors into consideration for network energy efficiency.We compare our proposed TDGTG algorithm with the previous traffic grooming algorithms for scheduled traffic model in terms of total energy consumption and blocking probability.The simulation results in three typical carrier topologies show the efficiency of our proposed TDGTD algorithm.     

基于层叠模型的动态组播业务疏导算法

流量疏导对于提高波分复用网络的利用率具有重要的意义.文章基于层叠模型的IP over WDM网络结构,研究了动态组播业务疏导问题,给出了两种动态组播业务疏导方法.仿真结果显示,在IP层和光层都计算最短路径来选取最短路径组建组播树的算法能够获得更低的阻塞率.     

WDM光网络多跳业务量疏导算法

针对具有多跳疏导能力的WDM光网络进行了研究,提出了一种基于固定备选路由的多跳业务量疏导算法（FO-HC-MH）。该算法对备选路由的跳数进行限制,因而可以节约使用网络的收发器资源。仿真实验表明,与FO-MH算法相比,在网络负载较低的情况下该算法节约效果明显。     

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.