A novel link set dimensioning procedure for networks supporting the load splitting link selection algorithm

Abstract

The load splitting link selection algorithm used in the Common Channel Signaling (CCS) network and proposed for use in the interswitching system interface in the network supporting the Switched Multimegabit Data Service (SMDS) is considered. The algorithm uses a randomly generated bit pattern to select a link for transmission. The author discusses how the traffic loads are distributed among the links in a link set based on the load splitting link selection algorithm and shows that, in some cases, the overall traffic capacity of the link set does not increase even when the number of installed links increases. A theorem that shows how to construct the set of links to increase the line set capacity is demonstrated. The theorem is used as the basis for an efficient and flexible procedure for implementing the link dimensioning algorithm in software, to support the mechanization of the CCS and SMDS network planning and traffic engineering functions.<>