DocumentCode :
1599215
Title :
Research of Directed Network Capacity Expansion Based on Spanning Tree Diagram
Author :
Xu, Kaihua ; Liu, Yuhua ; Huang, Hao ; Zhu, Haiyan
Author_Institution :
Central China Normal Univ., Wuhan
Volume :
5
fYear :
2007
Firstpage :
69
Lastpage :
73
Abstract :
This paper gives a mathematical description of the directed network capacity definitions and theorems of computing capacities towards the network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the directed network capacities based on spanning tree diagram and even an advanced optimization algorithm. In addition, it discusses network capacity expansion problems with constraints. And then, the optimization algorithm in the scenario of directed network with limited costs is given, whose feasibility and process are illustrated via examples.
Keywords :
computer networks; optimisation; trees (mathematics); computer network theories; directed network capacity expansion; optimization algorithm; spanning tree diagram; Computer networks; Computer science; Cost function; Electronic mail; Graph theory; Operations research; Process design; Space technology; Telecommunication traffic; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation, 2007. ICNC 2007. Third International Conference on
Conference_Location :
Haikou
Print_ISBN :
978-0-7695-2875-5
Type :
conf
DOI :
10.1109/ICNC.2007.609
Filename :
4344812
Link To Document :
بازگشت