Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Consider a P2P multicast tree that consists of N nodes. Suppose the tree is balanced (i.e., the depths of the leaf nodes never differ by

image text in transcribed
Consider a P2P multicast tree that consists of N nodes. Suppose the tree is balanced (i.e., the depths of the leaf nodes never differ by more than 1), and the tree fanout is M i.e., every internal node has M children). Every node has the same upload capacity C, and every link connecting two nodes has the same latency L. Let B be the chunk size. (a) Suppose there is no congestion-induced queueing delay. So the streaming delay consists of two components: node transmission) delay, and link (propagation) delay, what is the maxi- mum streaming delay over all the nodes in this tree? (b) Let N = 1000, C = 1 Mbps, B = 20 kB, L = 50 ms, and M = 5. Which delay component is more significant? (c) Supposing that the less significant delay component can be ignored, what is the optimal fanout M to choose in order to minimize delay? Consider a P2P multicast tree that consists of N nodes. Suppose the tree is balanced (i.e., the depths of the leaf nodes never differ by more than 1), and the tree fanout is M i.e., every internal node has M children). Every node has the same upload capacity C, and every link connecting two nodes has the same latency L. Let B be the chunk size. (a) Suppose there is no congestion-induced queueing delay. So the streaming delay consists of two components: node transmission) delay, and link (propagation) delay, what is the maxi- mum streaming delay over all the nodes in this tree? (b) Let N = 1000, C = 1 Mbps, B = 20 kB, L = 50 ms, and M = 5. Which delay component is more significant? (c) Supposing that the less significant delay component can be ignored, what is the optimal fanout M to choose in order to minimize delay

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Modern Database Management

Authors: Jeff Hoffer, Ramesh Venkataraman, Heikki Topi

13th Edition Global Edition

1292263350, 978-1292263359

More Books

Students also viewed these Databases questions