Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Stability and performance analysis of networks supporting elastic services
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
State space collapse with application to heavy traffic limits for multiclass queueing networks
Queueing Systems: Theory and Applications
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Network optimization and control
Foundations and Trends® in Networking
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Qualitative properties of α-weighted scheduling policies
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
On the Connection-Level Stability of Congestion-Controlled Communication Networks
IEEE Transactions on Information Theory
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
IEEE Journal on Selected Areas in Communications
Inefficiency of MaxWeight scheduling in spatial wireless networks
Computer Communications
Hi-index | 0.00 |
The packet is the fundamental unit of transportation in modern communication networks such as the Internet. Physical layer scheduling decisions are made at the level of packets, and packet-level models with exogenous arrival processes have long been employed to study network performance, as well as design scheduling policies that more efficiently utilize network resources. On the other hand, a user of the network is more concerned with end-to-end bandwidth, which is allocated through congestion control policies such as TCP. Utility-based flow-level models have played an important role in understanding congestion control protocols. In summary, these two classes of models have provided separate insights for flow-level and packet-level dynamics of a network. In this paper, we wish to study these two dynamics together. We propose a joint flow-level and packet-level stochastic model for the dynamics of a network, and an associated policy for congestion control and packet scheduling that is based on alpha-weighted policies from the literature. We provide a fluid analysis for the model that establishes the throughput optimality of the proposed policy, thus validating prior insights based on separate packet-level and flow-level models. By analyzing a critically scaled fluid model under the proposed policy, we provide constant factor performance bounds on the delay performance and characterize the invariant states of the system.