Quantitative QoS guarantees in labeled optical burst switching networks

Abstract

This paper presents a detailed architecture for providing quantitative QoS guarantees in labeled optical burst switching (LOBS) networks. Packets are assembled into data bursts based on their respective forwarding equivalence class (FEC) at ingress nodes. The burst assembly algorithm employs two parameters to control the burst blocking probability and burst assembly delay. We deploy a fair packet queueing (FPQ) algorithm in each edge node to regulate access to a wavelength scheduler. For LOBS core nodes, we present a novel approach that applies FPQ scheduling algorithms to the control plane of these nodes to guarantee fair bandwidth allocation. Based on the information provided by the queued control bursts, the core FPQ algorithm creates a virtual queue of data bursts in core nodes, then it selects the eligible control burst to be processed by the wavelength scheduler. In addition, we present analytical expressions for the worst case delay and the blocking probability in the proposed architecture. Simulation results demonstrate that the proposed architecture provides accurate and controllable service differentiation in LOBS networks.