Lagrange quality of service routing

Details Lagrange quality of service routing Lagrange quality of service routing

2006-03-28

2006-03-28

Pham, Chi (Department: 2666)

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

C706S019000, C709S239000, C709S240000, C709S241000

Reexamination Certificate

active

07020086

ABSTRACT:
A method for practical QoS routing, which provides a solution to the delay constrained least cost routing problem, is presented. The method uses the concept of aggregated costs and finds the optimal multiplier based on Lagrange relaxation. The method is polynomial in running time, and produces a theoretical lower bound (i.e. optimal solution), along with the result. The differences between the lower bound and result are small, indicating the quality of the result. Additionally, by further relaxing the desire for an optimal solution, an option is provided to control the trade-off between running time of the algorithm and quality of the result.

REFERENCES:
patent: 6411946 (2002-06-01), Chaudhuri
patent: 2002/0097716 (2002-07-01), Kumaran et al.
Mehrdad Parsa, An Iterative Algorithm for Delay-Constrained Minimum-Cost Multicasting, Aug. 4, 1998, IEEE, p. 461-474.

Affiliated with

Also associated with

Rating

Lagrange quality of service routing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Lagrange quality of service routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lagrange quality of service routing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3545584