Abstract: Systems, methods, and apparatuses provide a scalable framework for analyzing queuing and transient congestion in network switches. The system reports which flows contributed to the queue buildup and enables direct per-packet action in the data plane to prevent transient congestion. The system may be configured to analyze queuing in legacy network switches.

Abstract: Methods, systems, and computer-readable media for measuring packet delays are provided. An input port of a network device is tapped to duplicate an input packet stream having a first packet. An output port of the network device is tapped to duplicate an output packet stream including the first packet. The duplicated input packet stream and the duplicated output packet stream is transmitted to a programmable device. The first packet in the first input packet stream is matched to the first packet in the first output packet stream. An arrival time and a departure time for the first packet is measured. The difference between the departure time of the first packet and the arrival time of the first packet is determined and the value is reported to an external collector.

Abstract: Systems, methods, and apparatuses provide a scalable framework for analyzing queuing and transient congestion in network switches. The system reports which flows contributed to the queue buildup and enables direct per-packet action in the data plane to prevent transient congestion. The system may be configured to analyze queuing in legacy network switches.

Abstract: Methods, systems, and computer-readable media for measuring packet delays are provided. An input port of a network device is tapped to duplicate an input packet stream having a first packet. An output port of the network device is tapped to duplicate an output packet stream including the first packet. The duplicated input packet stream and the duplicated output packet stream is transmitted to a programmable device. The first packet in the first input packet stream is matched to the first packet in the first output packet stream. An arrival time and a departure time for the first packet is measured. The difference between the departure time of the first packet and the arrival time of the first packet is determined and the value is reported to an external collector.

Abstract: Methods and apparatus to migrate border gateway protocol sessions between routers are disclosed. An example method to migrate a border gateway protocol session from a first router to a second router disclosed herein comprises exporting a connection state to migrate a transport control protocol connection supporting the border gateway protocol session with a session endpoint from the first router to the second router, and after the transport control protocol connection has been migrated to the second router, announcing, from the first router to the second router, routes contained in an exported routing information base associated with the session endpoint, the second router to process the routes to migrate handling of the border gateway protocol session with the session endpoint to the second router.

Abstract: A resilient load balancing method uses fixed paths and a fixed path-splitting strategy to enable ingress routers to efficiently reroute traffic after a failure. An off-line management system computes a set of fixed paths and a set of splitting ratios for routing demand from ingress routers to egress routers, with sufficient capacity to meet demands under each failure scenario. That data is then used by the ingress router to reroute demand after observing a failure.

Abstract: A resilient load balancing method uses fixed paths and a fixed path-splitting strategy to enable ingress routers to efficiently reroute traffic after a failure. An off-line management system computes a set of fixed paths and a set of splitting ratios for routing demand from ingress routers to egress routers, with sufficient capacity to meet demands under each failure scenario. That data is then used by the ingress router to reroute demand after observing a failure.

Abstract: Methods and apparatus to migrate border gateway protocol sessions between routers are disclosed. An example method to migrate a border gateway protocol session from a first router to a second router disclosed herein comprises exporting a connection state to migrate a transport control protocol connection supporting the border gateway protocol session with a session endpoint from the first router to the second router, and after the transport control protocol connection has been migrated to the second router, announcing, from the first router to the second router, routes contained in an exported routing information base associated with the session endpoint, the second router to process the routes to migrate handling of the border gateway protocol session with the session endpoint to the second router.

Abstract: A resilient load balancing method uses fixed paths and a fixed path-splitting strategy to enable ingress routers to efficiently reroute traffic after a failure. An off-line management system computes a set of fixed paths and a set of splitting ratios for routing demand from ingress routers to egress routers, with sufficient capacity to meet demands under each failure scenario. That data is then used by the ingress router to reroute demand after observing a failure.

Abstract: A flexible mechanism for routers to select the egress point for each destination prefix, herein referred to as tunable inter-domain egress (TIE) selection, comprises the step of ranking possible points of egress according to a metric, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. A weighting function is discussed whereby known hot potato routing can be weighted against a fixed ranking scheme. TIE has been applied to data of two different autonomous systems posing different problems solved using integer-programming and multi-commodity flow techniques, respectively, to tune the TIE according to the weighting function to satisfy network-wide objectives. Experiments with traffic, topology and routing data from two different backbone networks demonstrate that TIE is both simple (for the routers) and expressive (for the network administrators) and can be practically applied in traffic engineering.

Abstract: A flexible mechanism and method for routers to select the egress point for each destination comprises identifying a plurality of points of egress from an autonomous system, ranking the plurality of points of egress according to a metric having variable and fixed terms, selecting a point of egress having the smallest rank, and transmitting packets from a point of ingress via a path to the selected point of egress. The metric is across a plurality of destinations and respective possible points of egress from the autonomous system and the metric is m(i, p, e) equaling ?(i, p, e)·d(G,i,e)+?(i, p, e) where a and ? are configurable values, i is the identity of the router, p is the destination, G is an undirected weighted graph, the d function is the interior gateway protocol distance and e is a point of egress.

Abstract: Certain exemplary embodiments comprise a method comprising a plurality of activities, comprising: for each of the plurality of routing entities in an AS: obtaining IGP topology information; learning available BGP routes associated with the routing entity; utilizing the available BGP routes and the IGP topology information for all routing entities in the AS, assigning the routing entity a customized routing decision comprising a BGP route; and sending the customized routing decision to the routing entity.

Abstract: The invention comprises a method and apparatus for managing route selection in a network. Specifically, the method comprises receiving a set of routes from each of a plurality of routers, filtering each of the sets of routes, and selecting at least one route from each of the filtered sets of routes according to routing information associated with each of the respective routers.