Research: A new distributed routing algorithm for supporting delay-sensitive applications

  • Authors:
  • Quan Sun;Horst Langendörfer

  • Affiliations:
  • Institute of Operating Systems and Computer Networks, Technical University of Braunschweig, Bültenweg 74/75, 38106 Braunschweig, Germany;Institute of Operating Systems and Computer Networks, Technical University of Braunschweig, Bültenweg 74/75, 38106 Braunschweig, Germany

  • Venue:
  • Computer Communications
  • Year:
  • 1998

Quantified Score

Hi-index 0.24

Visualization

Abstract

We propose a new distributed delay-constrained unicast routing algorithm which can always find a delay-constrained path with small message complexity if such a path exists. At each network node, limited information about the network state is needed and only a small amount of computation is required. Simulation results show that the proposed algorithm has much better cost performance than the least delay path algorithm.