Abstract: A computer implemented method, apparatus, and computer usable program code for managing addresses in a network. In one advantageous embodiment, a computer implemented method is used to managing addresses for a plurality of destinations in a network. Addresses assigned to a plurality of gateways are summarized to form summarized addresses containing prefixes and addresses for the plurality of gateways in which each gateway in the plurality of gateways is associated with a portion of the prefixes and addresses for destinations handled by the each gateway in the plurality of gateways. A gateway in the plurality of gateways having a largest portion of the summarized addresses is assigned a prefix for all addresses assigned to the network to form a selected gateway. An associated portion of the summarized addresses for the selected gateway is replaced with the prefix.

Abstract: A method, apparatus, and computer usable program code for managing networks. In one advantageous embodiment, a computer implemented method processes routing information. The process collects updates to the routing information in a first network. Responsive to an event, a cost of reaching each address in the first network from each of a plurality of gateways in the first network that has access to a second network is identified to form identified costs. The process also selects a set of addresses for a set of gateways providing access to the second network, wherein each gateway in the set of gateways is identified using a policy with respect to a cost of reaching a particular address in the first network to form an update list. The update list is sent to the second network.

Abstract: A computer implemented method, apparatus, and computer usable program code for managing addresses in a network. In one advantageous embodiment, a computer implemented method is used to managing addresses for a plurality of destinations in a network. Addresses assigned to a plurality of gateways are summarized to form summarized addresses containing prefixes and addresses for the plurality of gateways in which each gateway in the plurality of gateways is associated with a portion of the prefixes and addresses for destinations handled by the each gateway in the plurality of gateways. A gateway in the plurality of gateways having a largest portion of the summarized addresses is assigned a prefix for all addresses assigned to the network to form a selected gateway. An associated portion of the summarized addresses for the selected gateway is replaced with the prefix.

Abstract: A method, apparatus, and computer usable program code for managing networks. In one advantageous embodiment, a computer implemented method processes routing information. The process collects updates to the routing information in a first network. Responsive to an event, a cost of reaching each address in the first network from each of a plurality of gateways in the first network that has access to a second network is identified to form identified costs. The process also selects a set of addresses for a set of gateways providing access to the second network, wherein each gateway in the set of gateways is identified using a policy with respect to a cost of reaching a particular address in the first network to form an update list. The update list is sent to the second network.