| Two Bandwidth Packing Algorithms for the Centralized Wireless Network and Their Average-case Analysis |
| |
| 作者姓名： | 陈建新 龚玲 杨宇航 曾鹏 |
| |
| 作者单位： | [1]Dept．ofElectronicEng．,ShanghaiJiaotongUniv．,Shanghai200240,China [2]Dept．ofComputerEng．ofNanjingUniv．ofPosts＆．Telecommunications,Nanjing210093,China |
| |
| 摘 要： | 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.
|
| 关 键 词： | 计算机网络技术 宽带 生产性能 包装技术 |
Two Bandwidth Packing Algorithms for the Centralized Wireless Network and Their Average-case Analysis |
| |
| CHEN Jian-xin,GONG Ling,YANG Yu-hang,ZENG Peng.Two Bandwidth Packing Algorithms for the Centralized Wireless Network and Their Average-case Analysis[J].Journal of Shanghai Jiaotong university,2007,12(3):397-404. |
| |
| Authors: | CHEN Jian-xin GONG Ling YANG Yu-hang ZENG Peng |
| |
| Abstract: | 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. |
| |
| Keywords: | wireless network average performance bandwidth packing problem (BWP) |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
