This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2 RTT : HTML le d 3 3 e (2 RTT ) : 3 objects, 3 at a time 4 RTT c) Persistent w/ pipelining: 2 RTT : HTML le RTT : all 3 requests sent together 3 RTT d) Persistent w/o pipelining: 2 RTT : HTML le 3 RTT : 3 objects, requested 1 at a time 5 RTT 20. Initially, the query is sent to all N neighbors. On every successive step, only N-1 queries are forwarded, because we exclude the host that sent the last query. This proceeds for K-1 steps (when the count is exhausted). Therefore, the number of messages at each step is N ( N-1) i , and the total number is K-1 i =0 N ( N-1) i = N (( N-1) K-1) N-2 1...
View Full Document
- Spring '09