The Personal Interview

In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the practical implementation of the protocols.

https://www-inst.eecs.berkeley.edu/~ee228a/fa03/228A03/papers/Mo.pdf

Fair end-to-end window-based congestion control

This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are provided to illustrate the cost of approaching optimality. This theory is also applicable to problems in operations research and economics, where energy-efficient and profit-maximizing decisions must be made without knowing the future. Topics in the text include the following: - Queue stability theory - Backpressure, max-weight, and virtual queue methods - Primal-dual methods for non-convex stochastic utility maximization - Universal scheduling theory for arbitrary sample paths - Approximate and randomized scheduling theory - Optimization of renewal systems and Markov decision systems Detailed examples and numerous problem set questions are provided to reinforce the main concepts. Table of Contents: Introduction / Introduction to Queues / Dynamic Scheduling Example / Optimizing Time Averages / Optimizing Functions of Time Averages / Approximate Scheduling / Optimization of Renewal Systems / Conclusions

Stochastic Network Optimization with Application to Communication and Queueing Systems

This document provides updates to IEEE Std 802.16's MIB for the MAC, PHY and asso- ciated management procedures in order to accommodate recent extensions to the standard.

IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems Draft Amendment: Management Information Base Extensions

Massive multiple-input multiple-output MIMO is one of themost promising technologies for the next generation of wirelesscommunication networks because it has the potential to providegame-changing improvements in spectral efficiency SE and energyefficiency EE. This monograph summarizes many years ofresearch insights in a clear and self-contained way and providesthe reader with the necessary knowledge and mathematical toolsto carry out independent research in this area. Starting froma rigorous definition of Massive MIMO, the monograph coversthe important aspects of channel estimation, SE, EE, hardwareefficiency HE, and various practical deployment considerations.From the beginning, a very general, yet tractable, canonical systemmodel with spatial channel correlation is introduced. This modelis used to realistically assess the SE and EE, and is later extendedto also include the impact of hardware impairments. Owing tothis rigorous modeling approach, a lot of classic "wisdom" aboutMassive MIMO, based on too simplistic system models, is shownto be questionable.

https://www.nowpublishers.com/article/DownloadSummary/SIG-093

Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency

We propose some improvements of TCP Vegas and compare its performance characteristics with TCP Reno. We argue through analysis that TCP Vegas, with its better bandwidth estimation scheme, uses the network resources more efficiently and fairly than TCP Reno. Simulation results are given that support the results of the analysis.

Analysis and comparison of TCP Reno and Vegas

This paper compares, through analysis and simulation, a number of multichannel MAC protocols. We first classify these protocols into four categories based on their principles of operation: dedicated control channel, common hopping, split phase, and parallel rendezvous protocols. We then examine the effects of the number of channels and devices, channel switching times, and traffic patterns on the throughput and delay of the protocols. Here are some of the conclusions of our study: (1) parallel rendezvous protocols generally perform better than single rendezvous protocols, (2) the dedicated control channel protocol can be a good approach with its simplicity when the number of channels is high and the packets are long, and (3) the split phase protocol is very sensitive to the durations of the control and data phases. Our study focuses on a single collision domain.

/pdf/comparison-of-multichannel-mac-protocols-49au29u7fp.pdf

Comparison of Multichannel MAC Protocols

Many multiple channel MAC protocols for wireless networks have been proposed to make efficient use of multiple channels where each node has a single radio which allows it to send or receive on one channel at a time. However, most of the proposed protocols are single rendezvous protocols that are subject to the congestion of the control channel. The paper proposed a new parallel rendezvous protocol, McMAC, to avoid control channel congestion so that it can scale to use a large number of channels efficiently. The authors validate the protocol design using simulation and implementation.

McMAC: A Parallel Rendezvous Multi-Channel MAC Protocol

In this paper, we demonstrate the existence of fair end-to- end window-based congestion control protocols for packet- switched networks with FCFS routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the construction of the protocols.© (1998) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Jeonghoon Mo

Papers

Fair end-to-end window-based congestion control

Analysis and comparison of TCP Reno and Vegas

Comparison of Multichannel MAC Protocols

McMAC: A Parallel Rendezvous Multi-Channel MAC Protocol

Fair end-to-end window-based congestion control