The Asynchronous Transfer Mode: a tutorial
Computer Networks and ISDN Systems - Special issue on the ATM—asynchronous transfer mode
International standardization of B-ISDN
Computer Networks and ISDN Systems - Special issue: Broadband ISDN: standards, switches, and traffic management
Optimizing the system of virtual paths
IEEE/ACM Transactions on Networking (TON)
Virtual path routing for survivable ATM networks
IEEE/ACM Transactions on Networking (TON)
The layout of virtual paths in ATM networks
IEEE/ACM Transactions on Networking (TON)
ATM network resources management using layer and virtual network concepts
Proceedings of the fifth IFIP/IEEE international symposium on Integrated network management V : integrated management in a virtual world: integrated management in a virtual world
A general framework for routing management in multi-service ATM networks
Proceedings of the fifth IFIP/IEEE international symposium on Integrated network management V : integrated management in a virtual world: integrated management in a virtual world
Deterministic algorithm for VP assignment in ATM networks
Computer Communications
Administration of restorable virtual path mesh networks
IEEE Communications Magazine
Self-healing ATM networks based on virtual path concept
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
Virtual paths (VPs) in an ATM network form a logical network, called VP network (VPN), over the underlying physical network. VPN allows flexible management of network resources and hence its design is an important issue in designing an ATM network. In this paper, we consider the VPN design problem which is formulated as an optimization problem with the objective of minimizing the switching and transmission cost, and control and management cost. We present here, a two-phase heuristic solution for designing a good VPN for a given traffic demand. The first phase is a routing phase in which a route is found between every node pair in the network. In the second phase, paths are selected as VPs using the set of routes generated in the routing phase. A path is selected as a VP so as to minimize the following parameters: (i) the total number of VPs configured; (ii) the number of VPs carried by a link (load); and (iii) the VP hopcount, the number of VPs that are concatenated to form a virtual channel (VC). We study the performance of the proposed algorithm through extensive simulation on various networks. The results show that the VPN generated by the proposed algorithm is good in minimizing the number of VPs configured, the load on a link, and the VP hopcount. The comparison of the results obtained by the proposed algorithm and that of Ahn et al. [Virtual path layout design in ATM networks, in: Proceedings of IEEE INFCOM'94, Toronto, Ontario, Canada, 1994, pp. 192-200] shows that our algorithm performs better.