多対多地点通信における制約のある準静的ルーチングアルゴリズム

概要

論文の詳細を見る
This paper discusses the quasi-static constrained routing in the complete broadcast multipoint-to-multipoint communications,that new participants request connection and current participants request termination and the route setup is constrained by the available bandwidth capacity of links and the bounded delay of source-destination paths.Depending on the arrangement of links in existing routes,this routing problem is classified into two cases,rearrangeable case and nonrearrangeable case. The nonrearrangeable is studied because the rearrangeable case causes much overhead of network control and unsequence of packet receiving.A routing algorithm is proposed and evaluated its average cost performance compared with a greedy algorithm by computer simulation.
社団法人電子情報通信学会の論文
1995-03-27