By Topic

A theory of tie-set graph and tie-set path - a graph theoretical study on robust network system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
T. Koide ; Graduate Sch. of Eng., Soka Univ., Tokyo, Japan ; H. Watanabe

Aiming at the establishment of a graph theoretical basis for a network management system using loops in the network as basic management units, this paper presents tie-set graph theory and its useful properties, such as transformation of tie-set graph, meta-tie-set graph measure of tie-set graph and simplest tie-set graph. It is shown that proposed theory gives a theoretical basis and effective means for loop based network management. Distributed algorithms for finding the lightest tie-set path are presented that can apply to fault link avoidance and load balancing in an information network

Published in:

Circuits and Systems, 2000. IEEE APCCAS 2000. The 2000 IEEE Asia-Pacific Conference on

Date of Conference: