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

Author

Chen, Jianxin ; Gong, Ling ; Yang, Yuhang

Author_Institution

Dept. of ELectron. Eng., Shanghai Jiao Tong Univ.

fYear

0

fDate

0-0 0

Firstpage

628

Lastpage

632

Abstract

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

Keywords

bandwidth allocation; radio networks; resource allocation; average-case analysis; bandwidth packing algorithm; call request; centralized wireless network; resource utilization; Algorithm design and analysis; Bandwidth; Centralized control; Frequency conversion; Multiaccess communication; Processor scheduling; Quality of service; Resource management; Scheduling algorithm; Wireless networks; Average Performance Ratio; Bandwidth Packing; Bandwidth Utility Ratio; Wireless Network;

fLanguage

English

Publisher

ieee

Conference_Titel

Information, Communications and Signal Processing, 2005 Fifth International Conference on

Conference_Location

Bangkok

Print_ISBN

0-7803-9283-3

Type

conf

DOI

10.1109/ICICS.2005.1689123

Filename

1689123