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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
