lecture11课件.ppt

Information Networks;What is P2P?;What is P2P?;What is P2P?;What is P2P?;Client/Server Architecture;Client/Server Limitations;P2P Architecture;P2P Network Characteristics;P2P Goals and Benefits;P2P Applications;Information sharing P2P systems;Popular file sharing P2P Systems;Napster;Napster: how does it work;Napster;Napster;Napster;Napster;Napster;Gnutella;Gnutella;Gnutella;Gnutella;Gnutella;Gnutella;Gnutella: strengths and weaknesses;Gnutella: initial problems and fixes;Kazaa (Fasttrack network);Anonymity;Freenet;Freenet routing;Freenet routing;Freenet routing;Freenet routing;Freenet routing;Freenet routing;Freenet routing;Freenet strengths and weaknesses;Unstructured vs Structured P2P;Distributed Hash Tables (DHT);DHT Desirable Properties;DHT Routing Protocols;Basic Approach;Consistent Hashing;Consistent Hashing;Consistent Hashing;Basic Approach Differences;Chord;Chord Finger Table;Chord Key Location;Chord node insertion;Chord Properties;Network locality;Plaxton’s Mesh;Plaxton’s Mesh – Routing Table;Enforcing Network Locality;Enforcing Network Locality;Enforcing Network Locality;Plaxton algorithm: routing;Plaxton algorithm: routing;Plaxton algorithm: routing;Plaxton algorithm: routing;Plaxton algorithm: routing;Pastry: Node Joins;Network Proximity;CAN;CAN Lookup;CAN node insertion;Kleinberg’s small world;Routing in the Small World;Symphony;Viceroy;Viceroy;Viceroy;Viceroy;Viceroy;Viceroy;Viceroy;Viceroy;Viceroy;Viceroy network;Viceroy network;Viceroy network;Butterfly links;Downward links;Upward links;Upward links;Lookup;P2P Review;Issues with P2P;Acknowledgements;References