Binary tree-based fault location algorithm for optical burst switching network

This paper proposes an effective method of fault location based on a binary tree for optical burst switching （OBS） network. To minimize the monitoring cost, we divide the network into several monitor domains by introducing monitoring-cycle algorithms. In order to generate an exclusive code, we modify the monitoring cycle algorithm when two nodes have the same code. Through the binary tree algorithm, a pre-computation of faults in the OBS network can be achieved. When a fault happens, we can locate it immediately and accurately. Examples have proved that the algorithm has general applicability.     

Techniques for optical packet switching and optical burst switching

Wavelength-division multiplexing appears to be the solution of choice for providing a faster networking infrastructure that can meet the explosive growth of the Internet. Several different technologies have been developed so far for the transfer of data over WDM. We survey two new technologies which are still in the experimental stage-optical packet switching and optical burst switching-and comment on their suitability for transporting IP traffic     

Dual-fiber optical burst switching network: A novel architecture for metropolitan area networks

Fiber optic rings are widely deployed in metropolitan area networks (MAN). These rings currently employ architectures and protocols that are neither optimized for nor scalable to the network demand. Therefore, emerging technologies are being pushed to replace the traditional architectures. Among these technologies, optical burst switching (OBS) is an effective and promising technology. In this study, a novel architecture, dual-fiber OBS (DOBS), is proposed. This architecture has similar functions to those of fiber delay lines, partial wavelength conversion and deflection routing. A theoretical model is developed to evaluate the performance of DOBS, which is compared with single-fiber and simple two-fiber schemes by introducing them into ring and mesh MAN in simulations. The results reveal that DOBS can exponentially reduce the burst dropping probability. Moreover, since DOBS can be implement using commercially available devices and dark fibers, it is commercially viable in metro networks.     

可编程光缓存器在OBS中的应用

对之前报道的两种可编程光缓存器结构在光突发交换网中的应用进行了仿真研究.构建了仿真平台,选取支持QoS的JET协议,提出了一种简单的资源调度算法,在相同网络流量的情况下,对比研究了采用两种可编程光缓存器和固定时间光缓存器时,OBS网络在丢包率和时延等方面的差异.仿真结果表明,两种可编程光缓存器在以上性能方面有良好的优越性.因此该可编程光缓存器可较好地解决光突发交换网突发包的冲突问题.     

一种支持业务均衡的OBS自适应多可达性路由机制

针对光突发交换(OBS)网络中如何高效解决频繁发生的光突发竞争问题,提出了一种支持业务均衡的OBS自适应多可达性路由机制(AMR-LB).首先根据发送端发送业务量大小和当前网络业务承载状态,按需地为光突发确定多可达性路由;然后在非线性规划下,自适应地调整各条路由的业务承载比例.通过性能仿真,并与自适应替代路由算法(AA...     

基于GMPLS的光突发交换体系及其关键技术

文章给出了基于通用多协议标签交换(GMPLS)的光突发交换(OBS)对等体系(GLOBS)的功能结构和分层视图.在此范畴内,针对标签空间减小和流量工程两方面,结合国内外最新的研究动态,比较了各种已有技术的优缺点,并提出了适合于GLOBS体系的可能的解决方案以及今后工作的重要技术问题.     

光突发交换网络中基于标记可抢占的调度算法

根据光突发交换(OBS)网络核心节点的结构和功能 特点,分析了OBS网络核心节点的数据信道 调度算法,提出了一种新的基于标记可抢占调度算法(LPSA),并讨论和分析了算法的实 现过程。本文算法根据到达核心节点的控制包所属业务等级的突发数据(OB)包占用的网络带 宽决定 数据信道调度的方法,实现了合理的使用数据信道和各业务类别间的业务区分,最终达到改 善OBS网络性能的目的。     

Hybrid switching and p-routing for optical burst switching networks

One promising switching technology for wavelength-division multiplexing optical networks is optical burst switching (OBS). However, there are major deficiencies of OBS. (1) The delay offset between a control message and its corresponding data burst is based on the diameter of a network. This affects network efficiency, quality-of-service, and network scalability.( 2) OBS adopts one-way resource reservation scheme, which causes frequent burst collision and, thus, burst loss. We address the above two important issues in OBS. In particular, we study how to improve the performance of delay and loss in OBS. To reduce the end-to-end delay, we propose a hybrid switching scheme. The hybrid switching is a combination of lightpath switching and OBS switching. A virtual topology design algorithm based on simulated annealing to minimize the longest shortest path through the virtual topology is presented. To minimize burst collision and loss, we propose a new routing algorithm, namely, p-routing, for OBS network. The p-routing is based on the wavelength available probability. A path that has higher available probability is less likely to drop bursts due to collision. The probability-based p-routing can reduce the volatility, randomness, and uncertainty of one-way resource reservation. Our studies show that hybrid switching and p-routing are complementary and both can dramatically improve the performance of OBS networks.     

Labeled optical burst switching for IP-over-WDM integration

The rapid pace of development in both Internet applications and emerging optical technologies is bringing about fundamental changes in networking philosophies. Key trends are the emergence of dynamic wavelength provisioning and a corresponding reduction in wavelength provisioning timescales. As this transition continues, the current use of the wavelength-routing paradigm for carrying bursty Internet traffic will likely suffer from various shortcomings associated with circuit-switched networks. Meanwhile, optical packet switching technology is still facing significant cost and technological hurdles. Optical burst switching, or OBS, which represents a balance between circuit and packet switching, has opened up some exciting new dimensions in optical networking. This article describes the OBS paradigm, and also proposes the use of labeled OBS, or LOBS, as a natural control and provisioning solution under the ubiquitous IP multiprotocol label switching framework     

Hierarchical time-sliced optical burst switching

To overcome the need for large buffers to store contending bursts in optical burst switched (OBS) networks, a recent variant called time-sliced OBS (TSOBS) suggested that bursts be sliced and spread across multiple frames of fixed-length time-slots. Since TSOBS is rigid in its frame structure, this paper generalises TSOBS to allow a hierarchy of frames. Termed hierarchical TSOBS (HiTSOBS), this scheme supports several granularities of rates, and permits multiple traffic classes with different loss-delay requirements to efficiently share the network. Our contributions are as follows: first, we present an architecture for HiTSOBS and offer it as a viable option for the realisation of flexible and cost-effective OBS networks. Second, we develop mathematical analysis to study the loss and delay performance of the proposed HiTSOBS system. Finally, we present simulation results that captures these loss-delay tradeoff values. Our HiTSOBS architecture gives network operators the freedom to choose the right mix of traffic with desired loss-delay requirements to coexist in the network.     

OBSns:一种OBS通用仿真平台的设计

光突发交换(OBS)是当前全光交换网络技术的研究热点之一,而仿真是OBS研究的一种重要手段。为了给研究者提供方便,同时实现各种研究结果的对比,开发了一种通用的OBS网络仿真平台--OBSns。OBSns以网络仿真工具NS-2为基础,对突发数据传输采用虚拟化的方法,实现了OBS网络的关键元素如突发组装、突发控制分组生成和传输、突发调度等等。同时OBSns是开放的,其各个元素都可以替换,从而为新算法和协议的研究提供了便利。     

基于NS2的OBS网络仿真平台研究与实现

给出了一种基于NS-2的OBS网络仿真平台--OBS-NP(OBS-NS2-platform).该平台通过扩展NS-2中的节点类与链路类,支持对光突发交换(OBS)网络的运行及关键算法的仿真.在详细描述OBS-NP系统构成的基础上,以一个9节点OBS网络为基础,对网络中突发包的时延、吞吐量和资源利用率进行了仿真,并给出了突发包的路由信息.最后,对OBS-NP仿真结果的准确性进行了分析和讨论.     

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 stochastic model for the behavior of multiple TCP NewReno sources over optical burst switching network

This work proposes a stochastic model to characterize the transmission control protocol (TCP) over optical burst switching (OBS) networks which helps to understand the interaction between the congestion control mechanism of TCP and the characteristic bursty losses in the OBS network. We derive the steady-state throughput of a TCP NewReno source by modeling it as a Markov chain and the OBS network as an open queueing network with rejection blocking. We model all the phases in the evolution of TCP congestion window and evaluate the number of packets sent and time spent in different states of TCP. We model the mixed assembly process, burst assembler and disassembler modules, and the core network using queueing theory and compute the burst loss probability and end-to-end delay in the network. We derive expression for the throughput of a TCP source by solving the models developed for the source and the network with a set of fixed-point equations. To evaluate the impact of a burst loss on each TCP flow accurately, we define the burst as a composition of per-flow-bursts (which is a burst of packets from a single source). Analytical and simulation results validate the model and highlight the importance of accounting for individual phases in the evolution of TCP congestion window.     

OBS网络中的虚拟突发交换技术

针对由于网络复杂度提高,突发数据在预留时冲突可能性增大,导致OBS网络性能下降的情况,提出OBS网络中的虚拟突发交换技术和相应的实现技术。其汇聚机制是基于服务类别的虚拟汇聚,调度策略对应有两种：非抢占调度策略和抢占调度策略。利用虚拟突发交换技术有利于减少信道碎片,提高链路利用率,提供可靠的QOS保证。用OPNET系统仿真工具进行验证,结果表明：虚拟突发交换与OBS传统交换方式相比有较高网络链路的利用率,较少的控制分组和数据突发的丢包率,增加了整个网络的吞吐量。     

一种新型光交换技术:光码标签突发包交换

一种新型光交换技术-光码标签突发包交换技术。该技术是光突发包交换与光码标签交换的结合体，具有两者的共同优点，是一种性能优良的光交换技术。本文首先介绍了该技术的原理，然后给出了网络节点功能结构的设计，最后讨论了该技术的性能。     

An experimental study of an optical burst switching network based on wavelength-selective optical switches

In this article we report the system structure and test results of an experimental optical burst switching network with three edge router's and one core node. Wavelength-selective switches developed for this system and their characteristics are depicted. The implementation and performance of our new scheme for the just-in-time protocol are described. We also report experimental results of FTP and VOD services on this system. Some parameters, including traffic rate, average burst data length, and assembly time, are studied.     

A burst loss probability model with impatient customer feature for optical burst switching networks

We consider optical delay line buffer as a solution to reduce the number of lost burst in optical burst switching, one of the promising candidates for future networks. Such network takes burst loss as an important performance criteria in the design step. Network performance, however, cannot be captured efficiently using traditional queueing models, because they often ignore the impatience of messages traveling through optical switches which is one of the popular issues in communication networks. In this paper, we develop an analytic model for this system using queueing theory and considering special impatience features. Simulation results show that (i) the developed model with impatience features can decrease burst loss probability ( ? 10%) compared with other approaches, and (ii) applying that model, we demonstrate that shared buffer architecture in optical burst switching network with optical buffer often achieves lower burst loss probability than dedicated buffer way in several different scenarios. Copyright © 2014 John Wiley & Sons, Ltd.