3) In a DWDM system wavelengths can be assigned on demand. The system sends files with an average length of 2.2TB, file lengths are exponentially distributed. Each wavelength transmits at 100GB/s. A group of users generates 200 wavelength requests/hr. Time between requests are exponentially distributed.

3) In a DWDM system wavelengths can be assigned on demand. The system sends files with an average length of 2.2TB, file lengths are exponentially distributed. Each wavelength transmits at 100GB/s. A group of users generates 200 wavelength requests/hr. Time between requests are exponentially distributed.

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

A messaging system reads message as 4-digit positive integer d1d2d3d4 and stores encoding of the message e1e2e3e4 for security reason. The encoding process is as follows: ei = (di+i) mod 3 For example, if message is 4590, the encoded message is 2101. Read any arbitrary message and display the encoded message in the following format: Original message = Encoded message = language : C
A telephone modem is used to connect a personal computer to a host computer. The speed of the modem is 56 kbps, the one-way propagation delay is 100 ms, the packet size is 256 bytes, and the probability of an error in a packet is 10^-4. Find the efficiency of stop-and-wait ARQ. What window size N is needed to keep the channel busy when there are no transmission errors. For this window size finds the efficiency of the go-back-N and selective repeat protocols. Note: Correct and detailed answer will be Upvoted else downvoted
Write a program to simulate the behavior of the CSMA/CD protocol over Ethernet when ther are N stations ready to transmit while a frame is being transmitted. Your program should report the times when each station successfully starts sending its frame. Assume that a clock tick occurs every slot time (51.2 microsec) and a collison detection and sending of a jamming sequence takes one slot time. All frames are the maximum length allowed.
Computer Networks Problem In the CSMA/CD protocol, the network adapter waits K-512 bit times after a collision, where K is drawn randomly. For K=20, how long does the adapter wait until returning to Step 2 for a 10 Mbps broadcast channel?
(a) Suppose a server S and client C are connected over the Internet. The one-way prop- agation delay from S to C is 50 ms. The maximum throughput between S and C is R = 200 Mbps. A browser on client C makes an HTTP request for a webpage on server S. The base HTML file is of size 500 KB and it references five objects, each of size 5 MB. Find the total response time for the client to receive the entire webpage using nonpersistent HTTP with up to two parallel connections. Assume that when two par- allel connections are active, the throughput for each connection is 40% of the maximum throughput R. (b) Suppose an application running on host ece.gmu.edu needs to resolve the domain name cs.vtech.edu. Draw a diagram (with labels) showing the sequence of queries/responses in a recursive DNS query to find the answer in a scenario where all levels of the DNS hierarchy are involved.
Computer Science A station, transmitting over a medium, employs exponential back-off. The parameters that govern the exponential back-off are CWE = 32, CWmin = 31 and CWmax = 1023. When CW > CWmax, retransmission is aborted. Assuming the slot time is 20 ns and the frame is sent after retransmission of the first frame, determine the maximum delay due to the error recovery time.
Consider a magnetic disk with 1000 cylinders rotating at a speed of 7200 revolutions per minute. The sector size on the disk is 1024 bytes. Assume that requests for sectors arriving from the file system can be located anywhere on the disk with equal probability and the locations of the requested sectors are independent of each other. Under these assumptions, the average seek time is 7 milliseconds. The transfer time per sector is 0.01 milliseconds (i.e., the raw data rate is 100 Megabytes per second). What is the effective data rate (select the answer closest to your calculated throughput)? a, 90KBytes/sec b. 100KBytes/sec c. 90MBytes/sec d. 100MBytes/sec
In a robotic laboratory of one university, the lab members are testing mobile robots. Each robot has a radio transmitter that it uses to communicate with a base station, and they find that if the robots get too close to one another, then there are problems with interference among the transmitters. So a problem arises: how to plan the motion of the robots in such a way that each robot gets to its intended destination, but in the process the robots don’t come close enough together to cause interference problems. This problem could be modeled as: suppose that we have an undirected graph G=(V,E), representing the floor plan of a building, and there are two robots initially located at nodes a and b in the graph. The robot at node a wants to travel to node c along a path in G, and the robot at node b wants to travel to node d. This is accomplished by means of a schedule: at each time step, the schedule specifies that one of the robots moves across a single edge, from one node to a…
Problem 1 A user in Beirut, connected to the internet via an 8 Mb/s connection (R = 8 Mb/s), retrieves a web page from a server in California (size of the web page = L = 50 Kbytes). The web page references 9 images on the same server (size .of each image = | = 310 Kbytes) Assume that the distance between Beirut and California is 15000Km, the average speed of .electrons in the used wire is 2 x 10^8 m/s :Find the one-way propagation delay * 90 msec O 80 msec O 75 msec 50 msec None of the mentioned
Computer A sends a message to computer B over an unreliable radio link. The message is encoded so that B can detect when errors have been introduced into the message during transmission. If B detects an error, it requests A to retransmit it. If the probability of a message transmission error is q = .1, what is the probability that a message needs to be transmitted more than two times?
Suppose that there are three stations labelled A, B, and C, where A and C are transmitting while B is receiving. The stations are in a configuration such that the two transmitters A and C are not in the radio range of each other. Since station C is out of the radio range of A, it does not know the presence of A. That’s why C perceives that channel B is free and starts transmitting to B. Also ‘A’ transmit signal at the same time to Channel B. The frames are garbled and a collision occurs. This is shown in the following figure: I. What is the name of this problem? II. How can we overcome this problem?
Gap in playback is a common problem exiting in multimedia applications transmitted using the isochronous data transmission approach shown in class. What is the method used to solve the problem?