Suppose Ethernet physical addresses are chosen at random (using true random bits). (a) What is the probability that on a 1024-host network, two addresses will be the same? (b) What is the probability that the above event will occur on one or more of 220 networks? (c) What is the probability that, of the 230 hosts in all the networks of (b), some pair has the same address? 1 Hint: The calculation for (a) and (c) is a variant of that used in solving the so-called Birthday Problem: Given N people, what is the probability that two of their birthdays (addresses) will be the same? The second person has probability 1 - 35 of having a different birthday from the first, the third has probability 1 - 365 of having a different birthday from the first two, and so on. The probability that all birthdays are different is thus 2 2 N (1-365) × (1-385) ××(1-¹) 365 which for smallish N is about 1 - 1+2+...+(N − 1) 365

Suppose Ethernet physical addresses are chosen at random (using true random bits). (a) What is the probability that on a 1024-host network, two addresses will be the same? (b) What is the probability that the above event will occur on one or more of 220 networks? (c) What is the probability that, of the 230 hosts in all the networks of (b), some pair has the same address? 1 Hint: The calculation for (a) and (c) is a variant of that used in solving the so-called Birthday Problem: Given N people, what is the probability that two of their birthdays (addresses) will be the same? The second person has probability 1 - 35 of having a different birthday from the first, the third has probability 1 - 365 of having a different birthday from the first two, and so on. The probability that all birthdays are different is thus 2 2 N (1-365) × (1-385) ××(1-¹) 365 which for smallish N is about 1 - 1+2+...+(N − 1) 365

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

Network & Data Communcations
Question 2 please (a,b,c,d included)
Skype is a well‑known VoIP system used not only for peer‑to‑peer conversations but also for audio and video conferencing involving three or more callers. Assume a video conference with a central server on Skype has N callers, and each caller generates a constant data stream at rate r bps. How many bits per second does the call initiator need to send? How many bits does each of other N‑1 callers need to send?
Consider an employee using their computer to send and retrieve email at their workplace. Only Ethernet networks are used for physical connectivity, but the mail server is located on a separate network. The employee’s network and the mail server’s network are connected by a single router which also has a connection to the Internet via the workplace’s ISP. Explain how the employees email client sends and receives emails using the email server, indicating any protocols involved and where any encapsulation/decapsulation occurs as data travels between the client, local mail server, and remote mail servers.
What is the size of the multicast address space? Suppose that two multicast groups randomly choose a multicast address. What is the probability that they choose the same address? Suppose nowthat 1,000 multicast groups are ongoing at the same time and choose their multicast group addresses at random. What is the probability that they interfere with each other?
In modern packet-switched networks, including the Internet, the source host segments long, application-layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8. 106 bits long that is to be sent from source to destination in Figure 1.27. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. a. Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? b. Now suppose that…
dont post from existing one sure strict downvote and compliant skip if dont know
A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^−3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?
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…
dont dont dont post eixsting one sure sure compliant skip only answer if 100% sure else compliant
Give a simple heuristic for finding two paths through a network from a given source to a given destination that can survive the loss of any communication line (assuming two such paths exist). The routers are considered reliable enough, so it is not necessary to worry about the possibility of router crashes.
If an error happened in the following scenario, please mention whether it occurred. The sender sends the number “001011010” to the recipient. The devices make use of odd parity, 8-bit data, and a 1-bit (LSB) parity for each bit of information. What happens if the devices are utilizing even parity instead than odd? What are the communication protocols that are utilized in TESLA automobiles? Insert the schematic of the one(s) that you have discovered.