Community Based Routing scheme for

future internet considering

PLM systems
Yatish Bathla, PhD candidate

Doctoral School of Applied Informatics and Applied Mathematics,

buda University, Budapest, Hungary
Email: yatish.bathla@phd.uni-obuda.hu

7/2/2017 SAMI 2016

1
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

2 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

3 7/2/2017
Definition of Internet

Network of Networks

Topology of
Autonomous System

4 7/2/2017
Definition of Internet

Autonomous System
collection of routers
running on routing
protocols

single administrative
domain

5 7/2/2017
Concept of Routing

Router
Routing Table
Routing Protocol
Routing Algorithm

6 7/2/2017
Concept of Routing

Routing Protocol
IGP: Also Known as
Intra-Domain Protocol
for e.g. RIP, OSPF,
IGRP, IS-IS
EGP: Also Known as
Inter-Domain Protocol
for e.g. BGP

7 7/2/2017
Concept of Routing

Routing Algorithm
Distance Vector : Intra-Domain Protocol RIP, IGRP
Link State: Intra-Domain Protocol OSPF, IS-IS
Path Vector: Inter-Domain Protocol BGP

8 7/2/2017
Concept of Routing

Path Vector Routing

Routing Policies and
Path attributes

Advertise Entire Path

9 7/2/2017
Issues in Present Internet

Scalability: increasing
routing table size and
BGP updates
Growth of Routing
Table: currently its 1
million entries per node
and reach 10 million
entries by 2050

10 7/2/2017
PLM Systems and future Internet

Product lifecycle management (PLM) track and

manage product information, component data,
bills of materials, product documentation,
engineering changes and revisions, and quality
and compliance data.
Different types of cloud strategies are
deployed: public, private and hybrid
As a result, number of inter-domain nodes are
increased

11 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

12 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

13 7/2/2017
Advance Routing Schemes

Geographic Routing
uses geographic location of the destination
distributed planarization is difficult in topology,
Costly and complex
Hierarchical Routing
routing decisions based on suffix name
routing not optimal, very poor performance

14 7/2/2017
Compact Routing Scheme

Node address and packet header sizes scale poly-

logarithmically
Routing table sizes scale sub linearly
Stretch is a constant
Compensate trade off between Routing table size
and Stretch

15 7/2/2017
Compact Routing Scheme

Cowen Routing Scheme:

concept of global landmarks and local
neighborhoods
Brady and Cowen Routing Scheme:
creates several spanning trees out of a given
graph
Abraham Routing Scheme:
vicinity balls, Coloring, Hashing names to colors,
Labeled routing on trees

16 7/2/2017
Thorup and Zwick Routing Scheme

Landmark node:
knowledge of whole
topology
Cluster nodes:
knowledge of
neighborhood and
landmark nodes

17 7/2/2017
Thorup and Zwick Routing Scheme

Landmark nodes faces issue of scalability

Cluster nodes routing algorithm is complex
Burden on cluster nodes

18 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

19 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

20 7/2/2017
Community Based Routing Scheme

Community:
collection of cluster
nodes
Community node:
representative of
community
Cluster node:
belongs to community
and act as source-
destination node

21 7/2/2017
Community Based Routing Scheme

Gate:
Local gate(LCG)
Community
gate(CMG)
Cluster gate(CLG)
Global gate(GLG)

22 7/2/2017
Community Based Routing Scheme

Rules followed by nodes

Cluster nodes present in the topology must
belongs to any community.
Community nodes present in the topology must
not belongs to any community, but it represents a
community.
A community node should represent only one
community.
Only one cluster gate(CLG) exists in a community.

23 7/2/2017
Community Based Routing Scheme

Rules followed by nodes

Only cluster node with cluster gate(CLG) activated
have rights to communicate with community
node.
For global connectivity of a community, either
global gate(GLG) must be activated in a cluster
node of community, or community gate(CMG)
must be activated in the representative
community node.

24 7/2/2017
Community Based Routing Scheme

Routing Table
Cluster node: Cluster ID of source node,
Community ID of source node, Cluster ID of
destination nodes, Community ID of destination
nodes, Path attribute and Metric cost.
Community node: Community ID of source
community node, Community ID of destination
community nodes, Path attribute and Metric cost.

25 7/2/2017
Community Based Routing Scheme

Routing Principle
Inside Community: shortest path routing
information in the routing table of source node
will be used to establish the connection using local
gate (LCG).
Outside Community: source cluster node forwards
the traffic towards representing community node
by cluster gate (CLG). Community node can
communicate with other community nodes either
by community gate(CMG) or by global gate
(GLG).
26 7/2/2017
Community Based Routing Scheme

Communication between nodes

27 7/2/2017
Community Based Routing Scheme

Community Based Routing Algorithm

28 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

29 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

30 7/2/2017
Result and Simulation

Discrete Event Simulator

31 7/2/2017
Result and Simulation

Routing Table Comparison

32 7/2/2017
Result and Simulation

Stretch w.r.t to Community 1

33 7/2/2017
Result and Simulation

Stretch w.r.t to Community 1

34 7/2/2017
Result and Simulation

Stretch w.r.t to Community 2

35 7/2/2017
Result and Simulation

Average Stretch

36 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

37 7/2/2017
OUTLINE

Section I : Internet Architecture

Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

38 7/2/2017
Conclusion

Topology of internet is well organized

Routing table size of inter-domain nodes are
reduced to prominent amount
Routing scheme for inter-domain nodes are
simpler as compare to TZ scheme
Community Based (CB) routing scheme is a
promising scheme to cope scalability issues of
internet

39 7/2/2017
 Thank You

40 7/2/2017