Bandwidth packing: a tabu search approach
Management Science
Path assignment for call routing: an application of tabu search
Annals of Operations Research - Special issue on Tabu search
An integer programming approach to the bandwidth packing problem
Management Science
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
SIAM Journal on Computing
Online bin packing with lookahead
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Queueing delay guarantees in bandwidth packing
Computers and Operations Research
The Multi-Hour Bandwidth Packing Problem with Response Time Guarantees
Information Technology and Management
COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
Probability in the Engineering and Informational Sciences
A bounded item bin packing problem over discrete distribution
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
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.