By Topic

The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yong Qin ; Center of Inf. & Networks, Maoming Univ., Maoming ; Wenjun Xiao ; Jianfeng Ye ; Wenhong Wei
more authors

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.

Published in:

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

Date of Conference:

23-25 July 2008