Reservoir Labs, Inc.

Aditya Gudibanda

Jordi Ros-Giralt

Paul Declan Mountcastle

Mitchell Harris

Techniques based on the Theory of Bottleneck Ordering can reveal the bottleneck structure of a network, and the Theory of Flow ordering can take advantage of the revealed bottleneck structure to manage and configure network flows so as to improve the overall network performance. These two techniques provide insights into the inherent topological properties of a network at least in three areas: (1) identification of the regions of influence of each bottleneck; (2) the order in which bottlenecks (and flows traversing them) may converge to their steady state transmission rates in distributed congestion control algorithms; and (3) the design of optimized traffic engineering policies.

Systems and methods for quality of service (QoS) based management of bottlenecks and flows in networks

In an apparatus for determining the state of a system in which several system components undergo respective changes simultaneously, sensor measurements obtained from the components and candidate paths representing the individual states of the different components are analyzed. In this analysis, the system state is modeled in terms of likelihoods that certain paths correspond to true parameterized paths representing individual states of the system components and likelihoods that certain observations are associated with certain components. An optimization of the model provides accurate values of each type of likelihood, which then indicate the likely state of the system.

Systems and methods for improved track accuracy for multiple targets

In a system for efficiently detecting large/elephant flows in a network, the rate at which the received packets are sampled is adjusted according to a top flow detection likelihood computed for a cache of flows identified in the arriving network traffic. After observing packets sampled from the network, Dirichlet-Categorical inference is employed to calculate a posterior distribution that captures uncertainty about the sizes of each flow, yielding a top flow detection likelihood. The posterior distribution is used to find the most likely subset of elephant flows. The technique rapidly converges to the optimal sampling rate at a speed O(1/n), where n is the number of packet samples received, and the only hyperparameter required is the targeted detection likelihood.

Growing community of inventors

Jersey City, NJ, United States of America

Aditya Gudibanda