loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 International Conference on Advanced Language Processing and Web Information Technology
The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization
July 23-July 25
ISBN: 978-0-7695-3273-8
ASCII Text
x 
 
Yong Qin, Wenjun Xiao, Jianfeng Ye, Wenhong Wei, Chenggui Zhao, "The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization," Advanced Language Processing and Web Information Technology, International Conference on, pp. 503-508, 2008 International Conference on Advanced Language Processing and Web Information Technology, 2008.
 
 
BibTex
x
 
@article{ 10.1109/ALPIT.2008.89,
author = {Yong Qin and Wenjun Xiao and Jianfeng Ye and Wenhong Wei and Chenggui Zhao},
title = {The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization},
journal ={Advanced Language Processing and Web Information Technology, International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3273-8},
pages = {503-508},
doi = {http://doi.ieeecomputersociety.org/10.1109/ALPIT.2008.89},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Language Processing and Web Information Technology, International Conference on
TI - The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization
SN - 978-0-7695-3273-8
SP503
EP508
A1 - Yong Qin,
A1 - Wenjun Xiao,
A1 - Jianfeng Ye,
A1 - Wenhong Wei,
A1 - Chenggui Zhao,
PY - 2008
KW - QoS matrices
KW - Pareto subset
KW - Routing pre-computing
KW - Routing Optimize
KW - Load balancing
VL - 0
JA - Advanced Language Processing and Web Information Technology, International Conference on
ER -
 
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.
Index Terms:
QoS matrices, Pareto subset, Routing pre-computing, Routing Optimize, Load balancing
Citation:
Yong Qin, Wenjun Xiao, Jianfeng Ye, Wenhong Wei, Chenggui Zhao, "The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization," alpit, pp.503-508, 2008 International Conference on Advanced Language Processing and Web Information Technology, 2008
Usage of this product signifies your acceptance of the Terms of Use.