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
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
THIS DESCRIBES VARIOUS ELEMENTS OF TRANSPORT PROTOCOL IN TRANSPORT LAYER OF COMPUTER NETWORKS
THERE ARE SIX ELEMENTS OF TRANSPORT PROTOCOL NAMELY
1. ADDRESSING
2. CONNECTION ESTABLISHMENT
3.CONNECTION REFUSE
4.FLOW CONTROL AND BUFFERS
5.MULTIPLEXING
6.CRASH RECOVERY
Hello People.. Welcome to GURUKULA!!!
Have you ever thought that how the protocols that are required for the effective delivery of the messages from one place to anpther place take place in a real time internet..... This video explains about the concept called PROTOCOL LAYERING, where you can learn the way how the protocols are layered in such a way..
Simple examples are also used to make the concepts clean nd clear.
This video will help you to learn:
What is protocol layering in networks, OSI Model in Computer Networks, Layers of OSI Model, OSI Model, OSI Internet Module, OSI Layers and their Functions, Examples of OSI Models, 7 layers of OSI Models, Principles of Protocol Layering, Why layering the Protocols,
Thanks for Watching, Keep Supporting and Keep Sharing...
Artificial Intelligence: Introduction, Typical Applications. State Space Search: Depth Bounded
DFS, Depth First Iterative Deepening. Heuristic Search: Heuristic Functions, Best First Search,
Hill Climbing, Variable Neighborhood Descent, Beam Search, Tabu Search. Optimal Search: A
*
algorithm, Iterative Deepening A*
, Recursive Best First Search, Pruning the CLOSED and OPEN
Lists
The data link layer, or layer 2, is the second layer of the seven-layer OSI model of computer networking. This layer is the protocol layer that transfers data between adjacent network nodes in a wide area network (WAN) or between nodes on the same local area network (LAN) segment.
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.
INTRODUCTION
WHAT IS OSI?
OSI MODEL
TYPES OF LAYERS
PHYSICAL LAYER
DATA LINK LAYER
NETWORK LAYER
TRANSPORT LAYER
SESSION LAYER
PRESENTATION LAYER
APPLICATION LAYER
A state occurring in network layer when the message traffic is so heavy that it slows down network response time.
Effects of Congestion
As delay increases, performance decreases.
If delay increases, retransmission occurs, making situation worse.
THIS DESCRIBES VARIOUS ELEMENTS OF TRANSPORT PROTOCOL IN TRANSPORT LAYER OF COMPUTER NETWORKS
THERE ARE SIX ELEMENTS OF TRANSPORT PROTOCOL NAMELY
1. ADDRESSING
2. CONNECTION ESTABLISHMENT
3.CONNECTION REFUSE
4.FLOW CONTROL AND BUFFERS
5.MULTIPLEXING
6.CRASH RECOVERY
Hello People.. Welcome to GURUKULA!!!
Have you ever thought that how the protocols that are required for the effective delivery of the messages from one place to anpther place take place in a real time internet..... This video explains about the concept called PROTOCOL LAYERING, where you can learn the way how the protocols are layered in such a way..
Simple examples are also used to make the concepts clean nd clear.
This video will help you to learn:
What is protocol layering in networks, OSI Model in Computer Networks, Layers of OSI Model, OSI Model, OSI Internet Module, OSI Layers and their Functions, Examples of OSI Models, 7 layers of OSI Models, Principles of Protocol Layering, Why layering the Protocols,
Thanks for Watching, Keep Supporting and Keep Sharing...
Artificial Intelligence: Introduction, Typical Applications. State Space Search: Depth Bounded
DFS, Depth First Iterative Deepening. Heuristic Search: Heuristic Functions, Best First Search,
Hill Climbing, Variable Neighborhood Descent, Beam Search, Tabu Search. Optimal Search: A
*
algorithm, Iterative Deepening A*
, Recursive Best First Search, Pruning the CLOSED and OPEN
Lists
The data link layer, or layer 2, is the second layer of the seven-layer OSI model of computer networking. This layer is the protocol layer that transfers data between adjacent network nodes in a wide area network (WAN) or between nodes on the same local area network (LAN) segment.
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.
INTRODUCTION
WHAT IS OSI?
OSI MODEL
TYPES OF LAYERS
PHYSICAL LAYER
DATA LINK LAYER
NETWORK LAYER
TRANSPORT LAYER
SESSION LAYER
PRESENTATION LAYER
APPLICATION LAYER
A state occurring in network layer when the message traffic is so heavy that it slows down network response time.
Effects of Congestion
As delay increases, performance decreases.
If delay increases, retransmission occurs, making situation worse.
What is congestion?
A state occurring in network layer when the message traffic is so heavy that it slows down network response time.
Effects of Congestion
As delay increases, performance decreases.
If delay increases, retransmission occurs, making situation worse.
This presentation about Conjestion control will enrich your knowledge about this topic.and use this presentation for your reference this presentation with the Leaky bucket algorithm.
APNIC Chief Scientist Geoff Huston gives a presentation on Buffers, Buffer Bloat and BBR at NZNOG 2020 in Christchurch, New Zealand, from 28 to 31 January 2020.
What is Quality of Service?
-Basic mechanisms
-Leaky and token buckets
-Integrated Services (IntServ)
-Differentiated Services (DiffServ)
-Economics and Social factors facing QoS
-QoS Vs. Over Provisioning
The Art Pastor's Guide to Sabbath | Steve ThomasonSteve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
1.4 modern child centered education - mahatma gandhi-2.pptx
Leaky Bucket & Tocken Bucket - Traffic shaping
1. 1
Traffic Shaping
•
It is about regulating average rate of data flow.
•
It is a method of congestion control by providing shape to data flow before entering the packet into
the network.
•
At connection set-up time, the sender and carrier negotiate a traffic pattern (shape)
•
There are two types of Traffic shaping algorithm :-
▫
1. Leaky Bucket Algorithm.
▫
2. Token Bucket Algorithm
2. 2
Leaky Bucket Algorithm
•
The Leaky Bucket Algorithm used to control rate in a network.
•
It is implemented as a single-server queue with constant service time.
•
If the bucket (buffer) overflows then packets are discarded.
•
In this algorithm the input rate can vary but the output rate remains constant.
•
This algorithm saves busty traffic into fixed rate traffic by averaging the data rate.
3. 3
The Leaky Bucket Algorithm
(a) A leaky bucket with water.
(b) a leaky bucket with packets.
4. 4
Leaky Bucket Algorithm
Algorithm
Step - 1 : Initialize the counter to ‘n’ at every tick of clock.
Step - 2 : If n is greater than the size of packet in the front of queue send the packet into the network and
decrement the counter by size of packet. Repeat the step until n is less than the size of packet.
Step - 3 : Reset the counter and go to Step - 1.
5. 5
Example
Let n = 1000
Packet =. 200
700
500
450
400
200
Since n > front of Queue i.e. n>200
Therefore, n= 1000-200 = 800
Packet size of 200 is sent to the network
200
700
500
450
400
Now Again n > front of queue i.e. n > 400
Therefore, n= 800-400 = 400
Packet size of 400 is sent to the network
200
700
500
450
Since n < front of queue .
There fore, the procedure is stop.
And we initialize n = 1000 on another tick of clock.
This procedure is repeated until all the packets is sent to the network.
6. 6
Leaky Bucket Algorithm
Example
Consider a frame relay network having a capacity of 1Mb and data is input at the rate of 25mbps.Calculate
1. What is the time needed to fill the bucket.
2. If the output rate is 2 mbps , the time needed to empty the bucket.
Ans.
Here ,
C is Capacity of bucket = 1mb
Data input rate = 25 mbps
output rate = 2mbps.
1.
T = C/input rate
= 1/25
= 40 msec
2
T = C/output rate
= ½
= 500 msec
7. 7
Token Bucket Algorithm
•
The Token Bucket Algorithm compare to Leaky Bucket Algorithm allow the output rate vary
depending on the size of burst.
•
In this algorithm the buckets holds token to transmit a packet, the host must capture and destroy
one token.
•
Tokens are generated by a clock at the rate of one token every t sec.
•
Idle hosts can capture and save up tokens (up to the max. size of the bucket) in order to send
larger bursts later.
9. 9
Token Bucket Algorithm
Algorithm
Step - 1 : A token is added at every ∆t time.
Step - 2 : The bucket can hold at most b-tokens. If a token arrive when bucket is full it is discarded.
Step - 3 : When a packet of m bytes arrived m tokens are removed from the bucket and the packet is sent to
the network.
Step – 4 : If less than n tokens are available no tokens are removed from the buckets and the packet is
considered to be non conformant.
The non conformant packet may be enqueued for subsequent transmission when sufficient token have been
accumulated in the bucket.
If C is the maximum capacity of bucket and ρ is the arrival rate and M is the maximum output rate then Burst
Length S can be calculated as
C + ρS = MS
10. 10
Token Bucket Algorithm
Example
Consider a frame relay network having a capacity of 1Mb of data is arriving at the rate of 25mbps for 40msec.The
Token arrival rate is 2mbps and the capacity of bucket is 500 kb with maximum output rate 25mbps.Calculate
1. The Burst Length.
2. Total output time.
Ans.
Here ,
C is Capacity of bucket = 500kb
M= 25 mbps
ρ = 2mbps.
1.
S= 500/((25-2)*1000) = 21.73msec ~= 22msec
2
For 22msec the output rate is 25msec after that the output rate becomes 2mbps i.e. token arrival rate.
Therefore, for another 500 kb the time taken will be.
500/(2000) = 250 msec
Therefore, total output time = 22 +250 = 272 msec.
11. 11
DIFFERENCE BETWEEN LEAKY BUCKET AND TOKEN BUCKET ALGORITHM
TOKEN BUCKET
LEAKY BUCKET
Token dependent.
Token independent.
If bucket is full token are discarded, but not the
packet.
If bucket is full packet or data is discarded.
Packets can only transmitted when there are
enough token
Packets are transmitted continuously.
It allows large bursts to be sent faster rate after
that constant rate
It sends the packet at constant rate
It saves token to send large bursts.
It does not save token.