Relevance of Complex Network Properties Philippe Giabbanelli «Impact of complex network properties on routing in backbone networks» Philippe Giabbanelli,

Slides:



Advertisements
Similar presentations
Capacity Planning IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
Advertisements

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
Approximation, Chance and Networks Lecture Notes BISS 2005, Bertinoro March Alessandro Panconesi University La Sapienza of Rome.
SKIP GRAPHS Slides adapted from the original slides by James Aspnes Gauri Shah.
Traffic Grooming in WDM Ring Networks Presented by: Eshcar Hilel.
Lab 2 Lab 3 Homework Labs 4-6 Final Project Late No Videos Write up
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Towards Virtual Routers as a Service 6th GI/ITG KuVS Workshop on “Future Internet” November 22, 2010 Hannover Zdravko Bozakov.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
GREEN IPTV A Resource and Energy Efficient Network for IPTV.
Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger.
The structure of the Internet. How are routers connected? Why should we care? –While communication protocols will work correctly on ANY topology –….they.
Network Capacity Planning IACT 418 IACT 918 Corporate Network Planning.
1 Maximizing Lifetime of Sensor Surveillance Systems IEEE/ACM TRANSACTIONS ON NETWORKING Authors: Hai Liu, Xiaohua Jia, Peng-Jun Wan, Chih- Wei Yi, S.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.
Traffic Engineering With Traditional IP Routing Protocols
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
ASWP – Ad-hoc Routing with Interference Consideration June 28, 2005.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Computer Science Department Stony Brook University.
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
1 Lecture 25: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) Review session,
Heuristic Algorithms for Multiconstrained Quality-of-Service Routing Xin Yuan, Member, IEEE IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 10, VO. 2, APRIL.
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
A Node-Centric Load Balancing Algorithm for Wireless Sensor Networks Hui Dai, Richar Han Department of Computer Science University of Colorado at Boulder.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
Sensor Network Navigation without Locations Mo Li, Yunhao Liu, Jiliang Wang, and Zheng Yang Department of Computer Science and Engineering Hong Kong University.
Towards Highly Reliable Enterprise Network Services via Inference of Multi-level Dependencies Paramvir Bahl, Ranveer Chandra, Albert Greenberg, Srikanth.
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
Network Aware Resource Allocation in Distributed Clouds.
Separability and Topology Control of Quasi Unit Disk Graphs Philippe Giabbanelli CMPT 880 – Spring 2008.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Performance Evaluation of ATM Shortcuts in Overlaid IP/ATM Networks Jim Kurose Don Towsley Department of Computer Science Univ. of Massachusetts, Amherst.
Glasgow 02/02/04 NN k networks for content-based image retrieval Daniel Heesch.
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
Rotamer Packing Problem: The algorithms Hugo Willy 26 May 2010.
Algorithms for Allocating Wavelength Converters in All-Optical Networks Authors: Goaxi Xiao and Yiu-Wing Leung Presented by: Douglas L. Potts CEG 790 Summer.
Social Network Analysis (1) LING 575 Fei Xia 01/04/2011.
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
Using traveling salesman problem algorithms for evolutionary tree construction Chantal Korostensky and Gaston H. Gonnet Presentation by: Ben Snider.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Complex Networks Measures and deterministic models Philippe Giabbanelli.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Subways: A Case for Redundant, Inexpensive Data Center Edge Links Vincent Liu, Danyang Zhuo, Simon Peter, Arvind Krishnamurthy, Thomas Anderson University.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Challenges in the Next Generation Internet Xin Yuan Department of Computer Science Florida State University
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
Energy Aware Network Operations
Link-Level Internet Structures
Does Topology Control Reduce Interference?
Chapter 4 Data Link Layer Switching
Isabella Cerutti, Andrea Fumagalli, Sonal Sheth
Multi-Core Parallel Routing
Randomized Algorithms CS648
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
Department of Computer Science University of York
2019/9/14 The Deep Learning Vision for Heterogeneous Network Traffic Control Proposal, Challenges, and Future Perspective Author: Nei Kato, Zubair Md.
Presentation transcript:

Relevance of Complex Network Properties Philippe Giabbanelli «Impact of complex network properties on routing in backbone networks» Philippe Giabbanelli, CCNet 2010 (IEEE Globecom)

P. GiabbanelliRelevance of complex network properties1 Outline What can we measure in a network? Finding out what’s useful to measure You know how good something could be: build it! Related work on measures

P. GiabbanelliRelevance of complex network properties2 What can we measure in a network? Example #1: Social networks Property: average distance Measure: distance

P. GiabbanelliRelevance of complex network properties3 What can we measure in a network? Example #2: Obesity map Measure: Centrality

P. GiabbanelliRelevance of complex network properties4 What can we measure in a network? Example #3: Backbone network

P. GiabbanelliRelevance of complex network properties5 What can we measure in a network? NetworkProcessMeasures Social network Disease spread Factors incluencing obesity Obesity level Backbone networkDeploying equipment Average distance Centrality ???

P. GiabbanelliRelevance of complex network properties6 Finding out what’s useful to measure 1 – Modelling the main features ▪ Planar network ▪ There is a request between all pairs ◦ bandwidth from lognormal dist. ▪ Each edge is supported by several ports, all offering same bandwidth ▪ Goal: minimize total number of ports ($$$)

P. GiabbanelliRelevance of complex network properties7 Finding out what’s useful to measure 2 – Simulating ◦ Use a random planar graph generator (released in 2010) ◦ Create requests using probability: ◦ Optimize the number of ports to install ◦ Use several measures on the network and record the optimal number of ports

P. GiabbanelliRelevance of complex network properties8 Finding out what’s useful to measure 3 – Analysis ◦ We recorded several measures. Which ones best indicate the # of ports? ◦ Using data mining, we built classifiers and looked at their accuracy. < 9% error

P. GiabbanelliRelevance of complex network properties9 Finding out what’s useful to measure 3 – Analysis ◦ Routers are often of the same kind: same # ports. ◦ What happens if we also want to balance the charge? ◦ Same measures, and still ≈10% prediction error.

P. GiabbanelliRelevance of complex network properties10 From analysis to building ◦ We identified key measures to get efficient networks wrt ports. ◦ Now let’s build networks that score well on such measures. ◦ Networks must be incremental: add nodes with capacity needs. ◦ Space-filling networks were the best ones.

P. GiabbanelliRelevance of complex network properties11 Perspectives ◦ Traffic changes over time. ◦ When deploying a network, capacity is 100% over peak… ◦ …but what about managing? ◦ Turn ports off to save energy ◦ Green networks: hot topic.

P. GiabbanelliRelevance of complex network properties12 Related work on measures ◦ Knowing which measures are relevant to analyze a problem isn’t the end ◦ Computing measures for large networks (often happen) can be very long « Computing the average path length and a label-based routing in a small- world graph », P. Giabbanelli, D. Mazauric, S. Pérennes, AlgoTel 2010 « On the average path length of deterministic and stochastic networks », P. Giabbanelli, D. Mazauric, J.-C. Bermond, CompleNet 2010 ◦ Collaborated on theorems for average distance in a class of networks: ◦ Extended the work by considering a network with probabilistic growth:

P. GiabbanelliRelevance of complex network properties13 Related work on measures

P. GiabbanelliRelevance of complex network properties14 Questions ?!