IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Maximum Weighted Matching with Interference Constraints
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
On guaranteed smooth scheduling for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Impact of interference on multi-hop wireless network performance
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Throughput Region of Finite-Buffered Networks
IEEE Transactions on Parallel and Distributed Systems
Low jitter guaranteed-rate communications for cluster computing systems
International Journal of Communication Networks and Distributed Systems
A low-jitter guaranteed-rate scheduling algorithm for packet-switched IP routers
IEEE Transactions on Communications
On tracking the behavior of an output-queued switch using an input-queued switch
IEEE/ACM Transactions on Networking (TON)
Joint scheduling and power control for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution
IEEE Communications Magazine
Advances and Challenges with Data Broadcasting in Wireless Mesh Networks
IEEE Communications Magazine
Multi-hop wireless backhaul networks: a cross-layer design paradigm
IEEE Journal on Selected Areas in Communications
Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
A low-jitter guaranteed-rate scheduling algorithm for packet-switched IP routers
IEEE Transactions on Communications
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
| Hi-index | 0.00 |
A technology to increase throughput and QoS in infrastructure-based Wireless Mesh Networks (WMNs) is proposed. In a uniform WMN, let each Base Station (BS) have R1 transceivers for communications with neighboring BSs, and R2 transceivers for communications with the Stationary and Mobile Subscribers within the wireless cell. One Gateway BS provides access to the global Internet, and the throughput capacity of the entire WMN is constrained by the IO bandwidth of the Gateway. A small number of extra wireless links can be added to the Gateway BS and selected other BSs, resulting in a nonuniform system. The addition of an asymptotically small number of transceivers can increase WMN capacity several fold. Efficient scheduling requires the partitioning of an asymmetric bipartite graph representing a general traffic rate matrix, into multiple graphs representing doubly-stochastic matrices. Routing and scheduling algorithms presented. The algorithms can provision long-term multimedia flows including VOIP or IPTV with guaranteed service. For multichannel WMNs where the traffic is routed and partitioned, the number of queued cells per BS is near-minimal and bounded, the end-to-end delay and jitter are near-minimal and bounded, and cell loss rates due to scheduling conflicts are zero. The algorithm also achieves 100% of capacity.