EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 6, Problem R6RQ
Program Plan Intro
CSMA/CD:
- It is known as “Carrier-Sense Multiple Access with Collision Detection (CSMA/CD)”.
- It is an access control method which is mostly used in Local Area Networking.
- It is designed to improve CSMA’s (Carrier-sense multiple access) performance by halting transmission once the collision is spotted.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
If a multi port bridge was
used in a heavy load
standard Ethernet network
such that the traffic is not
going through it. If the total
number of stations in the
LAN is 40 and the number of
collision domains is 4 with
equal number of stations in
each domain, then each
station will theoretically be
given a capacity in Mbps
:equals to
In CSMA/CD, after the 4th collision,, what is the probability that a node chooses K =8 to correspond to a delay of how many seconds on a 10Mpbs Ethernet?
A and B are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both A and B attempt to transmit a frame at the same time and a collision occurred.
What is the probability that A wins the first backoff race is?
Assume A wins the first backoff race. At the end of this successful transmission by A, both A and B attempt to transmit and collide. What is the probability that A wins the second backoff race?
Chapter 6 Solutions
EBK COMPUTER NETWORKING
Ch. 6 - Consider the transportation analogy in Section...Ch. 6 - If all the links in the Internet were to provide...Ch. 6 - Prob. R3RQCh. 6 - Prob. R4RQCh. 6 - Prob. R5RQCh. 6 - Prob. R6RQCh. 6 - Prob. R7RQCh. 6 - Prob. R8RQCh. 6 - Prob. R9RQCh. 6 - Prob. R10RQ
Ch. 6 - Prob. R11RQCh. 6 - Prob. R12RQCh. 6 - Prob. R13RQCh. 6 - Prob. R14RQCh. 6 - Prob. R15RQCh. 6 - Prob. R16RQCh. 6 - Suppose the information content of a packet is the...Ch. 6 - Suppose the information portion of a packet (D in...Ch. 6 - Prob. P4PCh. 6 - Prob. P5PCh. 6 - Prob. P6PCh. 6 - Prob. P7PCh. 6 - Prob. P8PCh. 6 - Prob. P9PCh. 6 - Prob. P10PCh. 6 - Prob. P11PCh. 6 - Prob. P12PCh. 6 - Prob. P13PCh. 6 - Prob. P14PCh. 6 - Prob. P15PCh. 6 - Prob. P16PCh. 6 - Prob. P17PCh. 6 - Prob. P18PCh. 6 - Prob. P19PCh. 6 - Prob. P20PCh. 6 - Prob. P21PCh. 6 - Prob. P22PCh. 6 - Prob. P23PCh. 6 - Prob. P24PCh. 6 - Prob. P25PCh. 6 - Prob. P26PCh. 6 - Prob. P27PCh. 6 - Prob. P32PCh. 6 - Prob. P33P
Knowledge Booster
Similar questions
- Assume the VC number of a virtual-circuit network is a 16-bit field. What is the maximum number of virtual circuits that can be carried over a link? If the path and the VC number for each VC are determined by a central node of the network and the same VC number is used for all links along the path of same VC, how does the central node determine the VC number at the setup time?arrow_forwardWhat is the maximum and minimum waiting time for a node on a 1 Gbps ethernet network after the 10th collision?arrow_forwardConsider the Distance Vector Routing algorithm in a network of 1000 nodes. Each node has 19 lines to other nodes. If the delay values are between 0 and 249ms, and the delay vectors are exchanged 3 times per second. How much data rate per (full-duplex) line is taken by the routing algorithm?arrow_forward
- Q4: What is the total delay (latency) for a frame of size 6 million bits that is being sent on a link with 5 routers each having a queuing time of 5 µs and a processing time of 2 µs. The length of the link is 3000 Km. The speed of light inside the link is 2 x 1018 m/s. The link has a bandwidth of 10 Mbps. Which component of the total delay is dominant? Which one is negligible?arrow_forwardConsider a router buffer preceding an outbound link. In this problem, you will use Little’s formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little’s formula is N=a⋅d . Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link’s transmission rate is 100 packets/sec. Using Little’s formula, what is the average packet arrival rate, assuming there is no packet loss?arrow_forwardIf a two port bridge was used in a heavy load standard Ethernet network such that the traffic is going through it. If each station is theoretically given a capacity of5Mbpsand the number of stations in each LAN segment is equal, then the number of stations in each LAN is:arrow_forward
- Consider a broadcast channel with N nodes and a transmission rate of R bps. Suppose the broadcast channel uses polling (with an additional polling node) for multiple access. Suppose the amount of time from when a node completes transmission until the subsequent node is permitted to transmit (that is, the polling delay) is ?poll. Suppose that within a polling round, a given node is allowed to transmit at most Q bits. What is the maximum throughput of the broadcast channel?arrow_forwardConsider a network with a ring topology, link bandwidths of 100 Mbps, and propagation speed 2 × 108 m/s. What would the circumference of the loop be to exactly contain one 1500-byte packet, assuming nodes do not introduce delay? What would the circumference be if there was a node every 100 m, and each node introduced 10 bits of delay?arrow_forwardConsider two nodes (A, B) sharing the same broadcast channel of speed R =10Mbps. The propagation delay between the two nodes is 1ms. Consider a node C in the middle between both nodes. If A starts at time t=0 its transmission of a packet to node C, at what time can node B start transmitting its packet to a node D in the network in order for the two packets not to collide? Assume both nodes have each a packet of length L = 1000Bytes. О а. 1.3ms O b. 1ms О с. 0.5ms d. 1.8msarrow_forward
- Suppose four active nodes—nodes A, B, C and D—are competing for access to a channel using slotted ALOHA. Assume each node has an infinite number of packets to send. Each node attempts to transmit in each slot with probability . The first slot is numbered slot 1, the second slot is numbered slot 2, and so on. (a) What is the probability that node A succeeds for the first time in slot 5? (b) What is the probability that some node (either A, B, C or D) succeeds in slot 4? (c) What is the probability that the first success occurs in slot 3? (d) What is the efficiency of this four-node system?arrow_forward32222 data bytes are transferred from client to server over a TCP connection over a point-to- point line using Ethernet frames (total overhead = 26 bytes, assume no interframe gap.). The connection parameters are the following: MSS=1280 for both ends, initial sequence number for client is 543 and for server is 99992. The client initiates the disconnection right after finishing data transmission by sending the FIN flag and server replies by sending the FIN flag. Assume the window size is 20000 bytes on both sides and no options in IP and TCP headers. Also assume one ACK segment is sent for each data segment. (a) Show a diagram of a data frame and a control frame (ACK, SYN, etc). Show how many bytes in each field: Eth header, payload, trailer. Assume padding is used for Ethernet frames with a data length less than 46 bytes. the answers are data: 1306 bytes, control: 72 bytes. Explain the answersarrow_forward32222 data bytes are transferred from client to server over a TCP connection over a point-to- point line using Ethernet frames (total overhead = 26 bytes, assume no interframe gap.). The connection parameters are the following: MSS=1280 for both ends, initial sequence number for client is 543 and for server is 99992. The client initiates the disconnection right after finishing data transmission by sending the FIN flag and server replies by sending the FIN flag. Assume the window size is 20000 bytes on both sides and no options in IP and TCP headers. Also assume one ACK segment is sent for each data segment. (a) Show a diagram of a data frame and a control frame (ACK, SYN, etc). Show how many bytes in each field: Eth header, payload, trailer. Assume padding is used for Ethernet frames with a data length less than 46 bytes. the answers are data: 1306 bytes, control: 72 bytes. I need clear explanation of every field in ethernet frames and how did you know the size of each field?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education