Discuss the csma/cd and csma/ca protocols, Computer Engineering

Assignment Help:

Discuss the CSMA/CD and CSMA/CA protocols.

CSMA/CD: this is an access method used mainly with LANs configured in a bus topology. Along with CSMA/CD, any station (node) can send a message to another station (or stations) as long as the transmission medium is free of transmissions from another station. Stations monitor (listen to) the line to find out if the line is busy. If the station has a message to transmit but the line is busy, this waits for an idle condition before transmitting message of this. If two stations transmit at similar time, collisions arise. When this occurs, the station first sensing the collision sends a special jamming signal to all other stations on the network. All stations then cease transmitting (back off) and wait a random period of time before attempting a retransmission. The random delay times for all stations are different, and therefore, permit for prioritizing the stations on the network. If successive collisions happen, the back off period for every station is twice. Along with CSMA/CD stations should contend for the network. A station has not guaranteed access to the network. To notice the occurrence of a collision, a station must be capable of transmitting and receiving simultaneously. CSMA/CD is used with most LANs configured in a bus topology. Ethernet is an illustration of a LAN which uses CSMA/CD.

CSMA/CA: this belongs to a class of protocols termed as multiple access methods. CSMA/CA stands for: Carrier Sense Multiple Access with Collision Avoidance. In Carrier Sense Multiple Access, a station wishing to transmit has to primary listen to the channel for a predetermined amount of time therefore as to check for any activity on the channel. If the channel is sensed "idle" then the station is allowed to transmit. If the channel is sensed like "busy" the station has to defer its transmission. It is the essence of both CSMA/CA and CSMA/CD. In CSMA/CA (Local Talk), a station sends a signal telling all other stations not to transmit only one time the channel is clear then sends its packet. In Ethernet 802.3, the station carries on to wait for a time and checks to observe if the channel is even free. If this is free, the station transmits, and waits for an acknowledgment signal which the packet was received.


Related Discussions:- Discuss the csma/cd and csma/ca protocols

Explain the working of a demultiplexer, Explain the working of a demultiple...

Explain the working of a demultiplexer with the help of an example. Ans: 1:4 Demultiplexer: Fig.(a) demonstrates the logic circuit of a 1:4 demultiplexer. This has two NOT

How many select lines will a 32:1 multiplexer will have, How many select li...

How many select lines will a 32:1 multiplexer will have ? Ans. 5 select lines will be required for 32 inputs, as 2 5 = 32.

Explain naming convention libraries, Explanation:- Common used functions...

Explanation:- Common used functions are placed in libraries. These are located in the SQABas32 subdirectory of the Robot working directory. A library is separated into three fil

Variable or compound expression - unification algorithm, Variable or compou...

Variable or compound expression - Unification algorithm: Here some things to note regarding this method are:  (i) There if really trying to match a constant to a different

Explain about the various features present in ms access, Microsoft access h...

Microsoft access has vast advantages for a programmer and end user. Some of the advantages are ? Relative compatibility with SQL and VBA. ? Microsoft SQL server desktop engi

How can i handle floating-point exceptions gracefully, 'On many systems, yo...

'On many systems, you can describe a function matherr which will be known as when there are certain floating-point errors, like errors in the math routines in .

Define parity bit and list its types, Define parity bit and List its types....

Define parity bit and List its types. The most common error detection code used is the parity bit. Parity bit is a extra bit contained with a binary message to make the total n

Student, Suppose we have an array-based list A[0..N - 1] and we want to del...

Suppose we have an array-based list A[0..N - 1] and we want to delete all duplicates. LastPosition is initially N - 1, but gets smaller as elements are deleted. Consider the pseudo

Data dictionary, data dictionary for online banking system in software engi...

data dictionary for online banking system in software engineering

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd