A study of information flow maximization problem in the tie-set flow vector space

摘要

Modem information network is becoming larger and more complex system, where the most important issues are how to deliver huge amount of multimedia-information throughout broadband networks with the maximum efficiency, and how to manage such complex networks with higher reliability. Furthermore, in order to increase transferring efficiency, it is important to handle a sequence of packets as a line of information-flow. This paper dealt with a theory of solving network optimization problem, where the problem is solved as an optimization problem in U dimensional tie-set flow vector space. Applying the theory to the problem of maximum information flow, a new method of finding the maximum information flow from a source to a sink was proposed. The theory proposed in this paper will be useful for effective transmission of large amount of information and for efficient distributed network management in large and complex information network.