UPnP服务发现算法性能分析与改进.PDFVIP

ISSN 100020054 ( ) 2006 46 4 CN 1122223 N J T singhua U n iv (Sci T ech) , 2006, V o l. 46, N o. 4 39 40 6002603, 608 U Pn P ( ,, , , 100084) : U PnP , U PnP , U PnP , () : ;; : T P 393 : 100020054 (2006) 0420600204 ; U PnP :A Eva lua t ion and im provem en t of UPnP serv ice d iscovery a lgor ithm CHEN Eny i, S HI Yua nchun, XU G ua ngyou (Key Labora tory of Perva sive Com puting, M in istry of Educa tion, D epartm en t of Com puter Sc ience and Technology, Tsinghua Un iversity, Be ij ing 100084, Ch ina) Abstract: T he cu rren t U PnP service discovery algo rithm can cau se severe drop s w ith respon se m essage rate w hen app lied in p ervasive com p u ting environm en ts w ith large scales of service. T he deficiency lies in the in stan taneou s tran sm ission of all respon se m essages and the independen t random selection of the tran sm ission delay so that the respon se m essages co llide and congest. To reduce the congestion, a refined algo rithm w as develop ed w h ich tran sm its the respon se m essages w ith a certain in terval betw een ad jacen t m essages o r (and) selects a p lanned delay acco rding to the all service2p rovid ing nodes. Sim u lation s verify that the refined algo rithm g ives better p erfo rm ance in the respon se m essage’s d rop ratio and reduces the respon se m essage buffer size. Key words: com p u ter netw o rk; p ervasive com p u ting; service d iscovery; U PnP ,[ 3 5 ] U PnP U PnP G ribb le[6 ] , [7] U PnP [2] , (PD IT ) (PDCT ) (RDCT ) ; ; PD IT , , In ternet : 0, , 1 UPnP U PnP ( roo t devices) (con t ro l po in t) d (em bedded devices) ( services) U PnP , ;, k ,, , , [1], , : 2005203223 : (N CET : (19752) , ( ) , , : , , E2m ail: sh iyc@ tsinghua. edu. cn , : U PnP [ 0,M ] U PnP (1 j p ) M, U PnP B, m, , , N Rcv, , r p (0 p m ) Nj , Nj B = 40 , P mM 601 2 R = N Rcv , p N j. j= 1 (1) SSD P_ ALL , , n ( 3 + 2d + k ) [2 ], p= m N j= n (3+ 2d + k ) , (1 j p ) d = 2, k = 3, n= 2, n (3+ 2d + k ) = 20 200 , r= 200 , N S2 B