A survey of network design problems and joint design approaches in wireless mesh networks

PH Pathak, R Dutta - IEEE Communications surveys & tutorials, 2010 - ieeexplore.ieee.org
Over the last decade, the paradigm of Wireless Mesh Networks (WMNs) has matured to a
reasonably commonly understood one, and there has been extensive research on various …

An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks

W Si, S Selvakennedy, AY Zomaya - Journal of Parallel and Distributed …, 2010 - Elsevier
Channel Assignment (CA) is an active research area due to the proliferating deployments of
multi-radio multi-channel wireless mesh networks. This paper presents an in-depth survey of …

Stochastic models of load balancing and scheduling in cloud computing clusters

ST Maguluri, R Srikant, L Ying - 2012 Proceedings IEEE …, 2012 - ieeexplore.ieee.org
Cloud computing services are becoming ubiquitous, and are starting to serve as the primary
source of computing power for both enterprises and personal computing applications. We …

A distributed CSMA algorithm for throughput and utility maximization in wireless networks

L Jiang, J Walrand - IEEE/ACM Transactions on Networking, 2009 - ieeexplore.ieee.org
In multihop wireless networks, designing distributed scheduling algorithms to achieve the
maximal throughput is a challenging problem because of the complex interference …

Q-CSMA: Queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

J Ni, B Tan, R Srikant - IEEE/ACM Transactions on Networking, 2011 - ieeexplore.ieee.org
Recently, it has been shown that carrier-sense multiple access (CSMA)-type random access
algorithms can achieve the maximum possible throughput in ad hoc wireless networks …

On combining shortest-path and back-pressure routing over multihop wireless networks

L Ying, S Shakkottai, A Reddy… - IEEE/ACM Transactions …, 2010 - ieeexplore.ieee.org
Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have
recently received much attention for jointly routing and scheduling over multihop wireless …

Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks

C Joo, X Lin, NB Shroff - IEEE/ACM transactions on networking, 2009 - ieeexplore.ieee.org
In this paper, we characterize the performance of an important class of scheduling schemes,
called greedy maximal scheduling (GMS), for multihop wireless networks. While a lower …

Performance evaluation of WebRTC-based video conferencing

B Jansen, T Goodwin, V Gupta, F Kuipers… - ACM SIGMETRICS …, 2018 - dl.acm.org
WebRTC has quickly become popular as a video conferencing platform, partly due to the
fact that many browsers support it. WebRTC utilizes the Google Congestion Control (GCC) …

Low-complexity distributed scheduling algorithms for wireless networks

A Gupta, X Lin, R Srikant - IEEE/ACM Transactions on …, 2009 - ieeexplore.ieee.org
We consider the problem of designing distributed scheduling algorithms for wireless
networks. We present two algorithms, both of which achieve throughput arbitrarily close to …

Delay-based back-pressure scheduling in multihop wireless networks

B Ji, C Joo, NB Shroff - IEEE/ACM Transactions on Networking, 2012 - ieeexplore.ieee.org
Scheduling is a critical and challenging resource allocation mechanism for multihop
wireless networks. It is well known that scheduling schemes that favor links with larger …