NDLI: RYNSORD: a novel, decentralized algorithm for railway networks with "soft reservation"

Content Provider	IEEE Xplore Digital Library
Author	Razouqi, Q. Lee, T. Ghosh, S.
Copyright Year	1998
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA (Razouqi, Q.)
Abstract	This paper presents RYNSORD (a novel decentralized algorithm with soft reservation for efficient scheduling and congestion mitigation in railway networks), wherein every train utilizes lookahead to dynamically re-plan its route. Thus, a train, currently at position X and headed for the ultimate destination position Y, first requests and reserves N tracks, ahead of its current position, for use at appropriate future times. The N tracks are chosen either along the shortest path or an alternate shortest path where the tracks of the two paths are mutually exclusive. The train issues two sets of requests, concurrently, for the tracks on the two paths. After it has been granted reservations, the train selects the path that promises the quickest arrival time at the final destination. The train moves through the N tracks and, upon completion, it again requests and reserves N subsequent tracks ahead of itself. The process continues until the train reaches its destination, Y. The reservation process may be characterized by less abruptness and greater flexibility in negotiation between the trains and stations. This characteristic is termed "soft" reservations in this paper. Under "soft reservations", a train negotiating for N tracks will, in general, always succeeds. This paper also reports on an implementation of RYNSORD and a distributed approach that is similar to RYNSORD except that it employs hard reservations, on a network of SUN spare workstations, configured as a loosely-coupled parallel processor. Experimental results are presented.
Starting Page	2585
Ending Page	2589
File Size	563534
Page Count	5
File Format	PDF
ISBN	0780343204
ISSN	10903038
DOI	10.1109/VETEC.1998.686227
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-05-21
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Rail transportation Processor scheduling Scheduling algorithm Tracking Switches Computer science Railway engineering Sun Workstations Stochastic processes
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

RYNSORD: a novel decentralized algorithm for railway networks with soft reservation

Stability of RYNSORD, a decentralized algorithm for railway networks, under perturbations

Stability of RYNSORD-a decentralized algorithm for railway networks under perturbations

An Ant Algorithm for the Reception-Departure Line Assignment Problem

Stochastic Scheduling

Generating optimal schedules for an underground railway line

The synthetical optimization of railway hub shift working plan

Stochastic soft backpressure algorithms for routing and scheduling in wireless ad-hoc networks

Stochastic Scheduling with Availability Constraints in Heterogeneous Clusters

RYNSORD: a novel, decentralized algorithm for railway networks with "soft reservation"

Similar Documents

RYNSORD: a novel decentralized algorithm for railway networks with soft reservation

Stability of RYNSORD, a decentralized algorithm for railway networks, under perturbations

Stability of RYNSORD-a decentralized algorithm for railway networks under perturbations

An Ant Algorithm for the Reception-Departure Line Assignment Problem

Stochastic Scheduling

Generating optimal schedules for an underground railway line

The synthetical optimization of railway hub shift working plan

Stochastic soft backpressure algorithms for routing and scheduling in wireless ad-hoc networks

Stochastic Scheduling with Availability Constraints in Heterogeneous Clusters

RYNSORD: a novel, decentralized algorithm for railway networks with "soft reservation"