Abhay Parekh

TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.

TL;DR: The authors propose the use of a packet service discipline at the nodes of the network that is based on a multiplex scheme called generalized processor sharing (GPS) that is combined with leaky bucket rate admission control to provide flexible, efficient and fair use of the links.

TL;DR: This work investigates whether efficiency and fairness can be obtained with self-enforcing spectrum sharing rules, and presents examples that illustrate that in many cases the performance loss due to selfish behavior is small.

TL;DR: A central theme emerges: the use of lattice codes for alignment of interfering signals on the signal level in the Gaussian interference channel to within a constant number of bits.

TL;DR: This paper addresses the problem of characterizing and designing scheduling policies that are optimal in the sense of minimizing buffer and/or delay requirements under the assumption of commonly accepted traffic constraints, and investigates buffer requirements under three typical memory allocation mechanisms which represent tradeoffs between efficiency and complexity.