At&t Intellectual Property I, LP

University of Michigan

University of Oregon

Niksun, Inc.

Walter Willinger

Oliver Spatscheck

Subhabrata Bapi Sen

Alexandre Gerber

Feng Qian

Zhuoqing Morley Mao

Balachander Krishnamurthy

Dan Pei

Ricardo Oliveira

Brice Augustin

Vaneet Aggarwal

Ajay Mahimkar

Beichuan Zhang

Christopher H Misa

Reza Rejaie

Hongyao Ma

Lixia Zhang

Ramakrishnan Durairajan

A method for network dataplane telemetry includes: a) receiving telemetry queries, where each query includes a requested network telemetry task, and associated query result accuracy and query result latency weights; b) every epoch, scheduling the telemetry queries to produce a schedule associating to each sub-epoch of an epoch for a subset of the telemetry queries; c) every sub-epoch, reprogramming a programmable dataplane device to execute scheduled telemetry queries associated the sub-epoch; d) every sub-epoch, collecting and aggregating intermediate query results from the programmable dataplane device; e) every epoch, returning aggregated results of completed queries; wherein scheduling the telemetry queries uses a multi-objective optimization that uses multiple objective functions weighted by the query result accuracy and query result latency weights to balance resource requirements of the runtime programmable network switch, query result accuracy, and query result latency.

Method for dynamic resource scheduling of programmable dataplanes for network telemetry

A method, computer-readable storage device, and an apparatus for determining a localized service quality in a wireless network are disclosed. For example, the method constructs a tensor comprising a plurality of dimensions to represent data for the localized service quality, receives data for the wireless network that is gathered at a coarse granularity level, populates the tensor in accordance with the data that is gathered, applies an unfolding mechanism to construct a plurality of two dimensional matrices from the tensor, determines for each respective two dimensional matrix of the plurality of two dimensional matrices an approximation for a pre-determined level of accuracy, and populating all entries of each respective two dimensional matrix that are not populated in accordance with the approximation of the respective two dimensional matrix, and determines the localized service quality by applying a folding mechanism across the plurality of two dimensional matrices.

Method and apparatus for determining localized service quality in a wireless network

A packet trace is received. Transmitted bytes and retransmitted bytes are identified in the packet trace. Upon identifying the transmitted bytes and the retransmitted bytes in the packet trace, one or more time-rate pairs are determined from the packet trace. The time-rate pairs are plotted on a rate tracking graph.

Detecting irregular retransmissions

A packet trace is received. Inter-arrival times between the multiple packets in the packet trace are determined. An inter-arrival time in the inter-arrival times that is greater than a threshold is identified. An order number of the inter-arrival time is identified. A determination is made as to whether a size of each of at least a portion of the multiple packets is equal to a maximum segment size. When a determination is made that the size of each of at least a portion of the multiple packets is equal to the maximum segment size, a size of the ICW as a product of the order number and the maximum segment size is returned.

Inferring TCP initial congestion window

A packet trace is received. The packet trace is transformed into a sequence of pulse signals in a temporal domain. The sequence of pulse signals in the temporal domain is transformed into a sequence of pulse signals in a frequency domain. Peaks are detected within relevant frequency bands in the sequence of pulse signals in the frequency domain. A fundamental frequency is identified within the peaks. The fundamental frequency, which represents the TCP flow clock, is returned.

TCP flow clock extraction

Certain exemplary embodiments can provide a method, which can comprise, based upon a quantified completeness of a determined topology of an interconnected set of Autonomous Systems of the Internet, at a user interface of an information device, automatically rendering a determined identity of a customer to which telecommunications products will be offered.

Devices, systems, and/or methods for determining internet topology

A technique for examining the relationships of autonomous systems (ASes) participating in an Internet Exchange Point (IXP) utilizes packet tracing servers proximate the IXPs. Where such packet tracing servers cannot be found in the participating ASes, the methodology identifies additional vantage points by looking at a list of ASes that are one hop away from the ASes at the IXP. The choice of one-hop away ASes is made judiciously by picking ones that have better connectivity, based on past-data. Plural-hop ASes may also be used where necessary.

Reverse engineering peering at internet exchange points

Reverse engineering peering at Internet exchange point

Methods and apparatus to infer the status of BGP sessions are disclosed. A disclosed example method comprises querying a configuration file of a router of a first AS to identify a BGP session to a second AS, querying the file to determine whether the BGP session is a single hop, when the BGP session is a single hop, setting a status flag to a first value, querying the file to determine whether there is a valid IP configuration for the BGP session, when there is a valid IP configuration, setting the status flag to a second value, querying a router syslog file for the router to identify a syslog message associated with the BGP session, determining whether the session is stale, and when the session is not stale and the status flag is set to the second value, adding the second AS to a list of actual AS neighbors.

Growing community of inventors

Madison, NJ, United States of America

Walter Willinger