This document provides an overview of key concepts in network layer delivery, forwarding, and routing. It discusses delivery and forwarding of packets, including direct vs indirect delivery and next-hop vs route forwarding methods. It also summarizes several unicast routing protocols, including distance vector protocols like RIP and link state protocols like OSPF. Finally, it discusses path vector routing and Border Gateway Protocol (BGP) for interdomain routing.
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.
Network layer - design Issues ,Store-and-Forward Packet Switching, Services Provided to the Transport Layer, Which service is the best , Implementation of Service , Implementation of Connectionless Service , Implementation of Connection-Oriented Service
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.
Network layer - design Issues ,Store-and-Forward Packet Switching, Services Provided to the Transport Layer, Which service is the best , Implementation of Service , Implementation of Connectionless Service , Implementation of Connection-Oriented Service
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.
IPv4 (Internet Protocol Version 4). This silde will give u all information about IPv4.
Hope so you like it Freinds.
and
Sorry if i can fulfill ur wish in the given IPv4 Presentation.
Spanning Tree Protocol (STP) is a network protocol designed to prevent layer 2 loops. It is standardized as IEEE 802.D protocol. STP blocks some ports on switches with redundant links to prevent broadcast storms and ensure loop-free topology. With STP in place, you can have redundant links between switches in order to provide redundancy.
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.
IPv4 (Internet Protocol Version 4). This silde will give u all information about IPv4.
Hope so you like it Freinds.
and
Sorry if i can fulfill ur wish in the given IPv4 Presentation.
Spanning Tree Protocol (STP) is a network protocol designed to prevent layer 2 loops. It is standardized as IEEE 802.D protocol. STP blocks some ports on switches with redundant links to prevent broadcast storms and ensure loop-free topology. With STP in place, you can have redundant links between switches in order to provide redundancy.
A beginners guide into routing, its elements and basic working principles. An introduction to most widely used Unicast routing protocols and their working principles.
What are the only force you have become too much of work and all I can be done by my name Vishnu namaste I have to do you have to do you have to do you have to do you have to.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
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.
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.
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
2. Delivery
• The network layer supervises the handling of the packets by the underlying
physical networks. We define this handling as the delivery of a packet.
Direct versus Indirect Delivery
3.
4.
5. Forwarding
• Forwarding means to place the packet in its route to its
destination.
• Forwarding requires a host or a router to have a routing table
6. Forwarding techniques to make the size of the
routing table manageable
•Next-hop method versus route method
•Network-specific method versus host-specific
method
•Default method
12. Forwarding Process
• In classless addressing, we need at least four columns in a routing table
13. Example
• Make a routing table for router R1, using the configuration in Figure
14. Example
• Routing table for router R1
• Forwarding process for the destination address 180.70.65.140 ?
• Forwarding process for the destination address 18.24.32.78 ?
15. Address Aggregation
• Classless addressing increases the number of routing table entries
• To alleviate the problem, the address aggregation is used
29. Distance Vector Routing: Initialization
• At the beginning, each node can know only the distance between itself and its
immediate neighbors
30. Distance Vector Routing: Sharing
• In distance vector routing, each node shares its routing table (with first two cols)
with its immediate neighbors periodically and when there is a change
31. Distance Vector Routing: Updating
• When a node receives a two-column table from a neighbor, it
need to update its routing table
• Updating rule:
– Choose the smaller cost. If the same, keep the old one
– If the next-node entry is the same, the receiving node chooses the new row
34. When to Share
• Periodic update: A node sends its routing table, normally
every 30 s
• Triggered update: Anode sends its two-column routing table to
its neighbors anytime there is a change in its routing table
42. LLiinnkk SSttaattee RRoouuttiinngg
• Each node has the entire topology of the domain- the list of nodes and links, how
they are connected including type, cost, and condition of the links(up or down)
• Node can use Dijkstra’s algorithm to build a routing table
43. LLiinnkk SSttaattee RRoouuttiinngg
• Each node has partial knowledge: it know the state (type, condition, and cost) of its links.
The whole topology can be compiled from the partial knowledge of each node
44. BBuuiillddiinngg RRoouuttiinngg TTaabbllee
1. Creation of the states of the links by each node, called the link state packet
(LSP)
2. Dissemination of LSPs to every other router, called flooding, in an
efficient and reliable way
3. Formation of a shortest path tree for each node
4. Calculation of a routing table based on the shortest path tree
• Creation of LSP
– LSP contains node identity, the list of links (to make the topology),
sequence number (to facilitate flooding and distinguish new LSPs
from old ones
– LSPs are generated (1) when there is a change in the topology of the
domain, (2) on a periodic basis, normally 60 min or 2 h
45. BBuuiillddiinngg RRoouuttiinngg TTaabbllee
• Flooding of LSPs
– The creating node sends a copy of the LSP out of each interface
– A node compares it with the copy it may already have. If the newly
arrived LSP is older than the one it has, it discards the LSP. If it is
newer,
1. It discards the old LSP and keeps the new one
2. It sends a copy of it out of each interface except the one from which
the packet arrived
• Formation of shortest path tree: Dijkstra Algorithm
– After receiving all LSPs, each node will have a copy of the whole
topology. Need to find the shortest path to every other node
– The Dijkstra algorithm creates a shortest path tree from a graph
50. Open Shortest Path First (OSPF)
• Popular intra domain routing protocol based on link state routing
• To handle routing efficiently and in a timely manner, OSPF divides an autonomous
system into area
• Area is a collection of network, hosts, and routers all contained within an AS
• AS can also be divided into many different areas
51.
52. Metric
• The OSPF allows the administrator to assign a cost, called the metric, to each route
• The metric can be based on a type of service (minimum delay, maximum
throughput, and so on)
Types of Links
53. Point-to-Point Link
• To connect two routers without any other host or router in between
Transient Link
• A network with several routers attached to it
55. Path Vector Routing
• Distance vector routing is subject to instability if there are
more than a few hops in the domain of operation
• Link state routing needs a huge amount of resources to
calculate routing tables. It also create heavy traffic because
of flooding
• Need for a third routing algorithm for interdomain routing,
called path vector routing
• Path vector routing is similar to distance vector routing
• But, only speaker node (one node that acts on behalf of
entire AS) creates a routing table and advertises it to speaker
nodes in each AS in its neighbour.
• A speaker node advertises the path, not the metric of nodes
57. Path Vector Routing: Sharing and Updating
Sharing: Like distance vector routing, a speaker shares its
table with immediate neighbors
Updating: When a speaker receives a two-column table from
a neighbor, it updates its own table
• Loop prevention
• Policy routing
• Optimum path
58.
59.
60.
61.
62. Border Gateway Protocol (BGP)
• Interdomain routing protocol using path vector routing
• Types of autonomous systems (ASs)
– Stub AS: only one connection to another AS. A stub AS is
either a sink or source.
– Multihomed AS: more than one connection to other ASs,
– Transit AS: A multihomed AS that also allows transient
traffic
63. Path attributes
1. Well-known attribute
Well-known mandatory attribute: that must appear in
the description of a router.
ORIGIN (source of the routing information)
AS_PATH (the list of ASs)
NEXT-HOP(the next router)
Well-known discretionary attribute that not required
in every update message.
2. Optional attribute :
64. BGP Sessions
• A session is a connection between BGP routers for the
exchange of router information
• To create a reliable environment, BGP uses the services of
TCP as semipermanent connections
• External and internal BGP
– E-BGP sessions: used to exchange information between
two speaker nodes belonging to two different ASs
– I-BGP sessions: used to exchange information between two
routers inside an AS