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.     

A Novel Framework for IP DiffServ over Optical Burst Switching Networks

This paper presents a novel framework for IP Differentiated Services (DiffServ) over optical bursts witching (OBS), namely, DS-OBS. The network architecture, functional model of edge nodes and core nodes,the control packet format, a novel burst assembly scheme at ingress nodes and scheduling algorithm of core nodes are presented. The basic idea is to apply DiffServ capable burst assembly at ingress nodes and perform different per hop behavior (PHB) electronic treatments for control packets of different QoS class services at core nodes. Simulation results show that the proposed schemes can provide the best differentiated service for expedited forwarding (EF), assured forwarding (AF) and best effort (BE) services in terms of end-to-end delay, throughput and IP packet loss probability.     

OBS网络中基于优先级与概率的偏射路由算法*

摘 要：为了保证OBS网络中不同优先级业务的服务质量和解决偏射算法在偏射控制上的问题,提出了一种基于优先级与概率的偏射路由算法。该算法根据突发包的优先级和转发概率来控制突发包的偏射,并从网络突发阻塞概率的意义上寻找最佳偏射路由。当冲突发生时,分割优先级低的突发包,并将分割突发包偏射到空闲的链路上;节点根据链路上指定的权值,按概率为分割突发包选择一条可以使网络突发阻塞概率最小的最佳偏射路由。仿真结果表明,虽然网络中可选路由数目的增加对网络性能的改善非常有限,但是该算法能够有效的降低整个网络的丢包率,并且得到的高优先级突发包的丢失率低于低优先级突发包的丢失率,从而很好的保障了网络的服务质量。故这种方法能够有效的提高OBS网络的性能。     

An integrated congestion control mechanism for optimized performance using two-step rate controller in optical burst switching networks

Optical burst switching (OBS) is a promising solution to implement the optical internet backbone. However, the lack of adequate congestion-control mechanisms may result in high burst loss. Schemes such as fiber delay line (FDL), wavelength conversion, and deflection routing to reduce burst collision are unable to prevent the network congestion effectively. To address this problem, we propose and investigate a global solution, called Integrated Congestion-Control Mechanism (ICCM), for OBS networks. ICCM, which combines congestion avoidance with recovery mechanism, restricts the amount of burst flows entering the network according to the feedback information from core routers to edge routers to prevent network congestion. Also, a flow-policing scheme is proposed to intentionally drop the overloaded traffic with a certain probability at a core router to support fairness among flows. Moreover, the transmission rate of each flow is controlled to achieve optimized performance such as maximizing throughput or minimizing loss probability using two-step rate controller at the edge router. Simulation results show that ICCM effectively eliminates congestion within the network and that, when combined with a flow-policing mechanism, the fairness for competing flows can be supported while maintaining effective network performance.     

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.     

Interleaved Traffic Splitting: A promising technique to solve False Timeout

In this paper, we analyze the False Timeout (FTO) problem that TCP flows suffered in OBS networks and propose Interleaved Traffic Splitting (ITS) to solve the problem. We show that the collision loss of ACK bursts may also cause FTO, which has been neglected by previous researchers. As TCP Sack is designed to recover from multiple packet losses, we find that a Sack flow can recover its data transmission without triggering retransmission timeout if packet loss is not too severe. This suggests limiting the number of packets carried by a single burst. In ITS, this is achieved by carrying out a parallel, interleaved burst assembly process at each ingress OBS edge router. We show that ITS tackles the FTO problem caused by the loss of both data and ACK bursts. Unlike other existing approaches, the ITS scheme requires only modification to the assembly/de-assembly mechanisms implemented at the edge routers. It does not add complexities to the network management or the router design. In this paper, both analytical and simulation results are presented to demonstrate the performance improvement of ITS. Our analysis further shows that the use of two parallel bursts is optimum for ITS.     

On burst rescheduling in OBS networks with partial wavelength conversion capability

The core nodes in an optical burst switching (OBS) network are normally equipped with wavelength converters (WCs) to reduce the burst loss probability. Since WCs are expensive and still immature technologically, it is desirable to reduce the number of WCs in the network and to have partial wavelength conversion capability at the core nodes. Nevertheless, a majority of algorithms in the literature are proposed under the full wavelength conversion assumption. As a result, they do not consider the burst loss caused by insufficient WCs, i.e., bursts dropped due to the unavailability of free WCs to convert them to unused wavelengths. In this paper, we demonstrate how to use burst rescheduling to decrease the burst loss due to insufficient WCs and hence cut down on the overall burst loss probability in OBS networks. Two burst rescheduling algorithms are proposed. Their effectiveness in reducing the overall burst loss probability is verified through simulation experiments.     

OBS网络中汇聚机制对边缘结点时延特性的影响

提出了一种边缘结点时延特性分析模型,将边缘结点时延分为组装时延、突发排队时延和偏置时延;在分析光突发交换汇聚机制的基础上指出组装时延对时延特性影响最大;从理论上分析了三种不同组装算法的组装时延,并通过仿真验证了理论分析的正确性;利用仿真研究了在Possion和自相似业务输入下边缘结点的时延特性。分析和仿真结果表明,边缘结点时延特性主要由组装时延决定,与所选取的组装算法和算法参数有密切关系,并且爱输入业务自相似性的影响。     

Link scheduling state information based offset management for fairness improvement in WDM optical burst switching networks

In wavelength division multiplexed (WDM)-based optical burst switching (OBS) networks, bursts that traverse longer paths are more likely to be dropped compared to bursts that traverse shorter paths resulting in a fairness problem. Fairness here refers to having, for all ingress–egress node pairs in a network, a burst to have equal likelihood to get through independent of the hop length involved. In this paper, we develop a link scheduling state based fairness improvement method which can be used in a classless as well as a multi-class environment. The basic idea is to collect link scheduling state information and use it to determine the offset times for routes with different hop lengths. By using the online link state information, this method periodically computes and adapts the offset times needed, thus inherently accounting for the traffic loading patterns and network topological connectivity. It also ensures that the delay experienced by a burst is low and shorter-hop bursts are not over-penalized while improving the performance of longer-hop bursts. The effectiveness of the proposed method is evaluated through simulation experiments.     

基于部分专用波长的OBS网络冲突规避机制

提出一种适用于光突发交换网络(OBS)的新型冲突预先规避机制.相应于OBS网络中的每个入口边缘节点,本文根据流量情况为其分配一个或一个以上的专用波长,突发包将沿着专用波长通道传送至不同的目的节点,中间节点处的冲突能够被部分消除.通过构建流量负载平衡扩张树、波长重用以及统计复用波长信道的使用,网络资源利用率仍然保持在一个合理的水平.与光纤延迟线和突发包分段的方案相比,本方案能够实现更低的丢包率.     

Slotted Optical Burst Switching (SOBS) networks

In the paper, we study Optical Burst Switching (OBS) networks. Since OBS still suffers high loss ratio due to the lack of buffer at the OBS core routers, we study methods to reduce the loss without using optical buffers. We consider time-slotted OBS called Slotted OBS (SOBS), where routers are synchronized and only send fixed length bursts at the beginning of time slots. Our simulation results show that SOBS reduces the packet loss probability significantly. Moreover, we show that SOBS can be implemented with little or no additional cost and has other advantages such as providing better support for Quality of Service (QoS).     

An optical burst reordering model for time-based and random selection assembly strategies

Contention resolution schemes in optical burst switched networks (OBS) as well as contention avoidance schemes delay burst delivery and change the burst arrival sequence. The burst arrival sequence usually changes the packet arrival sequence and degrades the upper layer protocols performance, e.g., the throughput of the transmission control protocol (TCP).In this paper, we present and analyze a detailed burst reordering model for two widely applied burst assembly strategies: time-based and random selection. We apply the IETF reordering metrics and calculate explicitly three reordering metrics: the reordering ratio, the reordering extent metric and the TCP relevant metric. These metrics allow estimating the degree of reordering in a certain network scenario. They estimate the buffer space at the destination to resolve reordering and quantify the number of duplicate acknowledgements relevant for investigations on the transmission control protocol.We show that our model reflects the burst/packet reordering pattern of simulated OBS networks very well. Applying our model in a network emulation scenario, enables investigations on real protocol implementations in network emulation environments. It therefore serves as a substitute for extensive TCP over OBS network simulations with a focus on burst reordering.     

Correlating burst events on streaming stock market data

We address the problem of monitoring and identification of correlated burst patterns in multi-stream time series databases. We follow a two-step methodology: first we identify the burst sections in our data and subsequently we store them for easy retrieval in an efficient in-memory index. The burst detection scheme imposes a variable threshold on the examined data and takes advantage of the skewed distribution that is typically encountered in many applications. The detected bursts are compacted into burst intervals and stored in an interval index. The index facilitates the identification of correlated bursts by performing very efficient overlap operations on the stored burst regions. We present the merits of the proposed indexing scheme through a thorough analysis of its complexity. We also manifest the real-time response of our burst indexing technique, and demonstrate the usefulness of the approach for correlating surprising volume trading events using historical stock data of the NY stock exchange. While the focus of this work is on financial data, the proposed methods and data-structures can find applications for anomaly or novelty detection in telecommunication, network traffic and medical data.     

OBS通用仿真模型的设计与实现

仿真是通信网络技术研究中一种非常有效的分析手段,但对于光突发交换（OBS）这种新型的光交换技术,目前还缺乏一种通用的仿真模型.该文在总结现有光突发交换技术的基础上,以OPNET Modeler为工具建立了一种通用的OBS仿真模型.提出了一种在不损失精度的条件下对OBS网络体系结构进行简化设计的方案,并根据仿真需要对OBS关键设备边缘节点和核心节点的逻辑结构进行了重新设计,同时为增加模型的灵活性,增设了数据源节点和初始化节点.目的是要建立一种灵活、易用、可扩展性强的通用OBS仿真模型.     

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.     

光突发交换网络中QoS机制研究与实现

光突发交换作为下一代光互联网最有前途的解决方案已经越来越受到人们的关注,如何增强光突发交换网络的服务质量(QoS)保障能力,已成为光交换领域内的一个重要研究课题。论文对光突发交换网络中基于偏置时间的QoS机制进行了研究,采用低优先级直接丢弃算法,结合突发分片技术和最近可用信道-空隙填充算法,提出了一种新的QoS解决方案,通过建立相应的光突发交换网络模型对该解决方案进行了仿真比较,仿真结果表明该方案可以明显地降低阻塞率,提高信道利用率,为各类业务提供良好的QoS保障。     

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.     

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

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

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.     

光突发交换网络中无缓存冲突解决模型的研究

光突发交换网络被认为是未来光网络发展的趋势,而突发包在节点的冲突问题却是光突发交换网络中一个非常需要解决的问题,目前很多情况下使用的光缓存技术虽然可以缓解冲突问题,但是却增加了节点结构的复杂性和噪声。论文首先提出一种基于优先级的冲突解决方法,并给出了突发包的封装格式,然后利用三种无缓存的冲突解决模型对不同优先级突发包的冲突问题进行了详细的叙述和比较。