Dynamic Hypercube Topology - Distributed Computing Group动态超立方体拓扑的分布式计算组.pptVIP

Dynamic Hypercube Topology Stefan SchmidURAW 2005Upper Rhine Algorithms WorkshopUniversity of Tübingen, Germany Static vs. Dynamic Networks (1) Network graph G=(V,E) V = set of vertices (“nodes”, machines, peers, …) E = set of edges (“connections”, wires, links, pointers, …) “Traditional”, static networks Fixed set of vertices, fixed set of edges E.g., interconnection network of parallel computers Static vs. Dynamic Networks (2) Dynamic networks Set of nodes and/or set of edges is dynamic Here: nodes may join and leave E.g., peer-to-peer (P2P) systems (Napster, Gnutella, …) Dynami