Admission Control and Routing Algorithms for the Permanent Virtual Connection (PVC) Service

• Main Authors: Chin Tsun Chen, 陳錦村
• Other Authors: Yeong Sung Lin
• Format: Others
• Language: zh-TW
• Published: 1996
• Online Access: http://ndltd.ncl.edu.tw/handle/18090009816296454444

碩士 === 國立臺灣科技大學 === 電子工程學系 === 84 === In this thesis, we propose admission control and routing algorithms for networks supporting the PVC (Permanent Virtual Connection) service. The objective of admission control is the maximization of the system*s throughput (revenue) subject to the quality-of-service (QOS) constraint for all user pairs and the constraint that the ratio of the total routing table modification cost and the corresponding revenue for admitting new users not exceed a given bound, where the routing table modification cost is referred to as the time and other related cost associated with manual operations to modify routing table for the purpose of setting up, terminating and/or rerouting PVCs via a network management system. Whereas, the objective of routing is the minimization of the aforementioned routing table modification cost for admitting the set of new users determined by the admission control function subject to the QOS constraint. We formulate these two problems as nonlinear combinatorial optimization problems with integer decision variables. The basic approach to the algorithm development is Lagrangean Relaxation. In computational experiments, the proposed algorithms calculate near-optimal solutions for a number of actual networks with 10 to 14 nodes.