Early commit: an improved scheduling algorithm for reservation-based TDMA networks

Ajit S. Thyagarajan

doi:10.1117/12.265360

30 January 1997 Early commit: an improved scheduling algorithm for reservation-based TDMA networks

Ajit S. Thyagarajan

Proceedings Volume 2918, Emerging Components and Technologies for All-Optical Photonic Systems II; (1997) https://doi.org/10.1117/12.265360
Event: Photonics East '96, 1996, Boston, MA, United States

Abstract

We address the problem of scheduling data bursts with no intermediate queuing in high-speed networks. The problem is to determine the exact intermediate switch schedules such that each burst travels from source to destination without any queuing. We target applications which require high-speed burst transmissions and which can tolerate some degree of latency between requesting transmissions and the actual transmission of the burst itself. Such scenarios are common in satellite networks where the characteristics of the satellite links (multiple access, long delays) and the bursty nature of the traffic make it difficult to apply traditional network algorithms. In this paper, we analyze reservation-based algorithms for just-in-time scheduling of data bursts. These algorithms have been developed as part of the highball project, a high speed, packet-switched network using distributed reservation and scheduling algorithms. Simulations of these algorithms on various network topologies have shown good scheduling efficiencies. However, the data bursts incur a large scheduling delay since each reservation request must be received by all the nodes in the network. We then describe an improved scheduling algorithm which achieves higher scheduling efficiencies and lower scheduling delays by determining the schedule before all the nodes have received the request. We prove theoretically that the resulting burst schedules are consistent and collision- free, and analyze the performance of the algorithm via simulation. This idea can also be adapted to other parallel discrete event simulation (PDES) applications, such as intelligent highways, traffic control and distributed interactive simulation.

Citation Download Citation

Ajit S. Thyagarajan "Early commit: an improved scheduling algorithm for reservation-based TDMA networks", Proc. SPIE 2918, Emerging Components and Technologies for All-Optical Photonic Systems II, (30 January 1997); https://doi.org/10.1117/12.265360

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
12 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Switches

Satellites

Algorithm development

Algorithms

Computer simulations

Satellite communications

Switching

Show All Keywords

Keywords/Phrases

Search In:

Publication Years