DocumentCode
2989126
Title
A Method Based on Penalty Function and Integer Programming for QoS Routing Problem
Author
Ni, Mingfang ; Wu, Xinrong ; Zheng, Yan ; Wang, Zeyan
Author_Institution
Inst. of Commun. Eng., PLA Univ. of Sci. & Technol., Nanjing, China
fYear
2010
fDate
29-31 Oct. 2010
Firstpage
1
Lastpage
3
Abstract
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.
Keywords
integer programming; linear programming; quality of service; telecommunication network routing; QoS routing problem; integer linear programming; integer programming; multi-constrained path; penalty function; quality of service routing; Algorithm design and analysis; Integer linear programming; Linear programming; Programmable logic arrays; Quality of service; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Technology (ICMT), 2010 International Conference on
Conference_Location
Ningbo
Print_ISBN
978-1-4244-7871-2
Type
conf
DOI
10.1109/ICMULT.2010.5630338
Filename
5630338
Link To Document