Hyperbolic Traffic Load Centrality for Large-Scale Complex Communications Networks

Size: px
Start display at page:

Download "Hyperbolic Traffic Load Centrality for Large-Scale Complex Communications Networks"

Transcription

1 ICT 2016: 23 rd International Conference on Telecommunications Hyperbolic Traffic Load Centrality for Large-Scale Complex Communications Networks National Technical University of Athens (NTUA) School of Electrical & Computer Engineering Network Management & Optimal Design Lab (NETMODE) Eleni Stai, Konstantinos Sotiropoulos, Vasileios Karyotis and Symeon Papavassiliou Thessaloniki Greece, Monday, May

2 Outline Motivation, Aims & Contributions More efficient computation of path-based centralities (e.g., TLC, BC) via hyperbolic space network embedding Network Embedding in Hyperbolic Space Hyperbolic Traffic Load Centrality Definition Algorithm Complexity Analysis Numerical Evaluations & Comparisons with Traffic Load Centrality Synthetic Scale-free Graphs Real Graphs Conclusions Bonus results in various parts of the presentation 2

3 Motivation & Aims `Big network data' paradigm: analyze vast network (traffic) data & very large network topologies Converged (complex) future networks: numerous heterogeneous devices all mechanisms operate at very large scales, efficiently and with low complexity Computations of various network analyses efficient and resource-conserving methodologies Example (subject of this work): correctly identify most important nodes for routing operation (e.g., via path-based centralities TLC) improve routing & routing-dependent applications 3

4 Traffic Load Centrality Q. What is Traffic Load Centrality (TLC)? A. TLC: metric for identifying central nodes in terms of the traffic they handle/control with respect to the total network traffic 1. Each node sends a unit amount of some commodity (e.g., traffic) to any other node 2. The commodity is transferred from one node to its neighbor closer (hop-wise) to the destination 3. Commodity is equally divided among more than one possible available relays Originally, TLC uses shortest paths in terms of graph (i.e., hop) distances hard to compute for social networks with millions of nodes 4

5 State-of-the-art & Contribution State-of-the-art Most efficient exact algorithm (time & space) for TLC: Brandes Algorithm (BA) [2],[5] Approximations via sampling pairs of nodes randomly or adaptively for computing TLC Ego-centralities or k-hop centralities Network embedding for approximating graph (hop) distances most suitable space: Hyperbolic Hyperbolic Traffic Load Centrality (HTLC): alternative to TLC, based on network embedding in hyperbolic metric space and greedy routing over hyperbolic coordinates HTLC s twofold advantages: 1. Computation of shortest paths in large social and complex networks is cumbersome Greedy routing over hyperbolic coordinates demands only local knowledge at each node & only geometric space coordinates avoids shortest path computations New routing scheme new centrality metrics, i.e. HTLC (HBC) 2. Scale-free topologies (most social/complex networks of interest): greedy paths in hyperbolic space have approximately the same length as shortest paths! HTLC closely approximates TLC, while reducing computational complexity paper s contribution 5

6 Network Embedding in Hyperbolic Space Key for HTLC: choice of the network embedding algorithm in hyperbolic space Network embedding in hyperbolic space: Assigns hyperbolic coordinates to network nodes Greedy embedding in hyperbolic space ensures 100% success rate of greedy routing every graph has a greedy embedding in hyperbolic space which is not true for the twodimensional Euclidean space suitable for small network topologies with short diameter We employ the Rigel Embedding in this work: suitable for large-scale networks, allows parallelization in computation Rigel embedding is not greedy embedding, i.e., some greedy paths may fail scale-free networks: greedy routing based on hyperbolic coordinates/distances achieves a success rate close to 100% 6

7 Rigel Network Embedding in Hyperbolic Spaces Hyperboloid model of the n-dimensional hyperbolic space Distance function for two points x, y : The Rigel embedding: Multidimensional scaling: L<<N nodes are chosen as landmarks (usually high-degree nodes) Bootstrapping step: hyperbolic coordinates of the landmarks so that the distances between all pairs of landmarks in the Hyperboloid areas as close as possible to matching hop distances in original graph Final step: hyperbolic coordinates of rest of nodes calibrated with respect to fixed landmarks each node's hyperbolic distances to all landmarks are very close to corresponding hop distances in original graph Achieves low distance distortion error & answers to queries for node distances fast Tested for computation of graph & social analysis metrics such as radius, diameter and average path length, closeness centrality, resulting in values very close to the ground truth Not tested for path-based centrality metrics (this paper) 7

8 Hyperbolic Traffic Load Centrality - Definition DEFINITION OF HTLC: Assuming that a) each node sends a unit amount of some commodity (traffic) to each other node, b) from each node (except from the destination) the commodity is equally divided to its neighbors that reduce the hyperbolic distance to the destination, denoted as ``greedy neighbors", HTLC is defined as the total amount of commodity passing through a vertex via these exchanges Algorithmic Approach: Based on Routing Betweenness Centrality for source-oblivious routing 1. Computes a directed acyclic graph (DAG) 2. Collects load dependencies and computes centralities 8

9 Efficient TLC/BC Computation Dependencies Efficient computation of BC (employed for TLC slightly modified): Cubic number of pair-wise dependencies can be aggregated without computing them explicitly where σ(s,t) is the # of shortest paths (SPs) between nodes s, t σ(s,t v) is the # of SPs between nodes s, t that pass through node v One-sided dependencies: It was shown (Brandes, 2001) that The dependency of s on some v can be compiled from dependencies on vertices one edge farther away! BC is computed by iterating over all vertices s computing dependencies in two phases: The first phase is a BFS, in which distances and SP counts from s are determined. The second phase visits all vertices in reverse order of their discovery, i.e. those farthest from s first, to accumulate dependencies 9

10 Hyperbolic Traffic Load Centrality Algorithm (1) This serves at examining the nodes in the correct order when accumulating the load dependencies in Part II. if examining nodes in decreasing order of their hyperbolic distances towards the corresponding destination, a node that is already examined cannot be used again as a greedy neighbor of a next node 10

11 Hyperbolic Traffic Load Centrality Algorithm (2) Brandes for TLC For Comparison Difference in Part I 11

12 HTLC Complexity Analysis Complexity Part I Part II HTLC O(N 2 log N) O(N E ) TLC O(N E ) O(N E ) NOTE: # edges of a connected graph ( E ) N a (a real between (1,2)) Gives complexity of O(N N a ) for Part I of TLC and O(N 2 logn) for Part I of HTLC, where O(N a )>O(N logn). 12

13 Numerical Results on Synthetic Scale-free Graphs (1) Accuracy of approximating TLC with HTCL Time Complexity 13

14 Numerical Results on Synthetic Scale-free Graphs (2) Time Complexity: HTLC is computed at least 1.5 times faster than TLC for dense graphs. at least 2.5 times faster than TLC for less dense graphs. in denser graphs more greedy paths increase the computational time needed for Part II of HTLC restrict the number of greedy paths by considering as possible relays (i.e., greedy neighbors) only those neighbors of a node that reduce the hyperbolic distance to the destination more than a specified threshold (current work) Accuracy: HTLC achieves a precision of at least equal to 65%, while reaching up to 100%. # nodes of the network does not affect precision Expected behavior for scale-free topologies that exhibit hidden hyperbolic structure Lower precision in small-world and random graphs 14

15 Numerical Results on Real Graphs (1) Accuracy of approximating TLC with HTCL Time Complexity 15

16 Numerical Results on Real Graphs (2) RMSE: Measures fit to the power-law distribution of each real data set, i.e., how close it is to a scale-free graph HTLC improves computational time vs. TLC from 1.2 times (fb\_combined) to 4.1 times (as-caida ) for k>7 the precision achieved is over 57% for all data sets Note: High precision achieved for all data sets except from CA-Hepth For the CA-Hepth data set the power-law distribution does not provide a good fit (RMSE column) 16

17 In this paper: Summary Future Work Introduced HTLC metric for determining central nodes in a complex network when greedy routing in hyperbolic space is applied Proposed algorithm for computing HTLC, studied its complexity comparing it with TLC Shown improvement in computational complexity in favor of HTLC and high precision values achieved when approximating TLC for graphs with the scale-free property Ongoing work: Betweenness centrality variant on hyperbolic space, using greedy routing Study different embedding types and their impact on routing and metrics computations (i.e., accuracy) Develop a framework for path-based metrics computation & adaptive routing based on the above 17

18 Scale-free graphs Alleviating Routing Congestion under Hyperbolic Embedding (1) Left graph: TLC similar to the power-law distribution Right graph: HTLC Node 1: hub node Node 35: low-degree node Choosing node 35 balances better traffic load among nodes decongest the core of the scalefree network Dynamically transfer load congestion via simple distributed operations, towards nodes with lower degree in case of congestion at high-degree nodes 18

19 Example on random graphs Alleviating Routing Congestion under Greedy Hyperbolic Embedding (2) TLC: almost uniform HTLC under greedy embedding: nodes with significant higher HTLC values appear (the root and its neighbors) similar to TLC/HTLC for scale-free graphs (third graph) Possibility to drive traffic load towards nodes with less congestion Note!!! Such capability of dynamically alleviating routing congestion, emerge only under greedy embedding with minimum-depth spanning tree, not with the Rigel embedding 19

20 Thank you for your attention!??? Questions??? 20

Topology Enhancement in Wireless Multihop Networks: A Top-down Approach

Topology Enhancement in Wireless Multihop Networks: A Top-down Approach Topology Enhancement in Wireless Multihop Networks: A Top-down Approach Symeon Papavassiliou (joint work with Eleni Stai and Vasileios Karyotis) National Technical University of Athens (NTUA) School of

More information

Big Data Clustering via Community Detection and Hyperbolic Network Embedding in IoT Applications

Big Data Clustering via Community Detection and Hyperbolic Network Embedding in IoT Applications sensors Article Big Data Clustering via Community Detection and Hyperbolic Network Embedding in IoT Applications Vasileios Karyotis 1, *,, Konstantinos Tsitseklis 1,, Konstantinos Sotiropoulos 1,2, and

More information

Fast and Scalable Analysis of Massive Social Graphs

Fast and Scalable Analysis of Massive Social Graphs Fast and Scalable Analysis of Massive Social Graphs Xiaohan Zhao, Alessandra Sala, Haitao Zheng and Ben Y. Zhao Department of Computer Science, U. C. Santa Barbara, Santa Barbara, CA USA {xiaohanzhao,

More information

Info 2950, Lecture 16

Info 2950, Lecture 16 Info 2950, Lecture 16 28 Mar 2017 Prob Set 5: due Fri night 31 Mar Breadth first search (BFS) and Depth First Search (DFS) Must have an ordering on the vertices of the graph. In most examples here, the

More information

Routing Outline. EECS 122, Lecture 15

Routing Outline. EECS 122, Lecture 15 Fall & Walrand Lecture 5 Outline EECS, Lecture 5 Kevin Fall kfall@cs.berkeley.edu Jean Walrand wlr@eecs.berkeley.edu Definition/Key Questions Distance Vector Link State Comparison Variations EECS - Fall

More information

From Routing to Traffic Engineering

From Routing to Traffic Engineering 1 From Routing to Traffic Engineering Robert Soulé Advanced Networking Fall 2016 2 In the beginning B Goal: pair-wise connectivity (get packets from A to B) Approach: configure static rules in routers

More information

Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning

Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning Brad Karp Berkeley, CA bkarp@icsi.berkeley.edu DIMACS Pervasive Networking Workshop 2 May, 2 Motivating Examples Vast

More information

Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks

Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department RPI Mobile Wireless Networks Wireless nodes

More information

Edge Weight Method for Community Detection in Scale-Free Networks

Edge Weight Method for Community Detection in Scale-Free Networks Edge Weight Method for Community Detection in Scale-Free Networks Sorn Jarukasemratana Tsuyoshi Murata Tokyo Institute of Technology WIMS'14 June 2-4, 2014 - Thessaloniki, Greece Modularity High modularity

More information

Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen

Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen University of Copenhagen Outline Motivation and Background Minimum-Weight Spanner Problem Greedy Spanner Algorithm Exact Algorithm:

More information

Performance Study of Routing Algorithms for LEO Satellite Constellations

Performance Study of Routing Algorithms for LEO Satellite Constellations Performance Study of Routing Algorithms for LEO Satellite Constellations Ioannis Gragopoulos, Evangelos Papapetrou, Fotini-Niovi Pavlidou Aristotle University of Thessaloniki, School of Engineering Dept.

More information

Flat Routing on Curved Spaces

Flat Routing on Curved Spaces Flat Routing on Curved Spaces Dmitri Krioukov (CAIDA/UCSD) dima@caida.org Berkeley April 19 th, 2006 Clean slate: reassess fundamental assumptions Information transmission between nodes in networks that

More information

Figure (5) Kohonen Self-Organized Map

Figure (5) Kohonen Self-Organized Map 2- KOHONEN SELF-ORGANIZING MAPS (SOM) - The self-organizing neural networks assume a topological structure among the cluster units. - There are m cluster units, arranged in a one- or two-dimensional array;

More information

Virtual Network Embedding with Substrate Support for Parallelization

Virtual Network Embedding with Substrate Support for Parallelization Virtual Network Embedding with Substrate Support for Parallelization Sheng Zhang, Nanjing University, P.R. China Jie Wu, Temple University, USA Sanglu Lu, Nanjing University, P.R. China Presenter: Pouya

More information

Load Balanced Short Path Routing in Wireless Networks Jie Gao, Stanford University Li Zhang, Hewlett-Packard Labs

Load Balanced Short Path Routing in Wireless Networks Jie Gao, Stanford University Li Zhang, Hewlett-Packard Labs Load Balanced Short Path Routing in Wireless Networks Jie Gao, Stanford University Li Zhang, Hewlett-Packard Labs Aravind Ranganathan University of Cincinnati February 22, 2007 Motivation Routing in wireless

More information

Structured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov

Structured Light II. Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Structured Light II Johannes Köhler Johannes.koehler@dfki.de Thanks to Ronen Gvili, Szymon Rusinkiewicz and Maks Ovsjanikov Introduction Previous lecture: Structured Light I Active Scanning Camera/emitter

More information

We noticed that the trouble is due to face routing. Can we ignore the real coordinates and use virtual coordinates for routing?

We noticed that the trouble is due to face routing. Can we ignore the real coordinates and use virtual coordinates for routing? Geographical routing in practice We noticed that the trouble is due to face routing. Is greedy routing robust to localization noise? Can we ignore the real coordinates and use virtual coordinates for routing?

More information

TELCOM2125: Network Science and Analysis

TELCOM2125: Network Science and Analysis School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 Figures are taken from: M.E.J. Newman, Networks: An Introduction 2

More information

Approximately Uniform Random Sampling in Sensor Networks

Approximately Uniform Random Sampling in Sensor Networks Approximately Uniform Random Sampling in Sensor Networks Boulat A. Bash, John W. Byers and Jeffrey Considine Motivation Data aggregation Approximations to COUNT, SUM, AVG, MEDIAN Existing work does not

More information

3D Computer Vision. Structured Light II. Prof. Didier Stricker. Kaiserlautern University.

3D Computer Vision. Structured Light II. Prof. Didier Stricker. Kaiserlautern University. 3D Computer Vision Structured Light II Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de 1 Introduction

More information

Data Communication. Guaranteed Delivery Based on Memorization

Data Communication. Guaranteed Delivery Based on Memorization Data Communication Guaranteed Delivery Based on Memorization Motivation Many greedy routing schemes perform well in dense networks Greedy routing has a small communication overhead Desirable to run Greedy

More information

Graph Algorithms. Many problems in networks can be modeled as graph problems.

Graph Algorithms. Many problems in networks can be modeled as graph problems. Graph Algorithms Many problems in networks can be modeled as graph problems. - The topology of a distributed system is a graph. - Routing table computation uses the shortest path algorithm - Efficient

More information

Brocade: Landmark Routing on Peer to Peer Networks. Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz

Brocade: Landmark Routing on Peer to Peer Networks. Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz Brocade: Landmark Routing on Peer to Peer Networks Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz State of the Art Routing High dimensionality and coordinate-based P2P routing Decentralized

More information

Geometric data structures:

Geometric data structures: Geometric data structures: Machine Learning for Big Data CSE547/STAT548, University of Washington Sham Kakade Sham Kakade 2017 1 Announcements: HW3 posted Today: Review: LSH for Euclidean distance Other

More information

SILC: Efficient Query Processing on Spatial Networks

SILC: Efficient Query Processing on Spatial Networks Hanan Samet hjs@cs.umd.edu Department of Computer Science University of Maryland College Park, MD 20742, USA Joint work with Jagan Sankaranarayanan and Houman Alborzi Proceedings of the 13th ACM International

More information

Scalable overlay Networks

Scalable overlay Networks overlay Networks Dr. Samu Varjonen 1 Lectures MO 15.01. C122 Introduction. Exercises. Motivation. TH 18.01. DK117 Unstructured networks I MO 22.01. C122 Unstructured networks II TH 25.01. DK117 Bittorrent

More information

Overlay and P2P Networks. Unstructured networks. PhD. Samu Varjonen

Overlay and P2P Networks. Unstructured networks. PhD. Samu Varjonen Overlay and P2P Networks Unstructured networks PhD. Samu Varjonen 25.1.2016 Contents Unstructured networks Last week Napster Skype This week: Gnutella BitTorrent P2P Index It is crucial to be able to find

More information

Local Algorithms for Sparse Spanning Graphs

Local Algorithms for Sparse Spanning Graphs Local Algorithms for Sparse Spanning Graphs Reut Levi Dana Ron Ronitt Rubinfeld Intro slides based on a talk given by Reut Levi Minimum Spanning Graph (Spanning Tree) Local Access to a Minimum Spanning

More information

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing

More information

Basic Switch Organization

Basic Switch Organization NOC Routing 1 Basic Switch Organization 2 Basic Switch Organization Link Controller Used for coordinating the flow of messages across the physical link of two adjacent switches 3 Basic Switch Organization

More information

Centrality in Large Networks

Centrality in Large Networks Centrality in Large Networks Mostafa H. Chehreghani May 14, 2017 Table of contents Centrality notions Exact algorithm Approximate algorithms Conclusion Centrality notions Exact algorithm Approximate algorithms

More information

CS521 \ Notes for the Final Exam

CS521 \ Notes for the Final Exam CS521 \ Notes for final exam 1 Ariel Stolerman Asymptotic Notations: CS521 \ Notes for the Final Exam Notation Definition Limit Big-O ( ) Small-o ( ) Big- ( ) Small- ( ) Big- ( ) Notes: ( ) ( ) ( ) ( )

More information

Pregel. Ali Shah

Pregel. Ali Shah Pregel Ali Shah s9alshah@stud.uni-saarland.de 2 Outline Introduction Model of Computation Fundamentals of Pregel Program Implementation Applications Experiments Issues with Pregel 3 Outline Costs of Computation

More information

Chapter 8 DOMINATING SETS

Chapter 8 DOMINATING SETS Chapter 8 DOMINATING SETS Distributed Computing Group Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking

More information

GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks. Stanford University. HP Labs

GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks. Stanford University. HP Labs GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks Qing Fang Jie Gao Leonidas J. Guibas Vin de Silva Li Zhang Stanford University HP Labs Point-to-Point Routing in Sensornets Routing

More information

Network Design for QoS under IEEE ( Zigbee ) CSMA/CA for Internet of Things Applications

Network Design for QoS under IEEE ( Zigbee ) CSMA/CA for Internet of Things Applications Network Design for QoS under IEEE 802.15.4 ( Zigbee ) CSMA/CA for Internet of Things Applications EECS Symposium Abhijit Bhattacharya Advisor: Prof. Anurag Kumar Dept. of ECE, IISc, Bangalore April 28,

More information

Low-cost Enhancement of the Intra-domain Internet Robustness Against Intelligent Node Attacks

Low-cost Enhancement of the Intra-domain Internet Robustness Against Intelligent Node Attacks Low-cost Enhancement of the Intra-domain Internet Robustness Against Intelligent Node Attacks Panagiotis Pantazopoulos Ioannis Stavrakakis Department of Informatics and Telecommunications, Advanced Networking

More information

Review for Midterm Exam

Review for Midterm Exam Review for Midterm Exam 1 Policies and Overview midterm exam policies overview of problems, algorithms, data structures overview of discrete mathematics 2 Sample Questions on the cost functions of algorithms

More information

Chapter 8 DOMINATING SETS

Chapter 8 DOMINATING SETS Distributed Computing Group Chapter 8 DOMINATING SETS Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking

More information

TELCOM2125: Network Science and Analysis

TELCOM2125: Network Science and Analysis School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 Figures are taken from: M.E.J. Newman, Networks: An Introduction 2

More information

Novel Cluster Based Routing Protocol in Wireless Sensor Networks

Novel Cluster Based Routing Protocol in Wireless Sensor Networks ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 32 Novel Cluster Based Routing Protocol in Wireless Sensor Networks Bager Zarei 1, Mohammad Zeynali 2 and Vahid Majid Nezhad 3 1 Department of Computer

More information

Graph Algorithms. Many problems in networks can be modeled as graph problems.

Graph Algorithms. Many problems in networks can be modeled as graph problems. Graph Algorithms Graph Algorithms Many problems in networks can be modeled as graph problems. - The topology of a distributed system is a graph. - Routing table computation uses the shortest path algorithm

More information

Geographic Routing in Simulation: GPSR

Geographic Routing in Simulation: GPSR Geographic Routing in Simulation: GPSR Brad Karp UCL Computer Science CS M038/GZ06 23 rd January 2013 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops

More information

Bandwidth Aware Routing Algorithms for Networks-on-Chip

Bandwidth Aware Routing Algorithms for Networks-on-Chip 1 Bandwidth Aware Routing Algorithms for Networks-on-Chip G. Longo a, S. Signorino a, M. Palesi a,, R. Holsmark b, S. Kumar b, and V. Catania a a Department of Computer Science and Telecommunications Engineering

More information

What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals

What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting

More information

Efficient Cluster Based Data Collection Using Mobile Data Collector for Wireless Sensor Network

Efficient Cluster Based Data Collection Using Mobile Data Collector for Wireless Sensor Network ISSN (e): 2250 3005 Volume, 06 Issue, 06 June 2016 International Journal of Computational Engineering Research (IJCER) Efficient Cluster Based Data Collection Using Mobile Data Collector for Wireless Sensor

More information

Interconnection networks

Interconnection networks Interconnection networks When more than one processor needs to access a memory structure, interconnection networks are needed to route data from processors to memories (concurrent access to a shared memory

More information

Overlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma

Overlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma Overlay and P2P Networks Unstructured networks Prof. Sasu Tarkoma 19.1.2015 Contents Unstructured networks Last week Napster Skype This week: Gnutella BitTorrent P2P Index It is crucial to be able to find

More information

On Graph Query Optimization in Large Networks

On Graph Query Optimization in Large Networks On Graph Query Optimization in Large Networks Peixiang Zhao, Jiawei Han Department of omputer Science University of Illinois at Urbana-hampaign pzhao4@illinois.edu, hanj@cs.uiuc.edu September 14th, 2010

More information

Achieving Efficient Bandwidth Utilization in Wide-Area Networks While Minimizing State Changes

Achieving Efficient Bandwidth Utilization in Wide-Area Networks While Minimizing State Changes 1 Achieving Efficient Bandwidth Utilization in Wide-Area Networks While Minimizing State Changes 2 WAN Traffic Engineering Maintaining private WAN infrastructure is expensive Must balance latency-sensitive

More information

Coriolis: Scalable VM Clustering in Clouds

Coriolis: Scalable VM Clustering in Clouds 1 / 21 Coriolis: Scalable VM Clustering in Clouds Daniel Campello 1 Carlos Crespo 1 Akshat Verma 2 RajuRangaswami 1 Praveen Jayachandran 2 1 School of Computing and Information Sciences

More information

Regional Gossip Routing for Wireless Ad Hoc Networks

Regional Gossip Routing for Wireless Ad Hoc Networks Mobile Networks and Applications 10, 61 77, 2005 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands. Regional Gossip Routing for Wireless Ad Hoc Networks XIANG-YANG LI, KOUSHA

More information

CS 457 Networking and the Internet. What is Routing. Forwarding versus Routing 9/27/16. Fall 2016 Indrajit Ray. A famous quotation from RFC 791

CS 457 Networking and the Internet. What is Routing. Forwarding versus Routing 9/27/16. Fall 2016 Indrajit Ray. A famous quotation from RFC 791 CS 457 Networking and the Internet Fall 2016 Indrajit Ray What is Routing A famous quotation from RFC 791 A name indicates what we seek An address indicates where it is A route indicates how we get there

More information

13: Betweenness Centrality

13: Betweenness Centrality 13: Betweenness Centrality Machine Learning and Real-world Data Ann Copestake and Simone Teufel Computer Laboratory University of Cambridge Lent 2017 Last session: some simple network statistics You measured

More information

CS BGP v4. Fall 2014

CS BGP v4. Fall 2014 CS 457 - BGP v4 Fall 2014 Autonomous Systems What is an AS? a set of routers under a single technical administration uses an interior gateway protocol (IGP) and common metrics to route packets within the

More information

Quality of Service Routing. Anunay Tiwari Anirudha Sahoo

Quality of Service Routing. Anunay Tiwari Anirudha Sahoo Quality of Service Routing Anunay Tiwari Anirudha Sahoo Motivation Real time applications like audio and video conferencing, VoIP requires QoS from the Internet to have satisfactory performance. Internet

More information

Graph Clarity, Simplification, & Interaction

Graph Clarity, Simplification, & Interaction Graph Clarity, Simplification, & Interaction http://i.imgur.com/cw19ibr.jpg https://www.reddit.com/r/cablemanagement/ Today Today s Reading: Lombardi Graphs Bezier Curves Today s Reading: Clustering/Hierarchical

More information

Fractional Cascading in Wireless. Jie Gao Computer Science Department Stony Brook University

Fractional Cascading in Wireless. Jie Gao Computer Science Department Stony Brook University Fractional Cascading in Wireless Sensor Networks Jie Gao Computer Science Department Stony Brook University 1 Sensor Networks Large number of small devices for environment monitoring 2 My recent work Lightweight,

More information

A Scalable Content- Addressable Network

A Scalable Content- Addressable Network A Scalable Content- Addressable Network In Proceedings of ACM SIGCOMM 2001 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Presented by L.G. Alex Sung 9th March 2005 for CS856 1 Outline CAN basics

More information

Fairness Example: high priority for nearby stations Optimality Efficiency overhead

Fairness Example: high priority for nearby stations Optimality Efficiency overhead Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency

More information

Outline. Graphs. Divide and Conquer.

Outline. Graphs. Divide and Conquer. GRAPHS COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming Challenges books. Outline Graphs.

More information

Graphs. Tessema M. Mengistu Department of Computer Science Southern Illinois University Carbondale Room - Faner 3131

Graphs. Tessema M. Mengistu Department of Computer Science Southern Illinois University Carbondale Room - Faner 3131 Graphs Tessema M. Mengistu Department of Computer Science Southern Illinois University Carbondale tessema.mengistu@siu.edu Room - Faner 3131 1 Outline Introduction to Graphs Graph Traversals Finding a

More information

Layer 3: Network Layer. 9. Mar INF-3190: Switching and Routing

Layer 3: Network Layer. 9. Mar INF-3190: Switching and Routing Layer 3: Network Layer 9. Mar. 2005 1 INF-3190: Switching and Routing Network Layer Goal Enable data transfer from end system to end system End systems Several hops, (heterogeneous) subnetworks Compensate

More information

Implementation of Near Optimal Algorithm for Integrated Cellular and Ad-Hoc Multicast (ICAM)

Implementation of Near Optimal Algorithm for Integrated Cellular and Ad-Hoc Multicast (ICAM) CS230: DISTRIBUTED SYSTEMS Project Report on Implementation of Near Optimal Algorithm for Integrated Cellular and Ad-Hoc Multicast (ICAM) Prof. Nalini Venkatasubramanian Project Champion: Ngoc Do Vimal

More information

Models of Network Formation. Networked Life NETS 112 Fall 2017 Prof. Michael Kearns

Models of Network Formation. Networked Life NETS 112 Fall 2017 Prof. Michael Kearns Models of Network Formation Networked Life NETS 112 Fall 2017 Prof. Michael Kearns Roadmap Recently: typical large-scale social and other networks exhibit: giant component with small diameter sparsity

More information

Overlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma

Overlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma Overlay and P2P Networks Unstructured networks Prof. Sasu Tarkoma 20.1.2014 Contents P2P index revisited Unstructured networks Gnutella Bloom filters BitTorrent Freenet Summary of unstructured networks

More information

Primitives for Active Internet Topology Mapping: Toward High-Frequency Characterization

Primitives for Active Internet Topology Mapping: Toward High-Frequency Characterization Primitives for Active Internet Topology Mapping: Toward High-Frequency Characterization Robert Beverly, Arthur Berger, Geoffrey Xie Naval Postgraduate School MIT/Akamai February 9, 2011 CAIDA Workshop

More information

Motivation. The Impact of DHT Routing Geometry on Resilience and Proximity. Different components of analysis. Approach:Component-based analysis

Motivation. The Impact of DHT Routing Geometry on Resilience and Proximity. Different components of analysis. Approach:Component-based analysis The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Karthik Lakshminarayanan at P2P Systems class (Slides liberally borrowed from Krishna s SIGCOMM talk) Krishna Gummadi, Ramakrishna

More information

The Impact of DHT Routing Geometry on Resilience and Proximity. Acknowledgement. Motivation

The Impact of DHT Routing Geometry on Resilience and Proximity. Acknowledgement. Motivation The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Noorullah Moghul Krishna Gummadi, Ramakrishna Gummadi, Sylvia Ratnasamy, Steve Gribble, Scott Shenker, Ion Stoica Acknowledgement

More information

A LOAD-BASED APPROACH TO FORMING A CONNECTED DOMINATING SET FOR AN AD HOC NETWORK

A LOAD-BASED APPROACH TO FORMING A CONNECTED DOMINATING SET FOR AN AD HOC NETWORK Clemson University TigerPrints All Theses Theses 8-2014 A LOAD-BASED APPROACH TO FORMING A CONNECTED DOMINATING SET FOR AN AD HOC NETWORK Raihan Hazarika Clemson University, rhazari@g.clemson.edu Follow

More information

Given a graph, find an embedding s.t. greedy routing works

Given a graph, find an embedding s.t. greedy routing works Given a graph, find an embedding s.t. greedy routing works Greedy embedding of a graph 99 Greedy embedding Given a graph G, find an embedding of the vertices in R d, s.t. for each pair of nodes s, t, there

More information

MST & Shortest Path -Prim s -Djikstra s

MST & Shortest Path -Prim s -Djikstra s MST & Shortest Path -Prim s -Djikstra s PRIM s - Minimum Spanning Tree - A spanning tree of a graph is a tree that has all the vertices of the graph connected by some edges. - A graph can have one or more

More information

CS 498 Hot Topics in High Performance Computing. Networks and Fault Tolerance. 9. Routing and Flow Control

CS 498 Hot Topics in High Performance Computing. Networks and Fault Tolerance. 9. Routing and Flow Control CS 498 Hot Topics in High Performance Computing Networks and Fault Tolerance 9. Routing and Flow Control Intro What did we learn in the last lecture Topology metrics Including minimum diameter of directed

More information

Energy aware geographic routing in wireless sensor networks with anchor nodes. Mircea Cretu Stancu Utrecht University Computing Science May 2013

Energy aware geographic routing in wireless sensor networks with anchor nodes. Mircea Cretu Stancu Utrecht University Computing Science May 2013 Energy aware geographic routing in wireless sensor networks with anchor nodes Mircea Cretu Stancu Utrecht University Computing Science May 2013 Overview Introduction Current paradigm EAGR preliminaries

More information

COM-208: Computer Networks - Homework 6

COM-208: Computer Networks - Homework 6 COM-208: Computer Networks - Homework 6. (P22) Suppose you are interested in detecting the number of hosts behind a NAT. You observe that the IP layer stamps an identification number sequentially on each

More information

Outsourcing Privacy-Preserving Social Networks to a Cloud

Outsourcing Privacy-Preserving Social Networks to a Cloud IEEE INFOCOM 2013, April 14-19, Turin, Italy Outsourcing Privacy-Preserving Social Networks to a Cloud Guojun Wang a, Qin Liu a, Feng Li c, Shuhui Yang d, and Jie Wu b a Central South University, China

More information

Optimal network flow allocation

Optimal network flow allocation Optimal network flow allocation EE384Y Project intermediate report Almir Mutapcic and Primoz Skraba Stanford University, Spring 2003-04 May 10, 2004 Contents 1 Introduction 2 2 Background 2 3 Problem statement

More information

Advanced Data Management

Advanced Data Management Advanced Data Management Medha Atre Office: KD-219 atrem@cse.iitk.ac.in Sept 26, 2016 defined Given a graph G(V, E) with V as the set of nodes and E as the set of edges, a reachability query asks does

More information

Networking Sensors, II

Networking Sensors, II Networking Sensors, II Sensing Networking Leonidas Guibas Stanford University Computation CS321 ZG Book, Ch. 3 1 Class Administration Paper presentation preferences due today, by class time Project info

More information

Landmark-based routing

Landmark-based routing Landmark-based routing [Kleinberg04] J. Kleinberg, A. Slivkins, T. Wexler. Triangulation and Embedding using Small Sets of Beacons. Proc. 45th IEEE Symposium on Foundations of Computer Science, 2004. Using

More information

A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks

A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 6, DECEMBER 2000 747 A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks Yuhong Zhu, George N. Rouskas, Member,

More information

Adaptive Routing. Claudio Brunelli Adaptive Routing Institute of Digital and Computer Systems / TKT-9636

Adaptive Routing. Claudio Brunelli Adaptive Routing Institute of Digital and Computer Systems / TKT-9636 1 Adaptive Routing Adaptive Routing Basics Minimal Adaptive Routing Fully Adaptive Routing Load-Balanced Adaptive Routing Search-Based Routing Case Study: Adapted Routing in the Thinking Machines CM-5

More information

Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks

Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Mobile Information Systems 9 (23) 295 34 295 DOI.3233/MIS-364 IOS Press Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Keisuke Goto, Yuya Sasaki, Takahiro

More information

MA/CSSE 473 Day 12. Questions? Insertion sort analysis Depth first Search Breadth first Search. (Introduce permutation and subset generation)

MA/CSSE 473 Day 12. Questions? Insertion sort analysis Depth first Search Breadth first Search. (Introduce permutation and subset generation) MA/CSSE 473 Day 12 Interpolation Search Insertion Sort quick review DFS, BFS Topological Sort MA/CSSE 473 Day 12 Questions? Interpolation Search Insertion sort analysis Depth first Search Breadth first

More information

CS5984 Mobile Computing

CS5984 Mobile Computing CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part II 1 Outline Routing Protocols for Ad hoc Networks DSDV: Highly Dynamic Destination-Sequenced Distance- Vector

More information

Chapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3

Chapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3 Chapter 3 Introduction to Dynamic Routing Protocols CCNA2-1 Chapter 3 Introduction to Dynamic Routing Protocols Introduction to Dynamic Routing Protocols CCNA2-2 Chapter 3 Perspective and Background Dynamic

More information

CS781 Lecture 2 January 13, Graph Traversals, Search, and Ordering

CS781 Lecture 2 January 13, Graph Traversals, Search, and Ordering CS781 Lecture 2 January 13, 2010 Graph Traversals, Search, and Ordering Review of Lecture 1 Notions of Algorithm Scalability Worst-Case and Average-Case Analysis Asymptotic Growth Rates: Big-Oh Prototypical

More information

CS 5220: Parallel Graph Algorithms. David Bindel

CS 5220: Parallel Graph Algorithms. David Bindel CS 5220: Parallel Graph Algorithms David Bindel 2017-11-14 1 Graphs Mathematically: G = (V, E) where E V V Convention: V = n and E = m May be directed or undirected May have weights w V : V R or w E :

More information

AODV-PA: AODV with Path Accumulation

AODV-PA: AODV with Path Accumulation -PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications

More information

Latent Space Model for Road Networks to Predict Time-Varying Traffic. Presented by: Rob Fitzgerald Spring 2017

Latent Space Model for Road Networks to Predict Time-Varying Traffic. Presented by: Rob Fitzgerald Spring 2017 Latent Space Model for Road Networks to Predict Time-Varying Traffic Presented by: Rob Fitzgerald Spring 2017 Definition of Latent https://en.oxforddictionaries.com/definition/latent Latent Space Model?

More information

Graph Algorithms using Map-Reduce. Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web

Graph Algorithms using Map-Reduce. Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web Graph Algorithms using Map-Reduce Graphs are ubiquitous in modern society. Some examples: The hyperlink structure of the web Graph Algorithms using Map-Reduce Graphs are ubiquitous in modern society. Some

More information

CS644 Advanced Networks

CS644 Advanced Networks Outline CS644 Advanced Networks Lecture 9 Intra Domain Routing Andreas Terzis Spring 2004 1 So far we have talked about E2E mechanisms Routing is the other big component of the network Largest distributed

More information

Lesson 4. Random graphs. Sergio Barbarossa. UPC - Barcelona - July 2008

Lesson 4. Random graphs. Sergio Barbarossa. UPC - Barcelona - July 2008 Lesson 4 Random graphs Sergio Barbarossa Graph models 1. Uncorrelated random graph (Erdős, Rényi) N nodes are connected through n edges which are chosen randomly from the possible configurations 2. Binomial

More information

FIST: A Fast, Lightweight, FPGA-Friendly Packet Latency Estimator for NoC Modeling in Full-System Simulations

FIST: A Fast, Lightweight, FPGA-Friendly Packet Latency Estimator for NoC Modeling in Full-System Simulations FIST: A Fast, Lightweight, FPGA-Friendly Packet Latency Estimator for oc Modeling in Full-System Simulations Michael K. Papamichael, James C. Hoe, Onur Mutlu papamix@cs.cmu.edu, jhoe@ece.cmu.edu, onur@cmu.edu

More information

BGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University

BGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables

More information

Rumor Routing Algorithm

Rumor Routing Algorithm Aleksi.Ahtiainen@hut.fi T-79.194 Seminar on Theoretical Computer Science Feb 9 2005 Contents Introduction The Algorithm Research Results Future Work Criticism Conclusions Introduction is described in paper:

More information

IP Multicast Technology Overview

IP Multicast Technology Overview IP multicast is a bandwidth-conserving technology that reduces traffic by delivering a single stream of information simultaneously to potentially thousands of businesses and homes. Applications that take

More information

Topology Control in Wireless Networks 4/24/06

Topology Control in Wireless Networks 4/24/06 Topology Control in Wireless Networks 4/4/06 1 Topology control Choose the transmission power of the nodes so as to satisfy some properties Connectivity Minimize power consumption, etc. Last class Percolation:

More information

Interconnection Networks: Routing. Prof. Natalie Enright Jerger

Interconnection Networks: Routing. Prof. Natalie Enright Jerger Interconnection Networks: Routing Prof. Natalie Enright Jerger Routing Overview Discussion of topologies assumed ideal routing In practice Routing algorithms are not ideal Goal: distribute traffic evenly

More information

DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET

DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET S. J. Sultanuddin 1 and Mohammed Ali Hussain 2 1 Department of Computer Science Engineering, Sathyabama University,

More information