سال انتشار: ۱۳۸۲

محل انتشار: یازدهمین کنفرانس مهندسی برق

تعداد صفحات: ۹

نویسنده(ها):

Pejman Khadivi – Ph.D. Candidate Isfahan University of Technology
Shadrokh Samavi – Associate Professor
Hosein Saidi – Assistant Professor

چکیده:

Routing data from one node to another is one of the basic problems in computer networking. In today’s Internet, QoS and Multi-Constraint routing have a great importance. Because of its NP-completeness, there are various methods for solving the multi-constraint routing problem and also several heuristic methods have been introduced for this purpose. Among these methods, those that use a single mixed metric are more popular. However, when we use a mixed metric, we loose some of the useable information. In this paper, a novel single mixed metric routing algorithm is introduced. This multi-constraint routing algorithm is shown by simulation to have better performance than than some of the existing methods