Two Bandwidth Packing Algorithms for a Centralized Wireless Network and Their Average-case Analysis

This paper presents an analysis of two algorithms for processing requests for connections in a centralized wireless network. These algorithms are called bandwidth packing algorithms. Each call request comes with a bandwidth demand. A demand can be met only if there is sufficient bandwidth available during allocation, and requests with demands not met are held in a queue. We use the measure of bandwidth utility ratio to quantify the performance of our algorithms. Our results have shown that we can increase the bandwidth resource utility ratio (8%~10%) significantly without adding much computation complexity