As one of the most challenging problems in the upcoming next-generation high-speed networks

quality-of-service routing (QoSR) with multiple constraints has the NP-complete complexity.A precomputation algorithm

MEFPA

was proposed.This algorithm divides the significance of each QoS weight into multiple degrees

and constructs a number of linear energy functions (LEFs) distributed uniformly in the multi-dimensional QoS metric space.Using LEFs

it then converts different QoS weights to a single energy.At last

it uses Dijkstra's algorithm to create the least energy trees

based on which the QoS routing table is created.The performance of LEFs with constraints is analyzed

and the method is given to determine the feasible and unfeasible areas in the multi-dimensional QoS metric space for a QoS constraint.Then MEFPA for the multi-constrained QoS routing problem was introduce.Extensive simulations show that our easily implemented MEFPA is a promising precomputation algorithm to provide QoSR with high scalability and high performance in high-speed networks.