A survey of network design problems and joint design approaches in wireless mesh networks
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 …
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
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 …
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
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 …
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 …
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
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 …
algorithms can achieve the maximum possible throughput in ad hoc wireless networks …
On combining shortest-path and back-pressure routing over multihop wireless networks
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 …
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
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 …
called greedy maximal scheduling (GMS), for multihop wireless networks. While a lower …
Performance evaluation of WebRTC-based video conferencing
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) …
fact that many browsers support it. WebRTC utilizes the Google Congestion Control (GCC) …
Low-complexity distributed scheduling algorithms for wireless networks
We consider the problem of designing distributed scheduling algorithms for wireless
networks. We present two algorithms, both of which achieve throughput arbitrarily close to …
networks. We present two algorithms, both of which achieve throughput arbitrarily close to …
Delay-based back-pressure scheduling in multihop wireless networks
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 …
wireless networks. It is well known that scheduling schemes that favor links with larger …