%PDF-1.4
%
1 0 obj
<<
/Type /Catalog
/Version /1.6
/Pages 2 0 R
/Metadata 3 0 R
>>
endobj
4 0 obj
<<
/Subject (Path Diversity)
/Author (Rohrer, Justin P., Jabbar, Abdul, Sterbenz, James P. G.)
/Creator (Rohrer, Justin P., Jabbar, Abdul, Sterbenz, James P. G.)
/Keywords (Path Diversification is a new mechanism that can be used to select multiple paths between a given ingress and egress node pair using a quantified diversity measure to achieve maximum flow reliability. The path diversification mechanism is targeted at the end-to-end layer, but can be applied at any level for which a path discovery service is available. Path diversification also takes into account service requirements for low-latency or maximal reliability in selecting appropriate paths. Using this mechanism will allow future internetworking architectures to exploit naturally rich physical topologies to a far greater extent than is possible with shortest-path routing or equal-cost load balancing. We describe the path diversity metric and its application at various aggregation levels, and apply the path diversification process to 13 real-world network graphs as well as 4 synthetic topologies to asses the gain in flow reliability. Based on the analysis of flow reliability across a range of networks, we then extend our path diversity metric to create a composite compensated total graph diversity metric that is representative of a particular topology's survivability with respect to distributed simultaneous link and node failures. We tune the accuracy of this metric having simulated the performance of each topology under a range of failure severities, and present the results. The topologies used are from national-scale backbone networks with a variety of characteristics, which we characterize using standard graph-theoretic metrics. The end result is a compensated total graph diversity metric that accurately predicts the survivability of a given network topology.)
/PTEX.Fullbanner (This is pdfTeX, Version 3.1415926-1.40.11-2.2 \(TeX Live 2010\) kpathsea version 6.0.0)
/Producer (pdfTeX-1.40.11)
/ModDate (D:20190515113726-07'00')
/Title (Path Diversification for Future Internet End-to-End Resilience and Survivability)
/Trapped /False
>>
endobj
2 0 obj
<<
/Type /Pages
/Kids [5 0 R 6 0 R 7 0 R 8 0 R 9 0 R 10 0 R 11 0 R 12 0 R 13 0 R 14 0 R
15 0 R 16 0 R 17 0 R 18 0 R 19 0 R 20 0 R 21 0 R 22 0 R 23 0 R]
/Count 19
>>
endobj
3 0 obj
<<
/Length 8130
/Subtype /XML
/Type /Metadata
>>
stream
2012-03-23T10:10:51-07:00
TeX
2012-04-24T20:25:20-05:00
2012-04-24T20:25:20-05:00
This is pdfTeX, Version 3.1415926-1.40.11-2.2 (TeX Live 2010) kpathsea version 6.0.0
pdfTeX-1.40.11
False
Path Diversification is a new mechanism that can be used to select multiple paths between a given ingress and egress node pair using a quantified diversity measure to achieve maximum flow reliability. The path diversification mechanism is targeted at the end-to-end layer, but can be applied at any level for which a path discovery service is available. Path diversification also takes into account service requirements for low-latency or maximal reliability in selecting appropriate paths. Using this mechanism will allow future internetworking architectures to exploit naturally rich physical topologies to a far greater extent than is possible with shortest-path routing or equal-cost load balancing. We describe the path diversity metric and its application at various aggregation levels, and apply the path diversification process to 13 real-world network graphs as well as 4 synthetic topologies to asses the gain in flow reliability. Based on the analysis of flow reliability across a range of networks, we then extend our path diversity metric to create a composite compensated total graph diversity metric that is representative of a particular topology's survivability with respect to distributed simultaneous link and node failures. We tune the accuracy of this metric having simulated the performance of each topology under a range of failure severities, and present the results. The topologies used are from national-scale backbone networks with a variety of characteristics, which we characterize using standard graph-theoretic metrics. The end result is a compensated total graph diversity metric that accurately predicts the survivability of a given network topology.
application/pdf
Path Diversification for Future Internet End-to-End Resilience and Survivability
Path Diversity
Justin P. Rohrer, Abdul Jabbar, James P.G. Sterbenz
Path Diversification is a new mechanism that can be used to select multiple paths between a given ingress and egress node pair using a quantified diversity measure to achieve maximum flow reliability.
The path diversification mechanism is targeted at the end-to-end layer
but can be applied at any level for which a path discovery service is available.
Path diversification also takes into account service requirements for low-latency or maximal reliability in selecting appropriate paths.
Using this mechanism will allow future internetworking architectures to exploit naturally rich physical topologies to a far greater extent than is possible with shortest-path routing or equal-cost load balancing.
We describe the path diversity metric and its application at various aggregation levels
and apply the path diversification process to 13 real-world network graphs as well as 4 synthetic topologies to asses the gain in flow reliability.
Based on the analysis of flow reliability across a range of networks
we then extend our path diversity metric to create a composite compensated total graph diversity metric that is representative of a particular topology's survivability with respect to distributed simultaneous link and node failures.
We tune the accuracy of this metric having simulated the performance of each topology under a range of failure severities
and present the results.
The topologies used are from national-scale backbone networks with a variety of characteristics
which we characterize using standard graph-theoretic metrics.
The end result is a compensated total graph diversity metric that accurately predicts the survivability of a given network topology.
uuid:48f47e3c-7de4-43c4-982b-4a35e98b7065
uuid:006bcac7-7789-4ace-8acf-494cd60f4c7f
endstream
endobj
5 0 obj
<<
/Type /Page
/MediaBox [0.0 0.0 612.0 792.0]
/Contents 24 0 R
/Resources 25 0 R
/Parent 2 0 R
>>
endobj
6 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents [26 0 R 27 0 R 28 0 R 29 0 R 30 0 R 31 0 R 32 0 R 33 0 R]
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 34 0 R
/Type /Page
>>
endobj
7 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 35 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 36 0 R
/Type /Page
>>
endobj
8 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 37 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 38 0 R
/Type /Page
>>
endobj
9 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 39 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 40 0 R
/Type /Page
>>
endobj
10 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 41 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 42 0 R
/Type /Page
>>
endobj
11 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 43 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 44 0 R
/Type /Page
>>
endobj
12 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 45 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 46 0 R
/Type /Page
>>
endobj
13 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 47 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 48 0 R
/Type /Page
>>
endobj
14 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 49 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 50 0 R
/Type /Page
>>
endobj
15 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 51 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 52 0 R
/Type /Page
>>
endobj
16 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 53 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 54 0 R
/Type /Page
>>
endobj
17 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 55 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 56 0 R
/Type /Page
>>
endobj
18 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 57 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 58 0 R
/Type /Page
>>
endobj
19 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 59 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 60 0 R
/Type /Page
>>
endobj
20 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 61 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 62 0 R
/Type /Page
>>
endobj
21 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 63 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 64 0 R
/Type /Page
>>
endobj
22 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 65 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 66 0 R
/Type /Page
>>
endobj
23 0 obj
<<
/CropBox [0.0 0.0 595.276 841.89]
/Parent 2 0 R
/Contents 67 0 R
/Rotate 0
/MediaBox [0.0 0.0 595.276 841.89]
/Resources 68 0 R
/Type /Page
>>
endobj
24 0 obj
<<
/Length 847
/Filter /FlateDecode
>>
stream
xV]o0R> 1
Q|8m%ĖZ&kI MhLsj'PىsϽލ㟯^8V=]^[8cqwNŭk.ܓ{{+7Hy!PBCSN359SO!
ͤw9&b.{zzsL_9i>/!xRFҽk1$C6#P 'ױheE?]bTR*Y7ѧhJi}<cӱe^щf^}{B
~tjG&?شZ
)rPYҞK]0[ThP8PH:aCKeh
pgbH)d[E;"IX3p2RX/QBm(]r_e6(i mLe&[oOm0`CZ[8~8 AqJZAdiIj=[hx?{b
u֪^s+yOH3㳪.2ȁ23l\cNd*#Zob4c?!HT*ӑ|pAp 6~}oEjVm+zF1~J/l^nD{nA7rjsȾ-&h_p_0a>Glʎidl5˭e3Q3%sOT33Ni/XIB [*"Iͮ:gY3)#e3gԦwbr3_Jc{7-kZAyNjᒨT9btlĞ$>
/Font 71 0 R
>>
endobj
26 0 obj
<<
/Length 614
/Filter /FlateDecode
>>
stream
HTMs Wp&@vgSZ$kB@ɤVJv:E첻oEF.Vz2sA
)ӊbLq*v5F9)
0ULwM:9Ԛ%Б5:٥Z$`F&KBd|z\N(LQ^!̈́8
o1mJ`A\*ŹJ9KLأ_>ď|1q*m*Tl0)/W,*q6DAɚTg;f5,ZWf l#,xb*O}CAKlqۏ>3_8Tӹ_GpySHʅ ?hVB.)f< The>%R8_rs\䮬9
ҫJڇU٦dOHPJe>d `y5x2_0Zg=FG'ƵX؛Vm&`/n2T*m< =u!Ü{cx4+uepﮍKuwy#2MkVf0PiѴZ$ܹviNӃi;k8_ zWA
endstream
endobj
27 0 obj
<<
/Length 612
/Filter /FlateDecode
>>
stream
HlT˲0fPp ?EW]Eۅ8AsLm}%MgXY#cע)V])⧈6}/Uui6*{cAB|^=;8'`UU~Yˀj&4mGv/.&gT̙4
3*