IEICE TRANSACTIONS on Information
A Network Dependence Graph for Modeling Network Services and Its Use in Fault Location
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.4 pp.737-746
- Publication Date
- 1999/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Internet Technology and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Katsuhisa MARUYAMA, Shozo NAITO, "A Network Dependence Graph for Modeling Network Services and Its Use in Fault Location" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 4, pp. 737-746, April 1999, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_4_737/_p
Copy
@ARTICLE{e82-d_4_737,
author={Katsuhisa MARUYAMA, Shozo NAITO, },
journal={IEICE TRANSACTIONS on Information},
title={A Network Dependence Graph for Modeling Network Services and Its Use in Fault Location},
year={1999},
volume={E82-D},
number={4},
pages={737-746},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Network Dependence Graph for Modeling Network Services and Its Use in Fault Location
T2 - IEICE TRANSACTIONS on Information
SP - 737
EP - 746
AU - Katsuhisa MARUYAMA
AU - Shozo NAITO
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 1999
AB - 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.
ER -
English
