Publications/Networking

Systems and methods for multiresolution priority queues

A system for storing and extracting elements according to their priority takes into account not only the priorities of the elements but also three additional parameters, namely, a priority resolution pΔ and two priority limits pmin and pmax. By allowing an ordering error if the difference in the priorities of elements are

Read More »

Designing Data Center Networks Using Bottleneck Structures

This paper provides a mathematical model of data center performance based on the recently introduced Quantitative Theory of Bottleneck Structures (QTBS). Using the model, we prove that if the traffic pattern is interference-free, there exists a unique optimal design that both minimizes maximum flow completion time and yields maximal system-wide

Read More »

A Quantitative Theory of Bottleneck Structures for Data Networks

The conventional view of the congestion control problem in data networks is based on the principle that a flow’s performance is uniquely determined by the state of its bottleneck link, regardless of the topological properties of the network. However, recent work has shown that the behavior of congestion-controlled networks is

Read More »

On the Bottleneck Structure of Congestion-Controlled Networks

In this paper, we introduce the Theory of Bottleneck Ordering, a mathematical framework that reveals the bottleneck structure of data networks. This theoretical framework provides insights into the inherent topological properties of a network at least in three areas: (1) It identifies the regions of influence of each bottleneck; (2)

Read More »

Systems and Methods for Multiresolution Parsing

A multiresolution parser (MRP) can selectively extract one or more information units from a dataset based on the available processing capacity and/or the arrival rate of the dataset. Should any of these parameters change, the MRP can adaptively change the information units to be extracted such that the benefit or

Read More »