UNIVERSITY OF JYVÄSKYLÄ Power-law Networks InBCT 3.2 Peer-to-Peer communication Cheese Factory -project Researcher.

Slides:



Advertisements
Similar presentations
Optimal Resource Discovery Paths of Gnutella2 The IEEE 22nd International Conference on Advanced Information Networking and Applications (AINA 2008)
Advertisements

UNIVERSITY OF JYVÄSKYLÄ Chedar: Peer-to-Peer Middleware Presentation for 8 th International Workshop on Java tm for Parallel and Distributed Computing.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery in P2P Networks Using Evolutionary Neural Networks Presentation for International Conference on Advances in.
UNIVERSITY OF JYVÄSKYLÄ New Topology Management Algorithms for Unstructured P2P Networks Presentation for The Second International Workshop on P2P Systems.
Complex Networks Advanced Computer Networks: Part1.
1 Analyzing Kleinberg’s Small-world Model Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
Analysis and Modeling of Social Networks Foudalis Ilias.
The Connectivity and Fault-Tolerance of the Internet Topology
UNIVERSITY OF JYVÄSKYLÄ Building NeuroSearch – Intelligent Evolutionary Search Algorithm For Peer-to-Peer Environment Master’s Thesis by Joni Töyrylä
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
Exp. vs. Scale-Free Poisson distribution Exponential Network Power-law distribution Scale-free Network.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
Peer-to-Peer Networks as a Distribution and Publishing Model Jorn De Boever (june 14, 2007)
Network Topology Julian Shun. On Power-Law Relationships of the Internet Topology (Faloutsos 1999) Observes that Internet graphs can be described by “power.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Network Design IS250 Spring 2010 John Chuang. 2 Questions  What does the Internet look like? -Why do we care?  Are there any structural invariants?
Mapping the Internet Topology Via Multiple Agents.
UNIVERSITY OF JYVÄSKYLÄ Chedar P2P platform InBCT 3.2 Peer-to-Peer communication Cheese Factory -project Research Assistant.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
UNIVERSITY OF JYVÄSKYLÄ InBCT 3.2 Peer-to-Peer communication/computation Cheese Factory -project Prof., D.Sc. (EE)
UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Using Neural Networks Presentation for IEEE Congress on Evolutionary Computing.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
UNIVERSITY OF JYVÄSKYLÄ Distributed computing in peer-to-peer environment InBCT 3.2 Peer-to-Peer communication Cheese Factory -project
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
UNIVERSITY OF JYVÄSKYLÄ Peer-to-Peer Algorithms and Prototypes in Jyväskylä Mikko Vapa, research student Department of Mathematical Information.
On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.
Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery in Unstructured P2P Networks Distributed Systems Research Seminar on Mikko Vapa, research student.
UNIVERSITY OF JYVÄSKYLÄ Topology Management Algorithms in Chedar InBCT 3.2 Peer-to-Peer communication Cheese Factory -project
UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Distributed Systems Research Seminar on Annemari Auvinen, Research Student.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
Damian Gordon.  When we hook up computers together using data communication facilities, we call this a computer network.
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
1 Wide Area Network. 2 What is a WAN? A wide area network (WAN ) is a data communications network that covers a relatively broad geographic area and that.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Information Networks Power Laws and Network Models Lecture 3.
Social Networking and On-Line Communities: Classification and Research Trends Maria Ioannidou, Eugenia Raptotasiou, Ioannis Anagnostopoulos.
Computer Networks All you need to know. What is a computer network? Two or more computers connected together so that they can communicate with each other.
Chapter 12 Computer Networks. Basic Concepts in Computer Networking – Communication Links – Figure 12.1a –Two Forms of Information Representation (a)
ROUTING ALGORITHMS IN AD HOC NETWORKS
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
1 3 Computing System Fundamentals 3.4 Networked Computer Systems.
Efficient Labeling Scheme for Scale-Free Networks The scheme in detailsPerformance of the scheme First we fix the number of hubs (to O(log(N))) and show.
Lecture 1-5 Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas.
Lecture 17 November 8Intra-domain routing November 13Internet routing 1 November 15Internet routing 2 November 20End-to-end protocols 1 November 22End-to-end.
Lecture (Mar 23, 2000) H/W Assignment 3 posted on Web –Due Tuesday March 28, 2000 Review of Data packets LANS WANS.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
Networking And their components. What is Networking? In it’s simplest term, networking is when two or more things are able to communicate and understand.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
Higher Computing Networking. Networking – Local Area Networks.
An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.
Bruce Hammer, Steve Wallis, Raymond Ho
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Unit 3, Lesson 6 Types of Network Topologies AOIT Computer Networking Copyright © 2008–2013 National Academy Foundation. All rights reserved.
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
1 Most important algorithms! Routing Algorithms Properties Shortest Path Routing Flooding Distance Vector Routing Link State routing Hierarchical routing.
Ad-hoc Networks.
Peer-to-Peer and Social Networks Fall 2017
Department of Computer Science University of York
Researcher M.Sc. Mikko Vapa University of Jyväskylä
Degree Distributions.
Presentation transcript:

UNIVERSITY OF JYVÄSKYLÄ Power-law Networks InBCT 3.2 Peer-to-Peer communication Cheese Factory -project Researcher M.Sc. Mikko Vapa University of Jyväskylä Agora Center

Highway map Flight map

UNIVERSITY OF JYVÄSKYLÄ 2002 Maps and their route distribution Highway routes follow normal distribution: But because of hubs like Helsinki flight routes have different characteristics. This structure is called power-law distribution: γ = degree exponent

UNIVERSITY OF JYVÄSKYLÄ 2002 Power-law structured network Power-law network of 50 nodes Nodes 1, 2, 3 and 4 are the most visible hubs

UNIVERSITY OF JYVÄSKYLÄ 2002 History of Power-law Networks Despite that power-law networks have been out there since life was born they were just recently discovered (in 1999 World Wide Web was found to be a power-law network) In a short time many other network maps were found to follow power-law distribution: –Internet routers and cables –Social networks (only 6 hops between any people in the world) –Companies (Nokia as a hub with many small subcontractors) –Molecules and chemical reactions in living organisms (H 2 O, ATP, ADP and CO 2 molecules as hubs) –Peer-to-peer networks (Gnutella diagnosed as the first one) During years researchers came into a conclusion that this structure is universal and dominates all forms of life and organisation in complex systems and societies

UNIVERSITY OF JYVÄSKYLÄ 2002 Characteristics of Power-law network Fault-tolerant meaning that no matter how many nodes fail the network stays connected Short network distance between any node in the network meaning that searching can be done efficiently Still unclear: –How do these networks emerge? research on evolution of networks is needed –What is the most efficient way to search these networks? new search algorithms are needed Reference: Barabási, A.-L., ”Linked – The New Science of Networks”, Perseus Publishing, 2002