EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6, Problem P18P
Explanation of Solution
Given:
- Given that the nodes “A” and “B” were on the 10 Mbps channel.
- Propagation delay between both the nodes is 325 bit times.
Given scenario:
Consider the node “A” starts to transmit a frame and before it finishes sending the frame, the node “B” starts to transmit a frame. If the node “A” finishes transmitting the frame before it detects that the node “B” had transmitted, then it is considered that the node “A” incorrectly believes that its frame was transmitted successfully without a collision.
Solution:
- The node “A” starts to transmit a frame at “t = 0”.
- The node “A” finish transmitting a frame at “t = 512 + 64” bit times...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Consider two hosts S and R connected directly
by a link. A link has a transmission speed of 107
bits/sec. It uses data packets of size 400 bytes.
Data needed to transmitted is 400 bytes. Length
of the link is 600 km and the propagation speed
are 3 × 108 meter per second. T is the
transmission delay and P is the propagation
delay. The propagation delay in millisecond and
transmission delay in microsecond respectively
are
Suppose a system has 50 MB data to send on a network and transmit the data in burst at 8 Mbps, the maximum transmission rate across routers in the network is 6 Mbps, if system uses leaky bucket algorithm, the capacity (in MB) that bucket must hold so that no data is discarded is?.
Consider 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?
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
- Give unique answer only. Do not use AI or plagiarized answer.arrow_forwardConsider two systems P and Q connected via a router R with the bandwidth of 2 Gbps. The length of the packet is 1000 bytes. The propagation delay between P and Q is 200 microseconds. The distance between the P and R is 10 km while the distance between R and Q is 5 km. The propagation speed in meter per second if each link is having the same 10³ km/s? propagation speed isarrow_forwardConsider 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 dpoll. 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_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 datagram network in which a packet travels through two switches S1 and S2 from source to destination. Packet experiences wait at each switch before it is forwarded. Transmission time, propagation time and wait time at each node is 3 ms, 1.5 ms, and 0.25 ms respectively. Find the total delay.arrow_forwardAs discussed in the OSI protocol stack, one way a data link layer handles transmission errors is by requesting damaged frames to be retransmitted (i.e. by sending a NACK, Not ACKnowledgment). If the frame arrived successfully, an ACK would be sent instead. Let probability of a frame being transmitted correctly be p. a) Find the probability, kq , of a frame requiring exactly k transmissions b) If p=0.3, what is the mean number of transmissions required to send a frame if acknowledgements (ACKS and NACKS) are never lost? Hint: If you don't already know this, the mean number would simply be: 1k k kq | = | And c) What if some NACKS are lost, would that increase or decrease (or not change) the mean number of transmissions to send a frame? Explain briefly.arrow_forward
- A sender with window size (W=3) is connected to a selective repeat receiver by a link with bandwidth =106 bytes/second and propagation delay of 0.25 msec. The receiver sends Positive ACK for correctly received packets. For each packet sent, the sender sets a timer with time out value of 5 msec. On receiving an ack for a packet, the timer for that packet is cancelled. If the timer expires, that packet is retransmitted immediately. Assume that the sender sends packets 1, 2, and 3 (at t=0, packet size =1000 Bytes) and packet 2 is lost. NO other packet is lost. Under this scheme , at what time in msec would all the packets been received at the receiver.arrow_forwardSuppose that there are three inter-media nodes between Host 1 and Host 2, and the transmission rate of each link is 4.096 Mbps. The time of end-to-end circuit established is 0.5 second. How much seconds does it take to send a file of 8.192M byte from host H1 to host H2 over a packet-switched network?arrow_forwardComputer Science Consider two hosts C & D connected by a point-to-point link with a data link rate of 10 Gb/s. The hosts are 2 km apart and the signal propagation speed is 2 × 108 m/s. Given the packet size is 500 bytes, how many packets can be in inflight from C to D?arrow_forward
- How long does it take a packet of size 10 KB to travel over three links (connection) with a transmission rate of 5 Mbps? These three links are connected by two routers. Assume there are no other delays.arrow_forwardAssume that there is a shared connection (for example, an Ethernet bus) with a speed of 1 Mbps. How much time (in microseconds) is required to send a frame with a length of 1000 bits over this link?arrow_forwardSuppose that a SW ARQ system with 1-bit sequence numbering has a time-out value that is less than the time required to receive an ACK. Station A sends 5 frames to station B. No errors occur during transmission of all 5 frames. One ACK is lost when it is transmitted the first time (see the following table), and no transmission of that ACK. No errors occur during transmission of the other 4 ACKS. Sketch the sequence of frame exchanges that transpire between stations A and B. (а) error occurs in re- Last digit of your student ID number 0, 1 2, 3 Lost ACK 1 4, 5 6, 7 8, 9 2 3 4arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks ColeSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning