Abstract: Disclosed example routing methods include accessing a control packet originating from a first internal router, translating the destination address of the control packet from a first value to a second value, and identifying a first one of a plurality of outgoing interfaces of a meta-router based on the second value of the destination address, the outgoing interfaces of the meta-router in communication with respective incoming interfaces of a splitter. Disclosed example methods also include forwarding the control packet to the first one of the outgoing interfaces of the meta-router after translating the destination address of the control packet from the second value back to the first value, and routing the control packet from the splitter to an external router based on which one of the incoming interfaces of the splitter receives the control packet from the meta-router.

Abstract: Disclosed example routing methods include accessing a control packet originating from a first internal router, translating the destination address of the control packet from a first value to a second value, and identifying a first one of a plurality of outgoing interfaces of a meta-router based on the second value of the destination address, the outgoing interfaces of the meta-router in communication with respective incoming interfaces of a splitter. Disclosed example methods also include forwarding the control packet to the first one of the outgoing interfaces of the meta-router after translating the destination address of the control packet from the second value back to the first value, and routing the control packet from the splitter to an external router based on which one of the incoming interfaces of the splitter receives the control packet from the meta-router.

Abstract: A network system that reduces the computational resources to centrally-control network nodes in a border gateway protocol (BGP) network. More particularly, the systems and methods describe the control of a plurality of individual network nodes by a centralized controller, and the use of a route control server (RCS), which is connected to the centralized controller, or OpenFlow Controller (OFC). By treating the plurality of individual network nodes as a single combined network node, the route control server is able communicate using a single BGP speaker, and hence, reduce the computational resources from that required to run an individual BGP speaker for each individual network node.

Abstract: A system and method to use network flow records to generate information about changes in network routing and to understand the impact of these changes on network traffic. The inferences made can be determinative, if sufficient information is available. If sufficient information is not available to make determinative inferences, inferences may be made that narrow the range of possible changes that may have occurred to network traffic and the underlying network.

Abstract: A system and method to use network flow records to generate information about changes in network routing and to understand the impact of these changes on network traffic. The inferences made can be determinative, if sufficient information is available. If sufficient information is not available to make determinative inferences, inferences may be made that narrow the range of possible changes that may have occurred to network traffic and the underlying network.

Abstract: Statistical methods are used to observe packet flow arrival processes and to infer routing changes from those observations. Packet flow arrivals are monitored using NetFlow or another packet flow monitoring arrangement. Packet flow arrivals are quantified by counting arrivals per unit time, or by measuring an inter-arrival time between flows. When a change in packet flow arrivals is determined to be statistically significant, a change in network routing protocol is reported.

Abstract: A method and apparatus for providing event correlation in a network are disclosed. For example, the method extracts a plurality of events of interest from a database, and creates one or more event time series from the plurality of events of interest, wherein each of the one or more event time series comprises a set of events of a same type and of a same location that occur within a given time period. The method forms one or more composite events from the one or more event time series, and performs one or more pair-wise correlations for at least one of: the event time-series, or the one or more composite events. The method then identifies one or more pair-wise correlations that are statistically significant.

Abstract: Disclosed herein are systems, computer-implemented methods, and computer-readable media for sampling network traffic. The method includes receiving a desired quantity of flow record to sample, receiving a plurality of network flow record each summarizing a network flow of packets, calculating a hash for each flow record of based on one or more invariant part of a respective flow, generating a quasi-random number from the calculated hash for each respective flow record, generating a priority from the calculated hash for each respective flow record, and sampling exactly the desired quantity of flow records, selecting flow records having a highest priority first. In one aspect, the method further partitions the plurality of flow records into groups based on flow origin and destination, generates an individual priority for each partitioned group, and separately samples exactly the desired quantity of flow records from each partitioned group, selecting flows having a highest individual priority first.

Abstract: Disclosed herein are systems, computer-implemented methods, and computer-readable media for sampling network traffic. The method includes receiving a plurality of flow records, calculating a hash for each flow record based on one or more invariant part of a respective flow, generating a quasi-random number from the calculated hash for each respective flow record, and sampling flow records having a quasi-random number below a probability P. Invariant parts of flow records include destination IP address, source IP address, TCP/UDP port numbers, TCP flags, and network protocol. A plurality of routers can uniformly calculate hashes for flow records. Each router in a plurality of routers can generate a same quasi-random number for each respective flow record and uses different values for probability P. The probability P can depend on a flow size. The method can divide the quasi-random number by a maximum possible hash value.

Abstract: Statistical methods are used to observe packet flow arrival processes and to infer routing changes from those observations. Packet flow arrivals are monitored using NetFlow or another packet flow monitoring arrangement. Packet flow arrivals are quantified by counting arrivals per unit time, or by measuring an inter-arrival time between flows. When a change in packet flow arrivals is determined to be statistically significant, a change in network routing protocol is reported.

Abstract: Disclosed herein are systems, computer-implemented methods, and computer-readable media for sampling network traffic. The method includes receiving a plurality of flow records, calculating a hash for each flow record based on one or more invariant part of a respective flow, generating a quasi-random number from the calculated hash for each respective flow record, and sampling flow records having a quasi-random number below a probability P. Invariant parts of flow records include destination IP address, source IP address, TCP/UDP port numbers, TCP flags, and network protocol. A plurality of routers can uniformly calculate hashes for flow records. Each router in a plurality of routers can generate a same quasi-random number for each respective flow record and uses different values for probability P. The probability P can depend on a flow size. The method can divide the quasi-random number by a maximum possible hash value.

Abstract: Disclosed herein are systems, computer-implemented methods, and computer-readable media for sampling network traffic. The method includes receiving a desired quantity of flow record to sample, receiving a plurality of network flow record each summarizing a network flow of packets, calculating a hash for each flow record of based on one or more invariant part of a respective flow, generating a quasi-random number from the calculated hash for each respective flow record, generating a priority from the calculated hash for each respective flow record, and sampling exactly the desired quantity of flow records, selecting flow records having a highest priority first. In one aspect, the method further partitions the plurality of flow records into groups based on flow origin and destination, generates an individual priority for each partitioned group, and separately samples exactly the desired quantity of flow records from each partitioned group, selecting flows having a highest individual priority first.

Abstract: A system and method to use network flow records to generate information about changes in network routing and to understand the impact of these changes on network traffic. The inferences made can be determinative, if sufficient information is available. If sufficient information is not available to make determinative inferences, inferences may be made that narrow the range of possible changes that may have occurred to network traffic and the underlying network.

Abstract: A method and apparatus for providing event correlation in a network are disclosed. For example, the method extracts a plurality of events of interest from a database, and creates one or more event time series from the plurality of events of interest, wherein each of the one or more event time series comprises a set of events of a same type and of a same location that occur within a given time period. The method forms one or more composite events from the one or more event time series, and performs one or more pair-wise correlations for at least one of: the event time-series, or the one or more composite events. The method then identifies one or more pair-wise correlations that are statistically significant.

Abstract: An improved bonding tool for bonding a ribbon characterized by a thickness to a bonding pad and the method for using the same is disclosed. The bonding tool includes a transducer and a bond foot having a plurality of protrusions extending therefrom for pressing the ribbon against the bonding pad, the protrusions having a height greater than 40 percent of the ribbon thickness. The bond foot to moves with respect to the bond pad while the bond foot is pressed against the ribbon. In one embodiment, the height of the protrusions is between 40 and 80 percent of the thickness of the ribbon. In one embodiment, the protrusions include truncated pyramids having rectangular cross-sections In one embodiment, the transducer causes said bond foot to move back and forth in a predetermined direction and said protrusions are aligned such that two sides of said protrusions are perpendicular to said predetermined direction.