ROUTING SYSTEM FOR INTERNET TRAFFIC

摘要

A deterministic approach for route selection in the Internet and other multi-homed networks is presented that is based upon a mathematical model that takes into consideration performance and costs while satisfying commitment constraints. The approach is expressed with a linear programming formulation that can be solved with conventional linear programming solver software. Performance metrics can be defined and combined in order to achieve the best route selection depending on requirements. Some of the potential benefits of the approach include: a global optimal solution for routing traffic (using metrics such as performance, cost, and other constraints), a dynamic weight assignment for performance metrics, and a flexible problem definition to add routing rules (e.g. static and restricted routes) to the model.

主权项

1. A method of routing computer network traffic from a multi-homed location to a plurality of routes wherein each route has a capacity associated therewith, said method comprising:
determining a traffic flow demand for each prefix in a network prefix set; gathering performance data for each prefix along each route; determining a performance value to each said prefix based upon said performance data; determining in a computer a routing decision for each said prefix, each said routing decision assigning one of said plurality of routes to each one of said prefixes; wherein each said routing decision is based upon said traffic flow demand, said performance values, and the capacity associated with each route.