摘要:
A technique manages route optimization for one or more groups of links in a computer network. According to the novel technique, each group or “subgroup” of links comprises one or more links, wherein the group may be configured based on various measures, such as, e.g., connectivity (physical or virtual), policies to be applied, per-prefix, per-application (e.g., Internet traffic or voice over IP, VoIP), geographic location, and/or quality-based (e.g., primary links and secondary/backup links). One or more policies may be defined for the groups of links (i.e., where these group policies are to be applied to the group as a whole), in addition to policies that may be defined for individual to links and/or prefixes. Once the link groups are established, traffic over the groups of links (e.g., routes to reachable address prefixes) may be managed and optimized according to the group policies, such as in accordance with Optimized Edge Routing (OER) techniques.
摘要:
In one embodiment, a plurality of spoke-to-hub virtual private network (VPN) tunnels are established from a spoke router located at an edge of a spoke network to a hub network. The spoke router is configured as an optimized edge routing (OER) node. The spoke router monitors a network statistic for each of a plurality of prefixes on each of the plurality of spoke-to-hub VPN tunnels. The monitored network statistic is analyzed to determine whether a distribution of traffic between the spoke network and the hub network can be optimized. In the event the distribution of traffic between the spoke network and the hub network can be optimized, traffic is redistributed on a per-prefix basis among the plurality of spoke-to-hub VPN tunnels based on the monitored network statistic, such that at least a portion of the traffic is routed over each of the plurality of spoke-to-hub VPN tunnels.
摘要:
In one embodiment, performance parameters may be determined for each of a plurality of network address prefixes in a computer network. Based on the respective performance parameters, the prefixes may be resized through at least one of consolidation of adjacent prefixes and splitting of prefixes, and traffic may then be routed in the computer network based on the resized prefixes.
摘要:
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.
摘要:
A method for detecting a suspicious packet flow in a packet-switched network comprises the computer-implemented step of receiving a first packet in which the SYN bit but not the ACK or RST bit of the packet's TCP header is set. If a specified first time has elapsed, a packet counter associated with the destination address of the flow is incremented. A determination as to whether the packet counter is greater than a specified threshold values is made. If the packet counter is greater than the threshold value, a notification message is generated. In one embodiment, information identifying a packet flow is aggregated to an aggregation cache based on the destination address of the flow.
摘要:
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.
摘要:
Techniques are provided for updating best path based on real-time congestion feedback. A method comprises monitoring packets received from an internetworked system, wherein the packets are received on one of a plurality of external interfaces of a networking device; detecting that a received packet includes real-time information that signals a present or pending congestion condition on a path from the external interfaces of the networking device to the internetworked system; notifying a control logic of the real-time information; receiving from the control logic control information defining a change in one or more paths from the external interfaces to the internetworked system; and changing the one or more paths from the external interfaces to the internetworked system. Examining ingress traffic on external interfaces of an internetworked system can cause changes to routes, routing policies and PBRs in routers of the first internetworked system in response to real-time congestion.
摘要:
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.
摘要:
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, 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.