Browsing by Subject "Packet switching (Data transmission)"

Now showing 1 - 7 of 7

Open Access
Analytical modeling of multi-channel optical burst switching with multiple traffic classes
(2011) Dinç, Volkan
In this thesis, we study an Optical Burst Switching (OBS) node with links carrying multiple wavelength channels (called hereafter channels) with multiple traffic classes. We assume that offset-based service differentiation is used to differentiate among these traffic classes in terms of packet loss probabilities. We first propose a basic scheme, called bLAUC (Basic Latest Available Unused Channel) for channel scheduling. Although practicality of the bLAUC scheme is relatively limited when compared to other conventional schedulers such as LAUC, we study bLAUC in this thesis due to its tractability to analysis and moreover bLAUC possesses certain crucial properties of conventional schedulers. We then propose an iterative procedure to approximate per-class loss probabilities for the OBS link of interest when packet arrivals to the link are Poisson and packet lengths are exponentially distributed. In our iterative procedure, we model a multi-channel OBS link with Poisson arrivals by a single channel Markov fluid queue with occupancy-dependent packet arrival intensities. The proposed procedure provides acceptable approximations for a wide range of scenarios with relatively low complexity. Consequently, the proposed procedure can be used in optimization problems concerning multiclass OBS and in finding guidelines to effectively utilize OBS resources under loss probability constraints.
Open Access
Congestion window based adaptive burst assembly for TCP traffic in optical burst switching networks
(2008) Özsaraç, Seçkin
Burst assembly is one of the key factors affecting the TCP performance in Optical Burst Switching (OBS) networks. Timer based burst assembly algorithm generates bursts independent of the rate of TCP flows. When TCP congestion window is small, the fixed-delay burst assembler waits unnecessarily long, which increases the end-to-end delay and decreases the TCP goodput. On the other hand, when TCP congestion window becomes larger, the fixed-delay burst assembler may unnecessarily generate a large number of small-sized bursts, which increases the overhead and decreases the correlation gain, resulting in a reduction in the TCP goodput. Using simulations, we show that the usage of the congestion window (cwnd) size of TCP flows in the burst assembly algorithm consistently improves the TCP goodput (by up to 38.4%) compared with the fixed-delay timer based assembly even when the timer based assembler uses the optimum assembly period threshold value. One limitation of this proposed method is the assumption that the exact value of the congestion window is available at the burst assembler. We then extend the adaptive burstification algorithm such that the burst assembler uses estimated values of the congestion winpassive measurements at the ingress node. It is shown through simulations that even when estimated values are used, TCP goodput can achieve values close to the results obtained by using exact values of the congestion window. dow that are obtained via
Open Access
Dynamic threshold-based algorithms for communication networks
(2009) Toksöz, Mehmet Altan
A need to use dynamic thresholds arises in various communication networking scenarios under varying traffic conditions. In this thesis, we propose novel dynamic threshold-based algorithms for two different networking problems, namely the problem of burst assembly in Optical Burst Switching (OBS) networks and of bandwidth reservation in connection-oriented networks. Regarding the first problem, we present dynamic threshold-based burst assembly algorithms that attempt to minimize the average burst assembly delay due to burstification process while taking the burst rate constraints into consideration. Using synthetic and real traffic traces, we show that the proposed algorithms perform significantly better than the conventional timer-based schemes. In the second problem, we propose a model-free adaptive hysteresis algorithm for dynamic bandwidth reservation in a connection-oriented network subject to update frequency constraints. The simulation results in various traffic scenarios show that the proposed technique considerably outperforms the existing schemes without requiring any prior traffic information.
Open Access
Effect of burst length on loss probability in OBS networks with void-filling scheduling
(2006) Kamçı, Ahmet Kerim
Optical burst switching (OBS) is a new transport architecture for the next generation optical internet infrastructure which is necessary for the increasing demand of high speed data traffic. Optical burst switching stands between optical packet switching, which is technologically difficult, and optical circuit switching, which is not capable of efficiently transporting bursty internet traffic. Apart from its promising features, optical burst switching suffers from high traffic blocking probabilities. Wavelength conversion coupled with fiber delay lines (FDL) provide one of the best means of contention resolution in optical burst switching networks. In this thesis, we examine the relation between burst loss probability and burst sizes for void filling scheduling algorithms. Simulations are performed for various values of the processing and switching times and for different values of wavelengths per fiber and FDL granularity. The main contribution of this thesis is the analysis of the relationship between burst sizes and processing time and FDL induced voids. This in turn creates a better understanding of the burstification and contention resolution mechanisms in OBS networks. We show that voids generated during scheduling are governed by the FDL granularity and the product of the per-hop processing delay and residual number of hops until the destination. We also show that differentiation between bursts with different sizes is achieved for different network parameters and a differentiation mechanism based on burst lengths is proposed for OBS networks.
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
Traffic engineering and regenerator placement in MPLS and GMPLS networks with restoration
(2002) Yetginer, Emre