The Repacking Efficiency for Bandwidth Packing Problem(Complexity Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2007-07-01

著者

• Zhou Lei

  Department Of Electronics Engineering Shanghai Jiaotong University

• Chen Jianxin

  Department Of Electronics Engineering Shanghai Jiaotong University:(present Office)college Of Comput

• Yang Yuhang

  Department Of Electronics Engineering Shanghai Jiaotong University

• Chen Jianxin

  Department Of Cardiovascular Surgery The Fourth Affiliated Hospital Harbin Medical University

関連論文

• Use of ultrasonic imaging for analysis of the craniofacial skeletal morphology
• Soft tissue profile changes in patients with Angle Class II division 1 malocclusion treated using a functional regulator
• The Repacking Efficiency for Bandwidth Packing Problem(Complexity Theory)
• The relationship between EGFR gain and VHL loss in lung adenocarcinoma and poor patient survival

スポンサーリンク