Abstract

In Polymorphous Optical Burst-Switched (POBS) networks, the Burst Control Packets (BCPs) of conventional Just-Enough-Time based signalling OBS networks are given extended properties which enable them not only to reserve fixed time-slots for asynchronous data bursts, but also to allocate TDM reservations for periodic streams of data, and even a complete wavelength for high-bandwidth demanding services. This allows POBS to provide a flexible, yet transparent, approach for supporting the idiosyncrasies of today's most popular services over the same underlying network architecture. In POBS, the spare gaps in between synchronous TDM reservations can be used for the allocation of best-effort data bursts, leading to a more efficient utilisation of the optical capacity.This work shows how to extend the well-known Erlang Fixed Point procedure to evaluate the performance behavior of POBS networks, whereby asynchronous data bursts coexist with high-priority periodic TDM reservations. The performance evaluation algorithm is applied to a number of case scenarios, showing the benefits arisen due to the flexibility of POBS networks.

© 2009 IEEE

Optimized Burst LSP Design for Absolute QoS Guarantees in GMPLS-Controlled OBS Networks

Pedro Pedroso, Jordi Perelló, Davide Careglio, Miroslaw Klinkowski, and Salvatore Spadaro
J. Opt. Commun. Netw. 4(2) 66-77 (2012)

Using the Network Load for Admission Control in OBS Networks: A Multilink Approach

Igor M. Moraes and Otto Carlos M. B. Duarte
J. Opt. Commun. Netw. 2(3) 137-147 (2010)

Reservation information sharing enhancement for deflection routing in OBS network

onghui Gao, Hanyi Zhang, and Zhiyu Zhou
Opt. Express 13(5) 1702-1709 (2005)

High-Priority First Transmission to Efficiently Support Service Differentiation in Just-in-Time OBS Networks

Guido Marchetto
J. Opt. Commun. Netw. 2(12) 1031-1041 (2010)

Hop-Based Burst-Cluster Transmission: Fairness Improvement in High-Performance OBS Networks

Takuji Tachibana, Badr Oulad Nassar, and Shoji Kasahara
J. Opt. Commun. Netw. 3(6) 542-552 (2011)