• 検索結果がありません。

スループット監視に基づく複製サーバ選択方法のスケーラビリティ向上

N/A
N/A
Protected

Academic year: 2021

シェア "スループット監視に基づく複製サーバ選択方法のスケーラビリティ向上"

Copied!
6
0
0

読み込み中.... (全文を見る)

全文

(1)マルチメディア通信と分散処理 105−6 (2001. 11. 15). $2+&(7>8GB")CDIJ$ 0*1';@ 1. 798 1 5346 1 þ 1ÿ 2 0

(2) 1 32ÿ 1 {{Ç{Ç«Òb6ÇôÜ·HÌQèé]8 (¼{ÇêÇÄHÌÌèÇ· 2. fhiromori,h-yamagu,higashino,[email protected] [email protected]. ♶—IP ÑØÉÂÔÇËÌÊËښô¡ž°—6µÅšÍ£ª¾«¾Ýã À6µÜ³½ø±òߨ˜ï µÑØÉÂÔÇËÇËךӲ¨° ©½3걗äü4ú£ö5±ýþà³2 ­¦±ö(´ÅšÍç·øÙÐØ ›ÇËךӜÀ쩽8!÷ÀÛ¨°¤°ž½˜§µ!÷´¡ž°¶—ü4ú¶9ÇËךӴ¯ž°—ªµ ë* ´Þ®°æõÎÄÊËÀ 4¨2 ýþÀñŸ¬¹—6µü4ú£ ô©½åé´¡ž°¶§µËÖÏÁÊõ

(3) £$ ²³½˜#𱶗ÇËךӴ¯ž°½Ý6µü4úµ¸£æõÎÄÊËÀ 4©½§²±—ü4ú6£

(4)  ¬ 1ó±ºæõÎÄÊË´»½ËÖÏÁÊÃÀ¥' ½!"ÀÛ©½˜æõÎÄÊ˵6À' ½²ª¾­¦¼¾½2 £ÿ³¥³½£—Û!÷±¶äü4ú£û¨¬2 À9°µü4ú±è%©½§²±—ÌÊËÚšÃÆÒÕٚÈÀ&ž ¬ùîíᢼ—ÌÊËښÃ0´)¾½æõÎÄÊ˵6À' ³£¼—è%¨¬æõ2 À&ž°7´ÇËךÓ8 £ñ ½§²£¿¢®¬˜ Improving Scalability in Monitoring-based Multicast Server Selection. 1. 1. 2. Akihito Hiromori , Hirozumi Yamaguchi , Keiichi Yasumoto ,. 1 Teruo Higashino. 1. 1 and Kenichi Taniguchi. Graduate School of Engineering Science, Osaka University. 2. Faculty of Economics, Shiga University. In our previous work, we have proposed a selection technique for replicated multicast video streams from di erent servers. In the technique, we have assumed that there exist replicated video servers, each of which encodes the same video into the ones of di erent quality levels and continuously transmits them as di erent multicast streams. Using an IGMP facility like mtrace, each receiver monitors the packet count information of all those streams on routers and periodically selects the one which is expected to provide low loss rate and to be suitable in the current available bandwidth of the receiver. However, under the exsistense of a large number of receivers, the amount of tracing trac may cause a signi

(5) cant problem. In this paper, we improve the monitoring technique used in the selection technique to keep the amount of tracing trac low even if the number of recever is large. In order to reduce the amount of tracing trac, only some part of receivers send mtrace queries for each stream. Also, each receiver selects a stream using the shared infomaion which is obtained by the other receivers. Our experimental results using a network simulator have shown that the amount of tracing trac is reasonable and receivers could select appropriate streams.. R Î+MS+Ã2J07 *ê”Qyƒ›.“f 6K ^} M8c`3+à 2J0SaLRyƒ›.“Qv? å¦+ ƒŸ.pÒµRU¹®–Q¯2+å2> f /

(6) Ac,<RF]+ 2J0Q7jµAcN å+šjŒ ˆë_Š‚mm ‚‘ „PO+s9Rž u.‡kR‘œ~o–yƒœ.|Q {ñR pl [3]. 1. »is  €7 ƒŸ.pFMªh>dc<N7 ßd>dc,?6?+ª³Qž»is  €S·Å ”{àñM1cF]+ž»iªJu.‡QsQRhp {y74ˆAc`3PGQS ƒŸ.pw©f¡ ¬Ac,Íh甂ihªhMSw©f÷¸?P2‘ œ~o–yƒŽJ [1] 7ÝâM1c7+€ªRu.‡M ž»iRªhMS+¢?Lž»if2JM8P2< N^ 4adc,<dQv?+åMSÅW‘œ~o– yƒu.‡fƪ†?F^NM2J07•YPu. ‡f^}AcÎ+QJ2L+29J6ôÜ7 ]ad L2c [2, 3], º-S<d[MQ+IP ƒŸ.pQ5;cÅW‘ œ~o–yƒ ž»iu.‡R^}Î+f‘£?L8L 2c [3],<RÎ+MS+ÅQR‘œ~o–yƒu.‡ 7Ÿ@ ž»is  €f¦PcÅQR¿.ŽœQ ò?+¡ì?FÉ-R‘œ~o–yƒyƒ›.“ N?LªhAc,DR^NM+Ã2J0S‘œ~o– yƒœ.|FMRyƒ›.“RˆrƒQHÌ (—h> dFˆrƒRQ) f N23€.œfâ2L ӔQË"?+DRHÌf^NQ•YP¿.7 ad cyƒ›.“fž”Q^}Ac, mtrace. mtrace. ›.”{.x ( Q`cË" ”{.x) 7 4 ˆAcâd71c,yƒ›.“^}QSˆrƒ QH Ì7Ý3M1c<NS [3] M)>dL5b+ R /

(7) f€;QäRAcN•YPyƒ›.“^}7

(8) 4 P2¶§S71c7+{ÖÖP ƒŸ.pÊáR• ¯S (yr.šŠ›i) f5F>CcF]+ Q ¯3Ë"ƒš‹ipfíú>Ccºã71c, Ñ MS+Çó [3] RÎ+Q52L+Ë"ƒš‹i pfíú?P7a+6J•YQyƒ›.“7

(9) edc `3Ã2J0R R/

(10) vE+ÛU/

(11) À˜QJ 2LRñf

(12) 3,‘£Î+MS+Ã2J0R /

(13) vES2J?L2cyƒ›.“R\N?+2J0 S /

(14) ï¸fa2J0Q‘œ~o–yƒhJA c<NQ`IL+Ã2J07ayƒ›.“QJ2LR ˆrƒQHÌfË%M8c`3QAc,<dQ`b+ yƒ›.“^}QºãPˆrƒ QHÌf1 ?JJ Ë"ƒš‹ipfíúAc<N7M8c,Q^Ðea B+2J0Q7>aPcjµQ`b+u.‡kQå2 ‘œ~o–yƒœ.|Q52L+ pl›.” {.xRQ7jµAc<N^ 4adc,6IL+ý-. 1 −31−. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace.

(15) Ryƒ›.“Qv?L+ f/

(16) M8c2J0R 3H+Ë"Ac&ÏÏÆÒ+DR&ÏQ/Q f/

(17) Ac2J0Qf1cªQ¤±QRü>dc` 3QAc,<R`3QÃ2J0R /

(18) À˜f ±>Cc<NM+s9R2J07pAc`3PÊ áQ52L^+Ë"ƒš‹ipf9ä4c<N7M 8c, º-S ƒŸ.pw’—.|. [4] fâ2L+ Çó [3] RÎ+N‘£Î+f·ÅAcw’—.w™  f

(19) IF,/÷ï¸6a+[3] RÎ+N·Å?L Q`cƒš‹ip75Ə2^RNPIL5b+†. „ Q 100 R&QSu.‡kR‘œ~o–yƒœ.|F MSÈä 2 Kbps N/âQÚ|P2ƒNPIL2F,[ F+Ã2J07 /Q2JM8Fyƒ›.“R¿.S ¤_RÎ+NYZ Ÿ›RƒNPIL5b+yƒ›.“ R^}7•YQ

(20) edL2c<N7Ä¥M8F, mtrace. server S1 (video transmission). server S2 (video transmission). mtrace. gr(2,2),1. a. mtrace. c. b. d. e. gr(1,2),1. ns. f. g. h. k. mtrace. 2. GB" )CD2!1%‘£Î+MS+Ãu.‡SŸªRž»is  €f. ¿.Žœ/»iujz+¾i˜+‹. “QPO0MÃAc,¤±MS<R¿.Žœf* `QM¼?+1 7¿., L S ¿.f¼A,[F+ u.‡ Si 6aªh>dc¿.Žœ l Rž»i‚. |yƒ›.“f€Qyƒ›.“N`U sti;l M¼A,à œ.|SÇó [5] M)>dL2cË"Õ§f/g?L 2c^RNAc,<RÕ§fIF IP ‘œ~o–y ƒƒš‰pË"âRz¼”P€.œQ [5] 7 1c, S‘œ~o–yƒqœ.h„yNh Jyƒh„yf!Ac<NM+hJyƒ6a f/

(21) Ac˜.vyƒ[MR‘œ~o–yƒ ªhêöÛUDRêöFRќ~o–yƒœ.|M —h>dF¤8òˆrƒQf1 Ac<N7M8c, Ã2J0Sª¾1FbQœ.|M—h>dcˆrƒ Qf cF]Q+ pl›.fÓ”Qhc,p l›.Rï¸SÜ.|MRˆrƒ QNpl›.R œ‡&NPIL5b+KRpl›.ï¸ 2 J6a Ü.|Mª¾1FbQ—h>dFˆrƒ Qfì L R¦Pc. mtrace. mtrace. mtrace. mtrace. Ac<N7M8c, 2.1. ‡„d‰Œk{ozrwf–•ej †‘. 2J0 Rj S¤±RHÌf_^IL„IL2c+[ FSË"Q`IL adc^RN³Ac,  bwi;l; yƒ›.“ sti;l RhJ.ƒ,Ãyƒ›. “S1a6@]e6IL2cÿ.ƒMªh> dc^RNAc,  pathi;j ; u.‡ Si 6a2J0 Rj [MRªhêö, pl›.Rï¸6a c<N7M8c,  gr i;l ;j ; 2J0 Rj Q vAcyƒ›.“ sti;l R qš‹i qœ.|,qš‹i qœ.|S+ ªhêö pathi;j FRœ.|R3Hyƒ›.“ sti;l f2J?L5b+2J0 Rj Q^å2œ. |f¼A, pl›.Rï¸6aªhêö pathi;j FMyƒ›.“ sti;l RˆrƒQ7 0 M P20Rœ.|N?L®õM8c,  ratio i;l @r; yƒ›.“ sti;l Rœ.| r MRˆ rƒ œ‡ë,¤± count i;l @r Mœ.| r M ª¾1FbQ—h>dFˆrƒQf¼A,<d mtrace. (. ). mtrace. (. ). (. ). m. n. receiver R1. receiver R2. st1,1. st1,2. p. q. receiver R3. t. u. receiver R4. receiver R5. receiver R6. st2,2. st2,1. st2,1. st1,2. low bandwdith video stream (level1) from S1 high bandwidth video stream (level2) from S1. low bandwdith video stream (level1) from S2 high bandwidth video stream (level2) from S2. P 1: yƒ›.“^}Rô S pl›.fÓ”Qhc<NM 1 Mr count 8c,<df â2L+ratioi:l @r S count S N?LìM8c,P5+count i;l @Si Su.‡ Si Myƒ›.“ sti;l Rˆrƒ7ª¾1FbO dG;hJ>dF6)A^RM+ª³”QS<R ˆrƒQfìc<NSM8P2,?6?+Si Q nAcŸ@ LAN Rœ.|M¨Ô>dcˆrƒ SYNgOP2NAdT+<RƒS<Rœ.|M —h>dFQNYZŸ@GN 4adc,ª³” Q+üû7DR`3Pœ.|MØ<c<NS[d M1b+<R³S•šP^RGN 4adc,  ratio i;l @Rj ; 2J0 Rj MRyƒ›.“ sti;l R R ˆrƒœ‡ë,count count S N?LìM8c, qtzcw‰Œk{ozrwh“’ˆ P 1 MS 2 JRu.‡ S , S 7DdEdŸªRž» is  €fŽœ 1, Žœ 2, Žœ 3 R 3 JR¿ .Žœ/<RôMSDdEd¿.+ˆ¿.+ ¿.0 M‘œ~o–yƒ hJ?L5b+2J0 Rj (j = 1::6) SDdEd1cu.‡6aR1c¿.ŽœRyƒ›. “f2J?L2c,ô4T R Su.‡ S 6aR Žœ 1 Ryƒ›.“ st ; f+R S st ; f2J?L 2c, /Q adcyƒ›.“R¿.S2J?P;dT e6aP27+‘£Î+MS+qš‹i qœ.| MRˆrƒ œ‡ë+qš‹i qœ.|6a2J 0[MR Qf2J0Q adcyƒ›.“R¿ .R!»NAc,<R^NM+Ã2J0SÒєQ+2 J0yƒMRû2JˆRyƒ›.“Rˆrƒ2 Jë75Æ¢?L2cN°‚M8cGS`b¿. ŽœR 2yƒ›.“f+¢?L2P2GS` b2yƒ›.“fž”Q^}Ac,DR+/R 2J0Rˆrƒœ‡ë7PcX9 2yƒ›.“f ^}AcF]+œ.|RË"ï¸QÒK8+qš‹i  qœ.|MRˆrƒ œ‡ë7Ò:ƒ¤FM+[F 2J06aqš‹i qœ.|[MR Q7 ^?>2yƒ›.“f^}Ac,<RÒ:ƒSž»i RVQYNgO Ú|7P2N°‚M8cYO 5Æ 2ˆrƒ œ‡ëf¼A^RNAc,<R`3QAc mtrace. (i;l) @. (i;l) @. (. (. ). ). j i. (i;l) @. (i;l) @. 2.2. 2 −31−. 1. 2. 1. 11. 1. 5. 23. i.

(22) èÞS+qš‹i qœ.|6a2J0[MRƒš ‹ipSÎlM8P2F]+qš‹i qœ.|M Rˆrƒ œ‡ë7DR[[2J0MRˆrƒ œ‡ ëNPaP2¶§S71cF]M1c,‘£Î+MS+ qš‹i qœ.|6a2J0[MRÞé7^? >2yƒ›.“f^}Ac<NM+DRyƒ›.“f /Q2J?FN8QÓxAc¿.7 adP2¶§ Sfú@>CL2c, ô4TP 1 Q52L+2J0 R MR st ; Rˆr ƒœ‡ë75Æ¢?L2cN°‚M8FGQS+R S`b 2¿.Mž»if2JAcF]Q+Žœ 2 R yƒ›.“f2J?`3N#\c,[B+R SŽœ 2 R aLRyƒ›.“QJ2Lqš‹i qœ.| gr ; ; (path ; = a-c-g-m FR g)+gr ; ; (path ; = b-d-f -m F R d) f  ]c,ratio ; @gr ; ; N ratio ; @gr ; ; (qš‹i qœ.|MRˆr ƒ œ‡ë) ROHa^Ò:ƒ¤FNPIL2c^RN Ac,<RN8+R S st ; N st ; R3H+qš‹ i qœ.|WR Q7?>2yƒ›.“f^ }Ac,<RôMS+R 6a g [MRÞé7 1  +d [MRÞé7 2 NPIL2cRM+R S st ; f^}Ac, ŸáQ+2J0MRˆrƒœ‡ë7Ò:ƒf±¿ cGS+¿.Žœ7Ÿ@6`b2yƒ›.“R 3H¢?L2JM8cNßd>dc^Rf^}Ac, ô4T+ratio ; @R 7Ò:ƒf±¿IF^RNAc N+R S st ; +st ; +st ; R3HRªJf2J?` 3NAc,ORyƒ›.“QJ2Lqš‹i qœ. |MRˆrƒœ‡ë7Ò:ƒf‹4L2dT+R S ûR¿.ŽœN¨%AcF]Q st ; f^}Ac, 1. server S1. server S2. a. b. c. 11. e. d. f. g. h. 1. 1. (1 2) 1. 11. (1 2). (2 2). (1 2) 1. (2 2) 1. 1. 12. 22. 1. 1. 12. (1 2). 3. 22. 3. 11. 21. 3. 22. qtzcw‰Œk{ozrw. Ã2J0 Rj S2J?L2cyƒ›.“ sti;l Rˆr ƒ œ‡ëQ¯@LÉRyƒ›.“f^}Ac6+û 2J?L2cyƒ›.“fëo?L2JAc6R°‚ fªÓÏ=NQ

(23) 3,‘£Î+MSˆrƒ œ‡ë QJ2L£JRÒ:ƒ P , P fâ2L+Rj RIyf (1) \¿.ŽœjµIy"+(2) \ëo2JIy"+(3) \ ¿.Žœ¨%/ú@Iy" R 3 IyQÆóAc,<< M+P Syƒ›.“R2J7YZˆrƒq-f¯e BQ

(24) edL5b+`b 2¿.ŽœRyƒ›.“ f2JAcRQ5ÆGN°‚M8cƒN?+P Ss@ ˆrƒžy7®V?L2c^RR+ž»iRVQ SYNgO¬ã7P2N°‚M8cƒNAc, 1. 2Jyƒ›.“ sti;l Rˆrƒ œ‡ë7 P (0 < P  1) ¤FM1c2J0 R S \Žœ jµ Iy" QnAc,<RG+Rjj S+¿.Žœ l + 1 RÃyƒ›.“ sti ;l Rqš‹i q œ.| gr i ;l ;j Q5;cˆrƒ œ‡ë70 9Ac P ¤FM1cyƒ›.“R3H+qš‹ i qœ.|6a Rj [MR Q7?M 1cyƒ›.“f^}Ac,qš‹i qœ. |Q52Lª¤FR¿./APeHˆrƒœ ‡ë07/û>dL5b+6JDRqš‹i  qœ.|6aRÞé72yƒ›.“f^}Ac, DR`3Pyƒ›.“7p?P2GQS Rj S sti;l f2J? o;c, 2. 2Jyƒ›.“ sti;l Rˆrƒ œ‡ë7 P (0 < P < P ) ¤F P ÔÓM1c2J0 Rj S \ë 2.3. 1. 2. 1. 2. 1. 1. 0. (. 0. +1). 2. 1. 1. n. receiver R1. p. q. u. receiver R2. receiver R3. receiver R4. receiver R5. P 2: £JR‘œ~o–yƒªh× o2JIy" QnAc,<RG+Rj S sti;l f ëo?L2JAc, 3. 2Jyƒ›.“ sti;l Rˆrƒ œ‡ë7 P Ô ÓM1c2J0 Rj S \¿.Žœ¨%1c2S ú@Iy" QnAc,<RG+Rj S¿.Ž œ l ^?9S l 0 1 Ryƒ›.“6a+DRq š‹i qœ.|MRˆrƒœ‡ë7 P ¤ FM1cyƒ›.“R3H^¿.ŽœR 2 yƒ›.“f^}Ac,DR`3Pyƒ›.“7 ª¥Qî[aP2GS+Rj S qš‹i q œ.|6a Rj [MRÞé7^2^Rf^} Ac, 3 $ 0*1' <L 7> IJ 2 AM )?F`3Q+‘£Î+SÃ2J0S fâ2Lˆrƒ QHÌf1 ?+DRHÌf^NQ yƒ›.“f^}Ac,ACK/NACK Q`c‹i.„ ‡pføQ?F JæS‘œ~o–yƒQ52L+ ACK/NACK ­®Ac Ú| [6] 7 !“>dL2c7+ ‘£Î+Q52L^u.‡Qå2‘œ~o–yƒœ. |M pl›.Rˆrƒ Q7 j{Ac¶§S 71c,<<M pl›.RˆrƒRñf̀ QõXIL\c,N NR2J07 TM ¾=NÓ”Q pl›.Rˆrƒ (F6G6 0.2kb) fhJA c,DdaRˆrƒSªhêöFfu.‡RY3W N—h>du.‡Q4ˆAc,L f¿.ŽœRQG 2. 2. mtrace. mtrace. mtrace. mtrace. NAcN+u.‡å9R‘œ~o–yƒœ.|Q5; c Rƒš‹ipS¤±R`3QPc, mtrace. 0:2(KB ) 3 8(bit =B ) 3 2N (packet ) 3 L (bps) TM (second ). +1. 2. 2. m. 21. (2 2) 1. ô4T N = 10; 000, TM := 2 and L = 3 NAcN+ ; = 24 NP Rƒš‹ipS b+ªh×RQ1Fcœ.|MSª¾1FbQ 5000 Rpl›.f<èAc<NQPc,<RƒS/â”P ^RMSP9+sNQR2J0Qv¯AcF]QS< Rpl›.RQfä4cºã71c, Ž|ej~‚’ƒ ‘£Î+MS<RÚ|Qv<AcF]Q+ªJRyƒ ›.“Qv?29J6R2J0R\7 pl›. mtrace. 0 238310 00033 2. Mbps. 3.1. 3 −33−. mtrace.

(25) fhJ?L2c,[F+ pl›.fhJ?P2 yƒ›.“QJ2LRHÌf2J0ÏMßÝM8c` 3Q?L2c,¤±M‘£Î+RDf9Xc, pl›.Rï¸fßÝAcF]Q+aLR2J07n ?L2c‘œ~o–yƒqœ. C fs ƒž.œq œ.N?Lâ2c,Ã2J0S+yƒ›.“^}R Qâ2c+ˆrƒ QHÌfË%?L2c,<RH ÌSaLRyƒ›.“Ru.‡6aÃ2J0WRªh êöQJ2LR^RM+*M7 /

(26) ?F Rï ¸+CÃ6a   adFï¸M9 K >dc, 2J0 Rj Syƒ›.“2JÀ _Q+aLR yƒ›.“QJ2LªhêöfŠXcF]Q+a LRyƒ›.“QJ2L pl›.fhJ Ac,  Ã2J0 Rj Sû2J?L2cyƒ›.“ sti;l QJ2LR\ pl›.fhJAcòçf ^J,  Ë"ÓÏ TM ¾=NQ+s ƒž.œqœ. C QŸÓRF]R”{.x7hJ>dc (u. ‡R3HRªJQ`c),  Rj S  R!QÆÂQÒK2Lƒ7[cš } “P|j‘.f^IL2c^RNAc,2J0S DdEdŸÓ”{.xf2JAcN|j‘.f y|.ƒ>Cc,  |j‘.7Ydc[MQ Rj S2J?L2cyƒ ›.“ sti;l QJ2L pl›.Rï¸f  adP2N8QS+ŒHQ pl›.” {.xfhJAc,  Rj 7 pl›.Rï¸f F1N+ŒH Qs ƒž.œqœ. C Qv?LDdfhJ ?+*M7Ë%AcˆrƒQHÌf9KAc,  Rj S C Q`IL adFpl›.Rï¸M+y ƒ›.“^}RQ â2c+*M7 Ë%Acˆ rƒQHÌf9KAc,  2J07hc pl›.ReQfRüAc F]Q+Rj Sž”Q!QÆÂRˆš”.|  f ʲ>Cc,<RؔRF]Q Rj S+TM = N C Q`IL adF Rï¸fnk  ƒAc. <df N NAc,N SªÓÏ¢ Q pl›.fhIF2J0RQNŸ@M 1c,Rj S'R+M Q`c{Rƒš ‹ip (u.‡kN2J0k) fõX^c, u.‡k: N mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. mtrace. 0:2(KB ) 3 8(bit =B ) 3 2M (packet ) (bps) TM (second ). 2J0k : 0:2(. KB. ) 3 8(bit =B ) 3 N (packet ) (bps) TM (second ). M fu.‡RQNAcN,Ã2J0SF×Rß dƒš‹ipQ`IL'RÓÏR  Rƒfî Ac, ßdƒš‹ipR3H2Bd67s  ƒž.œƒš‹ipN?LÝ>dcƒf­4 cN+2J0S  = 2 NAc,D3MP;dT 1.  =  ( < 1) NAc,. 1 session delay 9IMFAJDHEGCKN7%)=[`Q8b Y]O5.=5(  9T; 1= = 3 3 session delay 5.=!9 -;7VXU' mtrace 7<=SP?^=0;7 mtrace B@L" ?ZX.=' SP?$=:47 2 3 session delay &&=!/, 3 C 4_Z+>=' /8_Z7 session delay &&=!<13  ?*8<#6\5,0!*8WR\?2&#5 a 63 % 8VX U' C 4 mtrace 8SP?ZX.=*576=!. P 2 fâ2L<Rhj‚hf\ÕAc,£JRu. ‡ S +S 71b+DdaSDdEd st ; +st ; fh J?L2c,2J0 R , R , R S st ; f2J?L 5b+st QR\ pl›.fhJM8c (ª Î+R +;R S st ; R\Q pl›.fhJM 8c),TM =NQ R , R , R R29J67 pl›.fhJM8c,<<MS R +R 7<RÓÏ Qpl›.fhc^RNAc,DRN8¶aSªhê öFRÜ.|RKRˆrƒQf„c<N7M8 (a-c-g -p N a-c-g -q )+DdEdDRï¸f 2J?F0 Q C Q hJAc,ªÎ+R S C 6a  adFHÌ 6aDRªhêöF (a-c-e-m) R a, c RHÌS c< N7M8c7+e, m RHÌf c<N7M8P2,< RGQS+R S e, m QJ2L*M7Ë%?L2F ¤_RHÌfâ2c,‘£Î+MS!QÆÂQÒK2 Lƒ7[cš }“P|j‘.QQ62Ã2J07 pl›.fhJ?L5b+DR3HÃ2J0R ªhêöFRˆrƒQHÌ79K>dc<NQPc, FG+u.‡Qå2œ.|RHÌS2J0kR^RN ·XLÀ²Q9K>dc<NQPc, 'Q Rj 72J?L2P2yƒ›.“RHÌQJ2 L 4c,Rj SDR`3Pyƒ›.“Qv? pl›.fhJ?P2RM+s ƒž.œqœ. C ¤Â6aS<R`3PHÌf c<N7M8B+[F+ ªh×QÑ[dL2P2œ.|RHÌf„c<NSM 8P2,ô4T+R , R S pl›.Rï¸f s ƒž.œqœ. C QhIL2c7+<dQS R QJ2LRªhêö path ; FR m RHÌSÑ[dL 2P2,?6?P7a+R S b, d, f RHÌf„c< N7M8+R Syƒ›.“^}QºãPHÌS c< N7M8L2c<NQPc,(s ƒž.œqœ. C 6a hadF pl›.Rï¸QÑ[dL2c ^RR3H+2J0Q^å2œ.|7qš‹i  qœ.|NPc,) 1. 2. 11. 1. 4. 21. 11. mtrace. 11. 2. 3. 5. mtrace. 21. 1. 3. mtrace. 4. 3. 4. 1. 1. mtrace. mtrace. 2. mtrace. 5. 1. 21 1. 1. mtrace. €. 0Q+>aPcyr.šŠ›i5FN?L¤± R`3P<N7 4adc,  DdEdRyƒ›.“QJ2Ls ƒž.œq œ.fÈbšLc<N^ 4adc,<R`3 QAcN+Ã2J0S2J0QNILÐæR1c yƒ›.“Rs ƒž.œqœ.R\Q¤cG ;M`2<NQPb+ Rƒš‹ipe ñS>aQúcN 4adc,4 ARw’—. w™ /÷MSÍí²RF]s ƒž.œqœ. SªJN?L2c,  ÝàM8cs ƒž.œqœ.Rƒš‹ip eñN?LS+RTCP [7] R.ƒR1Q1c` 3Q+ª´¿.R2yƒ›.“RhJ.ƒR 5% 6a 10 % 7 tšM1cN 4adc,‘£ Î+R/÷ï¸MS<RRü¤±M1c<N7) >dF,D?9S 4 AM9Xc,  Rï¸fhc+TTL fR1Ac<NM ï¸fhc2J0NS®9édF2J0QDRï ¸fhc<NfÐ:<N7M8c,ª³”Q+ è”QédL2cDR`3P2J0ÏMSªhê öfßÝ?P2N 4ad+<R`3PR1^[ F3¸”M1c, 3.2. −34− 4. mtrace. mtrace.

(27) 4. #,.3#/4?:AE F5 ‘£Î+Rw’—.w™ /÷Q`c½´f

(28) 3. F]+[B2J07‘œ~o–yƒyƒ›.“Rªh êöFRœ‡ˆrƒ Qf1 AcF]R ƒŸ. pcŽœRžƒsœf IP ‘œ~o–yƒR€. œ RžùèQÒK2LZì?+Ddf  ƒŸ.pw’—.| ns-2 [4] FQ/û?F,Ã2J 0S*M72J?L2cyƒ›.“Rˆrƒœ‡ë QÒK2Lyƒ›.“R^}f

(29) 37+^}hœt› z“ (2.3 [) MçâAcýƒ P , P SDdEd 95%, 85% N?F, Ã2J07+Œ_R^}0+K?2yƒ›.“f^} ¶§NPc&ÏS+£JRˆš”.| Tup, Tdown fâ 2L¤±R`3QŠUAc,¿.Žœ l Ryƒ›. “f2J?L5b+¿.Žœ l + 1 Ryƒ›.“f2 J?`3NAcGQS+_R^}6a Tup (=Ӄ 2 ¾) G;xFP;dTPaP2,<R¿.Žœh 7-©?L l Ryƒ›.“QÙIFGQS+DRŒ 0R˜R¿.ŽœhS-©Ac¶§S7 2, D<M+¿.ŽœhR#\f?Ta9fäRA cF]Q+Tup f 2 «QAc,¿.Žœh7T 2?FGQS Tup f 2 ¾Q=Ó²Ac,ªÎ+û R¿.Žœ6`b2ŽœRyƒ›.“Q§

(30) A cN8S+Tdown xJ^RNAc,w’—.w™  /÷MS Tdown f 0.5 ¾Qÿ?L2c,<R`3P 2J.ƒR1ÎÏS+Ác²‘œ~o–yƒQ5; cÁc•¯ÎÏN?LÇó [8] POMB½>dL2c, mtrace. 1. 2. xcp”‹}. ‘£Î+Q52L2J0auN?L/QOR’˜ R¿.f/ûM8c6fŠXcF]Rw’—.w™  /÷f

(31) IF,/÷MS+yƒ›.“ sti;l f2J? F&Ï (ta, tb fDdEd2JÀ &ÏN3ð&ÏNA c) NDRN8Rˆrƒœ‡ë pt 6aDRyƒ›. “f2J?FN8Q  adFauR¿.f l N pt R XÆ (APeH, Rtt l 3 ptdt) NÚ?+Óm˜ NþV, /÷MS+2J0auQv? Óm˜eùfìl?+Ç ó [3] RÎ+N·Å?F,[3] RÎ+MS+2J0Sa LRyƒ›.“Qv?L f/

(32) ?L5b+À² Qˆrƒ QHÌf9K?L2c,ªÎ+‘£Î+M S+2J0S2J?L2cyƒ›.“QR\ f /

(33) ?L5b+DRrRyƒ›.“QJ2LSs ƒ ž.œqœ. C 6aˆrƒHÌf L2c,6I L+‘£Î+MS [3] RÎ+Q·X+Ã2J07 Ë% Acˆrƒ QHÌSÀ²Q9K>dL5aB+DR F]Qyƒ›.“^}Q¬ã7Mc<N7 4adc F]+‘£Î+Q52L•YQyƒ›.“^}7

(34) e dL2c6fŠXF, <R/÷MS+†.„ Q 20 6a 220 R ƒŸ. pfš }“Q VT?+ì 35 R ƒŸ.pQ52 LDdEd 120 ¾Rw’—.w™ f

(35) IF,Û  pRw©S, 280kbps, 560kbps, 1.1Mbps R2Bd6 N?F,Ãw’—.w™ MSu.‡RQS 3 N?+ ˜.vRQSe†.„ QR±ÆN?F,Ãu.‡S¿ .Žœ 1, 2, 3 R 3 JRyƒ›.“fhJ?DdaR hJ.ƒSDdEd 256kbps, 512kbps, 1Mbps N? 4.1. b a. mtrace. mtrace. P 3: Óm˜eùR†.„ QQ`cʲ. F,[F+‘œ~o–yƒœ.i qžƒsœS DVMRP N?F, P 3 MS+ÃÎÏM adFÓm˜Reùf†.„ Q=NQ)?L5b+7,7Óm˜Reù+°,7†. „ Qf¼A,P 3 `b+2BdRÎ+^†.„ Q 50 [ MSYZ Ÿ@ ƒNPIL2c<N7e6c,†.„ Q 7j4cN‘£Î+RƒS [3] `b^{82Óm˜eù f~T?L2cN24c,<dS [3] RÎ+Q52L+ 2J0RQ7jµAcNDRÆ Rƒš‹ip 7 jµ?+yƒ›.“RªhQ¬ãfÛZ?FF]M 1c, [F+Óm˜eù7 &Ïê¹NN^QMOR`3Q ʲAc6fŠXF,†.„ Q 50, 100, 200 MRï¸ fP 4 Q)A,†.„ Q 50(P 4 (a)) Rï¸Q52L S+‘£Î+MS+/÷À 6a5Q¾ÏS [3] RÎ+ N·X+Óm˜eùSõILS2c7+/÷3ð&Q S`b 2ƒNPIL2c,†.„ Q 100(P 4 (b)) R ï¸MS+‘£Î+RÓm˜eùS/ÉÀ &6a [3] RƒfF¿IL5b+/÷3ð&QSÜ 30 % F¿IL 2F,†.„ Q 220(P 4 (c)) Rï¸MS+‘£Î+N [3] NR7`bö‰Q¼dL2c,OR†.„ QQ5 2L^+&ÏRê¹Q¯22J0ÏMßÝAcHÌ7 jµAcN+yƒ›.“^}7•YQ

(36) edc`3Q Pc<Ne6c, mtrace. ~‚unstgijtyvlsmhŠ. N·Å?LOR’˜ Q`cƒš‹ip 7íúM8L2c6lAcw’—.w™ /÷f

(37) IF,P5+<Rw’—.w™ /÷MS+Ë"Î +MçâAc (3.1) fÿN?+ž”Qƒš‹ip RñfR1?L2P2,u.‡kMR Q`c Ë"ƒš‹ipRÃ$ôMRÈäîñfP 5 Q)A, P 5 MS°,S†.„ Qf+7,S Q¯3 ƒš‹ipRÈäf)?L2c,[3] RÎ+N·ÅA cN+ƒš‹ipRñS 30 ÆR 1 ¤±NPIL5 b+6PbRƒš‹ipfíúM8L2c<N7e6 c,†.„ Q7jµAcN+ƒš‹ipñ^jµ?L 2c7+DRñS†.„ Q 220 R ƒŸ.pQ52 L^ 6 kbps N5Ə9ä4adL2c, 4.2. [3]. mtrace. mtrace. mtrace.  Ñ MS+{ÖÖPÊáQ5;cyr.šŠ›i f ï?F+IP ‘œ~o–yƒ ƒŸ.pFMRÅ Wu.‡fâ2Fž»iªJQ5;cyƒ›.“^} Î+Q5;cyr.šŠ›iR5FQJ2Lñ5 5. 5 −35−.

(38) 1.1e+06 proposed method previous method 1e+06 900000 800000. Quality Values. 700000 600000 500000 400000 300000 200000 100000. P 5:. 0 0. 20. 40. 60 second. 80. 100. 120. =<H9. (a) 50 Nodes 1.6e+06 proposed method previous method. 1.2e+06. Quality Values. 1e+06. 800000. 600000. úLfO 47; ¢Ñèª ™ÛÙÁ4𪠞 »i‘œ~o–yƒªJQ5;cÅWu.‡^}h œt›z“R‘£NS§½´. ‘œ~”‚ih+Æ +àŠN•‡jœ (DICOMO 2001) w xk “øÇ4, pp. 331{336, 2001. [4] Berkeley MASH Research Group University of. 400000. 200000. 0 20. 40. 60 second. 80. 100. 120. (b) 100 Nodes 3e+06 proposed method previous method 2.5e+06. [5]. Quality Values. 2e+06. [6]. 1.5e+06. [7]. 1e+06. 500000. [8]. 0 0. 20. 40. 60 second. 80. 100. Q`cƒš‹ip. [1] C. Diot, J. Crowcroft, and W. Dabbous. Multipoint communication: A survey of protocols, functions, and mechanisms. IEEE Journal on Selected Areas in Communications, Vol. 15, No. 3, pp. 277{ 290, 1997. [2] Z. Fei, M. H. Ammar, and E. W. Zegura. Optimal allocation of clients to replicated multicast servers. In Proc. of 1999 Int. Conf. on Network Protocols (ICNP'99), pp. 69{76, 1999. [3] .. 1.4e+06. 0. mtrace. 120. (c) 220 Nodes. P 4: Óm˜eùR&ÏQ`cʲ `U/Cf

(39) IF,ŸÎ+Q52LS+1cªÓÏQ Ë"”{.xfhJAc2J0fªQQä4+Ë "”{.xR4ˆfä4L2c, ª³Qu.‡^}Qâ2cHÌRKSNyr.š Š›iSƒ.„m‹RÐæQ1cN 4adc,Ñ. MS+<Rƒ.„m‹RÛf

(40) IL5b+3ë `9 ƒŸ.pRHÌf1J]+6J2J0R 2 Óm˜f~TM8L2cN24c,0RôÜN?L Sh›r.w™ WR•¯_+MBONE PO /R ƒŸ.pƒžx.MRw’—.w™ /÷f 4L2c,. 6 −36−. California. The network simulator ns-2, 2000. http://www-mash.cs.berkeley.edu/ns/. W. Fenner and S. Casner. A \traceroute" facility for IP multicast. In Internet Draft, 2000. Brian Neil Levine and J.J. Garcia-Luna-Aceves. A comparison of reliable multicast protocols. Multimedia Systems, Vol. 6, pp. 334{348, 1998. Henning Schulzrinne, Stephen L. Casner, Ron Frederick, and Van Jacobson. RTP: A transport protocol for real-time application. In Request For Comments 1889, 1996. V. Jacobson, S. McCanne, and M. Vetterli. Receiver-driven layered multicast. In Proc. of ACM SIGCOMM'96, pp. 117{130, 1996..

(41)

参照

関連したドキュメント

Maria Cecilia Zanardi, São Paulo State University (UNESP), Guaratinguetá, 12516-410 São Paulo,

Applications of msets in Logic Programming languages is found to over- come “computational inefficiency” inherent in otherwise situation, especially in solving a sweep of

Shi, “The essential norm of a composition operator on the Bloch space in polydiscs,” Chinese Journal of Contemporary Mathematics, vol. Chen, “Weighted composition operators from Fp,

A Darboux type problem for a model hyperbolic equation of the third order with multiple characteristics is considered in the case of two independent variables.. In the class

[2])) and will not be repeated here. As had been mentioned there, the only feasible way in which the problem of a system of charged particles and, in particular, of ionic solutions

This paper presents an investigation into the mechanics of this specific problem and develops an analytical approach that accounts for the effects of geometrical and material data on

Using variational techniques we prove an eigenvalue theorem for a stationary p(x)-Kirchhoff problem, and provide an estimate for the range of such eigenvalues1. We employ a

One of the goals of this paper was to examine the extent to which the analysis of Carleson measures and interpolating sequences for space of all functions on the tree with