The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization

Author

Qin, Yong ; Xiao, Wenjun ; Ye, Jianfeng ; Wei, Wenhong ; Zhao, Chenggui

Author_Institution

Center of Inf. & Networks, Maoming Univ., Maoming

fYear

2008

fDate

23-25 July 2008

Firstpage

503

Lastpage

508

Abstract

The QoS routing is based on the computing of each flow as regards the dynamic request, the routing computing is more frequent and the granularity of resource distribution is more smaller. Aiming at fast routing computing, the method of pre-computing for parallel computing based on QoS matrices is proposed: the Pareto subset of viable path which satisfy routing constrain will be taken into account, the suitable route will be selected among the Pareto subset. In other words, the routing problem can be divided into two problem: suitable path selection unconcerned with practical routing request and route optimize concerned with practical routing request.

Keywords

Pareto optimisation; quality of service; search problems; telecommunication network routing; QoS matrices; QoS routing; QosR Pareto optimization; dynamic request; parallel computing; parallel routing searching; path selection; resource distribution; route optimization; routing computing; routing problem; Bandwidth; Computer science; Decision making; Distributed computing; Educational institutions; Extraterrestrial measurements; Information technology; Pareto optimization; Routing; Software; Load balancing; Pareto subset; QoS matrices; Routing Optimize; Routing pre-computing;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Language Processing and Web Information Technology, 2008. ALPIT '08. International Conference on

Conference_Location

Dalian Liaoning

Print_ISBN

978-0-7695-3273-8

Type

conf

DOI

10.1109/ALPIT.2008.89

Filename

4584417