CAPACITY ASSIGNMENT FOR CIRCUIT-SWITCHED REFERENCE NETWORKS WITH NONHIERARCHICAL ROUTING

Capacity assignment (CA) implies the minimization of network cost subj ect to several constraints, such as traffic demands, end-to-end Grade of Services (GOS) and the non negativity conservation of flows. Real a symmetric networks may be described by several statistical moments of different orders. Thus a reference network may be characterized by the mean distance between a given set of fully intermeshed nodes, the mea n traffic offered per demand pair, and the mean GOS for all end-to-end blockings. At first, we present an exact theoretical solution of the CA-problem for symmetric circuit- switched networks. We start with the formulation of the end-to-end blockinges with nonhierarchical two-lin k path alternate routing for reversible and nonreversible scheme, resp ectively. Next, we derive the Kuhn-Tucker conditions for the CA-proble m. The corresponding solution is verified to be unique and stable. The n, we proceed to approximate the relevant optimal parameters, such as die economic high link blocking, the optimal size of routing sequences and the minimum link size, by using least-square fitting. The results form new rules of thumb for a wide range of traffic demand and GOS an d may thus be used to support the initial dimensioning of asymmetric n onhierarchical networks. Finally an approximation for asymmetric netwo rks is proposed and verified, which is based on an appropriate CA deco mposition and relevant traffic parameters of both the symmetric refere nce and its asymmetric extension.