Cisco Technology, Inc.

Pritam Shah

Dana Lynn Blair

Rahul G Patel

Philip Clifford Jacobs

Vamsidhar Valluri

Gautam M Aggarwal

Ajith Thrivikramannair

Anand K Oswal

Sravan Vadlakonda

Preety Mordani

Chengelpet Ramesh

Amol Khare

Mitesh Dalal

Sanjay Sreenath

Kerry Lynn

S Scott Van De Houten

Vinod Peris

Kathleen Nguyen

Mittesh Dalal

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.

Event triggered traceroute for optimized routing in a computer network

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.

Identifying the best service provider link for performance routing

In an embodiment, a method comprises receiving a request to obtain network performance data for a plurality of target nodes; determining geo-locations of the plurality of target nodes; based on the geo-locations, determining a set of the plurality of target nodes that are within a specified proximity radius; selecting one particular target node in the set; sending a probe packet, requesting network performance data, to the one particular target node in the set and not to all other target nodes in the set; applying, to all the target nodes in the set, network performance data that is received in response to the probe packet; wherein the method is performed by one or more processors.

Determining network node performance data based on location and proximity of nodes

In one embodiment, a method includes receiving a first request to join a conference from a first user device. The location of the first user device is determined. Based on the location of the first user device, the proximity of the first user device relative to endpoints configured to facilitate the conference is identified. A first one of the endpoints that is more proximate to the first user device than other endpoints is selected for handling the conferences.

Location aware conferencing system and method

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.

Link grouping for route optimization

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.

Route optimization of services provided by one or more service providers for combined links

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.

Technique for using OER with an ECT solution for multi-homed sites

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.

Dynamically right-sizing prefixes for network and application performance

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.

System and method for increasing granularity of prefix control in a computer network

In one embodiment, a method includes identifying when a user device is in proximity to a moveable device, and determining a first amount of time the user device has been in proximity to the moveable device. The method also includes determining whether the first amount of time exceeds a threshold amount of time. When it is determined that the first amount of time exceeds the threshold amount of time, content associated with the moveable device is accessed. Finally, at least an indication of content is provided to the user device when it is determined that the first amount of time exceeds the threshold amount of time.

System for providing services based on relationships and proximity

In one embodiment, a method includes receiving at a network device information on paths to a destination node, determining a number of common nodes or links between at least two of the paths, calculating a path diversity index based on the number of common nodes or links, and selecting a route to the destination node based on the path diversity index. An apparatus for calculating path diversity index for use in route selection is also disclosed.

Path diversity index for use in route selection

A technique dynamically utilizes a plurality of multi-homed Virtual Private Network (VPN) tunnels from a client node to one or more enterprise networks in a computer network. According to the technique, a VPN client node, e.g., a 'spoke,' creates a plurality of multi-homed VPN tunnels with one or more servers/enterprise networks, e.g., 'hubs.' The spoke designates (e.g., for a prefix) one of the tunnels as a primary tunnel and the other tunnels as secondary (backup) tunnels, and monitors the quality (e.g., loss, delay, reachability, etc.) of all of the tunnels, such as, e.g., by an Optimized Edge Routing (OER) process. The spoke may then dynamically re-designate any one of the secondary tunnels as the primary tunnel for a prefix based on the quality of the tunnels to the enterprise. Notably, the spoke may also dynamically load balance traffic to the enterprise among the primary and secondary tunnels based on the quality of those tunnels.

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.

In one embodiment, probe messages may be transmitted from a local domain to a set of one or more responding probe targets located beyond a plurality of probed first-hop domains of the local domain, the probe messages transmitted via each of a plurality of probed first-hop domains. A reliability of each probed first-hop domain may then be determined based on responsiveness of probe messages transmitted via each respective probed first-hop domain, such that traffic destined beyond the probed first-hop domains may be load balanced across the probed first-hop domains based on the respective reliability, regardless of a traffic-class and a destination of the traffic.

Growing community of inventors

Fremont, CA, United States of America

Pritam Shah