Two bandwidth packing algorithms for the centralized wireless network and their average-case analysis

被引：0

作者：

Chen, Jian-Xin ^{[1
,2
]}

Gong, Ling ^{[1
]}

Yang, Yu-Hang ^{[1
]}

Zeng, Peng ^{[2
]}

机构：

[1] Dept. of Electronic Eng., Shanghai Jiaotong Univ., Shanghai 200240, China

[2] Dept. of Computer Eng., Nanjing Univ. of Posts and Telecommunications, Nanjing 210093, China

来源：

Journal of Shanghai Jiaotong University (Science) | 2007年 / 12 E卷 / 03期

关键词：

Bandwidth - Calculations - Resource allocation - Scheduling - Scheduling algorithms;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：397 / 404