A study on unicast routing algorithm with network bandwidth constraint

摘要

In this paper we present a new single unicast routing algorithm and a new group unicast routing algorithm with bandwidth constraint in communication networks. For multipath transmission in single unicast, a new grouping principle for has been given while for group unicast an optimization model is presented. With the new algorithms, network congestion can be prevented effectively.