Deflection Routing Strategies for Optical Burst Switching Networks: Contemporary Affirmation of the Recent Literature

A promising option to raising busty interchange in system communication could be Optical Burst Switched (OBS) networks among scalable and support routing effective. The routing schemes with disputation resolution got much interest, because the OBS network is buffer less in character. Because the deflection steering can use limited optical buffering or actually no buffering thus the choice or deflection routing techniques can be critical. Within this paper we investigate the affirmation of the current literature on alternate (deflection) routing strategies accessible for OBS networks

An assembly and offset assignment scheme for self-similar traffic in optical burst switching

Includes bibliographical references.Optical Burst Switching (OBS) is a viable technology for the next generation core network. We propose an FEC-assembly scheme that efficiently assembles self-similar traffic and a Pareto-offset assignment rather than a constant offset assignment. Two buffers, a packet buffer and a burst buffer, are implemented at the Label Edge Router (LER), buffering traffic in the electronic domain. The assembler, between the packet and burst buffers, is served by the packet queue while the assembler serves the burst queue. We outline advantages of why burst assembly cannot be implemented independent of offset assignment. The two schemes must be implemented in a complementary way if QoS is to be realized in an OBS network. We show that there is a direct relation between OBS network performance with burst assembly and offset assignment. We present simulation results of the assembly and offset assignment proposals using the ns2 network simulator. Our results show that the combination of the proposed FEC-Based assembly scheme with the proposed Pareto-offset assignment scheme give better network performance in terms of burst drop, resource contention and delay. Key to any traffic shaping is the nature traffic being shaped. This work also compares performance of both traditional exponential traffic with realistic Self-Similar traffic of Internet traffic on the proposed assembly and offset assignment schemes. In our simulations, we assume that all Label Switch Routers (LSR) have wavelength converters and are without optical buffers. We use Latest Available Unused Channel with Void Filling (LAUC-VF) scheduling scheme and use Just Enough Time (JET) reservation scheme

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

Improving Routing Efficiency, Fairness, Differentiated Servises And Throughput In Optical Networks

Wavelength division multiplexed (WDM) optical networks are rapidly becoming the technology of choice in next-generation Internet architectures. This dissertation addresses the important issues of improving four aspects of optical networks, namely, routing efficiency, fairness, differentiated quality of service (QoS) and throughput. A new approach for implementing efficient routing and wavelength assignment in WDM networks is proposed and evaluated. In this approach, the state of a multiple-fiber link is represented by a compact bitmap computed as the logical union of the bitmaps of the free wavelengths in the fibers of this link. A modified Dijkstra\u27s shortest path algorithm and a wavelength assignment algorithm are developed using fast logical operations on the bitmap representation. In optical burst switched (OBS) networks, the burst dropping probability increases as the number of hops in the lightpath of the burst increases. Two schemes are proposed and evaluated to alleviate this unfairness. The two schemes have simple logic, and alleviate the beat-down unfairness problem without negatively impacting the overall throughput of the system. Two similar schemes to provide differentiated services in OBS networks are introduced. A new scheme to improve the fairness of OBS networks based on burst preemption is presented. The scheme uses carefully designed constraints to avoid excessive wasted channel reservations, reduce cascaded useless preemptions, and maintain healthy throughput levels. A new scheme to improve the throughput of OBS networks based on burst preemption is presented. An analytical model is developed to compute the throughput of the network for the special case when the network has a ring topology and the preemption weight is based solely on burst size. The analytical model is quite accurate and gives results close to those obtained by simulation. Finally, a preemption-based scheme for the concurrent improvement of throughput and burst fairness in OBS networks is proposed and evaluated. The scheme uses a preemption weight consisting of two terms: the first term is a function of the size of the burst and the second term is the product of the hop count times the length of the lightpath of the burst

Supporting differentiated quality of service in optical burst switched networks

We propose and evaluate two new schemes for providing differentiated services in optical burst switched (OBS) networks. The two new schemes are suitable for implementation in OBS networks using just-in-time (JIT) or just-enough-time (JET) scheduling protocols. The first scheme adjusts the size of the search space for a free wavelength based on the priority level of the burst. A simple equation is used to divide the search spectrum into two parts: a base part and an adjustable part. The size of the adjustable part increases as the priority of the burst becomes higher. The scheme is very easy to implement and does not demand any major software or hardware resources in optical cross-connects. The second scheme reduces the dropping probability of bursts with higher priorities through the use of different proactive discarding rates in the network access station (NAS) of the source node. Our extensive simulation tests using JIT show that both schemes are capable of providing tangible quality of service (QoS) differentiation without negatively impacting the throughput of OBS networks

Effect of burst assembly over TCP performance in optical burst switching networks

Cataloged from PDF version of article.Optical Burst Switching (OBS) is proposed as a short-term feasible solution that is capable of efficiently utilizing the optical bandwidth of the future Internet backbone. Performance evaluation of TCP traffic in OBS networks has been under intensive study, as TCP constitutes the majority of Internet traffic. Since burst assembly mechanism is one of the fundamental factors that determine the performance of an OBS network, we focus our attention on burst assembly and specifically, we investigate the influence of the number of burstifiers on TCP performance for an OBS network. We start with a simple OBS network scenario where very large flows are considered and losses resulting from the congestion in the core OBS network are modeled using a burst independent Bernoulli loss model. Then, a background burst traffic is generated in order to create contention at a core node realizing burst-length dependent losses. Finally, simulations are repeated for Internet flows where flow sizes are modeled using a Bounded Pareto distribution. Simulation results show that for an OBS network employing timerbased assembly algorithm, TCP goodput increases as the number of burst assemblers is increased for each loss model. The improvement from one burstifier to moderate number of burst assemblers is significant, but the goodput difference between moderate number of buffers and per-flow aggregation is relatively small, implying that a cost-effective OBS edge switch implementation should use moderate number of assembly buffers per destination. The numerical studies are carried out using nOBS, which is an ns2 based OBS simulation tool, built within this thesis for studying the effects of burst assembly, scheduling and contention resolution algorithms in OBS networks.Gürel, GürayM.S

Performance analysis of optical burst switching network

In this dissertation, after reviewing the new paradigm in the optical switching network invoked by the DWDM technology and studying the changes of the schemes, we design the new optical burst switching networks, analyze the performance of the proposed scheme and interpret the analysis results. For design point of view, the fairness guaranteeing scheme and burst blocking reduction schemes in the mesh networks, loss less burst transmission scheme in DWDM metro ring networks are considered. As a future broad band optical alternative, optical burst switching has been receive much focus. We review the property of the optical switching technologies such as optical packet switching, optical circuit switching, and optical burst switching. The benefits of the optical burst switching is illustrated. Even though optical burst switching has several advantage, it has intrinsic technology barrier. We study the research activities to remove the basic problem of optical burst switching. Optical deflection, optical burst segmentation, burst cloning, and burst piggy backing scheme is considered. To improve the network performance, we design optical burst switching network in mesh networks and metro ring networks. We also implement the proposed network by our own developed network test bench. We verify the proposed network performance by analyzing the network mathematically in terms of blocking rate, delay and throughput. The theoretical results are compared with the simulation results. The verification shows that our proposed schemes outperform those of the conventional scheme. Our mathematical models are also matched to the simulation results. The interpretation of the verification shows that our assumption and theoretical analysis is well designed. The results illustrate that the difference between the simulation results and mathematical results is within the considerable margin. The contribution of the thesis is that the performance improvement schemes in both of the mesh network and ring network are proposed and analyzed. By considering feasibility of the future optical networks, proposed scheme in this thesis is more deployable in commercial network in terms of the burst blocking rate and delay as well as the network stability

Traffic and performance evaluation for optical networks. An Investigation into Modelling and Characterisation of Traffic Flows and Performance Analysis and Engineering for Optical Network Architectures.

The convergence of multiservice heterogeneous networks and ever increasing Internet applications, like peer to peer networking and the increased number of users and services, demand a more efficient bandwidth allocation in optical networks. In this context, new architectures and protocols are needed in conjuction with cost effective quantitative methodologies in order to provide an insight into the performance aspects of the next and future generation Internets. This thesis reports an investigation, based on efficient simulation methodologies, in order to assess existing high performance algorithms and to propose new ones. The analysis of the traffic characteristics of an OC-192 link (9953.28 Mbps) is initially conducted, a requirement due to the discovery of self-similar long-range dependent properties in network traffic, and the suitability of the GE distribution for modelling interarrival times of bursty traffic in short time scales is presented. Consequently, using a heuristic approach, the self-similar properties of the GE/G/¿ are being presented, providing a method to generate self-similar traffic that takes into consideration burstiness in small time scales. A description of the state of the art in optical networking providing a deeper insight into the current technologies, protocols and architectures in the field, which creates the motivation for more research into the promising switching technique of ¿Optical Burst Switching¿ (OBS). An investigation into the performance impact of various burst assembly strategies on an OBS edge node¿s mean buffer length is conducted. Realistic traffic characteristics are considered based on the analysis of the OC-192 backbone traffic traces. In addition the effect of burstiness in the small time scales on mean assembly time and burst size distribution is investigated. A new Dynamic OBS Offset Allocation Protocol is devised and favourable comparisons are carried out between the proposed OBS protocol and the Just Enough Time (JET) protocol, in terms of mean queue length, blocking and throughput. Finally the research focuses on simulation methodologies employed throughout the thesis using the Graphics Processing Unit (GPU) on a commercial NVidia GeForce 8800 GTX, which was initially designed for gaming computers. Parallel generators of Optical Bursts are implemented and simulated in ¿Compute Unified Device Architecture¿ (CUDA) and compared with simulations run on general-purpose CPU proving the GPU to be a cost-effective platform which can significantly speed-up calculations in order to make simulations of more complex and demanding networks easier to develop

Resource allocation and scalability in dynamic wavelength-routed optical networks.

This thesis investigates the potential benefits of dynamic operation of wavelength-routed optical networks (WRONs) compared to the static approach. It is widely believed that dynamic operation of WRONs would overcome the inefficiencies of the static allocation in improving resource use. By rapidly allocating resources only when and where required, dynamic networks could potentially provide the same service that static networks but at decreased cost, very attractive to network operators. This hypothesis, however, has not been verified. It is therefore the focus of this thesis to investigate whether dynamic operation of WRONs can save significant number of wavelengths compared to the static approach whilst maintaining acceptable levels of delay and scalability. Firstly, the wavelength-routed optical-burst-switching (WR-OBS) network architecture is selected as the dynamic architecture to be studied, due to its feasibility of implementation and its improved network performance. Then, the wavelength requirements of dynamic WR-OBS are evaluated by means of novel analysis and simulation and compared to that of static networks for uniform and non-uniform traffic demand. It is shown that dynamic WR-OBS saves wavelengths with respect to the static approach only at low loads and especially for sparsely connected networks and that wavelength conversion is a key capability to significantly increase the benefits of dynamic operation. The mean delay introduced by dynamic operation of WR-OBS is then assessed. The results show that the extra delay is not significant as to violate end-to-end limits of time-sensitive applications. Finally, the limiting scalability of WR-OBS as a function of the lightpath allocation algorithm computational complexity is studied. The trade-off between the request processing time and blocking probability is investigated and a new low-blocking and scalable lightpath allocation algorithm which improves the mentioned trade-off is proposed. The presented algorithms and results can be used in the analysis and design of dynamic WRONs