A bounded item bin packing problem over discrete distribution

Authors:
Jianxin Chen;Yuhang Yang;Hong Zhu;Peng Zeng
Affiliations:
Shanghai Jiaotong University, Shanghai, P.R. China;Shanghai Jiaotong University, Shanghai, P.R. China;Fudan University, Shanghai, P.R. China;Nanjing University of Posts & Telecommunications, Nanjing, P.R. China
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 9
Cited 1

Martingale inequalities and NP-complete problems

Mathematics of Operations Research
Internetworking with TCP/IP: principles, protocols, and architecture

Internetworking with TCP/IP: principles, protocols, and architecture
Bandwidth packing: a tabu search approach

Management Science
An integer programming approach to the bandwidth packing problem

Management Science
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
The multi-hour bandwidth packing problem

Computers and Operations Research
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

SIAM Journal on Discrete Mathematics
COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS

Probability in the Engineering and Informational Sciences
Probabilistic analysis of some bin-packing problems

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

The Repacking Efficiency for Bandwidth Packing Problem

IEICE - Transactions on Information and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we formulate a bounded item bin packing problem over discrete distribution (BIBPPOD) in computer and communication networks, and consider the average performance ratio for next fit algorithm. An efficient average-case analysis procedure for finding the average performance ratio and problem solution is demonstrated. We give the closed-form expression for some special range to which the bounded item belongs. Our result is useful for designing the length in fixed-size format or evaluating the performance impacted by the protocol header in computer and communication network.