search
Log In
0 votes
71 views
Consider the following statements:

S1: In ethernet, jamming signal ensure that all nodes using the channel are aware for their transmission(s) failed.

S2: Bit stuffing ensures that all frames are of the same size.

Which of the following is true?

(a) Only S1

(b) Only S2

© Both S1 and S2

(d) Neither S1 nor S2
in Computer Networks 71 views
0

Solution says that only S1 is true. But according to me neither of them is true since jamming signal is used to ensure all the nodes using the channel are aware for the collisions happening in the channel due to other stations and not because of its own collision since if the frames of a station collides, then the owner stations (sender and reciever) gets to know about the collision by collision detection scheme. But in order for other stations to know about the collision that just happened in the channel which don't involve their frames, jamming signal needs to be sent.

This is the concept that I knew.

Am I going wrong somewhere?

0
S1 is correct !

The purpose of jamming signal is, tell about collision happens to all the stations in the channel but not only for the involved stations, due to this reason, we will ensure that JAM signal also have to propagate the whole Channel.
0

aware for their transmission(s) failed.

but why would stations that are involved in collision need to know about collision of their own frames through jamming signal?They have the collision detection scheme to detect collision right? jam signal is needed for other stations in the same channel right?

0

jam signal is needed for other stations in the same channel right?

yes !

In ethernet, jamming signal ensure that all nodes using the channel are aware for their transmission(s) failed.

their means (in this context), only transmitting stations

0
ok..got it now :) thanks

Please log in or register to answer this question.

Related questions

1 vote
0 answers
1
151 views
Consider Dijkstra's algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connecting $u$ to $v.$ Ram then implements the rest of the algorithm correctly, aiming to produce minimum cost ... and link costs where all routing table entry will be correct. $D)$ Both $A)$ and $B)$ How Dijkstra working here?
asked May 14, 2019 in Computer Networks srestha 151 views
0 votes
0 answers
2
274 views
Consider a very large network $10000$ routers. Two host $A$ and $B$ connected with this network. Host $A$ sends a data to host $B$. and after some unit of time host $A$ receives $ICMP$ time exceed message for the samedata packet. The number of router ... some distance some ICMP message generated? Say if $ICMP$ message generated in $9999th$ router, then where it give error of time exceed message?
asked Apr 20, 2019 in Computer Networks srestha 274 views
0 votes
1 answer
3
70 views
The round trip delay between X and Y is given as 60 ms and bottle neck bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and channel is full duplex. As it is mentioned that channel is full duplex , so will it be changing the approach to solve the question?
asked Mar 14, 2019 in Computer Networks shreys02 70 views
0 votes
1 answer
4
163 views
100 stations on a pure Aloha network share a 1 MBPS channel. if frames are 1000 bits long, find the throughput if each station is sending 10 frames per second
asked Jan 30, 2019 in Computer Networks Jaggi 163 views
...