光突发交换中冲突解决的GHA策略

为了解决光突发交换中突发包竞争问题,针对光突发网络中现有的突发包分割机制,提出新的基于优先级分组复合封装策略,分析冲突长度相对值和偏射路由阈值概念,结合头部丢弃与偏射路由双重机制进行冲突解决。仿真结果表明,该策略有效地较低了网络的丢包率,保证了高优先级IP包的高效传输,较好地支持了网络的QoS。     

光突发交换中路由技术的研究

光突发交换网络中路由的实现是网络生存性和健壮性的一个保证。文章提出了一种光突发交换网络路由技术的新方案,将免疫遗传算法这种仿生物体的智能算法,应用到光突发交换网络路由算法中,保证群体多样性,控制收敛方向。仿真结果表明,该方案可以降低OBS网络中的数据丢失率。     

光突发交换中路由技术的研究

光突发交换网络中路由的实现是网络生存性和健壮性的一个保证。文章提出了一种光突发交换网络路由技术的新方案,将免疫遗传算法这种仿生物体的智能算法,应用到光突发交换网络路由算法中,保证群体多样性,控制收敛方向。仿真结果表明,该方案可以降低OBS网络中的数据丢失率。     

OBS网络中多优先级业务冲突解决模型研究*

为了充分认识光突发交换（OBS）网络核心节点中的多业务冲突性能,以OBS网络核心节点为研究对象,采用基于优先级的信道抢占原则,给出了在配置光缓存情况下,多优先级业务的冲突解决模型。结果表明,所提出的模型保证了OBS网络的服务质量,有效解决了以往研究中出现的两个局限性问题,所得参数对OBS网络的实验化建设提供了理论依据。     

基于多种性能约束的光突发交换网络动态组装算法

在综合分析光突发交换网络中组装算法对控制平面处理时延、数据平面资源利用效率和数据平面突发丢失率等多种性能指标的影响的基础上,提出了一种能够同时满足多种网络性能指标约束的边缘节点动态组装算法。该算法根据全网目标性能指标的约束,动态调整组装输出的突发长度和突发时间门限,从而实现同时满足全网链路资源利用率和控制平面突发丢失概率的双重性能约束。     

基于主客观权重判决的异构无线网络接入选择算法

为确保异构无线网络接入选择算法能够从备选网络中选择出性能最优的无线网络,提出一种新的异构无线网络接入选择算法。利用模糊层次分析法计算异构无线网络属性指标的主观权重,并运用粗糙集理论计算客观权重,根据业务需求对主客观权重进行动态调整,以达到最佳的服务质量。实验结果表明,该算法可降低网络切换频率,减少网络阻塞的发生概率,有效均衡网络负载,并能够较好地选择最佳的接入网络。     

基于改进蚁群优化算法的网络服务质量路由算法

针对当前无线网络路由算法存在丢包率高、节点拥塞严重的难题,提出一种基于改进蚁群优化算法的网络服务质量路由算法。首先根据无线网络的特点选择带宽、端到端的延迟、数据包丢失率以及链路花费作为QoS参数,并建立一个多约束网络服务质量路由优化问题的数学模型,然后采用具有正反馈机制和搜索能力强的蚁群优化算法对数学模型进行求解,并根据无线网络路由特点对标准蚁群优化算法进行改进,提高其搜索性能,最后采用具体仿真实验对路由算法的性能进行测试。实验结果表明,改进蚁群优化算法在满足网络质量要求的条件下,不仅降低了网络平均延时,而且减少了网络数据丢包率,性能优于其它算法。     

GMPLS-based OBS光传输网络体系结构

提出一种采用GMPLS协议作为控制面的光突发交换（OBS）网络体系结构,给出了网络结构、节点功能模型、控制包格式和新增控制信令交换接口的建议。提出的网络结构是在OBS的突发控制包用通用标签代替地址,并使用GMPLS协议栈完成路由和信令功能,实现流量工程和生存性研究。     

WDM网络中支持多约束QoS的路由算法

针对波分复用网络中的路由问题,提出一种支持多个服务质量要求的启发式路由算法。该算法基于带宽约束、时延较小、时延波动和包丢失率较低这4个约束条件寻找路径,通过代价函数值调用Dijkstra算法迭代求解。仿真实例证明了算法的有效性。     

一种区分服务的DTN概率路由算法

针对DTN网络中不同优先级的数据包需要区分服务的问题, 提出了区分服务的概率路由算法SDRP。该算法提出了参考概率这一概念, 相遇节点针对不同的数据包优先级定义了不同的参考概率, 若相遇节点的参考概率大于发送节点的转发概率则将数据包转发, 否则不转发。仿真表明, SDRP算法使不同优先级数据包的递交率呈层次化分布, 高中低优先级数据包的递交率由高到低依次排列。该算法使DTN网络在不改变原有网络通信性能的基础上, 较好地实现了根据数据包优先级的不同而区分服务的功能。     

光突发交换竞争解决机制研究

作为下一代互联网的关键技术之一的光突发交换技术已受到业界的广泛关注。本文在介绍光突发交换基本概念、特点的基础上,重点探讨了解决光突发交换网中突发数据包之间争夺链路资源问题的竞争解决机制,主要包括光缓存、波长转换、偏转路由以及突发分片等技术,对这些技术的优缺点进行了分析比较,并给出了一种偏转路由和突发分片技术结合的竞争解决方法。     

Topology-aware wavelength partitioning for DWDM OBS networks: A novel approach for absolute QoS provisioning

Optical Burst Switching (OBS) is a promising switching technology for the next generation all-optical networks. An OBS network without wavelength converters and fiber delay lines can be implemented simply and cost-effectively using the existing technology. However, this kind of networks suffers from a relatively high burst loss probability at the OBS core nodes. To overcome this issue and consolidate OBS networks with QoS provisioning capabilities, we propose a wavelength partitioning approach, called Optimization-based Topology-aware Wavelength Partitioning approach (OTWP). OTWP formulates the wavelength partitioning problem, based on the topology of the network, as an Integer Linear Programming (ILP) model and uses a tabu search algorithm (TS) to resolve large instances efficiently. We use OTWP to develop an absolute QoS differentiation scheme, called Absolute Fair Quality of service Differentiation scheme (AFQD). AFQD is the first absolute QoS provisioning scheme that guarantees loss-free transmission for high priority traffic, inside the OBS network, regardless of its topology. Also, we use OTWP to develop a wavelength assignment scheme, called Best Effort Traffic Wavelength Assignment scheme (BETWA). BETWA aims to reduce loss probability for best effort traffic. To make AFQD adaptive to non-uniform traffic, we develop a wavelength borrowing protocol, called Wavelength Borrowing Protocol (WBP). Numerical results show the effectiveness of the proposed tabu search algorithm to resolve large instances of the partitioning problem. Also, simulation results, using ns-2, show that: (a) AFQD provides an excellent quality of service differentiation; (b) BETWA substantially decreases the loss probability of best effort traffic to a remarkably low level for the OBS network under study; and (c) WBP makes AFQD adaptive to non-uniform traffic by reducing efficiently blocking probability for high priority traffic.     

Performance analysis of timer-based burst assembly with slotted scheduling for optical burst switching networks

In this paper, we analyze the performance of a timer-based burst assembly for optical burst switching (OBS) networks. In our analytical model, an ingress edge node has multiple buffers where IP packets are stored depending on their egress edge nodes, and bursts are assembled at the buffers in round-robin manner. Moreover, bursts are transmitted in accordance with slotted scheduling where each burst transmission starts at the slot boundary. We construct a loss model with two independent arrival streams, and explicitly derive the burst loss probability, burst throughput, and data throughput. In numerical examples, we show the effectiveness of our analysis in comparison with the Erlang loss system. It is shown that our model is quite useful for an OBS network with a large number of input and output links.     

Algorithms for burst rescheduling in WDM optical burst switching networks

Wavelength division multiplexing (WDM) is a promising technology for realizing terabit networks. Optical burst switching (OBS) is a way to efficiently support bursty traffic on WDM-based optical Internet networks. In OBS networks, the control (header) and payload (data) components of a burst are sent separately with a time gap. The control packet first traverses the burst switching nodes and reserves suitable wavelengths on the links for the corresponding data burst by using a scheduling algorithm. Our work is motivated from the observation that the existing scheduling algorithms either have low computational complexity or high performance in terms of burst dropping probability, but not both simultaneously. Since the arrival of bursts is dynamic, it is highly desirable that the scheduling is done as quickly as possible. We develop scheduling algorithms which integrate the merits of both low computational complexity and high burst dropping performance. The key idea is to reschedule an existing burst by assigning a new wavelength to it keeping the burst arrival and leaving time unchanged in order to accommodate the new burst. We propose computationally simple rescheduling algorithms called on-demand burst rescheduling and aggressive burst rescheduling. The effectiveness of the proposed algorithms and the signaling overhead are studied through simulation experiments.     

On ordered scheduling for optical burst switching

Optical burst switching (OBS) is a promising optical networking paradigm for efficient transport of bursty IP traffic over wavelength division multiplexing (WDM) optical Internet networks. In OBS, the header of a burst is sent in advance of the data burst to reserve a wavelength channel at each optical switching node along the path. The nodes use a scheduling algorithm to assign wavelengths to incoming bursts. Our work is motivated from the observation that existing scheduling algorithms assign a wavelength to a burst when its header arrives at the node. Thus, information about other bursts whose headers arrive later is not available when the scheduling decision is made. This leads to suboptimal scheduling decisions and unnecessary burst dropping. The key idea in our proposed algorithm, Ordered Scheduling, is to defer making the scheduling decision until just before the burst arrival in order to have full knowledge about other bursts. The effectiveness of the proposed algorithm is studied through simulation and the computational complexity and signalling overhead are analysed.     

稀疏分光配置OBS网络中的多播机制*

针对在稀疏分光配置的光突发交换（OBS）网络中进行多播的问题,提出了一种基于优先级的共享多播机制。该机制对包含相同分光节点的业务进行汇聚,并且在资源预约过程中引入了优先级来区分主干链路和分支链路,保证多播树的主干链路能优先抢占资源。通过仿真发现,相比传统多播机制,该方式能减少多播业务的丢包率和冗余包的数量,提高资源利用率。     

OBS网络中多重主动重调度算法

信道调度算法是光突发交换（OBS）网络的关键技术之一。在主动重调度算法的基础上,提出了一种新的多重主动重调度算法,通过搜索并重调度数据信道上所有能进行重调度的突发,使多个突发重调度后产生的间隔尽量小,从而降低突发丢失率。     

A redundant overbooking reservation algorithm for OBS/OPS networks

Optical burst switch (OBS) has been a hot topic in the area of optical networks. OBS can realize statistic multiplexing while having the advantage of simplicity in deployment. A key issue in OBS is how to reduce the rate of the burst dropping caused by the absence of optical buffers or by the limited number of Fiber Delay Line (FDL). Existing work addresses this issue in the wavelength, time, or space domains. This paper proposes an algorithm, which works from a new domain to address this problem. Specially, it works by using the idle bandwidth in upstream links to transmit redundant copies of bursts to provide more sending chances at the downstream node. Simulation results are given to demonstrate the high performance of our algorithm.