一种分布式的pcpo单播路由算法.pdfVIP

2004 10 Oct. 2004 27 5 Journal of Beijing University of Posts and Telecommunications ol. 27 No. 5 　　: 1007-5321(2004) 05-0070-05 PCPO 韩　玲,　孔令山,　曾志民,　 丁　炜 (, 100876) : (NPC)( PCPO) : QoS( TSQR) . PCPO( DCLC) , TSQ R , 2 ( MinCProbe1/MinDProbe1, MinCProbe2/MinDProbe2) , 2 ;,, ; . TSQR ,. , , T SQR. 　　: ; ; ; : T P393　　　: A A Distributed QoSUnicast Routing Algorithm for PCPO Problem ,　 - ,　 - ,　 HAN Ling KONG Ling shan ZENG Zhi min DING Wei ( Continuing Education School, Beijing University of Posts and Telecommunications, Beijing 100876, China) : ( - ) , Abstract TSQR two way selective probing QoS routing a distributed algorithm for NPC PCPO (path-constrained path-optimization) problem is proposed. Taking example for DCLC (delay-constrained least-cost) problem that belongs to PCPO problem according to TSQR algorithm source node sends two kinds of probing, , ( 1/ 1, 2/ 2) messages MinCProbe MinDProbe MinCProbe MinDProbe to destination node based on the minimum-cost path and the least-delay path between them, and these two kinds of probing messages correspond to two kinds of path-selection op- erations the mid nodes collect the path information that a message has traversed; , and mutate the message to probe in another direction while sending the message in original direction; destination node selects one or more paths from feasible paths set TSQR can remove loop paths naturally and has low storage and computation. , . - complexity Simulation results show that T SQRhas best path op