A Delay Constrained Minimum Hop Distributed Routing Algorithm using Adaptive Path Prediction

Abstract— We propose a new delay-constrained minimumhop distributed routing algorithm (DCMH) for unicastrouting. DCMH uses a novel path feasibility prediction (PFP) model that is able to predict the feasibility of a tentative routing path, and employs a crankback facility. It is a hybrid algorithm where it uniquely integrates the use of local-state and the global binary connectivity information maintained at each node to compute routing paths. Simulation results show that average message overhead is modest with good connection success and low nodal storage.

• Type: Journal
• Year: 2007
• Where: JNW
• Authors: Azizul R. Mohd. Shariff, Michael E. Woodward
• Keywords: JNW 2007, Path Feasibility Prediction, Routing, Tentative Routing Path