5,628 research outputs found

    T-WAS and T-XAS algorithms for fiber-loop optical buffers

    No full text
    In optical packet/burst switched networks fiber loops provide a viable and compact means of contention resolution. For fixed size packets it is known that a basic void-avoiding schedule (VAS) can vastly outperform a more classical pre-reservation algorithm as FCFS. For the setting of a uniform distributed packet size and a restricted buffer size we proposed two novel forward-looking algorithms, WAS and XAS, that, in specific settings, outperform VAS up to 20% in terms of packet loss. This contribution extends the usage and improves the performance of the WAS and XAS algorithms by introducing an additional threshold variable. By optimizing this threshold, the process of selectively delaying packet longer than strictly necessary can be made more or less strict and as such be fitted to each setting. By Monte Carlo simulation it is shown that the resulting T-WAS and T-XAS algorithms are most effective for those instances where the algorithms without threshold can offer no or only limited performance improvement

    Exact performance analysis of a single-wavelength optical buffer with correlated inter-arrival times

    Get PDF
    Providing a photonic alternative to the current electronic switching in the backbone, optical packet switching (OPS) and optical bursts witching (OBS) require optical buffering. Optical buffering exploits delays in long optical fibers; an optical buffer is implemented by routing packets through a set of fiber delay lines (FDLs). Previous studies pointed out that, in comparison with electronic buffers, optical buffering suffers from an additional performance degradation. This contribution builds on this observation by studying optical buffer performance under more general traffic assumptions. Features of the optical buffer model under consideration include a Markovian arrival process, general burst sizes and a finite set of fiber delay lines of arbitrary length. Our algorithmic approach yields instant analytic results for important performance measures such as the burst loss ratio and the mean delay

    Equivalent random analysis of a buffered optical switch with general interarrival times

    Get PDF
    We propose an approximate analytic model of an optical switch with fibre delay lines and wavelength converters by employing Equivalent Random Theory. General arrival traffic is modelled by means of Gamma-distributed interarrival times. The analysis is formulated in terms of virtual traffic flows within the optical switch from which we derive expressions for burst blocking probability, fibre delay line occupancy and mean delay. Emphasis is on approximations that give good numerical efficiency so that the method can be useful for formulating dimensioning problems for large-scale networks. Numerical solution values from the proposed analysis method compare well with results from a discrete-event simulation of an optical burst switch

    A Novel QoS provisioning Scheme for OBS networks

    Get PDF
    This paper presents Classified Cloning, a novel QoS provisioning mechanism for OBS networks carrying real-time applications (such as video on demand, Voice over IP, online gaming and Grid computing). It provides such applications with a minimum loss rate while minimizing end-to-end delay and jitter. ns-2 has been used as the simulation tool, with new OBS modules having been developed for performance evaluation purposes. Ingress node performance has been investigated, as well as the overall performance of the suggested scheme. The results obtained showed that new scheme has superior performance to classical cloning. In particular, QoS provisioning offers a guaranteed burst loss rate, delay and expected value of jitter, unlike existing proposals for QoS implementation in OBS which use the burst offset time to provide such differentiation. Indeed, classical schemes increase both end-to-end delay and jitter. It is shown that the burst loss rate is reduced by 50% reduced over classical cloning

    Fill the void: improved scheduling for optical switching

    Get PDF
    With ever-increasing demand for bandwidth, optical packet/burst switching is proposed to utilize more of the available capacity of optical networks in the future. In these packet-based switching techniques, packet contention on a single wavelength is resolved effectively by means of Fiber Delay Lines. The involved scheduling algorithms are typically designed to minimize packet loss and/or packet delay. By filling so-called voids, void-filling algorithms are known to outperform their non-void-filling counterparts. This however comes at a large computational cost as the void-filling algorithms have to keep track of beginnings and endings of all voids. This is opposed to the non-void-filling algorithms which only have to keep track of a single system state variable. We therefore propose a new type of algorithm that selectively creates voids that are larger than strictly needed, only when these will likely be filled. Results obtained by Monte Carlo simulation show that selective void creation can jointly reduce packet loss by 50% and packet delay by 18%, without imposing a high computational cost

    A Hessenberg Markov chain for fast fibre delay line length optimization

    Get PDF
    In this paper we present an approach to compute the invariant vector of the N + 1 state Markov chain P presented in (Rogiest et al., Lecture Notes in Computer Science, NET-COOP 2007 Special Issue, pp. 4465:185-194) to determine the loss rate of an FDL buffer consisting of N lines, by solving a related Hessenberg system (i.e., a Markov chain skip-free in one direction). This system is obtained by inserting additional time instants in the sample paths of P and allows us to compute the loss rate for various FDL lengths by solving a single system. This is shown to be especially effective in reducing the computation time of the heuristic LRA algorithm presented in (Lambert et al., Proc. NAEC 2005, pp. 545-555) to optimize the FDL lengths, where improvements of several orders of magnitude can be realized

    Design of Routers for Optical Burst Switched Networks

    Get PDF
    Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers using optical data paths and electronic control. In this dissertation, we study the design of network components that are needed to build an OBS network. Specifically, we study the design of the switches that form the optical data path through the network. An OBS network that switches data across wavelength channels requires wave-length converting switches to construct an OBS router. We study one particular design of wavelength converting switches that uses tunable lasers and wavelength grating routers. This design is interesting because wavelength grating routers are passive devices and are much less complex and hence less expensive than optical crossbars. We show how the routing problem for these switches can be formulated as a combinatorial puzzle or game, in which the design of the game board determines key performance characteristics of the switch. In this disertation, we use this formu-lation to facilitate the design of switches and associated routing strategies with good performance. We then introduce time sliced optical burst switching (TSOBS), a variant of OBS that switches data in the time domain rather that the wavelength domain. This eliminates the need for wavelength converters, the largest single cost component of systems that switch in the wavelength domain. We study the performance of TSOBS networks and discuss various design issues. One of the main components that is needed to build a TSOBS router is an optical time slot interchanger (OTSI). We explore various design options for OTSIs. Finally, we discuss the issues involved in the design of network interfaces that transmit the data from hosts that use legacy protocols into a TSOBS network. Ag-gregation and load balancing are the main issues that determine the performance of a TSOBS network and we develop and evaluate methods for both
    corecore