A Network Dependence Graph for Modeling Network Services and Its Use in Fault Location

Katsuhisa MARUYAMA  Shozo NAITO  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E82-D   No.4   pp.737-746
Publication Date: 1999/04/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Internet Technology and Its Applications)
Category: 
Keyword: 
network management,  network fault location,  dependence graph,  slicing,  data and control flow analysis,  

Full Text: PDF>>
Buy this Article




Summary: 
As network services become more diverse and powerful, service applications that perform such services are acquiring an ever-larger amount of complicated and changeable relationships. We present a network dependence graph (NDG) that captures both data and control flow relationships between components of service applications that work collaboratively. This graph is constructed based on analysis of both the behavior of each of the service applications and their configuration, which describes the device names they refer to, and allows network slicing to be implemented as a simple graph traversal. Network slicing is the extraction of necessary and minimum service components that may affect the execution of a specified service application; it helps a network manager to find the location of service faults lurking somewhere in the network. We also present a method for locating faults that uses network slicing and a system based on this method.