Network protocols in layered architectures have historically been obtained on an ad hoc
basis, and many of the recent cross-layer designs are also conducted through piecemeal …

This tutorial paper overviews recent developments in optimization-based approaches for
resource allocation problems in wireless systems. We begin by overviewing important …

In this paper we present pFabric, a minimalistic datacenter transport design that provides
near theoretically optimal flow completion times even at the 99th percentile for short flows …

In this paper we study resource allocation problems that involve multiple self-interested
parties or players and a central decision maker. We introduce and study the price of fairness …

Congestion control algorithms were implemented for the Internet nearly two decades ago,
but mathematical models of congestion control in such a large-scale network are relatively …

Provides a modern mathematical approach to the design of communication networks for
graduate students, blending control, optimization, and stochastic network theories. A broad …

We present five axioms for fairness measures in resource allocation. A family of fairness
measures satisfying the axioms is constructed. Special cases of this family include¿-fairness …

Quantifying the notion of fairness is underexplored when there are multiple types of
resources and users request different ratios of the different resources. A typical example is …

This paper deals with a basic issue: How does one approach the problem of designing the
“right” objective for a given resource allocation problem? The notion of what is right can be …

This paper concerns the design of distributed algorithms for sharing network bandwidth
resources among contending flows. The classical fairness notion is the so-called max-min …