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? 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-3 of having a 365 different birthday from the first, the third has probability 1 of having a different birthday from the first two, and so on. The probability that all birthdays are different is thus 2 N (1-365) × (1-365) ×---×(1-965¹) (₁ which for smallish N is about 1 - 1+2+...+(N − 1) 365 - 2 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? 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-3 of having a 365 different birthday from the first, the third has probability 1 of having a different birthday from the first two, and so on. The probability that all birthdays are different is thus 2 N (1-365) × (1-365) ×---×(1-965¹) (₁ which for smallish N is about 1 - 1+2+...+(N − 1) 365 - 2 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

Imagine for a moment that the desktop of your computer is completely covered with FIN WAIT 1 TCP connections, and that you have a large number of these connections. Is there a certain outcome that is more likely to take place than the others? Who precisely is to blame for this situation?
Given a M/M/1 queue, if the average inter-arrival time is Z seconds, the average packet service time is P, find: a. The probability an arriving packet has to wait in the queue b. The variance (o}) of the inter-arrival time The variance (o) of the packet service time d. The average number of packets in the system (i.e., in the queue + in the NIC) c.
A TCP connection is established through 10 wireless hops in an acoustic underwater ad hoc network. Assume that each hop is 100 meter in the average, acoustic signals travel 1500 meter per second, 10 kilobit data can be sent per second over a link, the source node has one megabyte of data to send, the receiver window size is 64 kilobytes, the maximum segment size is 1 kilobyte and the average processing delay for routing at each node is one millisecond. Assume also that the following segments do not reach the destination: 67, 112, 137. What would be the average utilization of the links for this connection if there is not another communications through them? Explain an alternative approach to increase the bandwidth utilization?
Assume that an end-to-end communications system is made up of three networks with date rate in Mbps ρ1, ρ2, and ρ3, respectively. Ignoring the other delay components, what is the total end-to-end delay to transmit a packet size of λ?