Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
A reliable and scalable striping protocol
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
Methodical Analysis of Adaptive Load Sharing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Fundamentals of wireless communication
Fundamentals of wireless communication
Fundamentals of WiMAX: Understanding Broadband Wireless Networking (Prentice Hall Communications Engineering and Emerging Technologies Series)
A unified framework for max-min and min-max fairness with applications
IEEE/ACM Transactions on Networking (TON)
Introduction to Space-Time Wireless Communications
Introduction to Space-Time Wireless Communications
Hi-index | 0.00 |
We present a wireless switching architecture that allows a self-interference-free asynchronous packet communication in multi-channel wireless switching networks. We propose a system architecture to get around the self-interference problem, which arises due to the proximity among RF devices in the switch and the large difference in strengths between receiving and transmitting signals. We then present a straightforward solution of separating the frequency spectra used for receiving and transmitting signals and propose a MAC/PHY cross-layer protocol for efficiently managing the channel bandwidth for asynchronous packet-based communication. We show that, when a K-port wireless switch with each port providing 20 MHz of bidirectional bandwidth, the total communication bandwidth can be increased to 1.4K × 20 MHz, which is about 2K times as high as a wireless access point with 20 MHz per channel. Finally, we introduce a scheduling scheme with a dynamic load balancing to ensure global fairness for all users. The performance of our algorithm is compared to that of the Least-Loaded-First (LLF) user assignment policy using simulations.