CNT 4713 Lecture Notes - Lecture 6: Cogeco Peer 1, Network Congestion, Hypertext Transfer Protocol
Document Summary
Max because we care about how fast things can be not how slow. Peers are assigned an id form 0 to (2^n)-1. Hash the original key to a key in the same range key = hash(original key) Assign key-value pairs to peers rule: assign key-value pair to the peer that has the closest id. convention: closest is the immediate successor of the key. e. g. , id space {0,1,2,3, ,63} suppose 8 peers: 1,12,13,25,32,40,48,60. If key = 51, then assigned to peer 48. If key = 60, then assigned to peer 60. If key = 61, then assigned to peer 1 (each key in circle so depending on position attribute corresponding peer) Peer 4 detects peer 5"s departure; makes 8 its immediate successor. 4 asks 8 who its immediate successor is; makes 8"s immediate successor its second successor. Each peer knows address of its two successors. Each peer periodically pings its two successors to check aliveness.
