JOURNAL OF NETWORKS (JNW)
ISSN : 1796-2056
Volume : 2    Issue : 3    Date : June 2007

A Delay Constrained Minimum Hop Distributed Routing Algorithm using Adaptive Path Prediction
Azizul R. Mohd Shariff and Mike E. Woodward
Page(s): 46-57
Full Text:
PDF (469 KB)


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.

Index Terms
distributed algorithm, routing, quality of service, path feasibility prediction