Network Design and Routing Algorithm in Convergence-Cast Communication

概要

論文の詳細を見る
We study the capacity assignment and routing procedure for a simultaneous multipoint-to-point communication network called convergence cast communication (con-cast). In capacity assignment, we analyse the network in two different application models, single destination and variable destination con-cast group. In each model, we determine the optimal capacity and network configuration. In routing procedure, since the problem is computationally intractable [1], [2], we present a heuristic algorithm that, under condition of the capacity constraint, selects a set of connections for n-1 separated points to one point. This is accomplished by considering a hierarchical structure and a flow decomposition technique in the network. The algorithm finds a solution for connection assignment in convergence-type communications. Theoretical analysis and computer simulation of the proposed method are given.
社団法人電子情報通信学会の論文
1996-02-25