Multiservice QoS-Enabled MAC for Optical Burst Switching

The emergence of a broad range of network-driven applications (e.g., multimedia, online gaming) brings in the need for a network environment able to provide multiservice capabilities with diverse quality-of-service (QoS) guarantees. In this paper, a medium access control protocol is proposed to support multiple services and QoS levels in optical burst-switched mesh networks without wavelength conversion. The protocol provides two different access mechanisms, queue-arbitrated and prearbitrated for connectionless and connection-oriented burst transport, respectively. It has been evaluated through extensive simulations and its simplistic form makes it very promising for implementation and deployment. Results indicate that the protocol can clearly provide a relative quality differentiation for connectionless traffic and guarantee null (or negligible, and thus acceptable) burst loss probability for a wide range of network (or offered) load while ensuring low access delay for the higher-priority traffic. Furthermore, in the multiservice scenario mixing connectionless and connection-oriented burst transmissions, three different prearbitrated slot scheduling algorithms are evaluated, each one providing a different performance in terms of connection blocking probability. The overall results demonstrate the suitability of this architecture for future integrated multiservice optical networks

A Survey of Quality of Service Differentiation Mechanisms for Optical Burst Switching Networks

Cataloged from PDF version of article.This paper presents an overview of Quality of Service (QoS) differentiation mechanisms proposed for Optical Burst Switching (OBS) networks. OBS has been proposed to couple the benefits of both circuit and packet switching for the ‘‘on demand’’ use of capacity in the future optical Internet. In such a case, QoS support imposes some important challenges before this technology is deployed. This paper takes a broader view on QoS, including QoS differentiation not only at the burst but also at the transport levels for OBS networks. A classification of existing QoS differentiation mechanisms for OBS is given and their efficiency and complexity are comparatively discussed. We provide numerical examples on how QoS differentiation with respect to burst loss rate and transport layer throughput can be achieved in OBS networks. © 2009 Elsevier B.V. All rights reserved

QoS Considerations in OBS Switched Backbone Net-Works

Optical Burst Switching (OBS) was proposed as a hybrid switching technology solution to handle the multi-Terabit volumes of traffic anticipated to traverse Future Generation backbone Networks. With OBS, incoming data packets are assembled into super-sized packets called data bursts and then assigned an end to end light path. Key challenging areas with regards to OBS Networks implementation are data bursts assembling and scheduling at the network ingress and core nodes respectively as they are key to minimizing subsequent losses due to contention among themselves in the core nodes. These losses are significant contributories to serious degradation in renderable QoS. The paper overviews existing methods of enhancing it at both burst and transport levels. A distributed resources control architecture is proposed together with a proposed wavelength assignment algorithm

Performance issues in optical burst/packet switching

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-01524-3_8This chapter summarises the activities on optical packet switching (OPS) and optical burst switching (OBS) carried out by the COST 291 partners in the last 4 years. It consists of an introduction, five sections with contributions on five different specific topics, and a final section dedicated to the conclusions. Each section contains an introductive state-of-the-art description of the specific topic and at least one contribution on that topic. The conclusions give some points on the current situation of the OPS/OBS paradigms

Contribution to Proving Absolute QoS in OBS Networks

This Final Master Project introduces a new strategy to provide QoS in IP/OBS networks, using routing with prioritization based on statistics, named RPBS. A new method is provided and subsequently validated. This proposal uses the feedback scheme in optical networks to provide statistical knowledge with the objective of finding a suitable route to reach each destination from a specific source node, with more chance of success. This yields a twofold outcome. First, the losses can be reduced in a big number due to statistics. Second, the delays are also reduced compared with other methods based on feedback scheme. These two improvements allow better QoS provision, supporting class differentiation and more efficient resources utilization. The benefits of this proposal are quantified and further compared against existent alternatives by simulations

A framework for Deterministic Delay Guarantee in OBS Networks

In OBS networks, the delay of control packets in the switch control unit (SCU) of core nodes influences burst loss performance in the optical switching and should be constrained. Furthermore, the end-to-end (E2E) delay requirements of premium services need queueing delay guarantee in network nodes throughout the transmission path. For this purpose, a framework for deterministic delay guarantee is proposed in this article. It incorporates the deterministic delay model in the ingress edge node as well as in the SCUs of core nodes. On this basis, the configuration of the assembler and the offset time is addressed by means of an optimization problem under the delay constraints. Scenario studies are carried out with reference to realistic transport network topologies. Compared to statistical delay models in the literature, the deterministic model has advantages in rendering robust absolute delay guarantee for individual FEC flows, which is especially appreciated in the provisioning of premium services. By performance evaluation in comparison with the statistical models, it is shown that the adopted deterministic delay models lead to practical delay bounds in a magnitude that is close to the delay estimations by stochastic analysis

A GMPLS/OBS network architecture enabling QoS-aware end-to-end burst transport

This paper introduces a Generalized Multi-Protocol Label Switching (GMPLS)-enabled Optical Burst Switched (OBS) network architecture featuring end-to-end QoS-aware burst transport services. This is achieved by setting up burst Label Switched Paths (LSPs) properly dimensioned to match specific burst drop probability requirements. These burst LSPs are used for specific guaranteed QoS levels, whereas the remaining network capacity can be left for best-effort burst support. Aiming to ensure the requested burst drop probability figures even under bursty traffic patterns, burst LSPs’ performance is continuously monitored. Therefore, GMPLS-driven capacity reconfigurations can be dynamically triggered whether unfavorable network conditions are detected. Through the paper, the GMPLS/OBS architecture is firstly detailed, followed by the presentation of the optimized methods used for the initial burst LSP dimensioning. The successful network performance is finally illustrated by simulations on several network scenarios.Preprin

Cost functions in optical burst-switched networks

Optical Burst Switching (OBS) is a new paradigm for an all-optical Internet. It combines the best features of Optical Circuit Switching (OCS) and Optical Packet Switching (OPS) while avoidmg the mam problems associated with those networks .Namely, it offers good granularity, but its hardware requirements are lower than those of OPS. In a backbone network, low loss ratio is of particular importance. Also, to meet varying user requirements, it should support multiple classes of service. In Optical Burst-Switched networks both these goals are closely related to the way bursts are arranged in channels. Unlike the case of circuit switching, scheduling decisions affect the loss probability of future burst This thesis proposes the idea of a cost function. The cost function is used to judge the quality of a burst arrangement and estimate the probability that this burst will interfere with future bursts. Two applications of the cost functio n are proposed. A scheduling algorithm uses the value of the cost function to optimize the alignment of the new burst with other bursts in a channel, thus minimising the loss ratio. A cost-based burst droppmg algorithm, that can be used as a part of a Quality of Service scheme, drops only those bursts, for which the cost function value indicates that are most likely to cause a contention. Simulation results, performed using a custom-made OBS extension to the ns-2 simulator, show that the cost-based algorithms improve network performanc