Deterministic algorithm for VP assignment in ATM networks

Virtual Path (VP) assignment is an important resource management activity in ATM networks. By using the VP concept, the logical layout of the network can be administered to minimize the total network cost to the provider. We formulate the VP assignment problem as a constrained optimization problem; the objective function to be minimized reflects processing/control costs at nodes and transmission costs between nodes. The blocking probability quality of service (QoS) requirements and overall throughput of the network are taken into consideration in the solution process as constraints. Since the solution space is complex, we develop a deterministic, iterative heuristic algorithm to reach a 'near-optimal' VP configuration for a given physical network and traffic demand. The Multi-Rate Loss Network model is used in the calculation of connection-level blocking probabilities. Results for static connection-routing are presented, for various forms of the objective function and constraints.

[1]  J. Burgin,et al.  Broadband ISDN resource management: the role of virtual paths , 1991, IEEE Communications Magazine.

[2]  Nguyen Duc,et al.  ISDN protocol architecture , 1985, IEEE Commun. Mag..

[3]  Keith W. Ross,et al.  Reduced load approximations for multirate loss networks , 1993, IEEE Trans. Commun..

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  Ken-ichi Sato,et al.  Broad-band ATM network architecture based on virtual paths , 1990, IEEE Trans. Commun..

[6]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[7]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[8]  Sanghyun Ahn,et al.  Virtual path layout design on ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[9]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[10]  Simon S. Lam,et al.  Queuing Networks with Population Size Constraints , 1977, IBM J. Res. Dev..

[11]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[12]  Ioannis Viniotis,et al.  Virtual path assignment in atm networks , 1996 .

[13]  Kwang-Ting Cheng,et al.  Virtual path assignment and virtual circuit routing in ATM networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[14]  I. Chlamtac,et al.  How to establish and utilize virtual paths in ATM networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[15]  Ori Gerstel,et al.  The virtual path layout problem in fast networks (extended abstract) , 1994, PODC '94.

[16]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[17]  K. Sato,et al.  A new transport network architecture based on asynchronous transfer mode techniques , 1988, ISSLS 88., International Symposium on Subscriber Loops and Services.

[18]  Imrich Chlamtac,et al.  Optimizing the system of virtual paths , 1994, TNET.