USC Computer Science Technical Reports, no. 731 (2000)

PDF

Download

Open document

Flip pages

Copy asset link

Request this asset

Description

Pavlin Radoslavov, Hongsuda Tangmunarunkit, Haobo Yu, Ramesh Govindan, Scott Shenker, Deborah Estrin. "On characterizing network topologies and analyzing their impact on protocol design." Computer Science Technical Reports (Los Angeles, California, USA: University of Southern California. Department of Computer Science) no. 731 (2000).

Transcript (if available)

Content ! " # $ " # % ! # & ! " # # $%&’ " ( ) *" % + *" , - . - / - / 0+ ) 1 2 . % - ) 3 ) 4 . ( $& ’ 5 6 + 7 7 $ ’ - . ) 5 ( %& # - - + 8 + + 6 9 + . . - $ 1,’ ( 6 $’ $& ’ $ ’ $& !’ $:’ $& ;’ $’ $& <’ 8 4 ( 3 5 4 ) ) 3 + 2 5 = 5 > . 5 4 . ) & 3 5 1 = ( * *" 4 % 4 5 ? ? % @ **A << !*** A: - + !*** < # ( ) & ) 5 + ( 4 , 6 4 $&,’ ;" < " % F $ ’ % ! / * ) $ ’ % . " B " B B" > & + = ( - A" . > ) > %8, % ) - + <" ( ) 5 A" & + + $ ’ 4 - 6 B* 2 F + E % 4 5 4 - B* ( 4 B* 4 5 ! B* 5 E + 2 4 B* % 4 1 1.5 2 2.5 3 3.5 Distance Ratio Topologies 90th percentile Mean Transit-stub Waxman Tiers Random Mesh Mbone AS Internet core The mean and 90th percentile distance ratio of various topologies 5 !6 % ( $ ’ . ! B* + - + 5 B* :! 5 . 6 4 E 4 B* % + - + $ ’ $5 ’ + + 3 4 . % ) EE $ ’ ! " I + : " I + - $ ’ 8 . ; " . 4 . & . 2 " > ( 9 . 5 !"6 $’ ( 4 - 4 $ ’ - + . . : 5 ) ) 0 0.2 0.4 0.6 0.8 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Interface entropy Receiver Probability Internet core AS Mbone )* + 0 0.2 0.4 0.6 0.8 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Receiver Probability Random Mesh Reduced mesh Tree )* - 0 0.2 0.4 0.6 0.8 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Receiver Probability Tiers Transit-stub Waxman )* . 5 ;6 % 5 ; 0 ) $5 ;$’’ . ( % $5 ;$’’ ( # ( % - + + $5 ;$’’ . - 4 + ) - $ :J’ * 5 *J : . 4 ;" . % $5 ’ ) ) $ - + ’ ? % & 4 6 - ) + + 3 5 5 3 # $ % 8 ) ;" . 8 $’ 4 0 > ( > 4 ;"6 + 8 ;" 4 + ! ;" + 4 = 0 ! 8 # & $#&’ #& % + 2 4 - - - ) 0 0.5 1 1.5 2 2.5 3 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Tree Stretch (IP Multicast tree = 1.0) Fraction of nodes with receivers Internet core AS Mbone )* + 0 0.5 1 1.5 2 2.5 3 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Fraction of nodes with receivers Random Mesh Reduced mesh Tree )* - 0 0.5 1 1.5 2 2.5 3 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Fraction of nodes with receivers Tiers Transit-stub Waxman )* . 5 <6 0 5 < + $5 <$’’ 5 $ !J’ & + ; 5 $5 <$’’ 5 5 ; 4+ $ + ’ 7 > % & . $5 <$’’ - + 5 !J 0 5 10 15 20 25 30 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Tree Stress (IP Multicast tree = 1.0) Fraction of nodes with receivers Internet core AS Mbone )* + 0 5 10 15 20 25 30 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Fraction of nodes with receivers Random Mesh Reduced mesh Tree )* - 0 5 10 15 20 25 30 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Fraction of nodes with receivers Tiers Transit-stub Waxman )* . 5 A6 0 5 A 2 *J $5 A$’’ 9 . ! % 1 $5 A$’’ % - + $5 A$’’ < - / % $ *J’ $5 ’ + 6 5 + : " ( + + + 9 + + - + % + % ( ) ) 5 5 & " ’ % <" 8 , :*" %,# > %,# 4 . :* "6 9 / & 4 %,# ( - + 4 4 + ( + $ ’ A 2 % + 1 ) 5 % + @ %,# + ) - 0 10 20 30 40 50 60 70 80 90 100 0 20 40 60 80 100 Percentage of successfully finding alternate path Percentage of congested links Internet core AS Mbone )* + 0 20 40 60 80 100 0 20 40 60 80 100 Percentage of congested links Random Mesh Reduced mesh Tree )* - 0 20 40 60 80 100 0 20 40 60 80 100 Percentage of congested links Tiers Transit-stub Waxman )* . 5 B6 & 5 B$’ + 6 + 6 4 9 E ) E I $5 B$’’ 9 - # %& + ) ? - + $5 B$’’ ) B # 9 %& 0 50 100 150 200 250 300 350 400 0 20 40 60 80 100 Average path length increase of alternate route (%) Percentage of congested links Internet core AS Mbone )* + 0 50 100 150 200 250 300 350 400 0 20 40 60 80 100 Percentage of congested links Random Mesh Reduced mesh Tree )* - 0 50 100 150 200 250 300 350 400 0 20 40 60 80 100 Percentage of congested links Tiers Transit-stub Waxman )* . 5 *6 0+ ! " 5 * + ( + $5 *$’’ 1 + + % + 2 + $5 *$’’ 0 %& ) + 5 $;*J’ !*J - + $5 *$’’ + 5 0 # % % $1 % * ) - + $5 :’ + $5 ’ 4 ) + + 2 + 9 3 , ( = - E E+ & 4 . - / % + E E I + 3 5 + ( + + & 6 F + @ 3 + ( ) # + + + 2 $ - ’ 5 ’ " % K 2 , 5 5 K 1 1 2 !"#$ & 5 BB: " 9 2 2 1 # "%%% : $’6B<LBA % BBB :" M 1 # @ 0- N # "%%% & K BB< " M 1 1) @ #8 # O 1 , 6PPP P&P !" # 1 K % % " ’ K - Q & BB ;" & @ # 8 0+ D%? !"#$ !!L; % BAA <" & @ @ 0 @ 5 O K 1 D D - % % -% # 8 !"#$ D & BB A" # @ % 2 # C ? "%%% # ’ (#)$*%$ + ? BB; B" @ 0 @ 5 2 & ,# , & 4 * + *" 1 5 , 5 # 5 - D D / 0 D !"#$ & BBB " ? D % ? 8 %& 1 6PPP8P P%&BB* : " , 5 R 6 0+ # % I 6PP P & BBB :" % C M # 0+ C # 8 @ & % & I ? & %?1&?BBAB K BBB & & @ % *** " 8 C 9 9 # @ "%%% " % # *** !" 1 9 ( 1 & !" , :6AALB! B< ;" R 1 &= 8 9 N 0 # ? & <" 2 8 9 1K 8& - 5 & %& @ 8 # 1& > "%%% & !$B’ BB A" C M O M % 5 9 S # & , C !" , !- *$’6:!BLB BBA B" M M , 8 1 %T @ 0 # 9 @ #%&1P2C#, % -% # 8 !"#$ O 2 1 & BBA *" C , & & 9 & # 6 1 1 & & D !"#$ & BBB " &1%? , = # # 6PPPP " , 8 @ 0 8 C 0+ 2# ) # & % 8 BB;B< I & 1 BBB :" R 8 1 0+ 8 % , 2 1@8 0 . /012 & BB: " % 8U ( 0 ! ’ :!!L:;* C 2 & , K B;B !" 8 & 8 & & M @ I ;" @ # 9 ( % # 5 & "%%% " % *** <" 2 # - + 8 # 1 "%%% , ! ;$B’6;<L; @ BAA : A" D - @ 0 % 1 # % "%%% " 1 K BB B" , - & , ? 6 %& 3 <$ ’6 BL;< BA< :*" @ N % , 8 # "%%% " # *** " $) $) ! * !+ 1 10 100 1000 10000 100000 1e+06 0 5 10 15 20 25 30 35 E(h) h Lr L S SL )* 23 1 10 100 1000 10000 100000 1e+06 1 10 100 E(h) h Lr L S SL )* 23 5 6 0+ 1 10 100 1000 10000 0 1 2 3 4 5 6 7 8 E(h) h 10^h Random100 Random1000 Random2000 Random4000 Random5000 )* 23 1 10 100 1000 10000 1 10 E(h) h 10^h Random100 Random1000 Random2000 Random4000 Random5000 )* 23 5 6 0+ + + 2C, " " " 5 5 + . 9 4 + + + + + + + 5 + ) * + ? 4 - " 5 + 4 + = + + 9 + % + ) + , $ % ! % - 0 0.5 1 1.5 2 2.5 3 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Tree Stretch (IP Multicast tree = 1.0) Fraction of nodes with receivers Internet core AS Mbone )* + 0 0.5 1 1.5 2 2.5 3 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Fraction of nodes with receivers Random Mesh Reduced mesh Tree )* - 0 0.5 1 1.5 2 2.5 3 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Fraction of nodes with receivers Tiers Transit-stub Waxman )* . 5 :6 0 & ; 9 # & $#&’ & 3 ! 5 : % #& , ( #& 5 < $ *J ’ . $ #& ’ S :*J #& 5 ) ) #& $ *L:*J’ 0 5 10 15 20 25 30 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Tree Stress (IP Multicast tree = 1.0) Fraction of nodes with receivers Internet core AS Mbone )* + 0 5 10 15 20 25 30 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Fraction of nodes with receivers Random Mesh Reduced mesh Tree )* - 0 5 10 15 20 25 30 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Fraction of nodes with receivers Tiers Transit-stub Waxman )* . 5 6 0 5 #& % $5 $’’ 4 % 4 9 #& *L:*J 9 #& 3 ; " ’ + $& <’ 4+ *J 0 20 40 60 80 100 1e-05 0.0001 0.001 0.01 0.1 1 Percentage of successfully finding alternate path Fraction of nodes with receivers Internet core AS Mbone )* + 0 20 40 60 80 100 1e-05 0.0001 0.001 0.01 0.1 1 Fraction of nodes with receivers Random Mesh Reduced mesh Tree )* - 0 20 40 60 80 100 1e-05 0.0001 0.001 0.01 0.1 1 Fraction of nodes with receivers Tiers Transit-stub Waxman )* . 5 !6 & $ *J ’ 5 ! - = 4 5 $ - +’ + & $ ’ 9 + 6 + ( + . *" $ ’ %& # ( 4 I + + % + + $5 ;’ - = < 0 5 10 15 20 25 30 1e-05 0.0001 0.001 0.01 0.1 1 Average path length increase of alternate route (%) Fraction of nodes with receivers Internet core AS Mbone )* + 0 5 10 15 20 25 30 1e-05 0.0001 0.001 0.01 0.1 1 Fraction of nodes with receivers Random Mesh Reduced mesh Tree )* - 0 5 10 15 20 25 30 1e-05 0.0001 0.001 0.01 0.1 1 Fraction of nodes with receivers Tiers Transit-stub Waxman )* . 5 ;6 0+ $ *J ’ F + ) 9 . 4 = S # + ( - + + . " ’ "% 9 %,# :*" + > ) $% + 1’ 5 < 1 5 < . 2 %,# + ) + *J 4+ . 5 A + 1 5 * + # + + %,# A 0 10 20 30 40 50 60 70 80 90 100 0 20 40 60 80 100 Percentage of successfully finding alternate path Percentage of congested links Internet core AS Mbone )* + 0 20 40 60 80 100 0 20 40 60 80 100 Percentage of congested links Random Mesh Reduced mesh Tree )* - 0 20 40 60 80 100 0 20 40 60 80 100 Percentage of congested links Tiers Transit-stub Waxman )* . 5 <6 & %,# 0 50 100 150 200 0 20 40 60 80 100 Average path length increase of alternate route (%) Percentage of congested links Internet core AS Mbone )* + 0 50 100 150 200 0 20 40 60 80 100 Percentage of congested links Random Mesh Reduced mesh Tree )* - 0 50 100 150 200 0 20 40 60 80 100 Percentage of congested links Tiers Transit-stub Waxman )* . 5 A6 0+ %,# B

Asset Metadata

Creator Estrin, Deborah (author), Govindan, Ramesh (author), Radoslavov, Pavlin Ivanov (author), Shenker, Scott (author), Tangmunarunkit, Hongsuda (author), Yu, Haobo (author)

Core Title USC Computer Science Technical Reports, no. 731 (2000)

Alternative Title On characterizing network topologies and analyzing their impact on protocol design (title)

Publisher Department of Computer Science,USC Viterbi School of Engineering, University of Southern California, 3650 McClintock Avenue, Los Angeles, California, 90089, USA (publisher)

Tag oai:digitallibrary.usc.edu:cstechreports,OAI-PMH Harvest

Format 29 pages (extent), technical reports (aat)

Language English

Permanent Link (DOI) https://doi.org/10.25549/cstechreports-oUC16270525

Unique identifier UC16270525

Identifier 00-731 On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design (filename)

Legacy Identifier usc-cstr-00-731

Format 29 pages (extent),technical reports (aat)

Rights Department of Computer Science (University of Southern California) and the author(s).

Internet Media Type application/pdf

Copyright In copyright - Non-commercial use permitted (https://rightsstatements.org/vocab/InC-NC/1.0/

Source 20180426-rozan-cstechreports-shoaf (batch), Computer Science Technical Report Archive (collection), University of Southern California. Department of Computer Science. Technical Reports (series)

Access Conditions The author(s) retain rights to their work according to U.S. copyright law. Electronic access is being provided by the USC Libraries, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright.

Repository Name USC Viterbi School of Engineering Department of Computer Science

Repository Location Department of Computer Science. USC Viterbi School of Engineering. Los Angeles\, CA\, 90089

Repository Email csdept@usc.edu

Inherited Values

Title Computer Science Technical Report Archive

Description Archive of computer science technical reports published by the USC Department of Computer Science from 1991 - 2017.

Coverage Temporal 1991/2017