NDLI: Dynamic distributed unicast routing: optimal incremental paths

Content Provider	Springer Nature Link
Author	Heydarian, Mohsen
Copyright Year	2013
Abstract	Developing new mathematical frameworks such as distributed dynamic routing algorithms for constructing optimal incremental paths from a node to another node is an important challenge in data communication networks. These new algorithms can model network resources optimally and increase network performances. A bundle of single routes in a current communication path, which starts from a source node and ends to a destination node, can consist of several successive nodes and links. The Incremental term emphasizes that the number of routes (links and nodes) in a current path can change so that achieving more data rate and optimal efficiency in the network. In this paper, our problem is to add/omit some routes consisting of some nodes and links to/from the current unicast path dynamically and optimally. We call this problem the Optimal Dynamic Distributed Unicast Routing (ODDUR) problem and it is a NP-complete problem. This problem can be formulated as a new type of Linear Programming Problem (LPP) for finding a minimum cost multichannel unicast path, which this path will minimize end-to-end delay and bandwidth consumption along the routes from the source node to the destination node. In this paper, at first a new mathematical framework will be constructed and then this framework will propose the new optimal dynamic distributed unicast routing algorithm for solving our LPP problem. This algorithm will compute an optimal solution for our LPP based on the simplex method and postoptimality computations and will reduce computations and consumed time. Simulation results will show that our new algorithm is more efficient than other available algorithms in terms of utilization of bandwidths and data rate.
Starting Page	214
Ending Page	244
Page Count	31
File Format	PDF
ISSN	09208542
Journal	The Journal of Supercomputing
Volume Number	68
Issue Number	1
e-ISSN	15730484
Language	English
Publisher	Springer US
Publisher Date	2013-11-16
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Distributed incremental path Dynamic routing Optimal path Unicasting Linear programming Programming Languages, Compilers, Interpreters Processor Architectures Computer Science
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Information Systems Hardware and Architecture Software

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 high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

Ant-based survivable routing in dynamic WDM networks with shared backup paths

Distributed Path-Based Inference in Semantic Networks

Optimization of Dynamic Hardware Reconfigurations

Checkpointing Distributed Shared Memory

Formally Analyzed Dynamic Synthesis of Hardware

Component Management in a Dynamic Architecture

Coordination Algorithm for Distributed Testing

Software Architectures and Coordination Models

Dynamic distributed unicast routing: optimal incremental paths

Similar Documents

A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

Ant-based survivable routing in dynamic WDM networks with shared backup paths

Distributed Path-Based Inference in Semantic Networks

Optimization of Dynamic Hardware Reconfigurations

Checkpointing Distributed Shared Memory

Formally Analyzed Dynamic Synthesis of Hardware

Component Management in a Dynamic Architecture

Coordination Algorithm for Distributed Testing

Software Architectures and Coordination Models

Dynamic distributed unicast routing: optimal incremental paths