NDLI: A two-time scale MDP-based routing algorithm, for DCLC problem

Content Provider	IEEE Xplore Digital Library
Author	Han Yue Liu Zeng-ji Qiu Zhi-liang Zhou Quan
Copyright Year	2009
Description	Author affiliation: ISN State Key Laboratory, Xidian University Xi'an China (Han Yue; Liu Zeng-ji; Qiu Zhi-liang) \|\| Xi'an Ist. of Space Radio Technology Xi'an China (Zhou Quan)
Abstract	The delay constrained least cost (DCLC) problem is to find the least cost path in a network subject to a delay constraint. Due to its NP-complete property, many heuristic methods have been proposed. However, these methods suffer from either high computation and communication complexity or low success ratio in finding the optimal path, or lack of scalability. In this paper, a new delay constrained least cost unicast routing algorithm called two-time scale MDP based DCLC is proposed. Based on the proposed two-time scale MDP model for DCLC problem, we define the optimal value function and the optimality equation. By using the policy iteration for solving the optimality equation, we always find the optimal path w.r.t the optimal policy in the probabilistic sense. The most attractive feature of the proposed algorithm is that it attains well scalability for the insensitivity to the network size. Extensive analyses show that the proposed algorithm not only has low computation and communication complexity, but also improves the load balance of large scale networks.
Starting Page	1
Ending Page	5
File Size	202338
Page Count	5
File Format	PDF
ISBN	9781424443376
DOI	10.1109/CHINACOM.2009.5339824
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-08-26
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Costs unicast routing algorithm Scalability Routing DCLC Complexity theory Equations Delay scalability Unicast MDP Computer networks Large-scale systems
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

A distributed heuristic algorithm on delay-constrained least-cost unicast routing

Logical Location-based Routing with Hole-shadowing in Large-scale MANETs

Energy-Balancing Multicast Routing Protocol for Wireless Sensor Networks

A new distributed routing algorithm for supporting delay-sensitive applications

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Enabling large-scale multicast simulation by reducing memory requirements

Performance optimizations for distributed real-time text indexing

Cluster based location-aware routing protocol for large scale heterogeneous MANET

Research on Unicast Routing for Deep Space Sensor Networks Based on DTN

A two-time scale MDP-based routing algorithm, for DCLC problem

Similar Documents

A distributed heuristic algorithm on delay-constrained least-cost unicast routing

Logical Location-based Routing with Hole-shadowing in Large-scale MANETs

Energy-Balancing Multicast Routing Protocol for Wireless Sensor Networks

A new distributed routing algorithm for supporting delay-sensitive applications

Cluster overlay broadcast (COB): MANET routing with complexity polynomial in source-destination distance

Enabling large-scale multicast simulation by reducing memory requirements

Performance optimizations for distributed real-time text indexing

Cluster based location-aware routing protocol for large scale heterogeneous MANET

Research on Unicast Routing for Deep Space Sensor Networks Based on DTN

A two-time scale MDP-based routing algorithm, for DCLC problem