This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can ...This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can be satisfied only if there is sufficient bandwidth available during resource scheduling and allocation. Unsatisfied requests were held in a queue. The metric of bandwidth utilization ratio was used to quantify the performance of our algorithms. By theoretical analysis, our algorithms can improve the average bandwidth usage ratio significantly, about 8%~10% without adding much computation complexity. Moreover, our algorithms outperform next fit with fragmentation (NFF) algorithm when the bandwidth resource is scarce. In this paper, the contributions follows: Introducing bandwidth packing problem into wireless network; Proposing two new bandwidth packing algorithms for wireless network where the complicate scheduling algorithms are prohibited; Studying the average performance of our algorithms mathematically, which agree well with the simulation results.展开更多
文摘This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can be satisfied only if there is sufficient bandwidth available during resource scheduling and allocation. Unsatisfied requests were held in a queue. The metric of bandwidth utilization ratio was used to quantify the performance of our algorithms. By theoretical analysis, our algorithms can improve the average bandwidth usage ratio significantly, about 8%~10% without adding much computation complexity. Moreover, our algorithms outperform next fit with fragmentation (NFF) algorithm when the bandwidth resource is scarce. In this paper, the contributions follows: Introducing bandwidth packing problem into wireless network; Proposing two new bandwidth packing algorithms for wireless network where the complicate scheduling algorithms are prohibited; Studying the average performance of our algorithms mathematically, which agree well with the simulation results.
