Effective management for aggregated flows in server-based QoS routing

The support of real-time applications on the Internet requires a routing mechanism that provides quality-of-service. Such mechanisms called QoS routing can be realized by server-based routing method. However, in large-scale networks, the processing load imposed on the server would be too high. We focus here on the use of flow aggregation schemes as a way of reducing the processing load. From simulation results, roughly speaking, as a trunk can accommodate a larger number of flows within it, a smaller processing load can be realized on the server at the cost of increased blocking probability.