Community based routing scheme for future Internet

8/18/2019 Community based routing scheme for future Internet

1/68

1

A Proposal of Modification in

Thorup Zwick Compact Routing

Algorithm for Future Internet Yatish Bathla

Adisor! "aide Careglio

Reporter!#alatore #padaro

Optical Communications Group

Departament de teoria del senyal i Comunicacions

Technical University of Catalunya (UPC)


2/68

2

OUTLINE

$% P&A#' I

(% P&A#' II

)% P&A#' III

*% P&A#' I+

,% C-.C/0#I-.#

1% -P'. I##0'#

2% F0T0R' 3-R4


3/68

3

OUTLINE

$% P&A#' I

(% P&A#' II

)% P&A#' III

*% P&A#' I+

,% C-.C/0#I-.#

1% -P'. I##0'#

2% F0T0R' 3-R4


4/68

PHASE I

! 3&AT I# I.T'R.'T5

"#T$ODUCT"O#

%UTO#O&OU' ''T&

! R-0TI.6

$OUT"#G T%*+

$OUT"#G P$OTOCO+'

, "GP

, GP $OUT"#G %+GO$"T-&

! PAT& +'CT-R A/6-RIT&M

! I.T'R"-MAI. #CA/ABI/ITY PR-B/'M#


5/68

.

PHASE I

! 3&AT I# I.T'R.'T5

"#T$ODUCT"O#

%UTO#O&OU' ''T&

! R-0TI.6

$OUT"#G T%*+

$OUT"#G P$OTOCO+'

, "GP





6/68

/

WHAT IS INTERNET?• INTRODUCTION

Network of the

networks

Uses: Business purpose application,

social networking,

Conference, games,

shopping etc

Topology of

Autonomous systems


7/68

0

AUTONOMOUS SYSTEM

Same routing policy

under single

administratie domain

Uni!ue identifying

num"er and different

types

Collection of routersrunning on routing

protocols


8/68

PHASE I

! 3&AT I# I.T'R.'T5

"#T$ODUCT"O#

%UTO#O&OU' ''T&

! R-0TI.6

$OUT"#G T%*+

$OUT"#G P$OTOCO+'

, "GP





9/68

ROUTING

• #ayer $ gateway

deice

• ROUTING TABLE "ig list of destination

networks

"asic inde% parameterare destination router,

gateway, &nterface,

su"net and metric


10/68

1

ROUTING PROTOCOL

&nterior 'ateway (rotocol

) intra)domain protocol *&(, +S(, &'*(, &S)&S

-%terior 'ateway (rotocol

) inter)domain (rotocol

B'(


11/68

1108/27/15 11

B'( is the standard protocol in &nternet

. e%ternal B'( /eB'(0 for interconnection "etween AS1s

. internal B'( /iB'(0 for interconnection "etween B'( routers within an AS

ROUTING PROTOCOL

eBGP

eBGP

eBGP

eBGP

iBGP

iBGPiBGP

eBGPiBGP

AS 1234

AS 6447

AS 2497

AS

32123

AS 111


12/68

12

ROUTING ALGORITHM

2istance 3ector : *&(, &'*(

#ink state : +S(, &S)&S

(ath 3ector : B'(


13/68

13

PHASE I

! 3&AT I# I.T'R.'T5

"#T$ODUCT"O#

%UTO#O&OU' ''T&

! R-0TI.6

$OUT"#G T%*+

$OUT"#G P$OTOCO+'

, "GP





14/68

1

Path-Vector Alor!th"• E#te$%!o$ o& '!%ta$ce-(ector ro)t!$

support fle%i"le routing policies and attri"utes

aoid count)to)infinity pro"lem

• *e+ !'ea, a'(ert!%e the e$t!re ath 2istance ector: send distance metric per dest d

(ath ector: send the entire path for each dest d

./ 0

'

1', ath 2/3045 1', ath 2045

data traffic data traffic


15/68

1.

PHASE I

! 3&AT I# I.T'R.'T5

"#T$ODUCT"O#

%UTO#O&OU' ''T&

! R-0TI.6

$OUT"#G T%*+

$OUT"#G P$OTOCO+'

, "GP





16/68

1/

INTERDOMAIN SCALABILITY

PROBLEMS• Scala6!l!t+: increasing routingta"le si4e and B'( updates

• Dr!(!$ &orce: multi)homing,

traffic engineering, incrementof users

• Gro7th o& BGP ta6le,

currently its 56$7 million

entries per node, reach 8

million entries within 9 years

and 95 million entries "y 855


17/68

10

OUTLINE

$% P&A#' I

(% P&A#' II

)% P&A#' III

*% P&A#' I+

,% C-.C/0#I-.#

1% -P'. I##0'#

2% F0T0R' 3-R4


18/68

1

PHASE II

! A"+A.C' R-0TI.6 #C&'M'#

C-MPACT R-0TI.6

, Co4en 'cheme

, Thorup and 54ic6 'cheme

, *rady and Co4en 'cheme

, %7raham 'cheme

6'-6RAP&IC R-0TI.6

, Greedy for4ardin8

&I'RARC&ICA/ R-0TI.6


19/68

1

PHASE II

! A"+A.C' R-0TI.6 #C&'M'#

C-MPACT R-0TI.6

, Co4en 'cheme



, %7raham 'cheme

6'-6RAP&IC R-0TI.6

, Greedy for4ardin8



20/68

2

COMPACT ROUTING

• A routing algorithm is compact if

Node address and packet header si4es scale poly)

logarithmically

*outing ta"le si4es scale su" linearly

Stretch is a constant

• +mitting some details of the network topology in

an efficient way • Compensate trade off "etween *outing ta"le si4e

and Stretch


21/68

21

Co7e$ Ro)t!$ Sche"e

n $8

• irst uniersal stretch)$compact routing scheme6

• Utili4es the concept of

glo"al landmarks andlocal neigh"orhoods

• #andmark set selection isdetermined "y greedy

appro%imation• +pen &ssue: facilitaterouting ta"le si4es note%ceeding +/ 0n

$8

n $8


22/68

22

Thor) a$' 87!c9

Ro)t!$ Sche"e• Addressed this open pro"lem producing scheme

with worst)case +/ 0 si4ed routing ta"les

• Changing the landmark selection scheme to aniteratie process that randomly selects nodes aslandmarks and introduce concept of cluster

• (resented a speciali4ed compact routing schemefor trees6

• This tree routing scheme has constant time+/90forwarding and e%tremely compact headersi4es6

89n


23/68

23

Bra'+ a$' Co7e$ Sche"e• Creates seeral spanning

trees out of a gien graph

• (rocessed using a routing

algorithm proided "yThorup and ;wick

• *outing ta"le si4es

O/elog2 n0

• +pen issues: Comple% as

two algorithm are needed

to proide routing

serices


24/68

2

A6raha" Sche"e

• Achiees "oth +/ 0 routing ta"les and stretch)$

•


25/68

2.

PHASE II

! A"+A.C' R-0TI.6 #C&'M'#

C-MPACT R-0TI.6

, Co4en 'cheme



, %7raham 'cheme

6'-6RAP&IC R-0TI.6

, Greedy for4ardin8



26/68

2/

GEOGRAPHIC ROUTING

• *elies on geographic position information

• &nstead of network address uses geographic

location of the destination• *outing takes place without knowledge of the

network topology or a prior route discoery

• -ach packet can hold a small amount +/90 of

routing information• There are arious approaches: single)path, multi)

path and flooding)"ased strategies6


27/68

20

Gree'+ &or7ar'!$

•


28/68

2

PHASE II

! A"+A.C' R-0TI.6 #C&'M'#

C-MPACT R-0TI.6

, Co4en 'cheme



, %7raham 'cheme

6'-6RAP&IC R-0TI.6

, Greedy for4ardin8



29/68

2

HIERARCHICAL ROUTING

• *outing in networks that is "ased on hierarchical

addressing6

•


30/68

3

OUTLINE

$% P&A#' I

(% P&A#' II

)% P&A#' III

*% P&A#' I+

,% C-.C/0#I-.#

1% -P'. I##0'#

2% F0T0R' 3-R4


31/68

31

PHASE III

! T&-R0P Z3IC4 R-0TI.6 #C&'M'

C/0#T'R A." /A."MAR4

PRI.CIP/'

"'#CRIPTI-.

-P'. I##0'#


32/68

32

PHASE III

! T&-R0P Z3IC4 R-0TI.6 #C&'M'

C/0#T'R A." /A."MAR4

PRI.CIP/'

"'#CRIPTI-.

-P'. I##0'#


33/68

33

CLUSTER AND

LANDMAR* NODES• #andmark node: knowledge of whole topology

• Cluster node: knowledge of neigh"orhood andlandmark nodes after landmark search algorithm

• Node pro"a"ility selected as landmark is

s>?potential landmark? , 9 @s @ n and s / 0

• #imit for a nodes cluster si4e is n>s6

•


34/68

3

PRINCIPLE

within local neigh"orhood:

store shortest path routing

outside local neigh"orhood:

store routing information to

all landmarks

stretch "ound follows from

the triangle ine!uality


35/68

3.

DESCRIPTION


36/68

3/

OPEN ISSUES

• -%tra "urden on each cluster router to store

routing information of all landmark routers

• (rocessor of eery cluster router is ery comple%• #andmark routers are oerloaded

• Scope of landmark routers are also limited

• Cluster routers are more costly


37/68

30

OUTLINE

$% P&A#' I

(% P&A#' II

)% P&A#' III

*% P&A#' I+

,% C-.C/0#I-.#

1% -P'. I##0'#

2% F0T0R' 3-R4


38/68

3

PHASE IV

! M-"IFI'" T&-R0P Z3IC4 R-0TI.6 #C&'M'

C/0#T'R A." C-MM0.ITY

BA#IC R0/'# A." R'60/ATI-.

PRI.CIP/'

R-0TI.6 A/6-RIT&M

"'#CRIPTI-. A." 6RAP

7 O# CO&&U#"T C%'

, T9O CO&&U#"T C%'

C-MPARI#I-.

M'RIT#


39/68

3

PHASE IV

! M-"IFI'" T&-R0P Z3IC4 R-0TI.6 #C&'M'

C/0#T'R A." C-MM0.ITY .-"'#

BA#IC R0/'# A." R'60/ATI-.

PRI.CIP/'

R-0TI.6 A/6-RIT&M

"'#CRIPTI-. A." 6RAP

7 O# CO&&U#"T C%'

, T9O CO&&U#"T C%'

C-MPARI#I-.

M'RIT#


40/68

CLUSTER AND

COMMUNITY NODES• Cluster node: routers present

within its cluster andminimum one and ma%imum

two community routers• Community node: certain

group of clusters at least onecommunity router for glo"alconnectiity and at mostnum"er of community routerse!ual to num"er of clusters

part of that community


41/68

1

BASIC RULES AND

REGULATION• *outer: "elongs to some cluster • Cluster: "elongs some community

• Community num"er : uni!ue6

• Cluster num"er : may or may not uni!ue6• *outer address: uni!ue6

• Community: only one community router and at least twocluster6

• +ne router from each cluster directly connected tocommunity router

• Cluster : at least one community and at most twocommunity6 &n two community concept of (rimary andSecondary community6


42/68

2

BASIC RULES AND

REGULATION• (rimary community

• Secondary Community

• Cluster node routes alwaystowards (rimary Community

• 2ifference "etween (rimaryand Secondary Community

• (rimary community at leastknowledge of one Secondarycommunity for glo"alconnectiity


43/68

3

PRINCIPLE

• Dithin local neigh"orhood:

stores information of its

cluster router

• +utside local neigh"orhood:

store information of at least

one community and at mosttwo community


44/68

ROUTING ALGORITHM


45/68

.

DESCRIPTION AND GRAPHS

ONE COMMUNITY CASE


46/68

/

ONE COMMUNITY CASE


47/68

0

DESCRIPTION AND GRAPHS

TWO COMMUNITY CASE


48/68

TWO COMMUNITY CASE


49/68

TWO COMMUNITY CASE


50/68

.

TWO COMMUNITY CASE


51/68

.1

TWO COMMUNITY CASE


52/68

.2

COMPARISION

S&N'#-

C+


53/68

.3

MERITS

• Structured

• +rgani4ed

• Compact

• easi"le

• le%i"le

• Dide scoped


54/68

.

OUTLINE

$% P&A#' I

(% P&A#' II

)% P&A#' III

*% P&A#' I+

,% C-.C/0#I-.#

1% -P'. I##0'#

2% F0T0R' 3-R4


55/68

..

CONCLUSIONS

• urther reducing the routing ta"le si4e of

eery router

• *educing comple%ity of the cluster routers


56/68

./

OUTLINE

$% P&A#' I

(% P&A#' II

)% P&A#' III

*% P&A#' I+

,% C-.C/0#I-.#

1% -P'. I##0'#

2% F0T0R' 3-R4


57/68

.0

OPEN ISSUES

• -%ceptional stretch in some case

• Aaila"ility and speed in some case

• Comple%ity and "andwidth consumption in

some case

• No router has knowledge of complete

topology


58/68

.

OUTLINE

$% P&A#' I

(% P&A#' II

)% P&A#' III

*% P&A#' I+

,% C-.C/0#I-.#

1% -P'. I##0'#

2% F0T0R' 3-R4


59/68

.

:UTURE WOR*

• Com"ine with other adance routing

scheme

'eographical *outing Scheme

=ierarchical *outing Scheme


60/68

/

T=ANF E+U


61/68

/1

GuestionsH


62/68

/2

BACF U( S#&2-S


63/68

/3

AUTONOMOUS SYSTEM

! Different types of autonomous systems:sin8le,homed; multihomed nontransit; andmultihomed transit<

! 'in8le,homed: one e=it point

! &ulti,homed: more than one e=it point

! % nontransit %' does not allo4 transit traffic to

pass throu8h it< Transit traffic is any trafficthat has a source and destination outside the %'<


64/68

/

BGP PATH ATTRIBUTE

• +*&'&N

• AS)(AT=

• N-IT)=+(

•


65/68

/.

:UNDAMENTAL DIMENSIONS

• D!%tr!6)t!o$: how routing ta"le si4e get

distri"uted among routers

• D+$a"!c!t+: descri"es whether the protocol canupdate routing ta"le of gien routers or not when

network topology changes

• Stretch: descri"es ma%imum ratio oer all source)

destination pairs "etween the path length as produced "y the routing scheme and the minimum

length for the same source)destination pair6


66/68

//

:UNDAMENTAL DIMENSIONS

• Cla%%: routing schemes work under either of

these two classes: Uniersal and Specialised

• Na"e Sche"e: diide into two category:

Name)dependence, Name)independence


67/68


68/68

#AN2

Documents

Community based routing scheme for future Internet