A client sends a 128-byte request to a server located 100 km away over a 1-gigabit optical fiber. What is the efficiency of the line during the remote procedure call? We assume the speed of light in fiber optics is 200 km/msec, and treat 128 bytes as 1000 bits.

A client sends a 128-byte request to a server located 100 km away over a 1-gigabit optical fiber. What is the efficiency of the line during the remote procedure call? We assume the speed of light in fiber optics is 200 km/msec, and treat 128 bytes as 1000 bits.

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

2. Suppose computer A is sending a message to computer B. The datalink layer is using a sequence number made up of 3 bits. A sliding window of size 7 is being used to manage communication. Answer each of the following: () What is the minimum sequence number that can be used? (i What is the maximum seauence number that can be used?
A processor uses a serial link to communicate with a keyboard for word processing. A typist using this keyboard can type at rates peaking at 120 words per minute, where a word is 6 characters (including spaces and punctuation). The characters will be transmitted from the keyboard in 8-bit ASCII with one stop bit and no parity. Only consider these and no special characters. The programmer writes setup and polling service routines based on a minimum baud rate, but then finds that the keyboard will only interface at 19.2 Kbaud. Will the polling service routine have to change? Why or why not? Baud Rates 300 600 1200 2400 4800 9600 19200
Consider an application that sends data at a constant pace (for example, the sender generates an N-bit unit of data every k time units, where k is small and fixed). Answer the following questions briefly. a Is this a packet-switched or circuit-switched network? Why? b. Assume a packet-switched network is used with just traffic from the apps specified above. Also, if the sum of the application data rates is less than the capacity of each link, is congestion control required? Why?
Channel partitioning MAC protocols are: A. Efficient for low channel load since the delay is N/2, whereas N is the number of nodes. B. None is true. C. Efficient for low channel load since the delay is 1/N, whereas N is the number of nodes. D. Efficient for high channel load since the delay is N/2, whereas N is the number of nodes. E. Efficient for high channel load since the delay is 1/N, whereas N is the number of nodes.
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.
Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in bits and time in using asynchronous communication. Assume one start bit and a stop element of length one bit, and 8 bits to send the byte itself for each character. The 8-bit character consists of all data bits, with no parity bit. B. Calculate the overhead in bits and time using synchronous communication. Assume that the data are sent in frames. Each frame consists of 1000 characters = 8000 bits and an overhead of 48 control bits per frame. C. What would the answers to parts (a) and (b) be for a file of 100,000 characters?
4. In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame). Let S be the length of a slot. Suppose all frames are of
TCP Window Flow Control, consider the following: • The MSS Maximum Segment size is 1024 bytes (I kilobyte) • Window size (rwnd) = 4096 bytes • The sendbase is 0000, the segment size is 1024 bytes How many segments can you send (before acknowledgment) then you have to stop, you stop until some ack comes back? What is the sequence number of the third segment?
Computter Networks