Adjustable heuristic routing method of quality of service based on width first search |
Title： |
| Adjustable heuristic routing method of quality of service based on width first search |
|
Application Number： |
02159930 |
Application Date： |
2002/12/30 |
Announcement Date： |
2003/05/07 |
Pub. Date： |
|
Publication Number： |
1416243 |
Announcement Number： |
1195364 |
Grant Date： |
2005-3-30 |
Granted Pub. Date： |
2005-3-30 |
ApplicationType： |
Invention |
State/Country： |
11[China|beijing] |
IPC： |
H04L 12/28, H04L 12/24, H04Q 3/00 |
Applicant(s)： |
Tsinghua Univ |
Inventor(s)： |
Wu Jianping, Cui Yong, Xu Ke |
Key Words： |
Adjustable, heuristic, routing method, quality of service, width first search |
Abstract： |
The invention belongs to the technique area of the route of the interconnecting network. First, each parameter of the quality of service request is input to the computer. Based on the linear energy function, the shortest route tree in reverse direction is built by using the Dijkstra algorithm and the target node as the root of the tree. The K weighted value of each node of the shortest route tree in reverse direction to the target node is calculated. Based on the value, all nodes are marked in revrese direction. Finally, based on the non linear energy function, the shortest route tree in positive direction is calculated by using the Dijkstra algorithm. When a node being added to the tree, it is needed to consider that whether all sub-nodes within the search depth are optimal. |
Claim： |
|
Priority： |
|
PCT： |
|
LegalStatus： |
|
Relevancy information
