NDLI: Routing in stochastic networks

Content Provider	IEEE Xplore Digital Library
Author	Key, R.
Copyright Year	2005
Description	Author affiliation: Draper Lab., Cambridge, MA, USA (Key, R.)
Abstract	This paper considers the problem of routing in a network where the travel times along the arcs are modeled as independent random variables. A standard approach to routing in such networks is to select a path with the least expected travel time. One of the problems with this approach is that it does not take into consideration, factors such as the travel time variance. Additionally, such an approach implicitly assumes each user in the network has the same routing objective. In this paper we develop an approach to routing in stochastic networks in which these problems are addressed. The fundamental concept in our approach is that, for a given user with a set of routing options at a given node, we approximate the distributions of travel time for these options. Using these approximate distributions, the options are compared according to a user-specified routing objective, and the best option is selected. The primary benefit of this approach is that one is not limited to a particular routing objective as the computed distributions of travel time allow us to efficiently determine an effective routing option for an arbitrary routing objective that depends on factors of random travel time other than the mean. The distribution of travel time adopted in this paper is the minimum travel time probability distribution, which is the distribution of travel time over all fastest paths. In a class of networks termed as series-parallel networks, the minimum travel time distribution can be calculated efficiently. For general, non-series-parallel networks, the approximation we adopt is the minimum travel time distribution obtained from a related series-parallel network. The performance and the benefits of this approach to routing are illustrated on an example network.
Starting Page	861
Ending Page	866
File Size	1133625
Page Count	6
File Format	PDF
ISBN	0780388127
DOI	10.1109/ICNSC.2005.1461305
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-03-19
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Intelligent networks Stochastic processes Distributed computing Random variables Probability distribution Stochastic systems Dynamic programming Laboratories Approximation algorithms
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

Using stochastic-dominance relationships for bounding travel times in stochastic networks

Asynchronous stochastic approximation and Q-learning

Shortest paths in stochastic networks

Distributed Routing Algorithms for Wireless Multihop Networks

Interactive Simulation

Distributed dynamic programming

Optimal routing policy problems in stochastic time-dependent networks. II. Exact and approximation algorithms

Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms

Idempotent algorithms for discrete-time stochastic control through distributed dynamic programming

Routing in stochastic networks

Similar Documents

Using stochastic-dominance relationships for bounding travel times in stochastic networks

Asynchronous stochastic approximation and Q-learning

Shortest paths in stochastic networks

Distributed Routing Algorithms for Wireless Multihop Networks

Interactive Simulation

Distributed dynamic programming

Optimal routing policy problems in stochastic time-dependent networks. II. Exact and approximation algorithms

Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms

Idempotent algorithms for discrete-time stochastic control through distributed dynamic programming

Routing in stochastic networks