SYSTEM AND METHOD FOR OPTIMAL LOGICAL NETWORK CAPACITY DEMENSIONING WITH BROADBAND TRAFFIC

摘要

A general dimensioning method and system (fig. 19) for allocating limited transmission resources to virtual networks given offered traffic for virtual paths on the virtual networks. The N-layer virtual network dimensioning problem is reduced (1903) to an equivalent virtual path dimensioning problem by collapsing the top three layers of an N-level hierarchichal structure to a two-layer hierarchical structure consisting of the old bottom layer and a new top layer. The new top layer comprises a plurality of virtual routes mapped on the old bottom layer. The resulting virtual route dimensioning problem can be solved (1905) using standard techniques or by using an entropy-based dimensioning algorithm to yield the optimal allocation of resources for layer N-2.