Deterministic algorithm for VP assignment in ATM networks

Authors:
Metin Aydemir;Yannis Viniotis
Affiliations:
Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27695-7911, USA;Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27695-7911, USA
Venue:
Computer Communications
Year:
1996

Citing 9
Cited 1

Data networks

Data networks
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Optimizing the system of virtual paths

IEEE/ACM Transactions on Networking (TON)
The virtual path layout problem in fast networks (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
Virtual Path Assignment Problem in ATM Networks

Proceedings of the Sixth IFIP WG6.3 Conference on Performance of Computer Networks: Data Communications and their Performance
Virtual path assignment in atm networks

Virtual path assignment in atm networks
Queuing networks with population size constraints

IBM Journal of Research and Development
Broadband ISDN resource management: the role of virtual paths

IEEE Communications Magazine

A new algorithm for virtual path network design in ATM networks

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.