By Topic

A capacity expansion model with applications to multiplexing in communication networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Luss, Hanan ; AT&T Bell Labs., Holmdel, NJ, USA

A capacity expansion model in which three types of demand are served by three facility types is described. The model can be applied to multiplexing problems for communication networks as well as to capacity expansion problems with deluxe and standard facility types. The capacity of any facility type can be expanded by adding units of equal size. An efficient single-state dynamic programming algorithm that finds the optimal expansion schedule as well as the optimal demand assignment and demand rearrangement decisions is developed. A lower bound that under certain conditions is equal to the optimal solution is also developed.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-14 ,  Issue: 3 )