TITLE

Serialised batch scheduling algorithm for optical burst switching networks

AUTHOR(S)
Cao, X.; Joseph, J.; Li, J.; Xin, C.
PUB. DATE
March 2009
SOURCE
IET Communications;Mar2009, Vol. 3 Issue 3, p353
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
A new scheduling algorithm called serialised batch scheduling (SBS) for optical burst switching (OBS) networks is proposed. SBS aggregates and serialises bursts along a shared path into one composite burst, which is switched as one unit. There are two major processes in SBS, namely, batching and serialising. While the batching process chooses a set of bursts to form the composite burst, the serialising process determines how to organise the OBS bursts within the composite burst and generates a corresponding control packet for this burst. Several SBS batching and serialising schemes are introduced and analysed here. The study by the authors shows that the guard band and burst overlap can be reduced in the SBS and, thus, the packet loss rate and the number of switch reconfigurations can be significantly reduced. In addition, it is indicated that the proposed SBS algorithm can be coupled with other OBS scheduling algorithms and reduce the requirements for a high-speed optical switch in OBS networks.
ACCESSION #
36858570

 

Related Articles

  • A new algorithm for packet routing problems using chaotic neurodynamics and its surrogate analysis. Kimura, Takayuki; Ikeguchi, Tohru // Neural Computing & Applications;2007, Vol. 16 Issue 6, p519 

    We propose a new algorithm for routing packets which effectively avoids packet congestion in computer networks. The algorithm involves chaotic neurodynamics. To realize effective packet routing, we first composed a basic method by a neural network, which routes packets with shortest path...

  • Dynamically Avoiding the Substantial Throughput Penalty of FRR. Ramesh, K.; Ahmed, Zameer // International Journal of Computer Applications;8/1/2012, Vol. 51, p25 

    Disclosed is a system for dynamically suppressing Fast Retransmission and Recovery (FRR) on high-latency Transport Control Protocol (TCP) connections with low ongoing packet loss. This system measures the relative rate of recent packet loss and adjusts the suppression of FRR based on the...

  • A New Routing Algorithm in MANETS: Location Aided Hybrid Routing. Basavaraddi, Chethan Chandra S.; B., Geetha N. // International Journal of Computer Technology & Applications;2012, Vol. 3 Issue 2, p760 

    In this paper, we propose a new hybrid routing protocol for MANET called Location Aided Hybrid Routing Protocol for MANET (LAHRP). The proposed routing algorithm not only aims to optimize bandwidth usage of MANETs by reducing the routing overload but also extend battery life of the mobile...

  • Bandwidth Optimization through Dynamic Routing in ATM Networks: Genetic Algorithm & Tabu Search Approach. Routray, Susmi; Sherry, A. M.; Reddy, B. V. R. // Enformatika;2006, Vol. 12, p171 

    Asynchronous Transfer Mode (ATM) is widely used in telecommunications systems to send data, video and voice at a very high speed. In ATM network optimizing the bandwidth through dynamic routing is an important consideration. Previous research work shows that traditional optimization heuristics...

  • Congestion Control in Wireless Ad Hoc Networks by Enhancement of Transmission Control Protocol. Premalatha, N.; Natarajan, A. M. // Journal of Computer Science;2011, Vol. 7 Issue 12, p1824 

    Problem statement: Transmission Control Protocol is the Internet's most widely used transport control protocol. TCP's strength lies in the adaptive nature of its congestion avoidance and control algorithm and its retransmission mechanism. In TCP Vegas rerouting (a path), which change the...

  • A Packing Problem Approach to Lightpath Assignment in an Optical Ring. Poulain, David; Tomasik, Joanna; Weisser, Marc-Antoine; Barth, Dominique // Computer Journal;Aug2014, Vol. 57 Issue 8, p1155 

    We present our work on the dimensioning of a packet-switching wavelength division multiplexing ring in order to reduce its infrastructure (capital expenditure) cost. We study a new all-optical architecture: the packed optical add-drop multiplexer (POADM). We aim to minimize the overall cost of...

  • Application of the generalised ballot theorem for evaluation of performance in packet buffers with non-first in first out scheduling. Ariffin, S. H. S.; Schormans, J. A.; Ma, A. H. I. // IET Communications;Jun2009, Vol. 3 Issue 6, p933 

    Packet scheduling is a vital component to support different classes of service in all-packet networks. In classical queuing systems, the waiting-time performance of non-first in first out buffer scheduling systems could be predicted through the use of analysis. However, all-packet networks...

  • A Real-Time Measurement Algorithm for Available Bandwidth. Yi Yin; Weidong // International Journal of Communications, Network & System Scienc;Nov2009, Vol. 2 Issue 8, p746 

    Available bandwidth estimation is useful for route selection in overlay networks, QoS, and traffic engineering. Many measurement algorithms, such as Pathload, Pathchar, and Packet Transmission Rate (PTR) method, etc. have been proposed. PTR method sends a sequence of packet trains to...

  • Efficient Variable Length Block Switching Mechanism. C. D., Jaidhar; Reddy, A. V. // International Journal of Computers, Communications & Control;Sep2007, Vol. 2 Issue 3, p269 

    Most popular and widely used packet switch architecture is the crossbar. Its attractive characteristics are simplicity, non-blocking and support for simultaneous multiple packet transmission across the switch. The special version of crossbar switch is Combined Input Crossbar Queue (CICQ) switch....

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics