By Topic

Application of Sequencing Policies to Telephone Switching Facilities

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

3 Author(s)

Sequencing policies for telephone switching facilities are examined. During the transient period, when old switching facilities are being replaced by new ones, substantial costs are incurred to guarantee uninterrupted service to all customers. These costs depend on the sequence chosen for transferring trunk groups from the old facility to the new one. A dynamic programming model is formulated to determine the optimal sequence. To facilitate the computation for problems of realistic size, a bounding procedure is developed which considerably reduces the storage requirements without sacrificing optimality. Thereafter, a heuristic is developed for larger facilities with up to about fifty trunk groups. The model has been computerized and is currently being used. Numerical examples and applications are discussed.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:7 ,  Issue: 8 )