NETWORK ROUTING CONTROLLED BY A MANAGEMENT NODE CALL

摘要

A network management node (10) collects trunk loading data and switch congestion data from switches in a telecommunication system. Path loading vectors (52, 56,) constraint vector (66), and switch congestion vector (76) are calculated and compared to yield potential intermediate switch candidates having the lowest available trunk traffic loading and switches with the lowest congestion consistent with other constraints associated with intermediate switch selection. Trunk groups with increasing levels of traffic and switches with increasing levels of congestion are incrementally tested in order to yield potential intermediate switch candidates whereby call distribution to the lightest loaded trunks and switches is accomplished.