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

Author

Koide, Toshio ; Watanabe, Hitoshi

Author_Institution

Graduate Sch. of Eng., Soka Univ., Tokyo, Japan

fYear

2000

fDate

2000

Firstpage

227

Lastpage

230

Abstract

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

Keywords

distributed algorithms; graph theory; information networks; telecommunication network management; distributed algorithms; fault link avoidance; graph theoretical study; information network; load balancing; loop based network management; network loops; network management system; robust network system; tie-set graph; tie-set path; Distributed algorithms; Electronic mail; Engineering management; Graph theory; Load management; Reliability theory; Robustness; Routing; Telecommunication traffic; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Tianjin

Print_ISBN

0-7803-6253-5

Type

conf

DOI

10.1109/APCCAS.2000.913473

Filename

913473