By Topic

An efficient method for determining economical configurations of elementary packet-switched 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
$31 $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

2 Author(s)
Kamimura, K. ; NTT. Tokyo, Japan ; Nishimo, H.

The packet-switched network design problem can be formulated as a capacity and flow assignment (CFA) problem. The CFA problem is investigated for an elementary network consisting of one tandem switch and n local switches. It is regarded as the structural unit of a hierarchical network. It is assumed that any line speed is available and the cost of each line is a linear function of its speed with a fixed charge for installation. This CFA problem is shown to be equivalent to a 0-1 integer programming problem with a discontinuous cost function. A threshold rule and a row-wise or column-wise improvement (RCI) iteration are proposed to solve the problem. The threshold rule assigns all the traffic between two local switches to a direct route if the required traffic exceeds a predetermined threshold value, and otherwise to a tandem route. The RCI iteration searches the vertices of the unit cube of 2n-dimensional Euclidean space by a procedure roughly like the simplex method. Whenever the network has external traffic, direct application of the threshold rule ensures a global optimum. When there is no external traffic, a simple modification of the RCI iteration yields almost a global optimum within 2n steps

Published in:

Communications, IEEE Transactions on  (Volume:39 ,  Issue: 2 )