Internet plays an increasingly significant role in our modern life style for our society, educational institution, engineering systems and industrial applications. It serves billions of users worldwide every day by carrying an extensive range of traffic from sources to desired destinations. Along with these advances, inter-domain routing nodes of internet are facing challenging issues like scalability. Path vector routing scheme is not sufficient to cope with this issues for building future internet. There are many different Advance Routing schemes available in the literature for solving the problem. Thorup Zwick routing scheme (TZ scheme) is one of the promising Compact Routing scheme, offering many benefits such as guaranteeing sub-linear state growth with the size of the network by introducing cluster nodes, landmark routing and incurring path stretch. However, the extra burden of routing table size in landmark nodes is an important issue which can generate scalability issues for landmark nodes. This paper tries to solve the scalability problem of internet by making modification in Thorup Zwick (TZ) scheme. we introduce a new concept named community in the topology of internet, re-define cluster nodes and replace landmark nodes with proposed community nodes in the network. The proposal organizes internet in an efficient way by defining new set of rules for inter-domain nodes and reduce routing table size in a prominent amount. The proposal provides an organized, simpler and effective routing scheme. A discrete event simulation study is used to verify the benefits of new scheme. Our simulation results show that the proposed scheme is capable to cope scalability issues of inter-domain nodes, handle generated traffic considering PLM systems and build an efficient future Internet.

1. Community Based Routing scheme for
future internet considering PLM systems
1
2016 IEEE 14th International Symposium on
Applied Machine Intelligence and Informatics
(SAMI)
Yatish Bathla, PhD candidate
Doctoral School of Applied Informatics and
Applied Mathematics, Óbuda University,
Budapest, Hungary
Email: yatish.bathla@phd.uni-obuda.hu

2. 3/11/20162
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. 3/11/20163
OUTLINE
Section I : Internet Architecture
Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

4. Network of Networks
Topology of
Autonomous System
Definition of Internet
4 3/11/2016

5. Autonomous System
collection of routers
running on routing
protocols
single administrative
domain
Definition of Internet
5 3/11/2016

6. Router
Routing Table
Routing Protocol
Routing Algorithm
Concept of Routing
6 3/11/2016

7. 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
Concept of Routing
7 3/11/2016

8. 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 3/11/2016

9. Path Vector Routing
Routing Policies and
Path attributes
Advertise Entire Path
Concept of Routing
9 3/11/2016

10. 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
Issues in Present Internet
10 3/11/2016

11. 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 3/11/2016

12. 3/11/201612
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. 3/11/201613
OUTLINE
Section I : Internet Architecture
Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

14. 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 3/11/2016

15. 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 3/11/2016

16. 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 3/11/2016

17. Landmark node:
knowledge of whole
topology
Cluster nodes:
knowledge of
neighborhood and
landmark nodes
Thorup and Zwick Routing Scheme
17 3/11/2016

18. Thorup and Zwick Routing Scheme
Landmark nodes faces issue of scalability
Cluster nodes routing algorithm is complex
Burden on cluster nodes
18 3/11/2016

19. 3/11/201619
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. 3/11/201620
OUTLINE
Section I : Internet Architecture
Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

21. Community:
collection of cluster
nodes
Community node:
representative of
community
Cluster node:
belongs to community
and act as source-
destination node
Community Based Routing Scheme
21 3/11/2016

22. Gate:
Local gate(LCG)
Community
gate(CMG)
Cluster gate(CLG)
Global gate(GLG)
Community Based Routing Scheme
22 3/11/2016

23. 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 3/11/2016

24. 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 3/11/2016

25. 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 3/11/2016

26. 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 3/11/2016

27. 3/11/201627
OUTLINE
Section I : Internet Architecture
Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

28. 3/11/201628
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. Discrete Event Simulator
Result and Simulation
29 3/11/2016

30. Routing Table Comparison
Result and Simulation
30 3/11/2016

31. Stretch w.r.t to Community 1
Result and Simulation
31 3/11/2016

32. Stretch w.r.t to Community 1
Result and Simulation
32 3/11/2016

33. Stretch w.r.t to Community 2
Result and Simulation
33 3/11/2016

34. Average Stretch
Result and Simulation
34 3/11/2016

35. 3/11/201635
OUTLINE
Section I : Internet Architecture
Section II : Advance Routing Schemes
Section III : Community Based Routing Scheme
Section IV : Result and Simulation
Section V : Conclusion

36. 3/11/201636
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. 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
37 3/11/2016

38. 38 3/11/2016
Thank You