Patent ID: 7665116

Claim:
A method for multi-constraints based QoS routing for content distribution over a network comprising: filtering a network topology with a first set of QoS constraints resulting in a filtered network topology; determining a least cost path that satisfies a second set of QoS constraints by performing Dijkstra's least cost path routing algorithm, wherein at each searching step in Dijkstra's least cost path routing algorithm, checking if ⁢ ⁢ ( ∑ ( ( u , v ) ∈ P ) ⁢ W i ⁡ ( u , v ) < L i ) ⁢ ⁢ for ⁢ ⁢ each ⁢ ⁢ i = 1 ⁢ ⁢ … ⁢ ⁢ m , wherein L i is the total end-to-end cost constraint that needs to be satisfied, over the filtered network topology, and using PATH_LOAD, (P)=MAX (u,v)εP (Link_load (u,v)), as a cost index to find the least-cost path; and balancing a network load according to the least cost path.