This document provides an overview of different routing protocols. It discusses IP routing, static routing, and dynamic routing. It also covers proactive routing protocols like DSDV which maintain routing tables and periodically update them. Reactive protocols like DSR and AODV establish routes on demand. Hybrid protocols combine proactive and reactive approaches. The document describes the key processes, advantages, and disadvantages of DSDV, DSR, AODV, and zone routing protocol.
Routing is the process of selecting a path for traffic in a network or between or across multiple networks. this slide helps to describe routing protocols and their various aspects.
Routing is the process of selecting a path for traffic in a network or between or across multiple networks. this slide helps to describe routing protocols and their various aspects.
This tutorial gives very good understanding on CCNA Dynamic Routing Protocols.After completing this tutorial,You will find yourself at a moderate level of expertise in knowing Advance Networking(CCNA)
In multicast communication, there is one source and a group of destination.
In multicasting, the router may forward the received packet through several of its interfaces.
The source address is a unicast address, but destination address is a group address.
The network layer is responsible for routing packets from the source to destination. The routing algorithm is the piece of software that decides where a packet goes next (e.g., which output line, or which node on a broadcast channel).For connectionless networks, the routing decision is made for each datagram. For connection-oriented networks, the decision is made once, at circuit setup time.
Routing Issues
The routing algorithm must deal with the following issues:
Correctness and simplicity: networks are never taken down; individual parts (e.g., links, routers) may fail, but the whole network should not.
Stability: if a link or router fails, how much time elapses before the remaining routers recognize the topology change? (Some never do..)
Fairness and optimality: an inherently intractable problem. Definition of optimality usually doesn't consider fairness. Do we want to maximize channel usage? Minimize average delay?
When we look at routing in detail, we'll consider both adaptive--those that take current traffic and topology into consideration--and nonadaptive algorithms.
Routing is the operation of transferring information transversely through an internetwork from a source to a destination. Alongside the approach, as a minimum one middle node normally is found. Routing is frequently compared with bridging, Copy the link given below and paste it in new browser window to get more information on Network Routing:- http://www.transtutors.com/homework-help/computer-science/network-routing.aspx
This tutorial gives very good understanding on CCNA Dynamic Routing Protocols.After completing this tutorial,You will find yourself at a moderate level of expertise in knowing Advance Networking(CCNA)
In multicast communication, there is one source and a group of destination.
In multicasting, the router may forward the received packet through several of its interfaces.
The source address is a unicast address, but destination address is a group address.
The network layer is responsible for routing packets from the source to destination. The routing algorithm is the piece of software that decides where a packet goes next (e.g., which output line, or which node on a broadcast channel).For connectionless networks, the routing decision is made for each datagram. For connection-oriented networks, the decision is made once, at circuit setup time.
Routing Issues
The routing algorithm must deal with the following issues:
Correctness and simplicity: networks are never taken down; individual parts (e.g., links, routers) may fail, but the whole network should not.
Stability: if a link or router fails, how much time elapses before the remaining routers recognize the topology change? (Some never do..)
Fairness and optimality: an inherently intractable problem. Definition of optimality usually doesn't consider fairness. Do we want to maximize channel usage? Minimize average delay?
When we look at routing in detail, we'll consider both adaptive--those that take current traffic and topology into consideration--and nonadaptive algorithms.
Routing is the operation of transferring information transversely through an internetwork from a source to a destination. Alongside the approach, as a minimum one middle node normally is found. Routing is frequently compared with bridging, Copy the link given below and paste it in new browser window to get more information on Network Routing:- http://www.transtutors.com/homework-help/computer-science/network-routing.aspx
Survey of Modified Routing Protocols for Mobile Ad-hoc Networkijsrd.com
In last few years extensive research work has been done in the field of routing protocols for Ad-hoc Network. Various routing protocols have been evaluated in different network conditions using different performance metrics. A lot of research has been done how to modify standard routing protocol in ad-hoc network to improve its performance. The hop count is not only metric that gives efficient routing path. There are various modified protocols which make the use of other parameters along with hop count to select the best routing path to the destination. In standard Ad-hoc On-demand Distance Vector (AODV) routing protocol only hop count is used for selecting the routing path. In this paper we have studied variants of AODV protocols with modified routing metric.
Performance Comparison of AODV and DSDV Routing Protocols for Ad-hoc Wireless...Narendra Singh Yadav
An ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple “hops” may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. This paper presents performance comparison of the three routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and pause time. Simulation revealed that although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.
The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Issues in designing a routing and Transport Layer protocol for Ad hoc networks- proactive
routing, reactive routing (on-demand), hybrid routing- Classification of Transport Layer
solutions-TCP over Ad hoc wireless Networks
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
5. ROUTING TABLE
In computer networking a routing table is
a data table stored in a router that lists the
routes to particular network destinations,
metrics (distances) associated with those
routes.
7. STATIC ROUTING
In static routing the routes are described by
fixed paths through a data network.
The hosts which are present in the same router
are entered are entered by system
administrator.
No routing algorithm or update mechanisms are
required.
8. DYNAMIC ROUTING
Dynamic Routing is used whenever the topology
changes frequently.
No Need to enter the Address belongs to the
network manually.
Here Routing Algorithms are used to calculate
the Route to destination.
9. PROACTIVE ROUTING PROTOCOLS
In this protocol all the nodes maintain the
information about the next node.
All the mobile nodes of this protocol have to
relay its entries to its adjacent nodes.
10. PROACTIVE ROUTING PROTOCOLS
Whenever any changes occurs in the topology, it
generates large number of control messages.
So the control messages consumes more
amount of Bandwidth.
11. REACTIVE ROUTING PROTOCOLS
Reactive protocols seek to set up routes on-
demand.
If a node wants to initiate communication with a
node to which it has no route, the routing protocol
will try to establish such a route by using Flooding
technique.
It reduces the large overhead information of
messages.
12. HYBRID ROUTING PROTOCOLS
It is a combination of Proactive and Reactive
Routing protocols.
It is used to increase the scalability of nodes in a
network.
13. DIFFERENCES BETWEEN PROACTIVE
AND REACTIVE
1) The delivery of packets is more efficient in
Reactive protocol than Proactive.
2) The performance is better in Reactive
protocol (Since it generates less control
messages).
3) Reactive consumes less Bandwidth.
4) The routing tables are updated only when
there is any changes in topology.
15. DSDV
Stands for Destination Sequenced Distance
Vector Routing Protocol.
It is a Table Driven Routing Protocol which
extends the Bellman Ford.
In DSDV, each nodes maintain a Routing Table
where the Destination and number of hops to
reach destination are recorded.
16. DSDV
Each node which are participating in the
topology knows the list of nodes, links and the
cost of each nodes.
The routing information are updated
periodically. Periodic updates are sent out after
every interval of 15s
18. STEPS IN DSDV
1) Each Router in the network collects the
Information of all the neighboring Routers.
2) After gathering Information, the node
determines the shortest path to reach all the
destinations.
3) Based on it new Routing table is created and
the table is known to all the neighbors.
19. PROS OF DSDV
1) Since the paths to all destinations are known
less delay is required in the path set up
process.
20. CONS OF DSDV
1) DSDV requires a regular update of its routing
tables, which uses up battery power and a small
amount of bandwidth.
2) DSDV is not suitable for highly dynamic or
large scale networks.
21. DSR
Stands for Dynamic Source Routing.
The sender of a packet determines the complete
sequence of nodes and records the exact path in
packet header.
In this protocol, the nodes do not need to exchange
the Routing table periodically, instead the Routing
table is updated when there is any change in
topology.
22. DSR
Since the Routing table is updated when there is
any change in topology the control messages is
reduced which conserve the Bandwidth.
Routing cache is updated when there is a change
in topology.
23. PHASES OF DSR
1) ROUTE DISCOVERY
When a node has to send a packet it first
checks the routing cache, if it finds a valid route in
the routing cache it delivers the packet to the
destination.
Otherwise it broadcasts Route Request
packet to all its neighbors. Upon the receipt of
Route Request packet it initiate the Route Reply
that knows the route to destination.
30. PHASES OF DSR
2) ROUTE MAINTENANCE
It is the process of monitoring the route in
use and taking corrective action when needed.
When a node finds to be broken because of
the shutdown, the nodes should not exchange any
information
31. PHASES OF DSR
When a node is broken it should send a Route Error
packet, which indicates the next hop is not
available.
As soon as a node receives a Route Error packet the
corresponding packet must be removed from the
cache.
It tries to rediscover a new route to reach the
destination.
32. CONS OF DSR
In DSR Routing along with the data the entire
path is sent over the network.
As the network size increases, the length of the
path increases which consumes more
bandwidth.
33. AODV
Stands for Adhoc On Demand Distance Vector
Protocol.
It is a Reactive Routing protocol (i.e.) The routes are
created only when it is needed (On Demand).
AODV protocol makes use of HOP count, sequence
number to route the packets from source to
destination.
34. ROUTE REQUEST
Route Discovery mechanism is based on RREQ
(Route Request) and RREP (Route Reply).
The Source node that needs a route to the
destination issues a Route Request. The Route
Request consists of following fields
35. ROUTE REPLY
The Route Reply is used to forward the packet
from where the packet gets requested.
41. ZONE ROUTING PROTOCOL
It is a Hybrid Routing Protocol.
Within a zone Table Driven (Pro Active Routing
Protocol) is used. This implies regular updates
takes place only within the zone.
If a node is outside the zone Reactive Routing
protocol is used.