A distributed routing algorithm in hybrid circuit/packet switching networks

The authors are concerned with the routing strategy in hybrid circuits/packet-switching networks, and an algorithm for distributed routing in the hybrid networks is presented. The algorithm chooses the shortest path weighted by available capacity factors of links for circuit-switching traffic and chooses the path which has the minimum product of the queuing length and available capacity factors of links for packet-switching traffic.<
>