Prioritized burst segmentation and composite burst-assembly techniques for QoS support in optical burst-switched networks

We address the issue of providing quality-of-service (QoS) in an optical burst-switched network. QoS is provided by introducing prioritized contention resolution policies in the network core and a composite burst-assembly technique at the network edge. In the core, contention is resolved through prioritized burst segmentation and prioritized deflection. The burst segmentation scheme allows high-priority bursts to preempt low-priority bursts and enables full class isolation between bursts of different priorities. At the edge of the network, a composite burst-assembly technique combines packets of different classes into the same burst, placing lower class packets toward the tail of the burst. By implementing burst segmentation in the core, packets that are placed at the tail of the burst are more likely to be dropped than packets that are placed at the head of the burst. The proposed schemes are evaluated through analysis and simulation, and it is shown that significant differentiation with regard to packet loss and delay can be achieved.     

A Novel Optical Burst Assembly Technique Based on a Dynamic Threshold Mechanism to Support Scalable QoS

In IP networks, coarse packet classification is a scalable QoS solution. Similarly, it can also be utilized to an OBS network. In order to match IP QoS requirements with the data processing capacity and flexibility of OBS networks, we propose a novel optical burst assembly technique, which is based on mapping rules and a dynamic threshold mechanism called ATQ-DT. How to map the IP QoS to burst priority is resolved by the mapping rules, and how to efficiently allocate the assembly capacity among classes belonging to the same priority is answered by ATQ-DT. This mechanism determines the maximum share for each class, which is proportional to the current unused capacity. Among the three mapping rules we propose, TQ-MAP is the most reasonable one because it considers both the traffic condition and the QoS requirement. As shown by simulation results, the assembly technique ATQ-DT with TQ-MAP can most remarkably improve the packets loss probability (PLP) to support QoS.     

一种基于资源动态分配的光突发装配新技术

在粗颗粒分类基础上提出了一种新的光突发装配技术。它包括两个方面：映射规则，主要解决某一优先级光突发可以装配的类别分组，提出了S映射、Q映射和TQ映射3种规则，其差别主要在于映射是否具有自适应性；动态门限装配能力分配方案，即ATQ-DT，主要解决如何动态、合理地分配光突发装配能力。TQ映射和ATQ-DT可随服务质量(QoS)要求和负载情况的变化而自动调整映射关系和装配门限。经仿真表明：它们的组合，即“TQ映射 ATQ-DT”在保证各分组类别的分组损失率(PLP)上效果最为明显。     

一种自适应光突发装配映射机制及性能仿真

分组粗颗粒分类因有良好的扩展性,可作为OBS(Optical Burst Switching)网络的QoS(Quality of Service)实现基础。然而OBS网络因其固有限制而只能支持较少的突发优先级,因此OBS常采用多类别光突发装配技术。该文在粗颗粒分类基础上,提出了一种新的适用于这类装配的映射机制TQ-Map,即确定某一优先级光突发可以装配哪些类别分组。自适应性是该机制的突出特点,主要体现在:映射关系能随各类分组的QoS要求和负载的改变而自动进行调整。仿真表明:TQ-Map机制的自适应性能有效保证突发装配与上层QoS要求相匹配(以分组损失率为衡量指标)。     

Hybrid offset‐time and burst assembly algorithm (H‐OTBA) for delay sensitive applications over optical burst switching networks

Optical burst switching (OBS) is the most favourable switching paradigm for future all‐optical networks. Burst assembly is the first process in OBS and it consists of aggregating clients packets into bursts. Assembled bursts wait for an offset time before being transmitted to their intended destinations. Offset time is used to allow burst control packet reserve required resources prior to burst arrival. Burst assembly process and offset‐time create extra delay in OBS networks. To make OBS suitable for real time applications, this extra latency needs to be controlled. This paper proposes and evaluates a novel offset time and burst assembly scheme to address this issue. Constant bit rate (CBR) traffic that has stringent end‐to‐end delay QoS requirements is used in this study. The proposed scheme is called hybrid offset‐time and burst assembly algorithm (H‐OTBA). The objective of the paper is achieved by controlling maximum burst transfer delay parameters of CBR. The proposed scheme was evaluated via network simulation. Simulation results demonstrate that, H‐OTBA has effectively reduced end‐to‐end delay for CBR traffic compared with current solutions. Copyright © 2014 John Wiley & Sons, Ltd.     

New assembly techniques and fast reservation protocols for optical burst switched networks based on traffic prediction

We propose new burst assembly schemes and fast reservation (FR) protocols for Optical Burst Switched (OBS) networks that are based on traffic prediction. The burst assembly schemes aim at minimizing (for a given burst size) the average delay of the packets incurred during the burst assembly process, while the fast reservation protocols aim at further reducing the end-to-end delay of the data bursts. The burst assembly techniques use a linear prediction filter to estimate the number of packet arrivals at the ingress node in the following interval, and launch a new burst into the network when a certain criterion, different for each proposed scheme, is met. The fast reservation protocols use prediction filters to estimate the expected length of the burst and the time needed for the burst assembly process to complete. A Burst Header Packet (BHP) packet carrying these estimates is sent before the burst is completed, in order to reserve bandwidth at intermediate nodes for the time interval the burst is expected to pass from these nodes. Reducing the packet aggregation delay and the time required to perform the reservations, reduces the total time needed for a packet to be transported over an OBS network and is especially important for real-time applications. We evaluate the performance of the proposed burst assembly schemes and show that a number of them outperform the previously proposed timer-based, length-based and average delay-based burst assembly schemes. We also look at the performance of the fast reservation (FR) protocols in terms of the probability of successfully establishing the reservations required to transport the burst.     

Modeling and Synthesis of Traffic in Optical Burst-Switched Networks

We analyze burst assembly process as the main building block of the optical burst switching (OBS) paradigm. The analysis is performed for time-based, volume-based, as well as hybrid burst assemblers. Under the assumption that the process of packet arrival to the assembly buffer is Poisson, exact analytical expressions are derived for length and interdeparture time of bursts that are generated by these three classes of assembly algorithms. Furthermore, we consider the issue of generating burst trace, which arises during the performance evaluation of OBS networks through discrete-event simulation. In such a simulation study, a significant part of the simulation time, particularly in the case of a network with a large number of ingress nodes, is used by the implementation of the burst assembly algorithms. This is due to the fact that each data burst is a result of aggregating several short-length packets, which-in a straightforward approach-have to be individually generated and, afterward, ldquomeltedrdquo into the burst. We present a novel approach to fast generation of bursts, which is based on the analytical models that are developed for burst length and burst interdeparture time distributions as well as an efficient generation technique (composition) supporting the generation of these distributions. The analysis is completed by numerical results that validate the accuracy of developed models and demonstrate the speedup gain of using proposed burst generation algorithms.     

Burstification Queue Management in Optical Burst Switching Networks

Among the various issues lying in optical burst switching (OBS) networks, burstification, i.e., assembling multiple IP packets into bursts, is an important one. Between the two important aspects related to burst assembly, the burst assembly algorithm aspect has been extensively studied in the literature. However, as far as we know, there is no research about the burstification queue management (BQM) aspect, which refers to how many burstification queues (BQ) we should set at each OBS edge node and how to manage these BQs. Suppose there are G destinations (egress edge nodes) and the OBS network provides S different quality of service (QoS) classes. Traditionally, it is simply regarded that each ingress edge node needs G· S queues to sort incoming packets, one for each possible destination and QoS class. For simplicity, we call this policy the static dedicate BQM (SDB) policy. The SDB policy, though simple, lacks scalability since we have to add S BQs at each OBS edge node if an extra OBS edge node is added to the OBS network. To solve this problem, we propose in this paper two BQM policies: quasi-static BQM (QSB) policy and dynamic BQM (DB) policy. For the QSB policy, we derive the packet loss probability due to lacking BQs based on a Markov chain, from which we can work out the employed number of BQs for a given packet loss probability. Based on these results, the scalability of the QSB policy is also studied. With the DB policy, we not only can dynamically assign BQs for incoming packets, but also can dynamically allocate buffer capacity for each BQ by using a least-mean-square (LMS)-based linear prediction filter. The performance of the DB policy is investigated by analysis and extensive simulations. We also compared the performance of the QSB policy and the DB policy. Results from analysis and simulation demonstrate that the DB policy is the best.     

支持QoS的自适应门限复合光突发装配技术

该文提出了一种新的光突发装配技术,该技术由自适应门限突发装配算法和基于优先级的随机 化的偏移时间设置方案构成.该装配算法特别适合于多类别分组混合装配,能让所有类别的分组公平有效地使用装配能力,能较好地与IP层的QoS机制相匹配。计算机仿真结果表明该文提出的光突发装配技术在性能上具有一定优越性.     

光突发交换网络中支持QoS的一种竞争处理机制

分段丢弃是最近提出的一种资源竞争解决方法.该文对尾部丢弃竞争处理方法中存在的弊端进行了分析.提出了改进的头部丢弃处理方法,该方法是当竞争重叠部分长度小于整个后到的竞争突发数据的长度时就丢弃后到突发数据的头部,否则就丢弃整个后到突发数据.为了更好地支持区分服务和尽可能地减少错序,该文还提出了基于优先级的混合封装机制.仿真结果证明基于优先级的混合封装机制和改进的头部丢弃方法联合使用时,对降低分组丢失率及支持区分服务等性能效果很明显.     

一种光突发交换网络中基于优先级的冲突解决方法的研究

该文提出一种解决光突发交换网络节点中突发数据包冲突的方法。发生冲突时,首先基于不同的优先级对突发数据包进行分割,然后根据这种分割方法提出了一种突发数据包的组合封装方式,最后利用计算机对其进行了模拟。可以看出这种方法对高优先级的突发数据包以及IP数据包有很好的保护作用,可以很好地实现服务质量QoS(Quality of Service)机制。     

光突发交换网络中的突发分组组装策略

光突发交换(OBS)技术集成光电路交换和光分组交换的优势,能满足现有大容量、高速率的多媒体信息交换与传输,将成为下一代光IP骨干网的核心技术。本文详细论述了OBS网络中的关键技术———突发分组的组装技术的各种策略与实现方式,指出具有良好QoS保证又可降低可操控性的突发组装策略将成为最佳选择。     

Burst scheduling for differentiated services in optical burst switching WDM networks

Optical burst switching (OBS) is one of the most important switching technologies for future optical wavelength division multiplexing (WDM) networks and the Internet. The model of differentiated services has been proposed to support quality of service (QoS) in the IP‐based Internet. It is also very important to have differentiated service support in OBS networks. When the burst scheduling in an OBS network is set up appropriately, network can support differentiated services. In this paper, we proposed a new burst scheduling scheme, called differentiated scheduling with identical priority offset time (DSIPO). In DSIPO, the same priority offset time is used for all the bursts destined to the same edge node regardless of their priorities. Differentiated services in terms of burst loss probability are achieved by processing the control packets of higher priority class bursts, thus reserving resources for their data bursts, more promptly upon their arrival than those of lower priority class bursts. Each intermediate (core) node can adjust the burst loss probabilities of various burst classes by choosing its own differentiated processing delay value for each priority class or its own differentiated processing delay difference value between any pair of adjacent priority classes. We model and analyse DSIPO in terms of the burst loss probability for each priority class with simulation validation. The performance of DISPO is evaluated by simulation. Copyright © 2004 John Wiley & Sons, Ltd.     

On the analysis of burst-assembly delay in OBS networks and applications in delay-based service differentiation

In Optical Burst Switching (OBS), packets travel through the network core as part of longer-size optical bursts, which do not suffer electronic conversion until they reach an eggress point. Typically, such optical bursts comprise tens or hundreds of packets, which are assembled/deassembled at border nodes. During the burst-formation process, each arriving packet must wait until the final burst is complete, which clearly adds an extra delay on each packet in the burst, especially on those arriving earlier. However, such burst-assembly delay may be excessive for the appropriate performance of certain applications, mainly real-time interactive ones. This work’s findings are twofold: first, it characterises the burst-assembly delay distribution of each packet in a burst arisen by the main assembly algorithms found in the literature; and, second, it introduces a new burst-assembly strategy that takes into account the particular delay constrains of packets in the formation of optical bursts, along with a detailed study of its properties. This work has been funded by the “Ministerio de Educación y Ciencia” of Spain under grant TEC2006-03246.     

A novel contention solution strategy based on priority for optical burst switching networks

A fundamental issue in optical burst switching (OBS) networks is to solve the burst contention for the core node. In this paper, a novel priority-based contention solution strategy for OBS networks is proposed. When the contention occurs, the burst priority is considered firstly, and then the burst segmentation method is used for the low priority bursts in this strategy. Ensuring the integrity of high priority bursts, part of the segmented bursts can be transmitted to the destination node via combining wavelength conversion and optical buffer method. Simulation results show that the proposed scheme not only ensures the integrity of high priority bursts, but also reduces the packet loss rate of the low priority bursts maximally, so that it can support good quality of service (QoS) for the network.     

Dynamic wavelength selection and delayed burst assignment schemes for Optical Burst Switching networks

Optical Burst Switching (OBS) has been proposed as a promising switching technology for the next generation of optical transport networks. In this paper, we address the issue of how to provide proportional differentiated services in OBS networks. Firstly, a Dynamic Wavelength Selection (DWS) scheme is introduced to provide proportional differentiated services in bufferless OBS networks by dynamically assigning more and longer periods of wavelengths to high priority classes. This scheme can also utilize wavelengths efficiently because the wavelengths are shared among different classes. Next, a Delayed Burst Assignment (DBA) scheme is introduced, by which bursts of the high priority class are given a higher probability for reserving wavelengths by scheduling the bursts of the low priority class with a delay to provide quality of service (QoS) in OBS networks. The integration of these two schemes provides proportional differentiated services and improves the burst loss performance by giving the burst head packet (BHP) two opportunities of scheduling its data burst (DB).     

Burst transmission algorithm to improve packet level performance in contention-free slotted OBS networks

In contention-free slotted optical burst switching (SOBS) networks, controllers are utilized in order to manage the time-slot assignment, avoiding congestions among multiple burst transmissions. In this network, bursts are never lost at intermediate nodes but packets are lost at an ingress edge node due to a burst transmission algorithm. In addition, packet transmission delay increases depending on the algorithm. In order to improve packet level performance, in this paper, we propose a new burst transmission algorithm. In this method, two different thresholds are used; one is used to send a control packet to a controller and the other is used to assemble a burst. With these thresholds, a time slot can be assigned to a burst in advance and packet level performance can be improved. In order to evaluate its packet level performance and investigate the impact of thresholds, we also propose a queueing model of a finite buffer where a batch of packets are served in a slot of a constant length. Numerical results show that our proposed method can decrease packet loss probability and transmission delay with two thresholds. In addition, we show that our analysis results are effective to investigate the performance of the proposed method when the number of wavelengths is large.     

Optical burst switching: a viable solution for terabit IP backbone

Wavelength-division multiplexing has emerged as an important physical layer technology. Optical transmission provides a physical layer capable of carrying bits at the speed at the order of a gigabit per second. Optical burst switching is proposed to overcome the shortcomings of conventional WDM deployment, such as lack of fine bandwidth granularity in wavelength routing and electronic speed bottlenecks in SONET/SDH. We describe an architecture for IP network over the OBS WDM transmission core. The use of MPLS-type technique for forwarding data bursts and the inclusion of a medium access control layer between the optical (WDM) and IP layers are the key ingredients of the proposed architecture. In particular, the architecture is based on provisioning MPLS paths, also called label switched paths, of desired quality of service through the OBS WDM transmission core. The MAC layer performs various OBS-specific functions, such as burst assembly, burst scheduling, and offset setting/traffic shaping. While burst assembly and burst scheduling are relatively straightforward, we point out that the offset setting strategy has significant impact on the performance of IP network operating over OBS WDM core. We describe a shaping scheme to set the offset, an important system parameter for OBS, between the successive data bursts of a given data stream (label switched path) and their associated control packets. This scheme results in robust operation of the network and also facilitates traffic engineering. Guidelines are provided for implementing various IP QoS mechanisms in the optical backbone using OBS.     

OBS网络中基于优先级的先分割后缓存冲突解决方法

为了有效地降低突发包的丢失率和保证OBS网络中不同优先级业务的服务质量,提出了一种基于优先级的先分割后缓存冲突解决方法。该方法通过在多波长信道系统的输出数据信道上设置光纤延迟线组来缓存被分割的冲突突发包。当冲突发生时,首先基于突发包的优先级和处理完毕时间进行"竞争突发包头部分割或者原突发包尾部分割"处理;无冲突部分进行交换或者直接在事先预留的输出数据信道上处理,冲突部分的分割突发包进行光缓存。仿真结果表明,多波长信道系统中,高优先级突发包的丢失率低于低优先级突发包的丢失率。同时该方法在一定程度上可以有效地减少端到端的传输时延和整个网络的丢包率,从而提高整个OBS网络的性能。     

光突发交换网络基于优先级与突发包分割的光缓存方法

为了保证光突发交换(OBS)网络中不同优先级业务的服务质量(Qos)和有效地降低突发包的丢失率,提出了一种基于优先级与突发包分割的光缓存方法.该方法通过在输出数据信道上设置光纤延迟线组来缓存被分割的冲突突发包.当冲突发生时,基于突发包的优先级进行"竞争突发包头部分割或者原突发包尾部分割,,处理;无冲突部分进行交换或者直...