a result on novel approach for load balancing in cloud computing

4
International Journal of Trend Volume 3 Issue 5, August 2019 Analysis Routing Department of Info University o How to cite this paper: Khaing Khaing Wai "Analysis of RIP, EIGRP, and OSPF Routing Protocols an A Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456- 6470, Volume-3 | Issue-5, August 2019, pp.1910-1917, https://doi.org/10.31142/ijtsrd27928 Copyright © 2019 by author(s) and International Journal of Trend in Scientific Research and Development Journal. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by /4.0) OSPF (Open Shortest Path First) is the most IOSPF is based on the Shortest Path First (SP which is used to calculate the shortest path EIGRP Enhanced Interior Gateway Routing Cisco’s proprietary routing protocol based Update Algorithm [4]. A routing protocol is the language a router spea routers in order to share information about th and status of network. It includes a procedure best path based on the reachability information recording this information in a route table. select the best path, a routing metric will be ap computed by a routing algorithm [8]. A metric is a variable assigned to routers a ranking them from the best to worst or from m to least preferred [9]. Different routing pr different metrics. When there is more tha between two nodes, a router must determine metrics by choose the routing protocol to calc path. 2. CLASSIFYING ROUTING PROTOCOLS The classification of routing protocol is depic Where there is some dynamic routing protoco to configuring routing tables in the router. The Gateway Protocol (IGP) than should be used fo in same domain network such as Routing IJTSRD27928 d in Scientific Research and Develop 9 Available Online: www.ijtsrd.com e-ISSN: s of RIP, EIGRP, and OSPF g Protocols in a Network Khaing Khaing Wai ormation Technology Support and Maintenance, of Computer Studies, Mandalay, Myanmar ABSTRACT There are many routing protocols out there today, so but all are used for the same purpose. In general, to between any two nodes on a computer network and dis Routing of data packets is one of the important pro routing protocol specifies the method of communicatio in the inter connection of networks. This paper takes in of such routing protocols (RIP, OSPF, and EIGRP), expre their way of operation. In this paper, we have anal proposed Local Area Network using different r configuration of these different routing protocols are d tracer simulator. KEYWORDS: RIP, EIGRP, OSPF, Cisco Packet Tracer 1. INTRODUCTION There are many routing protocols out there today, som all are used for the same purpose. In general, to ideally s two nodes on a computer network and disseminate inf Each routing protocols have their own algorithm performance basically. Three typical types of routing pr simulation samples: RIP, OSPF and EIGRP. RIP (Routing one of the oldest routing protocols still in service. Hop RIP uses, and the hop limit limits the network size that t widely used PF) algorithm to each node. g Protocol) is on Diffusing aks with other he reachability e to select the n it has and for Regarding to pplied and it is as a means of most preferred rotocols have an one route e a method of culate the best cted in below. ol can be used ere is Interior or the routers g Information Protocol (RIP), Enhanced Interior G (EIGRP), Open Shortest Path F (Intermediate System – Intermedia routers in different domain netw Protocol (EGP) can be used such as B (BGP). For the router in the same do two types of dynamic routing proto computer networks, namely distan routing protocols. Figure1. Routing Protoco pment (IJTSRD) : 2456 – 6470 ome old and some new, o ideally select routes sseminate information. ocess in the internet. A on among routers used nto consideration three esses them and analyzes lyzed and simulated a routing protocols. So, done using CISCO packet me old and some new, but select routes between any formation. and have difference in rotocol are chosen as the g Information Protocol) is p count is the metric that t RIP can support. Gateway Routing Protocol First (OSPF) and ISIS ate System). And for the work, Exterior Gateway Border Gateway Protocol omain network, there are ocols that can be used on nce vector and link-state ol Classification

Upload: ijtsrd

Post on 19-Sep-2019

0 views

Category:

Education


0 download

DESCRIPTION

Cloud computing is a large pool of system in which private or public networks are interconnected in order to provide the scalable infrastructure to application, data and file storage. It is considered as the computer archetype in which large amount of information is stored. It helps in the significant reduction of the cost of computation, application hosting, content storage and delivery. In order to experience direct cost benefits, cloud computing is considered as a practical approach and it can possibly transform a data center from a capital intensive set up to a variable priced environment. It provides the feasibility to its customers that they can access their information from anywhere they want. Therefore, cloud overcomes the limitation of the location constraint. As compared to traditional concepts, cloud computing coveys the concept of the grid computing, distributed computing, utility computing or autonomic computing. When any virtual machine gets overloaded, fault may occur in the cloud environment. With the help of BFO algorithm, technique of adaptive task scheduling is proposed. Using this method, it becomes easy to transfer the task to the most reliable virtual machine. On the basis of calculated weight at virtual machine, the reliability of the virtual machine is calculated. The proposed and existing algorithms have been implemented in CloudSim. On the basis of the simulation results, it is concluded that the proposed method shows the reduction in the execution time as compared to existing technique. Sukhdeep Kaur | Preeti Sondhi "A Result on Novel Approach for Load Balancing in Cloud Computing" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26362.pdfPaper URL: https://www.ijtsrd.com/engineering/computer-engineering/26362/a-result-on-novel-approach-for-load-balancing-in-cloud-computing/sukhdeep-kaur

TRANSCRIPT

Page 1: A Result on Novel Approach for Load Balancing in Cloud Computing

International Journal of Trend in Scientific Research and Development (IJTSRD)Volume 3 Issue 5, August 2019

Analysis

Routing

Department of Information Technology Support

University o

How to cite this paper: Khaing Khaing

Wai "Analysis of RIP, EIGRP, and OSPF

Routing Protocols an A Network"

Published in

International

Journal of Trend in

Scientific Research

and Development

(ijtsrd), ISSN: 2456-

6470, Volume-3 |

Issue-5, August

2019, pp.1910-1917,

https://doi.org/10.31142/ijtsrd27928

Copyright © 2019 by author(s) and

International Journal of Trend in Scientific

Research and Development Journal. This

is an Open Access article distributed

under the terms of

the Creative

Commons Attribution

License (CC BY 4.0)

(http://creativecommons.org/licenses/by

/4.0)

OSPF (Open Shortest Path First) is the most widely used

IOSPF is based on the Shortest Path First (SPF) algorithm

which is used to calculate the shortest path to each node.

EIGRP Enhanced Interior Gateway Routing Prot

Cisco’s proprietary routing protocol based on Diffusing

Update Algorithm [4].

A routing protocol is the language a router speaks with other

routers in order to share information about the reachability

and status of network. It includes a procedure to select the

best path based on the reachability information it has and for

recording this information in a route table. Regarding to

select the best path, a routing metric will be applied and it is

computed by a routing algorithm [8].

A metric is a variable assigned to routers as a means of

ranking them from the best to worst or from most preferred

to least preferred [9]. Different routing protocols have

different metrics. When there is more than one route

between two nodes, a router must determine a method of

metrics by choose the routing protocol to calculate the best

path.

2. CLASSIFYING ROUTING PROTOCOLS

The classification of routing protocol is depicted in below.

Where there is some dynamic routing protocol can be used

to configuring routing tables in the router. There is Interior

Gateway Protocol (IGP) than should be used for the routers

in same domain network such as Routing Information

IJTSRD27928

International Journal of Trend in Scientific Research and Development (IJTSRD)Volume 3 Issue 5, August 2019 Available Online: www.ijtsrd.com e-ISSN: 2456

Analysis of RIP, EIGRP, and OSPF

Routing Protocols in a Network

Khaing Khaing Wai

f Information Technology Support and Maintenance,

of Computer Studies, Mandalay, Myanmar

ABSTRACT

There are many routing protocols out there today, some old and some new,

but all are used for the same purpose. In general, to ideally select routes

between any two nodes on a computer network and disseminate information.

Routing of data packets is one of the important process in the internet. A

routing protocol specifies the method of communication among routers used

in the inter connection of networks. This paper takes into consideration three

of such routing protocols (RIP, OSPF, and EIGRP), expresses them and analyzes

their way of operation. In this paper, we have analyzed and simulated a

proposed Local Area Network using different routing protocols. So,

configuration of these different routing protocols are done using CISCO packet

tracer simulator.

KEYWORDS: RIP, EIGRP, OSPF, Cisco Packet Tracer

1. INTRODUCTION

There are many routing protocols out there today, some old and some new, but

all are used for the same purpose. In general, to ideally select routes between any

two nodes on a computer network and disseminate information.

Each routing protocols have their own algorithm and have difference in

performance basically. Three typical types of routing protocol are

simulation samples: RIP, OSPF and EIGRP. RIP (Routing Information Protocol) is

one of the oldest routing protocols still in service. Hop count is the metric that

RIP uses, and the hop limit limits the network size that RIP can support.

OSPF (Open Shortest Path First) is the most widely used

IOSPF is based on the Shortest Path First (SPF) algorithm

which is used to calculate the shortest path to each node.

EIGRP Enhanced Interior Gateway Routing Protocol) is

Cisco’s proprietary routing protocol based on Diffusing

A routing protocol is the language a router speaks with other

routers in order to share information about the reachability

and status of network. It includes a procedure to select the

best path based on the reachability information it has and for

recording this information in a route table. Regarding to

select the best path, a routing metric will be applied and it is

A metric is a variable assigned to routers as a means of

ranking them from the best to worst or from most preferred

Different routing protocols have

different metrics. When there is more than one route

between two nodes, a router must determine a method of

metrics by choose the routing protocol to calculate the best

The classification of routing protocol is depicted in below.

Where there is some dynamic routing protocol can be used

to configuring routing tables in the router. There is Interior

Gateway Protocol (IGP) than should be used for the routers

etwork such as Routing Information

Protocol (RIP), Enhanced Interior Gateway Routing Protocol

(EIGRP), Open Shortest Path First (OSPF) and ISIS

(Intermediate System – Intermediate System). And for the

routers in different domain network, Exterior Gateway

Protocol (EGP) can be used such as Border Gateway Protocol

(BGP). For the router in the same domain network, there are

two types of dynamic routing protocols that can be used on

computer networks, namely distance vector and link

routing protocols.

Figure1. Routing Protocol Classification

International Journal of Trend in Scientific Research and Development (IJTSRD)

ISSN: 2456 – 6470

There are many routing protocols out there today, some old and some new,

but all are used for the same purpose. In general, to ideally select routes

des on a computer network and disseminate information.

Routing of data packets is one of the important process in the internet. A

routing protocol specifies the method of communication among routers used

s into consideration three

of such routing protocols (RIP, OSPF, and EIGRP), expresses them and analyzes

their way of operation. In this paper, we have analyzed and simulated a

proposed Local Area Network using different routing protocols. So,

n of these different routing protocols are done using CISCO packet

There are many routing protocols out there today, some old and some new, but

purpose. In general, to ideally select routes between any

two nodes on a computer network and disseminate information.

Each routing protocols have their own algorithm and have difference in

performance basically. Three typical types of routing protocol are chosen as the

RIP (Routing Information Protocol) is

one of the oldest routing protocols still in service. Hop count is the metric that

RIP uses, and the hop limit limits the network size that RIP can support.

Protocol (RIP), Enhanced Interior Gateway Routing Protocol

(EIGRP), Open Shortest Path First (OSPF) and ISIS

Intermediate System). And for the

routers in different domain network, Exterior Gateway

rotocol (EGP) can be used such as Border Gateway Protocol

(BGP). For the router in the same domain network, there are

two types of dynamic routing protocols that can be used on

computer networks, namely distance vector and link-state

1. Routing Protocol Classification

Page 2: A Result on Novel Approach for Load Balancing in Cloud Computing

International Journal of Trend in Scientific Research and Development (IJTSRD)

2.1. Distance Vector Routing Protocols

Distance vector means that routes are advertised by

providing two characteristics: Distance - Identifies how far it

is to the destination network based on a metric such as hop

count, cost, bandwidth, delay.

Vector - Specifies the direction of the next-hop router or exit

interface to reach the destination.

Example. RIPv1 (legacy), RIPv2, IGRP Cisco proprietary

(obsolete), EIGRP

2.1.1. Routing Information Protocol (RIP)

The RIP is a distance-vector routing protocol that is based on

the Bellman-Ford algorithm and uses hops as a routing

metric. It is easy to configure. Routing updates broadcasted

255.255.255.255 every 30 seconds. Metric is hop count, the

maximum number of hops allowed are 15, which limits the

size of networks RIP can support.

RIV2 is the classless routing protocol that supports VLSM

and CIDR. Increased efficiency sends updates to multicast

address 224.0.0.9. Reduced routing entries supports manual

route summarization and secure supports authentication.

RIPng supports IPv6 enabled version of RIP and 15 hop limit

and administrative distance is 120.

2.1.2. Enhanced Interior-Gateway Routing Protocol

(EIGRP)

EIGRP replaced IGRP in 1992. It includes the following

features:

Bounded triggered updates – sends updates only to routers

that need it. Hello keepalive mechanism - Hello messages are

periodically exchanged to maintain adjacencies. Maintains a

topology table - maintains all the routes received from

neighbors (not only the best paths) in a topology table. Rapid

3. COMPARATIVE STUDY OF RIP, OSPF & EIGRP

Feature RIP- V1 RIP-

Type Distance

Vector

Distance

Vector

Algorithm Bellman-

ford

Bellman

ford

Class full/

Classless Class full Class less

Metric Hop Count Hop Count

Timers Update

(Hello/Dead) 30 sec 30 sec

Administrative

Distance 120 120

International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com

Distance vector means that routes are advertised by

Identifies how far it

is to the destination network based on a metric such as hop

hop router or exit

Example. RIPv1 (legacy), RIPv2, IGRP Cisco proprietary

Routing Information Protocol (RIP)

vector routing protocol that is based on

Ford algorithm and uses hops as a routing

metric. It is easy to configure. Routing updates broadcasted

ds. Metric is hop count, the

maximum number of hops allowed are 15, which limits the

RIV2 is the classless routing protocol that supports VLSM

and CIDR. Increased efficiency sends updates to multicast

educed routing entries supports manual

route summarization and secure supports authentication.

RIPng supports IPv6 enabled version of RIP and 15 hop limit

Gateway Routing Protocol

replaced IGRP in 1992. It includes the following

sends updates only to routers

Hello messages are

periodically exchanged to maintain adjacencies. Maintains a

aintains all the routes received from

neighbors (not only the best paths) in a topology table. Rapid

convergence – because it maintains alternate routes.

Multiple network layer protocol support

Dependent Modules (PDM) to support layer 3 pr

2.2. Link-State Routing Protocols

A link-State router uses the link-state information received

from other routers: to create a topology map and to select

the best path to all destination networks in the topology.

Link-state routing protocols do not u

Updates are only sent when there is a change in the topology.

Both of the following Interior Gateway Algorithms (OSPF and

IS-IS) are based on the Dijkstra algorithm.

2.2.1. Shortest Path First Protocols (OSPF)

Link-state routing protocols, also known as shortest path

first protocols, are built around Edsger Dijkstra's shortest

path first (SPF) algorithm. IPv4 Link

A. Open Shortest Path First (OSPF)

B. Intermediate System-to-Intermediate System (IS

Dijkstra's Algorithm, all link-state routing protocols

apply

Dijkstra’s algorithm (also known as shortest path first

(SPF)) to calculate the best path route:

A. Uses accumulated costs along each path, from source to

destination.

B. Each router determines its own cost to each

in the topology.

2.3. Routing Protocol Metrics

A metric is a measurable value that is assigned by the

routing protocol to different routes based on the usefulness

of that route. Routing metrics are used to determine the

overall “cost” of a path from source to destination. Best path

is route with the lowest cost. Metrics used by various

dynamic protocols:

� RIP – Hop count

� OSPF – Cost based on cumulative bandwidth

� EIGRP - Bandwidth, delay, load, and reliability.

2.4. Routing Protocol Characteristics

COMPARATIVE STUDY OF RIP, OSPF & EIGRP

Protocols Comparison

- V2 OSPF

Distance

Vector Link State

Bellman-

ford Dijkstra

Class less Classless Classless

Hop Count Cost Bandwidth/ Delay

30 sec

Triggered when network charge

occurs, send periodic update LSA

refreshes every 30 minutes

Triggered

(LAN3/15,WAN 60/180)

120 110 Internal 90 External 170

www.ijtsrd.com eISSN: 2456-6470

because it maintains alternate routes.

Multiple network layer protocol support – uses Protocol

Dependent Modules (PDM) to support layer 3 protocols.

State Routing Protocols

state information received

from other routers: to create a topology map and to select

the best path to all destination networks in the topology.

state routing protocols do not use periodic updates.

Updates are only sent when there is a change in the topology.

Both of the following Interior Gateway Algorithms (OSPF and

IS) are based on the Dijkstra algorithm.

Shortest Path First Protocols (OSPF)

lso known as shortest path

first protocols, are built around Edsger Dijkstra's shortest

path first (SPF) algorithm. IPv4 Link-State routing protocols:

Open Shortest Path First (OSPF)

Intermediate System (IS-IS)

state routing protocols

Dijkstra’s algorithm (also known as shortest path first

(SPF)) to calculate the best path route:

Uses accumulated costs along each path, from source to

Each router determines its own cost to each destination

A metric is a measurable value that is assigned by the

routing protocol to different routes based on the usefulness

of that route. Routing metrics are used to determine the

m source to destination. Best path

is route with the lowest cost. Metrics used by various

Cost based on cumulative bandwidth

Bandwidth, delay, load, and reliability.

Routing Protocol Characteristics

EIGRP

Hybrid

DUAL

Classless

Bandwidth/ Delay

Triggered

(LAN3/15,WAN 60/180)

Internal 90 External 170

Page 3: A Result on Novel Approach for Load Balancing in Cloud Computing

International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470

Authentication No Yes MD5 Authentication MD5 Authentication

Hop Limit 15 15 224 None

Convergence Slow Slow Fast Very Fast

Type of Updates Full table Full table Only Changes Only Changes

Support VLSM No Yes Yes Yes

Network Size Small Small Large Large

Split Horizon

Sensitive No No - Yes Yes

Area Types - - Backbone, stubby, Not so-stubby,

totally stubbing -

Table1. Comparison of RIP, EIGRP, OSPF

4. CONFIGURATION USING CISCO PACKET TRACER

Cisco Packet Tracer is a multitasking network simulation

software that can be used to perform and analyze various

network activities such as implementation of different

topologies, selection of optimum path based on various

routing algorithms, creation of appropriate servers,

subnetting, and analysis of various network configuration

and troubleshooting commands. Cisco Packet Tracer is a

powerful network simulation that allows educates to

experiment with network behavior and ask “what if” queries.

In this work we have configured the network using various

dynamic configuration protocols such as RIPv2, EIGRP and

OSPF.

Figure1. Topology using Different Networking Devices

4.1. Configuration on Router Branch 1 Using RIPv2

Protocol

router rip

version 2

network 172.16.1.0

network 172.16.2.0

network 172.16.5.0

network 172.16.6.0

no auto-summary

4.2. Configuration on Router Branch 2 Using RIPv2

Protocol

router rip

version 2

network 172.16.3.0

network 172.16.4.0

network 172.16.5.0

network 172.16.7.0

no auto-summary

4.3. Configuration on Branch 1 Using EIGRP Protocol

router eigrp 1

network 172.16.1.0

network 172.16.2.0

network 172.16.5.0

network 172.16.6.0

4.4. Configuration on Branch 2 Using EIGRP Protocol

router eigrp 1

network 172.16.3.0

network 172.16.4.0

network 172.16.5.0

network 172.16.7.0

4.5. Configuration on Branch 1 Using OSPF Protocol

router ospf 10

router-id 1.1.1.1

network 172.16.1.0 0.0.0.255 area 0

network 172.16.2.0 0.0.0.255 area 0

network 172.16.5.0 0.0.0.3 area 0

network 172.16.6.0 0.0.0.3 area 0

passive-interface GigabitEthernet0/0

4.6. Configuration on Branch 2 Using OSPF Protocol

router ospf 10

router-id 2.2.2.2

network 172.16.3.0 0.0.0.255 area 0

network 172.16.4.0 0.0.0.255 area 0

network 172.16.5.0 0.0.0.3 area 0

network 172.16.7.0 0.0.0.3 area 0

passive-interface GigabitEthernet0/0

4.7. Configuration on Branch 3 Using OSPF Protocol

router ospf 10

router-id 3.3.3.3

network 172.16.6.0 0.0.0.3 area 0

network 172.16.7.0 0.0.0.3 area 0

network 172.16.8.0 0.0.0.255area 0

passive-interface GigabitEthernet0/0

4.8. Summary of Comparison

Routing plays an important role to determine the efficiency

of network communication. The routing protocols operate

the following steps:

� To receive and send information about the network.

� To find the best path to a destination and install the

route in the routing table.

� To detect, react and inform to other devices about

Page 4: A Result on Novel Approach for Load Balancing in Cloud Computing

International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470

@ IJTSRD | Unique Paper ID – IJTSRD27928 | Volume – 3 | Issue – 5 | July - August 2019 Page 2487

CONCLUSION

In this work the network is demonstrated using the

simulator Cisco packet Tracer, with various routing

protocols. Routing protocols have a big role in network

communication. Different protocols have different criteria

and performance as we can see from the above comparison.

RIPv2 protocol is suitable for small network and EIGRP is

best for fast convergence, although it is a Cisco proprietary

protocol. And OSPF is suitable for a very large network

which does not have a maximum hop limit. After comparison

we find that the best protocol is EIGRP because it provides

better performance than RIPv2 and OSPF, in terms of fast

convergence time. While comparing OSPF and RIP, OSPF

dominates RIP in terms of average throughput and instant

delay in different size of network. For the routing traffic the

OSPF was the one with the most traffic sent and was the last

one to send routing traffic on the other hand EIGRP was the

first one to send traffic but RIP protocol had the least traffic

as it sends only the number of hops.

REFERENCES

[1] P. Kalamani, M. Venkatesh Kumar, M.

Chithambarathanu, Reji Thomas, Comparison of RIP,

EIGRP, OSPF, IGRP Routing Protocols in Wireless Local

Area Network (WLAN) by using OPNET Simulator tool

- A Practical Approach -IOSR-JCE, e-ISSN: 2278-0661,p-

ISSN: 2278-8727, Volume 16, Issue 4, Ver. VI (Jul- Aug.

2014)

[2] Circiumarescu, L. D.; Predusca, G. ; Angelescu, N. ;

Puchianu, D.,” Comparative evaluation of Protocol RIP,

OSPF, EIGRP and IGRP for carrier Video Conferencing,

e-mail, FTP, HTTP”, Control systems and PC technology

(CSCS), 2015 20th worldwide convention on, pp. 584 –

589, 2015.

[3] Archana C” evaluation of RIPv2, OSPF, EIGRP

Configuration on router the usage of CISCO Packet

tracer”, International journal of Engineering science

and innovative technology (IJESIT) volume 4, issue 2,

pp.215-222, March 2015.

[4] www.cisco.com

[5] ShewayeSirika, SmitaMahajine, “Performance

Evaluation of Dynamic Routing Protocols for Real time

application”, International Journal of Engineering

Trends and Technology (IJETT) – Volume 32 Number

7- February 2016.

[6] N. Nazumudeen et C. Mahendran, “Performance

Analysis of Dynamic Routing Protocols Using Packet

Tracer”, International Journal of Innovative Research in

Science, Engineering and Technology, Volume3, Special

Issue 1, 2014.

[7] Amrah Baba Ali, et Mujahid Tabassum, “A Comparative

Study of IGP and EGP Routing Protocols , Performance

Evaluation along Load Balancing and Redundancy

across Different AS”, Proceedings of the International

Multi Conference of Engineers and Computer Scientists

2016 Vol II, Hong Kong, mars-2016.

[8] Nisha Pandey et Dr. Dinesh Kumar, “Simulation Based

Comparative Study on EIGRP/ IS-IS and OSPF/ IS-IS”,

International Journal of Engineering Research and

General Science Volume 3, Issue 2, Part 2, India, avr-

2015.

[9] Archana C, “Analysis of RIPv2, OSPF, EI GRP

Configuration on router Using CISCO Packet tracer”,

International Journal of Engineering Science and

Innovative Technology (IJESIT) Volume 4, Issue 2,

India, mars-2015.

[10] Amrah Baba Ali, et Mujahid Tabassum, “A Comparative

Study of IGP and EGP Routing Protocols , Performance

Evaluation along Load Balancing and Redundancy

across Different AS”, Proceedings of the International

Multi Conference of Engineers and Computer Scientists

2016 Vol II, Hong Kong, mars-2016.