The Repacking Efficiency for Bandwidth Packing Problem

Jianxin CHEN
Yuhang YANG
Lei ZHOU

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E90-D    No.7    pp.1011-1017
Publication Date: 2007/07/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e90-d.7.1011
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Complexity Theory
Keyword: 
bandwidth packing problem,  repacking efficiency,  centralized networks,  average performance,  

Full Text: PDF(235.6KB)>>
Buy this Article


Summary: 
Repacking is an efficient scheme for bandwidth packing problem (BPP) in centralized networks (CNs), where a central unit allocates bandwidth to the rounding terminals. In this paper, we study its performance by proposing a new formulation of the BPP in the CN, and introducing repacking scheme into next fit algorithm in terms of the online constraint. For the realistic applications, the effect of call demand distribution is also exploited by means of simulation. The results show that the repacking efficiency is significant (e.g. the minimal improvement about 13% over uniform distribution), especially in the scenarios where the small call demands dominate the network.

open access publishing via