System and method for optimally configuring border gateway selection for transit traffic flows in a computer network
First Claim
Patent Images
1. A system for configuring border gateway selection for transit traffic flows in a computer network, comprising:
- a border gateway modeler that builds a model of cooperating border gateways, said model including capacities of said border gateways; and
a traffic flow optimizer, associated with said border gateway modeler, that initially assigns traffic to said border gateways in accordance with a generalized assignment problem and subsequently reassigns said traffic to said border gateways based on cost until said capacities are respected, wherein said cost is associated with route advertisement information comprising a network prefix, an Internet Protocol address of a next-hop, a multi-exit discriminator, and a list of autonomous systems along a path to a specified destination network prefix.
9 Assignments
0 Petitions
Accused Products
Abstract
A system for, and method of, configuring border gateway selection for transit traffic flows in a computer network. In one embodiment, the system includes: (1) a border gateway modeler that builds a model of cooperating border gateways, the model including capacities of the border gateways and (2) a traffic flow optimizer, associated with the border gateway modeler, that initially assigns traffic to the border gateways in accordance with a generalized assignment problem and subsequently reassigns the traffic to the border gateways based on cost until the capacities are respected.
39 Citations
27 Claims
-
1. A system for configuring border gateway selection for transit traffic flows in a computer network, comprising:
-
a border gateway modeler that builds a model of cooperating border gateways, said model including capacities of said border gateways; and a traffic flow optimizer, associated with said border gateway modeler, that initially assigns traffic to said border gateways in accordance with a generalized assignment problem and subsequently reassigns said traffic to said border gateways based on cost until said capacities are respected, wherein said cost is associated with route advertisement information comprising a network prefix, an Internet Protocol address of a next-hop, a multi-exit discriminator, and a list of autonomous systems along a path to a specified destination network prefix. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system for configuring border gateway selection for transit traffic flows in a computer network, comprising:
-
a border gateway modeler that builds a model of cooperating border gateways including capacities thereof; and a traffic flow optimizer, associated with said border gateway modeler, that initially assigns traffic to said border gateways in accordance with a generalized assignment problem and subseguenily reassigns said traffic to said border gateways based on cost until said capacities are respected, wherein said traffic flow optimizer holds certain of said capacities constant while reassigning said traffic to said border gateways. - View Dependent Claims (9, 10, 11)
-
-
12. A method of configuring border gateway selection for transit traffic flows in a computer network, comprising:
-
building a model of cooperating border gateways, said model including capacities of said border gateways; initially assigning traffic to said border gateways in accordance with a generalized assignment problem; and subsequently reassigning said traffic to said border gateways based on cost until said capacities are respected, wherein said cost is associated with route advertisement information comprising a prefix, an Internet protocol address of a next-hop, a multi-exit discriminator, and a list of autonomous systems along a path to a specified network destination prefix. - View Dependent Claims (13, 14, 15, 16, 17)
-
-
18. A method of configuring border gateway selection for transit traffic flows in a computer network, comprising:
-
building a model of cooperating border gateways including capacities thereof; initially assigning traffic to said border gateways in accordance with a generalized assignment problem; and subsequently reassigning said traffic to said border gateways based on cost until said capacities are respected, wherein said subsequently reassigning comprises holding certain of said capacities constant. - View Dependent Claims (19, 20, 21)
-
-
22. A method of managing a computer network, comprising:
-
collecting route advertisement information from border routers in said computer network, wherein said route advertisement information comprises a network prefix, an Internet Protocol address of a next-hop, a multi-exit discriminator, and a list of autonomous systems along a path to a specified destination network prefix; retrieving existing policy information regarding each of said border routers; collecting traffic information regarding each of said border routers; employing said route advertisement information, said existing policy information and said traffic information to compute updated policy information; and replacing said existing policy information with said updated policy information to decrease traffic through said computer network. - View Dependent Claims (23, 24, 25, 26, 27)
-
Specification