Browsing by Subject "Optical Burst Switching (OBS)"

Now showing 1 - 3 of 3

Open Access
A new adaptive burst assembly algorithm for OBS networks considering capacity of control plane
(2008) Çırak, İsmail
Recent developments in wavelength-division multiplexing (WDM) technology increase the amount of bandwidth available in fiber links by many orders of magnitude. However, this increase in link capacities is limited by the conventional electronic router’s capability. Optical burst switching (OBS) has been proposed as a promising and a short-term solution for switching technology to take advantage of increased capacity of optical links. The congestion in OBS control plane and the adaptive burst assembly algorithms are two important research topics that are among the most effective factors determining the performance of OBS networks. These two problems have been separately studied in the literature so far. It has been shown that contending bursts at a core optical switch in an OBS network may experience unfair loss rates based on their residual off- set times and burst lengths, that are called path length priority effect (PLPE) and burst length priority effect (BLPE), respectively. In this thesis, we propose a new adaptive timer-based burst assembly algorithm (ATBA) which uses loss rate measurements for determining the burstification delays of traffic streams in order to mitigate the undesired effects of PLPE and BLPE. ATBA distributes the burst generation rates of traffic streams at an ingress node such that total rate of generated bursts is constant in order to constrain the congestion in the control plane. Without ATBA, the fairness index drops to 76% when per hop processing delay (PHPD) is increasing. With ATBA, the fairness index drops only to 85% with increasing PHPD. It is also shown that the total goodput of the OBS network improves by 5% compared with the case without ATBA.
Open Access
Quality of service analysis for slotted optical burst switching networks
(2008) Öztürk, Onur
Optical burst switching (OBS) is proposed as the switching paradigm of nextgeneration optical Internet. In OBS, IP packets from access networks are assembled into longer units of bursts allowing a lower level of switching granularity offered by the readily available optical technology. Although OBS was asynchronous in the earlier work, slotted OBS (SOBS) has recently caught the attention of the researchers due to performance gains achievable with synchronous infrastructures. In this thesis, we study the blocking probabilities in a slotted optical burst switching node fed with independent and identically distributed Poisson burst traffic and for which the burst sizes are a fixed integer multiple of the slot length. We develop a discrete time Markov chain based framework to obtain the blocking probabilities in systems with and without QoS differentiation. In particular, we study priority scheduling and offset-based QoS differentiation mechanisms for SOBS networks. The latter problem suffers from the curse of dimensionality, which we address by a discrete phase type approximation for the discrete Poisson distribution. The results obtained by using the moment-matched phase type distribution are shown to provide a very accurate approximation for the blocking probabilities. Finally, we extend our framework to analyze the hybrid priority scheduling with unity-offset based differentiation scheme which proves to outperform the others in the degree of class isolation. We show that increasing burst length has an adverse affect on the attained QoS level. We also give a quantitative discussion of the trade off between the burst blocking probability and the slot granularity. As the slot duration is decreased, burst transmissions can be initiated in an earlier time decreasing the end-to-end delay in an SOBS network with a penalty of increased burst loss probability. We evaluate the burst blocking probabilities of a classless and two-class SOBS nodes as a function of the slot length, number of wavelengths and traffic load.
Open Access
Wavelength assignment in optical burst switching networks using neuro-dynamic programming
(2003) Keçeli, Feyza
All-optical networks are the most promising architecture for building large-size, hugebandwidth transport networks that are required for carrying the exponentially increasing Internet traffic. Among the existing switching paradigms in the literature, the optical burst switching is intended to leverage the attractive properties of optical communications, and at the same time, take into account its limitations. One of the major problems in optical burst switching is high blocking probability that results from one-way reservation protocol used. In this thesis, this problem is solved in wavelength domain by using smart wavelength assignment algorithms. Two heuristic wavelength assignment algorithms prioritizing available wavelengths according to reservation tables at the network nodes are proposed. The major contribution of the thesis is the formulation of the wavelength assignment problem as a continuous-time, average cost dynamic programming problem and its solution based on neuro-dynamic programming. Experiments are done over various traffic loads, burst lengths, and number of wavelength converters with a pool structure. The simulation results show that the wavelength assignment algorithms proposed for optical burst switching networks in the thesis perform better than the wavelength assignment algorithms in the literature that are developed for circuit-switched optical networks.