Scalable Cost Calculation Scheme for Load Balanced QoS Routing

Scalable Cost Calculation Scheme for Load Balanced QoS Routing
  • Lee, Kyoon Ha

초록

As for global network utilization, the simple but effective criterion of hop minimization is used in many existing QoS routing schemes. In this paper, we propose a scheme of calculating resources' costs for precomputation QoS routing scheme. This scheme is effective in respect to the global network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load. We, therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. Note that our cost calculation schemes for both kinds of traffic could be used in existing QoS routing protocols without any modification in small and large scale of networks.

제목
Scalable Cost Calculation Scheme for Load Balanced QoS Routing
제목 (타언어)
Scalable Cost Calculation Scheme for Load Balanced QoS Routing
저자
Lee, Kyoon Ha
학회명
PDPTA'02 - Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications