A capacity expansion model with applications to multiplexing in communication networks
- Resource Type
- Periodical
- Authors
- Luss, Hanan
- Source
- IEEE Transactions on Systems, Man, and Cybernetics IEEE Trans. Syst., Man, Cybern. Systems, Man and Cybernetics, IEEE Transactions on. SMC-14(3):419-423 Jun, 1984
- Subject
- Signal Processing and Analysis
Components, Circuits, Devices and Systems
Computing and Processing
General Topics for Engineers
Communication, Networking and Broadcast Technologies
Robotics and Control Systems
Power, Energy and Industry Applications
Dynamic programming
Heuristic algorithms
Yttrium
Multiplexing
Communication networks
Algorithm design and analysis
Planning
- Language
- ISSN
- 0018-9472
2168-2909
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. Primarily, demand types 1 and 2 are served by facility types 1 and 2. However, if used jointly, they are also capable of serving demand type 3. Once assigned to facilities 1 and 2, demand type 3 can be reassigned at a certain cost so that in future periods it will be served by facility type 3. Facility type 3 can serve only demand type 3. Deterministic demands over a finite number of discrete time periods are satisfied by the facilities. 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.