Milan Vojnović Joint work with: Jean-Yves Le Boudec Workshop on Clean Slate Network Design, Cambridge, UK, Sept 18, 2006 On the Origins of Power Laws in.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

GSA Pizza Talk - EPFL - Capillary routing with FEC by E. Gabrielyan 1 Capillary Multi-Path Routing for reliable Real-Time Streaming with FEC.
Mathematical Preliminaries
Slide 1 Insert your own content. Slide 2 Insert your own content.
1 On the Long-Run Behavior of Equation-Based Rate Control Milan Vojnović and Jean-Yves Le Boudec ACM SIGCOMM 2002, Pittsburgh, PA, August 19-23, 2002.
1 Coupon Replication Systems Laurent Massoulié & Milan Vojnović Microsoft Research Cambridge, UK.
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) & Milan Vojnovic (Microsoft Research Cambridge) IEEE Infocom.
Milan Vojnović Microsoft Research Cambridge Collaborators: E. Perron and D. Vasudevan 1 Consensus – with Limited Processing and Signalling.
Random Trip Mobility Models Jean-Yves Le Boudec EPFL Tutorial ACM Mobicom 2006 Milan Vojnović Microsoft Research Cambridge.
Exploring User Social Behavior in Mobile Social Applications Konglin Zhu *, Pan Hui $, Yang Chen *, Xiaoming Fu *, Wenzhong Li + * University of Goettingen,
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 38.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Transportation-aware Routing in Delay Tolerant Networks (DTNs) Asia Future Internet 2008 Taekyoung Kwon Seoul National University.
Enabling Inter-domain DTN Communications by Networked Static Gateways Ting He*, Nikoletta Sofra, Kang-Won Lee*, and Kin K Leung * IBM Imperial College.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Chapters 1 & 2 Theorem & Postulate Review Answers
1 Multi-Channel Wireless Networks: Capacity and Protocols Nitin H. Vaidya University of Illinois at Urbana-Champaign Joint work with Pradeep Kyasanur Chandrakanth.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Scalable Routing In Delay Tolerant Networks
0 - 0.
2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt Time Money AdditionSubtraction.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
T IME SERIES MODELING OF TEMPORAL NETWORK Sandipan Sikdar CNeRG Retreat 14 1.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Session 19: Individual Presentations. TimeFriday Day fives objectives Individual Presentations Individual.
高度情報化社会を支えるネットワーキング技術 (大阪大学 工学部説明会資料)
Power law and exponential decay Milan Vojnović Microsoft Research Cambridge Collaborators: T. Karagiannis and J.-Y. Le Boudec Hynet colloquium series,
1 Generating Network Topologies That Obey Power LawsPalmer/Steffan Carnegie Mellon Generating Network Topologies That Obey Power Laws Christopher R. Palmer.
1 On the Capacity of Ad Hoc Wireless Networks Under General Node Mobility Michele Garetto – Università di Torino Paolo Giaccone - Politecnico di Torino.
Outline Minimum Spanning Tree Maximal Flow Algorithm LP formulation 1.
O X Click on Number next to person for a question.
© S Haughton more than 3?
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
EPSRC Power Electronics Centre Early Stage Researchers Meet up WP1.1 High Power DC-DC Converter Topologies Luiz Villa.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
We are partners in learning. Name, Title Date
Properties of Exponents
Bi-intervals for backtracking on temporal constraint networks Jean-François Baget and Sébastien Laborie.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
Visions of Australia – Regional Exhibition Touring Fund Applicant organisation Exhibition title Exhibition Sample Support Material Instructions 1) Please.
1 Ke – Kitchen Elements Newport Ave. – Lot 13 Bethesda, MD.
1 Scheduling Reserved Traffic in Input-Queued Switches: New Delay Bounds via Probabilistic Techniques Matthew Andrews and Milan Vojnović Bell Labs, Lucent.
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
O X Click on Number next to person for a question.
1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)
Understanding The Simulation Of Mobility Models with Palm Calculus Jean-Yves Le Boudec EPFL UMD-ISR- February 2007 Milan Vojnović Microsoft Research Cambridge.
1 The Random Trip Mobility Model Milan Vojnovic (Microsoft Research) Computer Lab Seminar, University of Cambridge, UK, Nov 2004 with Jean-Yves Le Boudec.
Opportunistic Networking (aka Pocket Switched Networking)
1 Random Trip Stationarity, Perfect Simulation and Long Range Dependence Jean-Yves Le Boudec (EPFL) joint work with Milan Vojnovic (Microsoft Research.
Scaling Properties of Delay Tolerant Networks with Correlated Motion Patterns Uichin Lee, Bell Labs/Alcatel-Lucent Soon Y. Oh, Mario Gerla (UCLA) Kang-Won.
Pocket Switched Networks: Real-world Mobility and its Consequences for Opportunistic Forwarding Jon Crowcroft,Pan Hui (Ben) Augustin Chaintreau, James.
Hop-limited flooding over dynamic networks M. Vojnović and A. Proutiere Microsoft Research IEEE Infocom 2011, Shanghai, April 2011.
Energy Efficient Phone-to-Phone Communication Based on WiFi Hotspots in PSN En Wang 1,2, Yongjian Yang 1, and Jie Wu 2 1 Dept. of Computer Science and.
1 On the Levy-walk Nature of Human Mobility Injong Rhee, Minsu Shin and Seongik Hong NC State University Kyunghan Lee and Song Chong KAIST.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
Power law and exponential decay
Presentation transcript:

Milan Vojnović Joint work with: Jean-Yves Le Boudec Workshop on Clean Slate Network Design, Cambridge, UK, Sept 18, 2006 On the Origins of Power Laws in Mobility Systems

2 Abstract Recent measurements suggest that inter-contact times of human- carried devices are well characterized by a power-low complementary cumulative distribution function over a large range of values and this is shown to have important implications on the design of packet forwarding algorithms (Chainterau et al, 2006). It is claimed that the observed power-law is at odds with currently used mobility models, some of which feature exponentially bounded inter-contact time distribution. In contrast, we will argue that the observed power-laws are rather commonplace in mobility models and mobility patterns found in nature. See also: ACM Mobicom 2006 tutorial

3 Networks with intermittent connectivity Context –Pocket switched networks (ex Haggle) –Ad-hoc networks –Delay-tolerant networks Apps –Asynchronous local messaging –Ad-hoc search –Ad-hoc recommendation –Alert dissemination Challenges –Mobility: intermittent connectivity to other nodes –Design of effective packet forwarding algorithms –Critical: node inter-contact time

4 Over a large range of values Power law exponent is time dependent Confirmed by several experiments (iMots/PDA) –Ex Lindgren et al CHANTS 06 Human inter-contact times follow a power law [Chainterau et al, Infocom 06] P(T > n) Inter-contact time n

5 The finding matters ! The power-law exponent is critical for performance of packet forwarding algorithms –Determines finiteness of packet delay [Chainterau et al, 06] Some mobility models do not feature power-law inter-contacts –Ex classical random waypoint

6 A brief history of mobility models (partial sample) Manhattan street network (87) Random waypoint (96) Random direction (05) –With wrap-around or billiards reflections Random trip model (05) –Encompasses many models in one –Stability conditions, perfect simulation

7 Mobility models need to be redesigned ! Exponential decay of inter contact is wrong ! Need new mobility models (?) Current mobility models are at odds with the power-low inter-contacts ! Do we need new mobility models ?

8 Why power law ? Conjecture: Heavy tail is sum of lots of cyclic journeys of –a small set of frequency and phase difference Crowcroft et al 06 (talk slides) Why power law ?

9 This talk: two claims Power-law inter-contacts are not at odds with mobility models –Already simple models exhibit power-law inter-contacts Power laws are rather common in the mobility patterns observed in nature

10 Outline Power-law inter-contacts are not at odds with mobility models Power laws are rather common in the mobility patterns observed in nature Conclusion

11 Random walk on a torus of M sites T = inter-contact time 9:00 9:30 10:00 10:30 11:0011:3012:0012:30 13:00 13:30 T = 4 h 30 min Mean inter-contact time, E(T) = M

12 Random walk on a torus … (2) For fixed number of sites M, P(T > n) decays exponentially with n, for large n M = 500 P(T > n) Inter-contact time, n 10 4 No power law ! Example:

13 Random walk on a torus … (3) For infinitely many sites M, P(T > n) ~ const / n 1/2 P(T > n) Inter-contact time, n M = 500 Power law ! Example:

14 Random walk on Manhattan street network P(T > n) Inter-contact time, n M = 500

15 Outline Power-law inter-contacts are not at odds with mobility models Power laws are rather common in the mobility patterns observed in nature Conclusion

16 Power laws found in nature mobility Albatross search Spider monkeys Jackals See [Klafter et al, Physics World 05, Atkinson et al, Journal of Ecology 02] Model: Levy flights –random walk with heavy-tailed trip distance –anomalous diffusion

17 Random trip model permits heavy-tailed trip durations But make sure that mean trip duration is finite Ex 1: random walk on torus or billiards –Simple: take a heavy-tailed distribution for trip duration (with finite mean) –Ex. Pareto: P 0 (S n > s) = (b/s) a, b > 0, 1 < a < 2 Ex 2: Random waypoint –Take f V 0 (v) = K v 1/2 1(0 v vmax) – E 0 (S n ) <, E 0 (S n 2 ) =

18 Conclusion Power-law inter-contacts are not at odds with mobility models –Already simple models exhibit power-law inter-contacts Power laws are rather common in the mobility patterns observed in nature Future work –Algorithmic implications Ex delay-effective packet forwarding (?) Ex broadcast (?) Ex geo-scoped dissemination (?) –Realistic, reproducible simulations (?) Determined by (a few) main mobility invariants

19 ?