In response to the great progress of communications and computer technologies, aggressive deployment of broadband fiber optical network, advance of Internet technology, and the global standardization of IP technology, the telecommunication industry is moving toward a converged network, which uses a single global IP based packet-switching network to carry all types of network services. Diverse types of services demand diverse QoS requirements making it a great challenge to support potential services with guaranteed QoS on All-IP networks.

Our research group proposes a Budget-Based QoS (BBQ) management architecture to facilitate network operators of diversified networks. With BBQ management architecture, network operators can adjust their network architectures and management polities to support as many services as possible with end-to-end QoS guarantee. To reduce real-time resource reservation and computation overhead, BBQ utilizes preplaning approach to allocate resources and to plan paths (routing) for future incoming traffics.

In this thesis, based on BBQ QoS architecture, we propose a path planning methodology that integrates both centralized and distributed processes. We also developed a heuristic algorithm to solve the path planing problem (routing) under BBQ architecture.

To admit a service request during execution time, admission control component will assign a planned path that satisfy the QoS requirements to the admitted service. Under this method, absolute QoS will be guaranteed for admitted traffic. The hueristic path-planning algorithm we designed, the GPPA algorithm, takes total profit as its maximization objective and with bandwidth and quality entropy as its constraints. Through a performance evaluation using simulation method, we demonstrate that the pre-planing approach with our GPPA path-planning algorithm might outperform the real-time resource allocation approach with the traditional OSPF routing algorithm.