Title
Network optimization problem in tie-set flow vector space and information network resource management
Abstract
This paper presents a general approach to network optimization problem based on proposed theory of tie-set graph and tie-set flow vector space. A new distributed algorithm for the network optimization problem is proposed where local optimizations on tie-sets lead to global optimization autonomously. As an application of the theory, a distributed algorithm for efficient resource management in information network is proposed.
Year
DOI
Venue
2002
10.1109/ISCAS.2002.1010153
Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium  
Keywords
Field
DocType
distributed algorithms,graph theory,information networks,optimisation,distributed algorithm,global optimization,information network resource management,network optimization problem,resource management,tie-set flow vector space,tie-set graph
Graph theory,Resource management,Mathematical optimization,Vector space,Global optimization,Computer science,Flow (psychology),Distributed algorithm,Optimization problem,Distributed computing,Network management station
Conference
Volume
Citations 
PageRank 
3
1
0.63
References 
Authors
0
3
Name
Order
Citations
PageRank
Koide, T.110.63
Ishibashi, T.210.63
Hitoshi Watanabe3244.87