Abstract: 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.
Type:
Grant
Filed:
November 15, 2013
Date of Patent:
December 20, 2016
Assignee:
Internap Corporation
Inventors:
Marco A. Valero, Charles Victor Bancroft, II, William Brian Hammond, Adam S. Rothschild, Charles R. Gwyn, IV, Christopher B. Freas, Gilbert L. Shillcutt, Michael William Palladino