Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2002.07a
- /
- Pages.462-465
- /
- 2002
Augmenting Quasi-Tree Search Algorithm for Maximum Homogenous Information Flow with Single Source/Multiple Sinks
- Fujita, Koichi (Graduate School of Engineering, SOKA University) ;
- Watanabe, Hitoshi (Graduate School of Engineering, SOKA University)
- Published : 2002.07.01
Abstract
This paper presents a basic theory of information flow from single sending point to multiple receiving points, where new theories of algebraic system called "Hybrid Vector Space" and flow vector space play important roles. Based on the theory, a new algorithm for finding maximum homogenous information flow is proposed, where homogenous information flow means the flow of the same contents of information delivered to multiple clients at a time. Effective multi-routing algorithms fur tree-shape delivery rout search are presented.
Keywords