Question 4 . In the Internet, file distribution can be performed using either a Peer-to-peer or Client-server model. Assume that an institutional network operates with the following parameters: • Client upload rate= 100 • Server upload rate = 1000 Number of peers = 1000 File size 40 kbits Using the client-server model, please compute the time needed to distribute the file of size 40 kbits to the 1000 peers of the system. Using the peer-to-peer model, please compute the time needed to distribute the file of size 40 kbits to the 1000 peers of the system. Please compare the performance of these two file distribution models. Please describe the key principles behind the BitTorrent protocol and how the exchange of data is performed between peers.

Question 4 . In the Internet, file distribution can be performed using either a Peer-to-peer or Client-server model. Assume that an institutional network operates with the following parameters: • Client upload rate= 100 • Server upload rate = 1000 Number of peers = 1000 File size 40 kbits Using the client-server model, please compute the time needed to distribute the file of size 40 kbits to the 1000 peers of the system. Using the peer-to-peer model, please compute the time needed to distribute the file of size 40 kbits to the 1000 peers of the system. Please compare the performance of these two file distribution models. Please describe the key principles behind the BitTorrent protocol and how the exchange of data is performed between peers.

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 a distributed denial of service (DDOS) attack, Assume the attacker has compromised a number of broadband connected computers to use as zombie systems. If the ISP provides a maximum uplink data rate of 768 kbps in cable service, what is the maximum number of 128-byte ICMP echo request (ping) packets a single zombie computer can send per second? How many such zombie systems would the attacker need to flood a target server in an organization that has: A. Fast Ethernet. B. Gigabit Ethernet.
Write down a relationship that represents the effective end-to-end throughput that can be achieved over a network. Then calculate the effective throughput in a situation where a user wants to fetch a 1-MB file across a 1-Gbps network with a round-trip time of 100 ms
Do you agree that "there is no concept of client and server sides of a communication session" in a P2P file-sharing program? Both yes and no may be used to answer this question.
8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of head is at cylinder 130. The request queue is given as follows: 150, 40, 350, 100, 280 For each of the disk-scheduling algorithms given below, show (by plotting in the graphs below) the current position of head based on the disk arm movement to satisfy the above requests, and count the total distance (in cylinders) of the disk arm movement. a. First Come First Served (FCFS) 0 40 100 1.30 150 Total distance (disk am movement) = b. Shortest Seek Time First (SSTF) 40 100 130 150 0 Total distance (disk arm movement) = c. LOOK - in the direction of increasing track number 0 40 100 130 150 Total distance (disk arm movement) = 280 280 280 350 350 350 399 399 399
2. Host A wants to send a large file to Host B. The Path from Host A to Host B has three sequential link rates, R1 = 200 kbps, R2 = 2Mbps & R3 = 1 Mbps. a. What is the Throughput rate for the file transfer assuming there is no other traffic in the network? b. How long will it take to transfer the file (4 million bytes) to host B? c. c) Repeat (a) and (b) with R2 = 100 kbps?
Consider a disk subjected to I/O requests arriving (following Poisson distribution) at an average rate of requests/second. Assume that on average, there were 5 requests waiting for service in the queue and that each request waits in the queue for about 10 milliseconds, on average. What is the effective arrival rate for this disk?
research a criminal case where digital evidence obtained from a network/internet was used to help reach a verdict. Give a brief summary of the case and describe how they impact the digital evidence had. Student Replies: How could errors in the chain-of-custody affect the admissibility of the evidence (e.g. Hashing the files pulled from a network stream.
5
Give some details of how you might augment the sliding window protocol with flow control by having ACKs carry additional information that reduces the SWS as the receiver runs out of buffer space. Illustrate your protocol with a timeline for a transmission; assume the initial SWS and RWS are 4, the link speed is instantaneous, and the receiver can free buffers at the rate of one per second (i.e., the receiver is the bottleneck). Show what happens at T = 0, T = 1,...,T = 4 seconds.
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)b.) Assume a cache rate of 45% on the information received by the user in Madagascar from the Tokyo server. How does this affect your answer in a? Show your work.