A Method Based on Penalty Function and Integer Programming for QoS Routing Problem

摘要

The Quality of Service (QoS) routing emphasizes to find paths from source to destination satisfying the QoS requirements. In this paper, we consider the problem in QoS Routing called the MCP (Multi-Constrained Path). It is well-known that this problem is NP-Complete. We propose a method based on penalty function and integer linear programming. Preliminary numerical results show that the proposed method is viable for QoS Routing.