Accession Number:

ADA440518

Title:

Information Dynamics Applied to Link-State Routing

Descriptive Note:

Technical rept.

Corporate Author:

MARYLAND UNIV COLLEGE PARK INST FOR ADVANCED COMPUTER STUDIES

Report Date:

2001-11-01

Pagination or Media Count:

21.0

Abstract:

Information Dynamics Agrawala, 2000 is an information-centric framework that provides a sufficient understanding of the characteristics of information used in systems for better system design and implementation. In this paper, we describe how to improve link-state routing based on this framework. Link-state routing protocols such as OSPF Open Shortest Path FirstMoy, 1991 are currently used in many networks. In link-state routing, routes are determined based on link-delay estimates, which are periodically flooded throughout the network. This flooding of link-delay estimates is done without considering the relevance of these estimates to routing quality, i.e. without taking into account the usefulness of the link -delay information. We have developed a new approach that improves link-state routing by estimating future link delays and flooding these estimates only to the extent that they are relevant. This means that we consider the dynamics of the link-delay information and its usefulness. Simulation studies suggest that our approach can lead to significant reductions in routing traffic with noticeable improvements of routing quality in high-load conditions, demonstrating the effectiveness of the framework. We plan to further investigate the conditions where our information-dynamics approach is better than the standard approach.

Subject Categories:

  • Information Science
  • Computer Systems Management and Standards
  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE