摘要:
In one embodiment, two or more links, coupled to a first service provider (SP) that charges a price for utilization of services according to a first pricing structure, are combined to form a single virtual combined link. Each of the two or more links of the virtual combined link and one or more other links, coupled to a second SP that charges a price for utilization of services according to a second pricing structure, are monitored to obtain link data. The link data for the two of more links of the virtual combined link is merged to form link data for the virtual combined link. Data distribution among the virtual combined link and the one or more other links is optimized to distribute data among the virtual combined link and the one or more other links in a manner that minimizes cost.
摘要:
A technique dynamically increases the granularity of prefix control in a computer network. According to the novel technique, a routing table is populated with one or more reachable prefixes, e.g., learned or configured prefixes, and performance characteristics (e.g., bandwidth, cost, delay, etc.) of the prefixes are monitored. Upon determining that a need exists for more granular prefix control (i.e., smaller prefixes), one or more boundaries may be determined upon which to divide one or more of the prefixes based on the monitored characteristics and/or need. Once the one or more boundaries are determined, the one or more prefixes may be “split” accordingly, e.g., by injecting more specific prefixes into the routing table, thus providing more granular prefix control (i.e., by controlling the split prefixes).
摘要:
In one embodiment, a routing table of a router is populated with a plurality of prefixes. One or more performance characteristics of the plurality of prefixes are monitored. The router determines that a need exists to split a selected prefix of the plurality of prefixes. The router determines one or more boundaries upon which to split the selected prefix based on the monitored performance characteristics. The router then injects one or more more-specific prefixes into the routing table, each more-specific prefix referring to a smaller subset of nodes than the selected prefix, to split the selected prefix on the one or more boundaries to create a plurality of split prefixes. The split prefixes are controlled to optimize distribution of traffic.
摘要:
A technique performs route optimization of services provided by one or more service providers (SPs) for communication links that are combined in a computer network. According to the novel technique, performance characteristics and statistics (“link data”) for two or more combined links are merged to form link data for a single “virtual combined link.” Route optimization techniques (e.g., priority-based route optimization) may then be applied to one or more virtual combined links based on the combined link data, in addition to link data for zero or more conventional single links (physical or virtual). Illustratively, a route optimization technique may be used in accordance with the present invention to efficiently and accurately minimize costs associated with services provided by a plurality of SPs, wherein each SP charges for utilization of its service based on a tiered pricing structure. The tiered pricing structure comprises one or more tiers, wherein each tier correlates to an amount of service provided by the SP and an associated cost.
摘要:
An Optimized Edge Routing (OER) technique provides efficiently data routing at the edge of a network or subnetwork. The technique employs a Master node that manages a set of border nodes located at the edge of the network or subnetwork. The Master node may be a stand-alone network management node or may be incorporated into a network node, such as a border node. Unlike prior implementations, the Master node instructs the border nodes to dynamically acquire (“learn”) prefixes of incoming and outgoing data flows and to selectively filter a set of learned address prefixes whose corresponding data flows match a predetermined set of criteria. The criteria may be based on routing metrics other than, or in addition to, conventional cost-based or distance-based metrics. Further, the criteria may include a set of filtering parameters that may be reconfigured, e.g., by the Master node, from time to time. Using the learned prefixes filtered by the border nodes, the Master node can distribute network traffic and utilize network bandwidth more efficiently than conventionally done.
摘要:
In one embodiment, two or more links, coupled to a first service provider (SP) that charges a price for utilization of services according to a first pricing structure, are combined to form a single virtual combined link. Each of the two or more links of the virtual combined link and one or more other links, coupled to a second SP that charges a price for utilization of services according to a second pricing structure, are monitored to obtain link data. The link data for the two of more links of the virtual combined link is merged to form link data for the virtual combined link. Data distribution among the virtual combined link and the one or more other links is optimized to distribute data among the virtual combined link and the one or more other links in a manner that minimizes cost.
摘要:
In one embodiment, a routing table of a router is populated with a plurality of prefixes. One or more performance characteristics of the plurality of prefixes are monitored. The router determines that a need exists to split a selected prefix of the plurality of prefixes. The router determines one or more boundaries upon which to split the selected prefix based on the monitored performance characteristics. The router then injects one or more more-specific prefixes into the routing table, each more-specific prefix referring to a smaller subset of nodes than the selected prefix, to split the selected prefix on the one or more boundaries to create a plurality of split prefixes. The split prefixes are controlled to optimize distribution of traffic.
摘要:
In one embodiment, a first set of one or more control policies at a control server of a network domain may be transmitted to a routing master controller of the network domain, which uses a second set of one or more traffic policies to determine optimal paths for directing traffic through the domain. The routing master controller may then generate a third set of one or more integrated policies based on the first and second sets of policies, e.g., based on the knowledge and policies of both the control server and the routing master controller.
摘要:
In one embodiment, a network device (e.g., a master controller) may detect an event on a current path in a computer network from a local network domain to a destination address prefix of a remote domain. In response, the device may dynamically (e.g., intelligently) determine a trace target destination address within the destination address prefix, and may perform (or request performance of) a Traceroute of the current path and a selection of alternate paths in the network from the local network domain to the trace target, where the Traceroute is adapted to obtain per-hop measurements along the respective traced path. The measurements may then be stored, for example, to be used for optimal path selection, fault identification reporting, etc.
摘要:
In one embodiment, a method includes obtaining a first packet included in a flow to be forwarded to a border router, and replicating the first packet to create a duplicate. The first packet is forwarded onto a first set of links, and the duplicate is forwarded onto a second set of links, to the border router. First information relating to the first packet and the first set of links, and second information relating to the duplicate and the second set of links, is obtained. The first information and the second information are used to determine whether to forward the flow on the first set of links. The first set of links is used to forward the flow if it is determined that the first set of links is to be used to forward the flow, otherwise the second set of links is used to forward the flow.