Ethernet Transmitter Algorithm

Neso Academy
8 May 202011:43

Summary

TLDRThis tutorial covers the Ethernet transmitter algorithm, explaining how it functions with CSMA/CD to manage data transmission on Ethernet networks. It introduces the concept of Manchester encoding for signal conversion and addresses runt frames, which occur due to collisions or network issues. The video also highlights the importance of collision detection and the use of exponential back-off to minimize collision probability, providing a comprehensive understanding of Ethernet communication protocols.

Takeaways

  • πŸ˜€ The Ethernet transmitter algorithm is a method used by network adapters to manage data transmission over Ethernet cables.
  • πŸ” Outcomes of the session include understanding the Ethernet transmitter algorithm, recognizing runt frames, and knowing about exponential back-off.
  • πŸ’‘ The Ethernet adapter, also known as the Network Interface Card (NIC), is a crucial component that connects a host computer to an Ethernet cable via an RJ45 socket.
  • 🌐 The Ethernet Media Access Control (MAC) algorithm is implemented in the hardware of the network adapter and uses CSMA/CD (Carrier Sense Multiple Access with Collision Detection) as its access method.
  • πŸ“Ά Manchester encoding is the technique used by Ethernet to convert data bits into electrical signals for transmission over copper cables.
  • πŸš€ The Ethernet transmitter algorithm transmits a frame immediately if the adapter has a frame to send and the channel is idle.
  • 🚫 If the line is busy, the algorithm waits until it becomes idle before transmitting, reflecting the CSMA/CD protocol's behavior.
  • πŸ’₯ Collisions occur when two or more hosts transmit at the same time, leading to a runt frame, which is an Ethernet frame less than 64 bytes.
  • πŸ” Exponential back-off is a technique used to reduce collision probability by doubling the waiting time after each failed transmission attempt.
  • ⏱️ A runt frame is created when a collision occurs, or due to issues like malfunctioning network cards, buffer under-runs, or duplex mismatches.

Q & A

  • What are the three outcomes of the session on the Ethernet transmitter algorithm?

    -The three outcomes of the session are: 1) Understanding the Ethernet transmitter algorithm, 2) Understanding runt frames, and 3) Knowing about exponential back-off.

  • What is the function of an Ethernet adapter in a host computer?

    -An Ethernet adapter in a host computer is used to connect an Ethernet cable, allowing the computer to communicate over a network.

  • What is the access protocol for Ethernet?

    -The access protocol for Ethernet is Ethernet Media Access Control (MAC) algorithm, which is implemented in the hardware of the network adapter.

  • What access method does Ethernet use?

    -Ethernet uses the CSMA/CD (Carrier Sense Multiple Access with Collision Detection) access method.

  • Why is Manchester encoding technique used by Ethernet?

    -Ethernet uses the Manchester encoding technique to convert data bits into electrical signals that can be transmitted over copper cables, such as Ethernet cables.

  • How does the Ethernet transmitter algorithm handle a frame transmission when the channel is idle?

    -When the adapter has a frame to send and the channel is idle, it transmits the frame immediately.

  • What is the maximum payload size of an Ethernet frame?

    -The maximum payload size of an Ethernet frame is 1500 bytes.

  • Why is Ethernet referred to as a CSMA/CD protocol?

    -Ethernet is referred to as a CSMA/CD protocol because it uses Carrier Sense Multiple Access with Collision Detection, allowing hosts to detect collisions when they occur during transmission.

  • What is a runt frame in Ethernet?

    -A runt frame is an Ethernet frame that is less than 64 bytes in length, typically caused by collisions, malfunctioning network cards, buffer under-runs, or duplex mismatches.

  • What is the purpose of transmitting a 32-bit jamming sequence in case of a collision?

    -A 32-bit jamming sequence is transmitted to indicate a collision has occurred, allowing all involved host computers to recognize the collision and stop their transmission.

  • What is the role of exponential back-off in the Ethernet transmitter algorithm?

    -Exponential back-off is a technique used by the Ethernet algorithm to reduce the probability of collisions by doubling the waiting time between retransmission attempts after a collision is detected.

Outlines

00:00

🌐 Introduction to Ethernet Transmitter Algorithm

The video begins with an introduction to the Ethernet transmitter algorithm, outlining the session's objectives. The learner is expected to understand the Ethernet transmitter algorithm, recognize runt frames, and learn about exponential back-off upon completion. The Ethernet adapter, also known as the Network Interface Card (NIC), is explained as the component that connects the host computer to the Ethernet cable via an RJ45 socket. The video then delves into the Ethernet media access control (MAC) algorithm, which is implemented in the hardware of the NIC and uses Carrier Sense Multiple Access with Collision Detection (CSMA/CD). The Manchester encoding technique is introduced as the method used to convert data bits into electrical signals for transmission over copper cables.

05:01

πŸš€ Ethernet Transmitter Operation and Collision Handling

The script explains how the Ethernet transmitter algorithm works, detailing the process of frame transmission when the channel is idle. It emphasizes the maximum payload size of 1500 bytes for Ethernet frames and the conditions under which frames are transmitted. The video discusses the persistent nature of CSMA, where an adapter with a frame to send will transmit with a probability of one when the line becomes idle. Collisions are a key aspect of Ethernet operation, and the video describes how hosts detect collisions using the CSMA/CD protocol. It explains the transmission of a 32-bit jamming sequence upon collision detection and the minimum transmission of 96 bits, which includes a 64-bit preamble and the jamming sequence. The concept of runt frames, which are frames less than 64 bytes caused by collisions or other issues, is introduced, and the video explores worst-case scenarios involving frame collisions and the resulting runt frames.

10:05

πŸ” Exponential Back-Off Strategy in Ethernet

The final paragraph discusses the exponential back-off technique used by Ethernet to reduce collision probabilities. After a collision is detected and transmission is halted, the adapter waits for a random period before attempting to resend the frame. If the channel remains busy, the waiting period doubles with each subsequent attempt. This strategy, where the delay interval between retransmission attempts is exponentially increased, is known as exponential back-off. The video concludes with a summary of the Ethernet transmitter algorithm, runt frames, and the importance of the exponential back-off strategy in managing network traffic and minimizing collisions.

Mindmap

Keywords

πŸ’‘Ethernet Transmitter Algorithm

The Ethernet Transmitter Algorithm is a protocol that governs how data is sent over an Ethernet network. It is a fundamental part of the video's theme, as it dictates how frames are transmitted when the channel is idle. The script mentions that when the adapter (host computer) has a frame to send and the line is idle, it transmits the frame immediately, exemplifying the algorithm in action.

πŸ’‘Runt Frames

Runt frames are Ethernet frames that are less than the minimum length of 64 bytes. These are significant in the video's discussion on Ethernet transmission errors, often resulting from collisions. The script explains that runt frames are usually a consequence of two frames colliding, but they can also be caused by malfunctioning network cards or duplex mismatches.

πŸ’‘Exponential Back-off

Exponential Back-off is a collision resolution technique used in Ethernet networks. It is crucial for understanding the video's discussion on managing network congestion. The script describes how, after a collision, a device waits for a random time period before retransmitting, doubling the wait time after each failed attempt, thereby reducing the likelihood of repeated collisions.

πŸ’‘CSMA/CD

CSMA/CD stands for Carrier Sense Multiple Access with Collision Detection, which is the access method used by Ethernet. It is central to the video's explanation of how Ethernet networks manage multiple devices trying to transmit simultaneously. The script mentions that Ethernet is a CSMA/CD network, where devices sense the channel, and if it's busy, they wait until it's idle before transmitting.

πŸ’‘Manchester Encoding

Manchester Encoding is a line encoding technique used to represent binary data as electrical signals. It is relevant to the video's discussion on how data is converted into a form suitable for transmission over Ethernet cables. The script explains that Ethernet uses Manchester encoding to convert data bits into electrical signals that can be transmitted over copper cables.

πŸ’‘Collision

A collision in networking occurs when two or more devices send data simultaneously over the same communication channel. It is a key concept in the video's explanation of Ethernet's operation. The script describes how collisions can occur in Ethernet networks when multiple hosts transmit at the same time, leading to data corruption and the need for retransmission.

πŸ’‘Jamming Sequence

A Jamming Sequence is a 32-bit pattern transmitted by a device to indicate a collision has occurred. It is highlighted in the video's discussion on how devices detect and respond to collisions. The script mentions that when a device detects a collision, it transmits a jamming sequence to alert other devices and then stops transmitting.

πŸ’‘Payload

Payload in the context of Ethernet frames refers to the actual data being transmitted. It is an important aspect of the video's discussion on Ethernet frame structure. The script specifies that the maximum payload size in an Ethernet frame is 1500 bytes, which sets an upper limit on the amount of data that can be sent in a single frame.

πŸ’‘Network Interface Card (NIC)

A Network Interface Card (NIC), also known as a network adapter, is a hardware component that connects a computer to a network. It is integral to the video's explanation of how Ethernet connections are established. The script describes the NIC as the part of the host computer where the Ethernet cable is connected.

πŸ’‘Ethernet Media Access Control (MAC) Algorithm

The Ethernet MAC Algorithm is implemented in the hardware of network adapters and governs how devices share the communication channel. It is a core part of the video's discussion on Ethernet's operation. The script explains that this algorithm is responsible for managing access to the Ethernet medium, using techniques like CSMA/CD.

πŸ’‘Duplex Mismatch

Duplex Mismatch occurs when two devices connected via Ethernet operate in different modes of full- or half-duplex. It is mentioned in the video's discussion on potential sources of runt frames. The script explains that if one device is in half-duplex mode (transmits and receives on the same signal pair) and the other is in full-duplex mode (transmits and receives on separate pairs), it can lead to runt frames.

Highlights

Introduction to the Ethernet transmitter algorithm and session outcomes.

Understanding of the Ethernet adapter and its role in connecting the host computer.

Explanation of the Ethernet media access control (MAC) algorithm.

Description of the CSMA/CD access method used by Ethernet.

Importance of Manchester encoding technique in Ethernet.

Process of the Ethernet transmitter algorithm when the channel is idle.

Details on the maximum payload size of an Ethernet frame.

Behavior of the Ethernet transmitter when the line is busy.

Definition and characteristics of the CSMA/CD protocol.

Lack of centralized control in Ethernet and its implications.

How Ethernet detects and handles collisions between frames.

Explanation of the 32-bit jamming sequence during collisions.

Requirement for a transmitter to send at least 96 bits in case of collision.

Definition and causes of runt frames in Ethernet.

Worst-case scenario of the Ethernet transmitter algorithm.

Introduction to the concept of exponential back-off.

Mechanism of exponential back-off to reduce collision probability.

Conclusion summarizing the Ethernet transmitter algorithm, runt frames, and exponential back-off.

Transcripts

play00:00

hello everyone welcome back today we

play00:02

will see the Ethernet transmitter

play00:04

algorithm as usual let's start the

play00:07

session with the outcomes in today's

play00:09

session we have three outcomes let's see

play00:11

what are they upon the completion of the

play00:14

session the learner will be able to

play00:15

outcome number one we will understand

play00:18

that Ethernet transmitter algorithm

play00:20

outcome number two we will understand

play00:22

runt frames and last outcome we will

play00:25

know about exponential back-off before

play00:28

we step into the ethernet transmitter

play00:30

algorithm we will see the Ethernet

play00:33

adapter if we have a host computer and

play00:36

this host computer will be having an

play00:38

adapter where this Ethernet cable will

play00:40

be connected to this or after only I

play00:42

will show you the Ethernet adapter or

play00:45

the Ethernet NAC car this is actually

play00:48

the Ethernet adapter or we will call it

play00:49

as the NAC card that is the network

play00:51

interface card this NAC card will be the

play00:54

part of the host computer so that we can

play00:57

just plug in our Ethernet cable to this

play00:59

port in order to connect the ethernet

play01:01

cable and this port we need rj45 socket

play01:05

now let's see the access protocol for

play01:07

Ethernet the algorithm is commonly

play01:09

called Ethernet media access control

play01:12

that is Mac algorithm which is

play01:14

implemented in Hardware of the network

play01:16

adapter that is already we have seen the

play01:18

network adapter and this algorithm that

play01:21

is this Ethernet media access control

play01:22

algorithm which is implemented in the

play01:25

hardware of this network adapter and

play01:26

what's the access method used by

play01:28

Ethernet it is csma/cd that is carrier

play01:32

sense multiple access with collision

play01:33

detection already we have seen about

play01:35

this carrier sense multiple access with

play01:37

collision detection technique in one of

play01:39

the previous lectures if you want to

play01:41

know more about it I request you to

play01:43

watch my previous lecture title carrier

play01:45

sense multiple access and then what is

play01:47

the encoding scheme that is used by

play01:49

Ethernet the encoding method is the

play01:52

Manchester encoding technique why do we

play01:54

need this Manchester encoding technique

play01:56

I already told you that the ethernet

play01:58

cable will be connected through this

play01:59

port so application layer data is then

play02:01

given to transport layer then comes to

play02:03

the network layer then comes to the data

play02:05

link layer where the same AC card is

play02:06

actually so the frames that are created

play02:09

by the host computer have to be

play02:10

placed on the cables that is this

play02:12

channel so when it wants to place the

play02:14

data on the channel we need to do some

play02:17

encoding technique encoding means the

play02:19

actual data or the frame that is created

play02:22

by this host computer have to be

play02:24

converted into signals because the

play02:26

Ethernet cable will carry only signals

play02:28

Ethernet cable is an example of copper

play02:31

cable so it carries the data in the form

play02:33

of electrical signals Ethernet uses

play02:36

Manchester encoding technique for

play02:38

converting data bits in to signals

play02:40

let's now dive into the ethernet

play02:43

transmitter algorithm when the adapter

play02:46

has a frame to send we know then the

play02:48

adapter means the host computer has the

play02:50

frame to send and the channel or the

play02:52

line is idle and it transmits the frame

play02:55

immediately because the line is idle so

play02:58

whenever the her doctor has a frame to

play03:00

send it sends the frame immediately and

play03:02

what is the payload size of the frame we

play03:04

know the upper bound or the maximum size

play03:07

of the data or the payload in the

play03:09

Ethernet frame will be of thousand five

play03:10

hundred bytes so the upper bound of

play03:13

thousand five hundred bytes in the

play03:14

message means that the adapter can

play03:17

occupy the line for a fixed length of

play03:19

time in the first point we have seen

play03:21

they adapted as a frame to say in and

play03:23

the line is idle what is the adapter

play03:25

ASSA frame on the line is not idle that

play03:27

is the line is busy the Third Point

play03:30

answers this situation when the adapter

play03:32

has a frame to send and the line is busy

play03:35

it waits for the line to go idle and

play03:38

then transmits immediately so whenever

play03:41

it finds that the line is idle it places

play03:44

the frame

play03:44

whenever the line is busy this algorithm

play03:47

waits for a certain period of time and

play03:49

when it finds the line is idle it places

play03:52

the frame or it transmits the frame

play03:54

Ethernet is said to be here CSMA one

play03:57

persistent protocol why Ethernet is

play03:59

called as CSMA one persistent protocol

play04:02

because an adapter with a frame to send

play04:05

transmits with the probability one

play04:07

whenever a busy line goes idle so

play04:10

whenever a busy line goes idle this

play04:12

adaptive places the frames in order to

play04:14

send that with the probability of one

play04:16

and that is why the ethernet is said to

play04:19

be a CSMA one persistent protocol to

play04:21

know more about this I request you to

play04:23

watch my previous lecture title see SME

play04:25

is there any centralized control in the

play04:28

ethernet we will see that since there is

play04:30

no centralized control it is possible

play04:33

for two or more adapters to begin

play04:35

transmitting at the same time either

play04:38

because both found the line to be idle

play04:41

or both had been waiting for a busy line

play04:44

to become idle let's assume there are

play04:46

two host computers when both the host

play04:48

computers finds the line to be idle

play04:51

so they place their frames at the same

play04:53

time and this leads to collision

play04:55

Ethernet has no centralized control when

play04:58

the frames collide with each other this

play05:01

algorithm will intimate the host at the

play05:04

collision has happened that is why

play05:06

Ethernet access method is named as

play05:08

csma/cd csma/cd means carrier sense

play05:12

multiple access with collision detection

play05:14

hosts will be able to know whether the

play05:17

collision has happened or not when two

play05:19

or more host computer finds the line to

play05:22

be idle and they places their frames at

play05:24

the same time when this situation

play05:26

happens then two or more frames are said

play05:29

to be collide on the network what

play05:31

happens when coalition of up and since

play05:34

Ethernet supports collision detection

play05:36

each sender is able to determine that

play05:38

the collision is in progress how host

play05:40

computers come to know whether collision

play05:42

has happened or not at the moment an

play05:45

adapter detects that its frame is

play05:46

colliding with another frame it first

play05:49

made sure to transmit a 32 bit jamming

play05:52

sequence so whenever any node since a 32

play05:55

bit jamming sequence

play05:56

it means the frame has collided with

play05:59

each other then what the host computer

play06:01

will do it then stops transmission see

play06:04

please make a note of this point it's a

play06:06

very important point when the adapter

play06:08

detects its frame is colliding with

play06:10

another frame it first makes sure's to

play06:12

transmit a 32 bit jamming sequence so

play06:15

that other host will come to note that

play06:17

collision has happened and this host

play06:19

computer will stop its transmission

play06:21

immediately thus a transmitter will

play06:25

minimally send 96 bits in case of

play06:27

collision why the host computer has to

play06:30

send 96 bits because it has to send a 32

play06:33

bit jamming sequence just to indicate a

play06:34

collision as happen

play06:36

just 32 bits are not sufficient it needs

play06:39

to append a 64-bit preamble so the

play06:42

transmitter will minimally send 96 bits

play06:44

in case of collision now let's see what

play06:47

our run friends our rant frame is an

play06:51

Ethernet frame that is less than I

play06:53

Triple E 8 not 2.3 smin among length of

play06:57

64 bytes when we find a frame which is

play06:59

less than 64 bytes then these frames are

play07:02

runt friends you may have a question in

play07:04

your mind

play07:05

Ethernet will never create a frame that

play07:07

is less than the minimum length of 64

play07:10

bytes then how a run frame is created

play07:12

because run frames are frames that are

play07:14

less than 64 bytes these run frames are

play07:17

most commonly caused by collisions

play07:19

suppose if two frames are colliding with

play07:22

each other the result of that collision

play07:24

will be a run frame normally these run

play07:26

frames are caused because of collisions

play07:28

is there any other reasons for creating

play07:31

runt friends yes we have other reasons

play07:33

to not only collision there are other

play07:35

possible causes for creating runt

play07:38

friends they may be a malfunctioning

play07:40

network card or the NAC card the buffer

play07:43

under-run or the duplex mismatch duplex

play07:46

mismatch means one side of the line it

play07:48

will be running in half duplex mode and

play07:50

the other side will be running in full

play07:51

duplex mode this will also cause run

play07:54

frames because of software issues in the

play07:56

host side it can create run friends

play07:58

let's see the worst case scenarios of

play08:00

Ethernet transmitter algorithm now let's

play08:03

see the worst case scenario yay where

play08:05

air sends a frame at time T that is yeah

play08:08

is sending its frame at time T let's

play08:12

come to point number B the frame that

play08:14

was sent by host computer J will be

play08:16

received by the destination computer B

play08:19

at what time years frame will be

play08:21

received by B so as frame arrives at B

play08:24

at T plus D why because a time T only

play08:28

has transmitted the frame so it takes

play08:31

real time where D is the delay the delay

play08:34

it involves the transmission delay as

play08:36

well as the propagation delay so so at T

play08:39

plus D time

play08:40

yes frame arrives at B now let's move on

play08:43

to point number C so B begins

play08:46

transmitting at T plus D

play08:49

and collides with yes frame what is

play08:51

mentioned here is let's assume there are

play08:53

200 bits in this frame and all bits are

play08:57

transmitted and received by B except the

play08:59

last bit that time and the last bit is

play09:02

received by B at that time B begins its

play09:06

transmission so what happens and because

play09:08

of this single bit collision happens so

play09:11

B begins transmitting at T plus D at T

play09:15

plus D only year's frame and I should be

play09:17

at the merge of s frame B begins

play09:20

transmitting at t plus D and collides

play09:23

with es frame so what happens both the

play09:25

frames becomes unusable because of this

play09:28

collision what happens to this frame it

play09:30

will be a runt frame we knows this

play09:33

collision and befriends the runt frame

play09:35

at what time it will be received this

play09:38

frame is started at D plus D and it will

play09:40

take D delay in order to reach a so B's

play09:44

front frame arrives at yay at what time

play09:47

T plus 2 D why coalition has happened at

play09:50

t plus D and this front frame will take

play09:53

a delay of D in order to reach here the

play09:55

time it has started his T plus D and it

play09:58

takes D delay in order to reach so T

play10:00

plus D plus B is T plus 2 D so B's front

play10:04

frame arrives at ei at T plus dou T and

play10:08

before we conclude we will see what is

play10:10

exponential back-off exponential

play10:13

back-off is the technique that is used

play10:14

by Ethernet in order to reduce the

play10:17

probability of collision let's see how

play10:19

once an adapter has detected a collision

play10:21

and stopped its transmission it waits

play10:24

for a certain amount of time and tries

play10:26

again after waiting for a certain period

play10:28

of time the Ethernet algorithm finds the

play10:31

channel is still busy what it will do

play10:33

each time the adapter tries to transmit

play10:36

but fails so it doubles the amount of

play10:39

time it waits before trying again for

play10:42

example if the node has waited for one

play10:45

second previously for the next attempt

play10:47

it will wait for two seconds after the

play10:50

expiry of two seconds it will try to

play10:51

place the frame on the channel again if

play10:54

it is busy it waits for 4 seconds and it

play10:57

waits for 8 seconds and it goes on for

play10:59

every try it doubles the amount of the

play11:02

it waits before trying again so this

play11:04

strategy of doubling the delay interval

play11:07

between each retransmission attempt is

play11:09

known as the exponential back-off

play11:11

exponential back-off is the strategy

play11:13

that is followed by the Ethernet

play11:15

algorithm in order to reduce the

play11:17

probability of collision and that's it

play11:20

guys I hope now you know the Ethernet

play11:22

transmitter algorithm we understood the

play11:24

runt frames and we know about the

play11:26

exponential back-off strategy I hope you

play11:29

liked the video and thank you for

play11:30

watching

play11:32

[Applause]

play11:34

[Music]

Rate This
β˜…
β˜…
β˜…
β˜…
β˜…

5.0 / 5 (0 votes)

Related Tags
EthernetCSMA/CDTransmitter AlgorithmCollision DetectionManchester EncodingRunt FramesExponential Back-offNetwork AdapterData TransmissionCollision Handling