T IME SERIES MODELING OF TEMPORAL NETWORK Sandipan Sikdar CNeRG Retreat 14 1.

Slides:



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

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 22 Simple Mail Transfer Protocol (SMTP)
LEUCEMIA MIELOIDE AGUDA TIPO 0
1 UNIT I (Contd..) High-Speed LANs. 2 Introduction Fast Ethernet and Gigabit Ethernet Fast Ethernet and Gigabit Ethernet Fibre Channel Fibre Channel High-speed.
Bellwork If you roll a die, what is the probability that you roll a 2 or an odd number? P(2 or odd) 2. Is this an example of mutually exclusive, overlapping,
Virtual Trunk Protocol
Exploring User Social Behavior in Mobile Social Applications Konglin Zhu *, Pan Hui $, Yang Chen *, Xiaoming Fu *, Wenzhong Li + * University of Goettingen,
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 38.
1 Chapter 40 - Physiology and Pathophysiology of Diuretic Action Copyright © 2013 Elsevier Inc. All rights reserved.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Scalable Routing in Delay Tolerant Mobile Networks Hao Wen 1 Jia Liu, Chuang Lin, Fengyuan Ren, Chuanpin Fu 1 Department of Computer Science, Tsinghua.
Enabling Inter-domain DTN Communications by Networked Static Gateways Ting He*, Nikoletta Sofra, Kang-Won Lee*, and Kin K Leung * IBM Imperial College.
1 A Static-Node Assisted Adaptive Routing Protocol in Vehicular Networks Yong Ding, Chen Wang, Li Xiao {dingyong, wangchen, Department.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
1 Introduction to Transportation Systems. 2 PART I: CONTEXT, CONCEPTS AND CHARACTERIZATI ON.
Wireless Networks Should Spread Spectrum On Demand Ramki Gummadi (MIT) Joint work with Hari Balakrishnan.
Scalable Routing In Delay Tolerant Networks
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
List and Search Grants Chapter 2. List and Search Grants 2-2 Objectives Understand the option My Grants List Grant Screen Viewing a Grant Understand the.
0 - 0.
ALGEBRAIC EXPRESSIONS
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.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
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.
FACTORING Think Distributive property backwards Work down, Show all steps ax + ay = a(x + y)
Addition Facts
Year 6 mental test 10 second questions Numbers and number system Numbers and the number system, fractions, decimals, proportion & probability.
ZMQS ZMQS
Peer-to-Peer and Social Networks An overview of Gnutella.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
The Flooding Time Synchronization Protocol
TV Show Trivia Princeton Puzzle Hunt Do NOT flip over your answer sheet!
INTRODUCTION TO SIMULATION WITH OMNET++ José Daniel García Sánchez ARCOS Group – University Carlos III of Madrid.
April, 2008, IEEE ISCE Taehong Kim; Sukbin Seo; Chong Poh Kit; Kimseyoo, Y.; Seong-eun Yoo; Daeyoung Kim Experiments on mobile sink application in ZigBee.
On the Optimal Placement of Mix Zones Julien Freudiger, Reza Shokri and Jean-Pierre Hubaux PETS, 2009.
Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
© S Haughton more than 3?
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
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.
Twenty Questions Subject: Twenty Questions
Security Systems BU Communication Systems Slide 1 DCNtech MPCC IO NServerPC Installing and Operating with Multi PC Control  Windows Set-up.
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Energy & Green Urbanism Markku Lappalainen Aalto University.
YO-YO Leader Election Lijie Wang
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 EN0129 PC AND NETWORK TECHNOLOGY I NETWORK LAYER AND IP Derived From CCNA Network Fundamentals.
Evaluation of an intervention to increase online filing of individuals’ tax returns Peter Lumb September 2009.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—2-1 Extending Switched Networks with Virtual LANs Introducing VLAN Operations.
1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Week 1.
We will resume in: 25 Minutes.
Connecting LANs, Backbone Networks, and Virtual LANs
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
1 Unit 1 Kinematics Chapter 1 Day
VPN AND REMOTE ACCESS Mohammad S. Hasan 1 VPN and Remote Access.
1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
1 Chapter 6 Dynamic Programming Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
Exploring Energy-Latency Tradeoffs for Broadcasts in Energy-Saving Sensor Networks AUTHOR: MATTHEW J. MILLER CIGDEM SENGUL INDRANIL GUPTA PRESENTER: WENYU.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Presentation transcript:

T IME SERIES MODELING OF TEMPORAL NETWORK Sandipan Sikdar CNeRG Retreat 14 1

T EMPORAL NETWORK Network that changes with time Nodes and edges entering or leaving the system dynamically Example: Human communication network, mobile call network 2

T EMPORAL NETWORK AS TIME SERIES 3

4 Time series of some of the properties

P ROPERTIES OF TIME SERIES Stationarity ADF test KPSS test Trend Periodicity Seasonality 5

F ORECASTING USING T IME SERIES Selecting a window Auto-correlation ARIMA (auto-regressive-integrated-moving-average) 6 Auto-correlation function plots

R ESULTS AND DISCUSSIONS Datasets: INFOCOM 06 Human communication network collected at IEEE INFOCOM 2006 SIGCOMM 09 Human communication network collected at SIGCOMM 2009 Resolution – 5 minutes. 7

A CCURACY OF PREDICTION 8

S PECTROGRAM ANALYSIS Short term Fourier transform The whole series is divided into equal-sized windows and discrete Fourier transform is applied on this windowed data. We are able to get a view of the local frequency spectrum. 9

S PECTROGRAM ANALYSIS We use spectrograms for two purposes Determining predictability of a property We look into the spectrogram of the whole series. Determining the goodness of prediction at any time point We look into the spectrogram of the series formed by the previous few points. 10

S PECTROGRAM ANALYSIS 11 Spectrograms for (a)no of nodes and (b)betweenness centrality

S PREADING IN TEMPORAL NETWORKS 12

D ELAY - TOLERANT NETWORKS (DTN) Very sparse node population Unequal delay associated between the occurrence and reoccurrence of a link Lack of full network connectivity at virtually all points in time Eventual packet delivery achieved through node mobility 13

B ROADCAST /S PREADING IN DTN Challenges: o Distributed System o No global information o Unstable links Routing mechanisms: o Spray and wait o Two-hop spreading 14

T HE OVERALL SETUP Agent configuration and network Message configuration Transfer protocol Push Pull (restricted) Metrics of interest Delay Wastage 15

A COMBINED STRATEGY Push strategy works best at the start Pull strategy works best towards the end Can we combine the two strategies to improve broadcast time? Can we modify the strategies to reduce wastage? 16

T HE X % STRATEGY Switch from push to pull when x% of the nodes have been covered Significant improvement in broadcast delay and wastage Need for a global information and also spread the information to all the nodes 17

A NOTHER STRATEGY Interleave between push and pull A node starts the broadcast Capable nodes push for a preset number of time- steps Number of steps changes dynamically Nodes with partial segment tries to pull in the next few steps 18

R EDUCE WASTAGE Keeping some history information at each node An array which keeps track of the last k contact opportunities If last k transactions were unsuccessful, we turn off the node with some probability Reduces wastage But convergence? 19

T HANK YOU …… 20