Simulative analysis of optimal resource allocation and routing in IBCN's

The problem of resource allocation for future integrated broadband communication networks (IBCNs) is addressed. It mainly involves resource allocation at the connection level. The resource allocation problem is decomposed into the following interdependent tasks: given that a network can accommodate the bandwidth demand of a call request, determine a route for the corresponding asynchronous transfer mode (ATM) virtual connection; and allocate bandwidth, i.e. links inside the trunks of the chosen route, to this connection according to predefined limits on bandwidth use by various service calls. Various link allocation schemes combined with routing algorithms are examined. Their performance in terms of service call blocking is evaluated using a software package developed, for that purpose. It is shown that the traditional complete sharing (CS) and complete partitioning (CP) policies are not adequate for IBCNs. Movable boundary (MB) policies are more flexible and present near-optimal performance when access of broadband service to narrowband service resources is allowed and suitable routing algorithms are dynamically applied