【摘要】 本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图,再利用广度优先遍历算法BFS计算出另外一条不相交路径。使用每包分配方案把业务分配到两个完全不相交路径中,模拟结果表明该路由方法能够实现较高的投递率、较低的控制开销和较低的端到端延迟。更多还原

【Abstract】 This method uses intermediate nodes’ location information to create undirected graph at destination node, and uses Breath-First Search (BFS) algorithm to find another disjoint path. A per-packet allocation scheme is ar- ranged to distribute data packets into two paths of active sessions. The results of simulation show that this routing method has good network performance with high packet delivery ratio, low control overload and low average end-to- end delay.更多还原