Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit times. Suppose A and B send Ethemet frames at the same time, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. Assuming no other nodes are active, can the retransmissions from A and B collide? For our purposes, it suffices to work out the following example. Suppose A and B begin transmission at t=0 bit times. They both detect collisions at t=245 t bit times. Suppose KA=0 and KB=1. At what time does B schedule its retransmission? At what time does A begin transmission? (Note: The nodes must wait for an idle channel after returning to Step 2-see protocol.) At what time does A's signal reach B? Does B refrain from transmitting at its scheduled time?

Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit times. Suppose A and B send Ethemet frames at the same time, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. Assuming no other nodes are active, can the retransmissions from A and B collide? For our purposes, it suffices to work out the following example. Suppose A and B begin transmission at t=0 bit times. They both detect collisions at t=245 t bit times. Suppose KA=0 and KB=1. At what time does B schedule its retransmission? At what time does A begin transmission? (Note: The nodes must wait for an idle channel after returning to Step 2-see protocol.) At what time does A's signal reach B? Does B refrain from transmitting at its scheduled time?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…
Networking price Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. Manchester using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.
Q.3
To achieve totally-ordered multicasting with Lamport timestamps, is it strictly necessary that each message is acknowledged?
6. Delays. A user in Madagascar, connected to the internet via a 100 Mb/s (b-bits) connection retrieves a 250 KB (B-bytes) web page from a server in Tokyo, where the page references three images of 500 KB each. Assume that the one-way propagation delay is 82 ms and that the user's access link is the bandwidth bottleneck for this connection. a. Approximately how long does it take for the page (including images) to appear on the user's screen, assuming non-persistent HTTP using a single connection at a time? (For this part, you should ignore queueing delay and transmission delays at other links in the network) How long does it take if the connection uses persistent HTTP (single connection)? b. c. Suppose that user's access router has a 4 MB buffer (B-byte) on the link from the router to the user. How much delay does this buffer add during periods when the buffer is full? d. Assume a cache rate of 45% on the information received by the user in Madagascar from the Tokyo server. How does…
Plagiarism and wrong answers will downvotes Compute the fraction of the bandwidth that is wasted on overhead (headers and retransmissions) for sliding window protocol using selective repeat on a heavily loaded 50 kbps satellite channel with data frames consisting of 40 header and 3960 data bits. ACK frames never occur. NAK frames are 40-bits. The error rate for data frames is 1 percent and the error rate for NAK frames is negligible. The sequence numbers are 8-bits.
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How "long" (in meters) is one bit on link 1?
I need the answer as soon as possible
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?
In a network, at physical layer, the sender sends the data in continuous binary stream towards receiver, the receiver get confused about how many bits to combine in order to make the frame because the frames are not of fixed size. What you will suggest to make it work properly, suggest a solution that works on any given string. Elaborate your answer with the help of example.
2. (a) Suppose an end device A wants to send a frame containing a black and white image to another end device B. There are a total of 4 routers(R1,R2,R3,R4) in between them. The image being sent is a 1080*1920 pixel image. Every pixel is represented with 1 bit. The processing time(p) of each router in given below: I. R1: p = 1µs II. R2: p = 1.5μs III. R3: p = 2µS IV. R4: p = The image is being sent through a link of bandwidth 7 MBPS and device B is 3500 Km away from device A. The signal passes through the link at a speed of 2.5x10^8m/s. Considering there is no queuing time, calculate the total delay for this transmission.
Problem with constructing MAC. The messages X to be authenticated consists of z independent blocks, so that: X = x1||x2|| . . . ||xz, where every xi consists of |xi| = 8 bits. The input blocks are consecutively put into the compression function ci = h(ci−1, xi) = ci−1⊕xi At the end, the MAC value: MACk(X) = cz+k mod 28 is calculated, where k is a 64-bit long shared key. Describe how exactly the (effective part of the) key k can be calculated with only one known message X.