Presentation is loading. Please wait.

Presentation is loading. Please wait.

Sir John Tenniel; Alice’s Adventures in Wonderland,Lewis Carroll Chap_16 David L. Mills University of Delaware

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Sir John Tenniel; Alice’s Adventures in Wonderland,Lewis Carroll Chap_16 David L. Mills University of Delaware"— Presentation transcript:

1 Sir John Tenniel; Alice’s Adventures in Wonderland,Lewis Carroll Chap_16 David L. Mills University of Delaware http://www.eecis.udel.edu/~mills mailto:mills@udel.edu 27-Jun-151

2 NameState Variable recReceive timestamp dstDestination timestamp aorgA origin timestamp borgB origin timestamp xTransmit interleave switch hHold-off counter NamePacket Variable t org Orgin timestamp t rec Receive timestamp t xmt Transmit timestamp NamePeer Variable  Clock offset  Roundtrip delay  Unicast/broadcast offset fig_16_1

3 t org = rec t rec = dst If (x == 0) {/* basic mode */ aorg = clock t xmt = aorg } else {/* interleaved mode */ if (x > 0) { aorg = clock t xmt = borg } else { borg = clock t xmt = aorg } x = -x } Transmit Process. - Basic and Interleaved 27-Jun-153 if (x == 0) { /* basic mode */ txmt = clock torg = 0 } else {/* interleaved mode */ if (x > 0) { aorg = clock t xmt = aorg t org = borg } else { borg = clock t xmt = borg t org = aorg } } t rec = 0 Transmit Process.- Broadcast fig_16_2

4 rxproc. Receive proc and receive basic routine 27-Jun-154 T 1 = t org T 2 = t rec T 3 = t xmt T 4 = dst If (T 1 == 0 || T 2 == 0 || T 3 == 0) SYNC else if (T 1 != aorg) BOGUS } else {  = [(T 2 – T 1 ) + (T 3 – T 4 )] / 2  = (T 4 – T 1 ) – (T 3 – T 2 ) } Basic Symmetric Mode if (t xmt != 0 && t xmt == xmt) { DUPE } else if (x == 0) { rec = t xmt dst = clock If (mode == BROADCAST) Broadcast else Basic Symmetric } else { Interleaved Symmrytric rec = t rec dst = clock } if (h > 0) h- - xmt = t xmt Receive Process fig_16_3

5 rxout. Receive interleaved and receive broadcast routines If (x > 0) T 1 = aorg else T 1 = borg T 2 = rec T 3 = t xmt T 4 = dst if (t org == 0 || T 1 == 0 || T 2 == 0 || T 3 == 0) { SYNC } else if (t org != 0 && t org != T 4 ) { h = 2 BOGUS } else if (h == 0) {  = [(T 2 – T 1 ) + (T 3 – T 4 )] / 2  = (T 4 – T 1 ) – (T 3 – T 2 ) } Interleaved Symmetric Mode 27-Jun-155 if (t org == 0) { /* basic mode */  = t xmt – dst + d / 2 } else {/* interleaved mode */ T 1 = t org – borg T 2 = t org – aorg aorg = t xmt borg = dst if (T 2 > 1) BOGUS else  = T 1 + d / 2 } Broadcas Modet fig_16_4

6 NTP basic on-wire protocol operations (1step) 0 0 T2T2 T5*T5* T6T6 T7*T7* rec dst T3*T3* T4T4 T7*T7* T5*T5* T6T6 T5*T5* rec dst T1*T1* T2T2 T1*T1* T4T4 T3*T3* 0 0T1*T1* T2T2 T3*T3* T3*T3* T4T4 T3T3 T2T2 T1T1 T5T5 T6T6 T8T8 T7T7 T6T6 T1*T1*T5*T5* T4T4 T8T8 T3*T3*T7*T7* B A T3*T3* aorg 0 t1*t1* T5*T5* T5*T5*T1*T1* t org t rec t xmt Sync Valid 27-Jun-156 fig_16_5

7 Interleaved on-wire protocol operations (2step) 0 T1T1 T9T9 0 borg dst 0 T2T2 T2T2 T4T4 T5T5 T6T6 rec T2T2 T6T6 0 T4T4 T1T1 T4T4 T2T2 0 0 0 T1T1 T5T5 T4T4 T8T8 0 T1T1 0 T6T6 T8T8 T 10 T8T8 T7T7 T5T5 T9T9 T8T8 T6T6 T 12 T5T5 T4T4 T3T3 T2T2 T1T1 T5T5 T6T6 T8T8 T7T7 T 11 T 10 T9T9 t org T3T3 Round 1 Round 2 Round 3 T9T9 T 12 T 10 T 12 T9T9 T 13 T 14 T 13 aorg t rec t xmt T 14 borg dst T4T4 0 rec 0T4T4 0 T6T6 T3T3 T3T3 T2T2 0 T3T3 0T8T8 T7T7 T8T8 T 10 T7T7 T 11 T 12 T 11 aorg 0 T7T7 T2T2 T6T6 T 10 27-Jun-157 Valid SyncValid SyncValid T3T3 T7T7 T1T1 T5T5 B A fig_16_6

8 Interleaved broadcast on-wire protocol (3step) T1T1 aorg dst T3*T3* 0 T4T4 T5*T5* rec 0 T4T4 0 0 T3*T3* T5*T5* T4T4 T8T8 T5*T5*T1*T1* T4T4 T3T3 T5T5 T6T6 T8T8 T7T7 t org T7*T7* t rec t xmt borg T1T1 T1*T1* T3T3 T3T3 T3T3 aorg T2T2 Valid BroadcastStateless T2T2 T1T1 0 T 12 T3T3 T 11 * T 12 T 11 T3T3 T 11 * T1T1 T1T1 Broadcast T1T1 T3*T3*T3*T3*T 11 * T3*T3* T6T6 T5*T5* borg T 12 T1*T1* T2T2 T4T4 T4T4 T4T4 T7*T7* 27-Jun-158 B A Valid 0 T 14 T 11 T 13 * t 14 t 13 t 11 T 13 T 13 * Broadcast T 13 * T 14 fig_16_7

9 Automatic protocol detection example (4step) T1*T1*T9*T9* 0 borg dst 0 T2T2 0 T4T4 0 T6T6 rec 0T3T3 0 T4T4 0 T5*T5* T4T4 0 0 00 T3T3 0 T4T4 t 5* t1*t1* T8T8 0 T 5* T 1* T3T3 T8T8 0 T 10 T 11 * T8T8 0 T9*T9* T8T8 T3T3 T 12 T9*T9* T4T4 T3T3 T2T2 T1T1 T5T5 T6T6 T8T8 T7T7 T 11 T 10 T9T9 t org T3T3 Bogus T 13 * T 12 T 11 * T 12 T 13 * 0 T 14 T 13 aorg t rec t xmt T 14 borg dst T4T4 0 rec 0T4T4 0 T6T6 T3T3 T3T3 T2T2 0 T3T3 0T8T8 T7T7 T8T8 T 10 T7T7 T7T7 T 11 * T 13 * t 11 * aorg 0 T7T7 T2T2 T6T6 T 10 T 13 * T 16 T 15 * T 13 * T 14 T 15 * 0 T 14 T7T7 T 15 * T 13 * T 16 T 15 Bogus Sync Bogus Valid Sync 27-Jun-159 B A Basic t 5* T5*T5*T1*T1* Basic Xleave fig_16_8

10 backroom Mort .001 .100 .046 .015 Macabre .003 .108 .042 .015 GPS .015 .276 .024 GPS .021 .280 .040 MacabreMort Macabre .017 .261 .029 .025 .121 Mort .041 .204 .017 .035 .126 Howland Switch GPS fig_16_9

11 campus Bridgeprt  .022 .311 .031 .224 Baldwin .040 .359 .096 .176 Rackety .028 .478 .014 Rackety .017 .442 .021 BaldwinBridgeport PPS .000 .000 .004 Pogo  .163 .615 .031 .119 Rackety PPS .000 .000 .004 Rackety .181 .612 .020 .211 Pogo Switch fig_16_10

12 machines NameCPUEthernet NICOperating System BaldwinSun UltraSPARC III10/100/1000 Mb/sSolaris 5.10 bridgeportSun UltraSPARC III10/100/1000 Mb/sSolaris 5.10 HowlandIntel P4 1.0 GHzRealTek 8139 10/100 Mb/sFreeBSD 6.1 MacabreInteI P4x2 2.8 GHzBroadcom BCM5751 10/100/1000 Mb/sFreeBSD 6.1 mortInteI P4x2 2.8 GHzBroadcom BCM5751 10/100/1000 Mb/sFreeBSD 6.1 PogoSun Ultra-5.1010/100 Mb/sSolaris 5.10 RacketyIntel Pentium II 300 MHz3Com 3C905B 10/100 Mb/xFreeBSD 6.1 tbl_16_1

Download ppt "Sir John Tenniel; Alice’s Adventures in Wonderland,Lewis Carroll Chap_16 David L. Mills University of Delaware"

Similar presentations

COS 461 Fall 1997 Time and Clocks u uses of time in distributed systems: –time-based algorithms (e.g. in security) –distributed make –gathering event traces.

COS 461 Fall 1997 Time and Clocks u uses of time in distributed systems: –time-based algorithms (e.g. in security) –distributed make –gathering event traces.
One-way Delay Measurement Vladimir Smotlacha TF-NGN, October 2002.

One-way Delay Measurement Vladimir Smotlacha TF-NGN, October 2002.
Concurrency Control II

Concurrency Control II
HIERARCHY REFERENCING TIME SYNCHRONIZATION PROTOCOL Prepared by : Sunny Kr. Lohani, Roll – 16 Sem – 7, Dept. of Comp. Sc. & Engg.

HIERARCHY REFERENCING TIME SYNCHRONIZATION PROTOCOL Prepared by : Sunny Kr. Lohani, Roll – 16 Sem – 7, Dept. of Comp. Sc. & Engg.
Wireless Sensor Networks Clock Synchronization Professor Jack Stankovic University of Virginia.

Wireless Sensor Networks Clock Synchronization Professor Jack Stankovic University of Virginia.
Time and Clock Primary standard = rotation of earth De facto primary standard = atomic clock (1 atomic second = 9,192,631,770 orbital transitions of Cesium.

Time and Clock Primary standard = rotation of earth De facto primary standard = atomic clock (1 atomic second = 9,192,631,770 orbital transitions of Cesium.
NTP Time for iThingies A Network Time Protocol app. for iPhone and iPad Presented to TTSO8 on 2456765.63542 by Chris Douglass 1.

NTP Time for iThingies A Network Time Protocol app. for iPhone and iPad Presented to TTSO8 on by Chris Douglass 1.
CS6223: Distributed Systems Distributed Time and Clock Synchronization (1) Physical Time.

CS6223: Distributed Systems Distributed Time and Clock Synchronization (1) Physical Time.
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Time and Synchronization Steve Ko Computer Sciences and Engineering University at Buffalo.

CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Time and Synchronization Steve Ko Computer Sciences and Engineering University at Buffalo.
Computer Science 425 Distributed Systems CS 425 / CSE 424 / ECE 428 Fall 2011 August 30, 2011 Lecture 3 Time and Synchronization Reading: Sections 11.1-11.4.

Computer Science 425 Distributed Systems CS 425 / CSE 424 / ECE 428 Fall 2011 August 30, 2011 Lecture 3 Time and Synchronization Reading: Sections
L-8 Synchronizing Physical Clocks 1 Announcements Proj1 checkpoint – due midnight tonight HW1 checkpoint – due 2/12 2.

L-8 Synchronizing Physical Clocks 1 Announcements Proj1 checkpoint – due midnight tonight HW1 checkpoint – due 2/12 2.
Distributed Systems Fall 2010 Time and synchronization.

Distributed Systems Fall 2010 Time and synchronization.
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Time and Synchronization Steve Ko Computer Sciences and Engineering University at Buffalo.

CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Time and Synchronization Steve Ko Computer Sciences and Engineering University at Buffalo.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 15th Lecture 13.12.2006 Christian Schindelhauer.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 15th Lecture Christian Schindelhauer.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
© Chinese University, CSE Dept. Distributed Systems / 9 - 1 Distributed Systems Topic 9: Time, Coordination and Replication Dr. Michael R. Lyu Computer.

© Chinese University, CSE Dept. Distributed Systems / Distributed Systems Topic 9: Time, Coordination and Replication Dr. Michael R. Lyu Computer.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 13th Lecture 06.12.2006 Christian Schindelhauer.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 13th Lecture Christian Schindelhauer.
Event Context Information: Particle Data Run Information Platform, Run ID, TimeStamp Configuration Information Hardware and software configuration keys.

Event Context Information: Particle Data Run Information Platform, Run ID, TimeStamp Configuration Information Hardware and software configuration keys.
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
Figure 1.1 The observer in the truck sees the ball move in a vertical path when thrown upward. (b) The Earth observer views the path of the ball as a parabola.

Figure 1.1 The observer in the truck sees the ball move in a vertical path when thrown upward. (b) The Earth observer views the path of the ball as a parabola.

Similar presentations

Ads by Google