Tal Mizrahi
Technion — Israel Institute of Technology
Abstract
This dissertation analyzes the use of accurate time to coordinate network con-figuration updates. Specifically, this work focuses on centralized network archi-tectures, such as Software Defined Networks (SDN).
Time can be beneficial in a wide variety of network update scenarios. The current work focuses on two key scenarios in which using time has a significant advantage over state-of-the-art approaches. First, we characterize a set of update scenarios called flow swaps, for which timed updates are the optimal update ap-proach, yielding less packet loss than existing update approaches. Second, we ana-lyze the use of accurate time to schedule multi-phase update procedures, allowing updates to be performed consistently, while requiring less resource overhead than existing network update methods.
The current work also introduces a clock synchronization scheme that is adapted to the centralized SDN environment. However, even if network devices have per-fectly synchronized clocks, how can we guarantee that events are executed at the exact time for which they were scheduled? In this work we present and analyze two accurate scheduling methods. The first uses Ternary Content Addressable Memory (TCAM) ranges in hardware switches. The second is a prediction-based scheduling approach that uses timing information collected at runtime to accu-rately schedule future operations. Both methods are shown to be practical and efficient.
Finally, this thesis defines extensions to standard network protocols, enabling practical implementations of our concepts. We define a new feature in OpenFlow called Scheduled Bundles, which has been incorporated into the OpenFlow 1.5 protocol. A similar capability was defined for the NETCONF protocol, and has been published as an RFC.
[1] T. Mizrahi and Y. Moses, “Software Defined Networks: It’s about time,” inIEEE INFO-COM, 2016.
[2] T. Mizrahi and Y. Moses, “TIME4: Time for SDN,” IEEE Transactions on Network and Service Management (TNSM), under major revision, 2016.
[3] T. Mizrahi and Y. Moses, “OneClock to rule them all: Using time in networked
appli-cations,” inIEEE/IFIP Network Operations and Management Symposium (NOMS) mini-conference, 2016.
[4] T. Mizrahi and Y. Moses, “Time Capability in NETCONF,” RFC 7758, IETF, 2016.
[5] T. Mizrahi and Y. Moses, “ReversePTP: A clock synchronization scheme for software
de-fined networks,”International Journal of Network Management (IJNM), accepted, 2016.
[6] T. Mizrahi and Y. Moses, “The case for data plane timestamping in sdn,” inIEEE INFO-COM Workshop on Software-Driven Flexible and Agile Networking (SWFAN), 2016.
[7] T. Mizrahi, E. Saat, and Y. Moses, “Timed consistent network updates in software defined
networks,”IEEE/ACM Transactions on Networking (ToN), 2016.
[8] T. Mizrahi, E. Saat, and Y. Moses, “Timed consistent network updates,” inACM SIG-COMM Symposium on SDN Research (SOSR), 2015.
[9] T. Mizrahi, O. Rottenstreich, and Y. Moses, “TimeFlip: Scheduling network updates with
[10] T. Mizrahi and Y. Moses, “Using ReversePTP to distribute time in software defined
net-works,” inInternational IEEE Symposium on Precision Clock Synchronization for Mea-surement Control and Communication (ISPCS), 2014.
[11] T. Mizrahi and Y. Moses, “ReversePTP: A software defined networking approach to clock
synchronization,” inACM SIGCOMM Workshop on Hot topics in Software Defined Net-works (HotSDN), 2014.
[12] T. Mizrahi and Y. Moses, “On the necessity of time-based updates in SDN,” in Open Networking Summit (ONS), 2014.
[13] T. Mizrahi and Y. Moses, “Time-based updates in software defined networks,” in ACM SIGCOMM Workshop on Hot topics in Software Defined Networks (HotSDN), 2013.
[14] “Topology Zoo,”http://topology-zoo.org/, 2015.
[15] ITU-T G.8271/Y.1366, “Time and phase synchronization aspects of packet networks,”
ITU-T, 2012.
[16] J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. Furman, S. Ghemawat,
A. Gubarev, C. Heiser, P. Hochschild, et al., “Spanner: Google’s globally distributed database,”ACM Transactions on Computer Systems (TOCS), vol. 31, no. 3, p. 8, 2013.
[17] L. Lamport, “Using time instead of timeout for fault-tolerant distributed systems.,”ACM Trans. Program. Lang. Syst., vol. 6, pp. 254–280, Apr. 1984.
[18] Open Networking Foundation, “OpenFlow switch specification,”Version 1.4.0, 2013.
[19] J. Case, M. Fedor, M. Schoffstall, and C. Davin, “A simple network management protocol
(SNMP),” RFC 1157, IETF, 1990.
[20] R. Enns, M. Bjorklund, J. Schoenwaelder, and A. Bierman, “Network configuration
[21] IEEE TC 9, “1588 IEEE Standard for a Precision Clock Synchronization Protocol for
Networked Measurement and Control Systems Version 2,”IEEE, 2008.
[22] M. Reitblatt, N. Foster, J. Rexford, C. Schlesinger, and D. Walker, “Abstractions for
net-work update,” inACM SIGCOMM, 2012.
[23] D. G. Malcolm, J. H. Roseboom, C. E. Clark, and W. Fazar, “Application of a technique
for research and development program evaluation,” Operations research, vol. 7, no. 5, pp. 646–669, 1959.
[24] Emulab — Network Emulation Testbedhttp://www.emulab.net, 2015.
[25] The DeterLab projecthttp://deter-project.org/about_deterlab, 2015.
[26] “PingER,”http://pinger.fnal.gov/, 2014.
[27] “AMP Measurements,”http://erg.wand.net.nz, 2014.
[28] P. Franc¸ois and O. Bonaventure, “Avoiding transient loops during the convergence of
link-state routing protocols,” IEEE/ACM Transactions on Networking (TON), vol. 15, no. 6, pp. 1280–1292, 2007.
[29] S. Bryant, C. Filsfils, S. Previdi, and M. Shand, “IP Fast Reroute using tunnels,”
draft-bryant-ipfrr-tunnels, work in progress, IETF, 2004.
[30] X. Jin, H. H. Liu, R. Gandhi, S. Kandula, R. Mahajan, J. Rexford, R. Wattenhofer, and
M. Zhang, “Dionysus: Dynamic scheduling of network updates,” in ACM SIGCOMM, 2014.
[31] L. Vanbever, S. Vissicchio, C. Pelsser, P. Francois, and O. Bonaventure, “Seamless
network-wide IGP migrations,” in ACM SIGCOMM Computer Communication Review, vol. 41, pp. 314–325, 2011.
[32] H. H. Liu, X. Wu, M. Zhang, L. Yuan, R. Wattenhofer, and D. Maltz, “zUpdate: updating
[33] C.-Y. Hong, S. Kandula, R. Mahajan, M. Zhang, V. Gill, M. Nanduri, and R. Wattenhofer,
“Achieving high utilization with software-driven WAN,” inACM SIGCOMM, 2013.
[34] L. Lamport, “Time, clocks, and the ordering of events in a distributed system,” Communi-cations of the ACM, vol. 21, no. 7, pp. 558–565, 1978.
[35] K. Harris, “An application of IEEE 1588 to industrial automation,” inInternational IEEE Symposium on Precision Clock Synchronization for Measurement Control and Communi-cation (ISPCS), 2008.
[36] IEEE, “Time-Sensitive Networking Task Group,”http://www.ieee802.org/1/pages/
tsn.html, 2012.
[37] P. Moreira, J. Serrano, T. Wlostowski, P. Loschmidt, and G. Gaderer, “White rabbit:
Sub-nanosecond timing distribution over ethernet,” inInternational IEEE Symposium on Preci-sion Clock Synchronization for Measurement Control and Communication (ISPCS), 2009.
[38] G. R. Ash, “Use of a trunk status map for real-time DNHR,” inInternational TeleTraffic Congress (ITC-11), 1985.
[39] K. Watsen, “Conditional Enablement of Configuration Nodes,”
draft-kwatsen-conditional-enablement, work in progress, IETF, 2013.
[40] A. Greenberg, G. Hjalmtysson, D. A. Maltz, A. Myers, J. Rexford, G. Xie, H. Yan,
J. Zhan, and H. Zhang, “A clean slate 4D approach to network control and management,”
ACM SIGCOMM Computer Communication Review, vol. 35, no. 5, pp. 41–54, 2005.
[41] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford,
S. Shenker, and J. Turner, “Openflow: enabling innovation in campus networks,” ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, pp. 69–74, 2008.
[42] Open Networking Foundation, “Openflow management and configuration protocol
[43] B. Dickerson, “Time in the power industry: how and why we use it,”
Arbiter Systems, technical report, http://www.arbiter.com/ftp/datasheets/
TimeInThePowerIndustry.pdf, 2010.
[44] H. Li, “IEEE 1588 time synchronization deployment for mobile backhaul in China
Mo-bile,” keynote presentation, International IEEE Symposium on Precision Clock
Synchro-nization for Measurement Control and Communication (ISPCS), 2014.
[45] IEEE Std C37.238, “IEEE Standard Profile for Use of IEEE 1588 Precision Time Protocol
in Power System Applications,”IEEE, 2011.
[46] “ONF SDN Product Directory,” https://www.opennetworking.org/
sdn-resources/onf-products-listing, January, 2015.
[47] “Broadcom BCM56840+ Switching Technology,” product brief, http://www.
broadcom.com/collateral/pb/56840_PLUS-PB00-R.pdf, 2011.
[48] “Broadcom BCM56850 StrataXGS Trident II Switching Technology,” product brief,
http://www.broadcom.com/collateral/pb/56850-PB03-R.pdf, 2013.
[49] “Centec CTC6048 Advanced Product Brief,” http://www.valleytalk.org/
wp-content/uploads/2010/12/CTC6048-Product-Brief_v2.5.pdf, 2010.
[50] “Intel Ethernet Switch FM5000/FM6000 Datasheet,” http://www.
intel.com/content/dam/www/public/us/en/documents/datasheets/
ethernet-switch-fm5000-fm6000-datasheet.pdf, 2014.
[51] “LSI/Avago Axxia Communication Processor AXM5500 Family,” https:
//www.lsi.com/downloads/Public/Communication%20Processors/Axxia%
20Communication%20Processor/LSI_PB_AXM5500_E.pdf, 2014.
[52] “Mellanox SwitchX-2 Product Brief,” http://www.mellanox.com/related-docs/
[53] “Tilera TILE-Gx8072 Processor Product Brief,” http://www.tilera.com/sites/
default/files/productbriefs/TILE-Gx8072_PB041-04_WEB.pdf, 2014.
[54] “Marvell ARMADA XP Functional Spec,” http://www.
marvell.com/embedded-processors/armada-xp/assets/
ARMADA-XP-Functional-SpecDatasheet.pdf, 2014.
[55] “Marvell Xelerated HX4100,” product brief, http://www.marvell.com/
network-processors/assets/Xelerated_HX4100-02_product%20brief_v8.pdf,
2014.
[56] “Interface to the Routing System (I2RS) working group,”https://datatracker.ietf.
org/wg/i2rs/charter/, IETF, 2016.
[57] “Forwarding and Control Element Separation (ForCES) working group,” https://
datatracker.ietf.org/wg/forces/charter/, IETF, 2016.
[58] M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat, “Hedera:
Dy-namic flow scheduling for data center networks.,” inNSDI, 2010.
[59] S. Jainet al., “B4: Experience with a globally-deployed software defined WAN,” inACM SIGCOMM, 2013.
[60] Open Networking Foundation, “OpenFlow-enabled mobile and wireless networks,”ONF Solution Brief, 2013.
[61] Metro Ethernet Forum, “Mobile backhaul - phase 2 implementation agreement,” MEF 22.1, 2012.
[62] Metro Ethernet Forum, “Carrier ethernet class of service - phase 2 implementation
agree-ment,”MEF 23.1, 2012.
[63] T. G. Edwards and W. Belkin, “Using SDN to facilitate precisely timed actions on
[64] C. Rotsos, N. Sarrar, S. Uhlig, R. Sherwood, and A. W. Moore, “OFLOPS: An open
framework for openflow switch evaluation,” inPassive and Active Measurement, 2012.
[65] S. Kandula, I. Menache, R. Schwartz, and S. R. Babbula, “Calendaring for wide area
networks,” inACM SIGCOMM, 2014.
[66] N. Pippenger, “On rearrangeable and non-blocking switching networks,”Journal of Com-puter and System Sciences, vol. 17, no. 2, pp. 145–162, 1978.
[67] Open Networking Foundation, “Openflow switch specification,”Version 1.5.0, 2015.
[68] Open Networking Foundation, “Openflow extensions 1.3.x package 2,” 2015.
[69] “TIME4 source code,”https://github.com/TimedSDN, 2014.
[70] J. M. Kleinberg, “Single-source unsplittable flow,” in37th Annual Symposium on Founda-tions of Computer Science, FOCS ’96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 68–77, 1996.
[71] T. Mizrahi and Y. Moses, “Time Capability in NETCONF,” RFC 7758, IETF, 2016.
[72] T. Mizrahi and Y. Moses, “TIME4: Time for SDN,” technical report, arXiv preprint arXiv:1505.03421v2, 2016.
[73] T. Mizrahi and Y. Moses, “Time-based updates in OpenFlow: A proposed extension to the
OpenFlow protocol,” technical report, CCIT Report #835, July 2013, EE Pub No. 1792,
Technion – Israel Institute of Technology, 2013.
[74] “CPqD OFSoftswitch,”https://github.com/CPqD/ofsoftswitch13, 2014.
[75] “Precision Time Protocol daemon,” version 2.3.0, http://ptpd.sourceforge.net/,
2013.
[76] B. Lantz, B. Heller, and N. McKeown, “A network in a laptop: rapid prototyping for
[77] A. Tavakoli, M. Casado, T. Koponen, and S. Shenker, “Applying NOX to the datacenter.,”
inHotNets, 2009.
[78] A. Tootoonchian, S. Gorbunov, Y. Ganjali, M. Casado, and R. Sherwood, “On controller
performance in software-defined networks,” inUSENIX Workshop on Hot Topics in Man-agement of Internet, Cloud, and Enterprise Networks and Services (Hot-ICE), 2012.
[79] SMPTE Standard 2022-6, “Transport of High Bit Rate Media Signals Over IP Networks
(HBRMT),” 2012.
[80] “Iperf - The TCP/UDP Bandwidth Measurement Tool,”https://iperf.fr/, 2014.
[81] ITU-T Y.1563, “Ethernet frame transfer and availability performance,”ITU-T, 2009.
[82] D. Arnold and H. Gerstung, “Enterprise Profile for the Precision Time Protocol With
Mixed Multicast and Unicast Messages,” draft-ietf-tictoc-ptp-enterprise-profile-05, work
in progress, IETF, 2015.
[83] N. P. Katta, J. Rexford, and D. Walker, “Incremental consistent updates,” in ACM SIG-COMM workshop on Hot topics in Software Defined Networks (HotSDN), 2013.
[84] S. K. Fayazbakhsh, L. Chiang, V. Sekar, M. Yu, and J. C. Mogul, “Enforcing
network-wide policies in the presence of dynamic middlebox actions using FlowTags,” inNSDI, 2014.
[85] M. Canini, P. Kuznetsov, D. Levin, and S. Schmid, “A distributed and robust SDN control
plane for transactional network updates,” inIEEE INFOCOM, 2015.
[86] Z. Guo, M. Su, Y. Xu, Z. Duan, L. Wang, S. Hui, and H. J. Chao, “Improving the
per-formance of load balancing in software-defined networks through load variance-based
synchronization,”Computer Networks, vol. 68, pp. 95–109, 2014.
[87] X. Wen, C. Diao, X. Zhao, Y. Chen, L. E. Li, B. Yang, and K. Bo, “Compiling minimum
[88] J. C. Corbettet al., “Spanner: Google’s globally-distributed database,” inProceedings of OSDI, vol. 1, 2012.
[89] L. Lamport and P. M. Melliar-Smith, “Synchronizing clocks in the presence of faults,”
Journal of the ACM (JACM), vol. 32, no. 1, pp. 52–78, 1985.
[90] A. Mukherjee, “On the dynamics and significance of low frequency components of
inter-net load,”Technical Reports (CIS), p. 300, 1992.
[91] O. Gurewitz, I. Cidon, and M. Sidi, “One-way delay estimation using network-wide
mea-surements,” IEEE/ACM Transactions on Networking (TON), vol. 14, no. SI, pp. 2710– 2724, 2006.
[92] Metro Ethernet Forum, “Ethernet services attributes - phase 3,”MEF 10.3, 2013.
[93] Network Test Inc., “Virtual Chassis Performance: Juniper Networks EX Series Ethernet
Switches,” white paper,http://www.networktest.com/, 2010.
[94] “Connectivity Fault Management,”IEEE Std 802.1ag, 2007.
[95] J. Mirkovic and T. Benzel, “Teaching cybersecurity with DeterLab,”Security & Privacy, IEEE, vol. 10, no. 1, pp. 73–76, 2012.
[96] Cisco, “Cisco’s Massively Scalable Data Center,”http://www.cisco.com/c/dam/en/
us/td/docs/solutions/Enterprise/Data_Center/MSDC/1-0/MSDC_AAG_1.pdf,
2010.
[97] ITU-T G.144, “One-way transmission time,”ITU-T, 2003.
[98] D. Kreutz, F. Ramos, and P. Verissimo, “Towards secure and dependable software-defined
networks,” in ACM SIGCOMM workshop on Hot topics in Software Defined Networks (HotSDN), 2013.
[100] M. Ambrosin, M. Conti, F. D. Gaspari, and R. Poovendran, “LineSwitch: Efficiently
man-aging switch flow in software-defined networking while effectively tackling DoS attacks,”
inACM Symposium on Information, Computer and Communications Security, ASIA CCS, 2015.
[101] T. Mizrahi, “Security requirements of time protocols in packet switched networks,”
draft-tictoc-security-requirements, work in progress, IETF, 2014.
[102] A. R. Curtis, J. C. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, and S. Banerjee,
“De-voflow: scaling flow management for high-performance networks,” inACM SIGCOMM Computer Communication Review, vol. 41, pp. 254–265, ACM, 2011.
[103] J. Naous, D. Erickson, G. A. Covington, G. Appenzeller, and N. McKeown,
“Implement-ing an OpenFlow switch on the NetFPGA platform,” inACM/IEEE ANCS, 2008.
[104] F. Long, Z. Sun, Z. Zhang, H. Chen, and L. Liao, “Research on TCAM-based OpenFlow
switch platform,” inIEEE ICSAI, 2012.
[105] Renesas, “R8A20410BG QUAD-Search TCAM,” datasheet, 2010.
[106] V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel, “Fast and scalable layer four
switching,” inACM SIGCOMM, 1998.
[107] A. Bremler-Barr and D. Hendler, “Space-efficient TCAM-based classification using gray
coding,”IEEE Trans. Computers, vol. 61, no. 1, pp. 18–30, 2012.
[108] T. Mizrahi and Y. Moses, “Software Defined Networks: It’s about time,” inIEEE INFO-COM, 2016.
[109] C. Pignataro, “Minutes for IETF87, SDNRG meeting,” meeting minutes, IETF, 2013.
[110] O. Rottenstreich, R. Cohen, D. Raz, and I. Keslassy, “Exact worst case TCAM rule
[111] H. Liu, “Efficient mapping of range classifier into ternary-cam,” inIEEE Hot Intercon-nects, 2002.
[112] H. Che, Z. Wang, K. Zheng, and B. Liu, “DRES: Dynamic range encoding scheme for
TCAM coprocessors,”IEEE Trans. Computers, vol. 57, no. 7, pp. 902–915, 2008.
[113] C. R. Meiners, A. X. Liu, and E. Torng, “TCAM Razor: A systematic approach towards
minimizing packet classifiers in TCAMs,” inIEEE ICNP, 2007.
[114] A. Bremler-Barr, D. Hay, and D. Hendler, “Layered interval codes for TCAM-based
clas-sification,”Computer Networks, vol. 56, no. 13, pp. 3023–3039, 2012.
[115] K. Kogan, S. I. Nikolenko, O. Rottenstreich, W. Culhane, and P. Eugster, “SAX-PAC
(Scalable And eXpressive PAcket Classification),” inACM SIGCOMM, 2014.
[116] E. Norige, A. X. Liu, and E. Torng, “A ternary unification framework for optimizing
TCAM-based packet classification systems,” inACM/IEEE ANCS, 2013.
[117] C. R. Meiners, A. X. Liu, E. Torng, and J. Patel, “Split: Optimizing space, power, and
throughput for TCAM-based classification,” inACM/IEEE ANCS, 2011.
[118] C. R. Meiners, A. X. Liu, and E. Torng, “Bit Weaving: A non-prefix approach to
com-pressing packet classifiers in TCAMs,” IEEE/ACM Trans. Networking, vol. 20, no. 2, pp. 488–500, 2012.
[119] D. Mills, J. Martin, J. Burbank, and W. Kasch, “RFC 5905: Network time protocol version
4: Protocol and algorithms specification,”IETF, 2010.
[120] O. Rottenstreich, I. Keslassy, A. Hassidim, H. Kaplan, and E. Porat, “On finding an
opti-mal TCAM encoding scheme for packet classification,” inIEEE INFOCOM, 2013.
[121] “Marvell Prestera 98DX4251 Product Brief,” http://www.marvell.com/switching/
[122] ITU-T G.8275.1, “Precision time protocol telecom profile for phase/time synchronization
with full timing support from the network,” 2014.
[123] D. L. Mills, “Internet time synchronization: the network time protocol,”Communications, IEEE Transactions on, 1991.
[124] K. Lakshminarayanan, A. Rangarajan, and S. Venkatachary, “Algorithms for advanced
packet classification with ternary cams,” inACM SIGCOMM, 2005.
[125] “The Internet Toaster,”http://www.livinginternet.com/i/ia_myths_toast.htm.
[126] “Writable MIB Module IESG Statement,”https://www.ietf.org/iesg/statement/
writable-mib-module.html, 2014.
[127] M. Bjorklund, “YANG - A Data Modeling Language for the Network Configuration
Pro-tocol (NETCONF),” RFC 6020, IETF, 2010.
[128] “Active Internet-Drafts,”https://datatracker.ietf.org/doc/active/, 2015.
[129] B. Claise, “YANG data models statistics,” http://www.claise.be/YANGPageMain.
html, 2015.
[130] R. Penno, P. Quinn, D. Zhou, and J. Li, “YANG Data Model for Service Function
Chain-ing,” draft-penno-sfc-yang-13, work in progress, IETF, 2015.
[131] A. Sehgal, V. Perelman, S. Kuryla, and J. Sch¨onw¨alder, “Management of resource
con-strained devices in the internet of things,” Communications Magazine, IEEE, vol. 50, no. 12, pp. 144–149, 2012.
[132] J. Sch¨onw¨alder and A. Sehgal, “Management of the Internet of Things,” http://cnds.
eecs.jacobs-university.de/slides/2013-im-iot-management.pdf, 2013.
[134] T. Mizrahi and Y. Moses, “Time Capability in NETCONF,” RFC 7758, IETF, 2016.
[135] D. Levi and J. Schoenwaelder, “Definitions of managed objects for scheduling
manage-ment operations,” RFC 3231, IETF, 2002.
[136] T. Mizrahi, O. Rottenstreich, and Y. Moses, “TimeFlip: Scheduling network updates with
timestamp-based TCAM ranges,” inIEEE INFOCOM, 2015.
[137] M. A. Iverson, F. ¨Ozg¨uner, and L. C. Potter, “Statistical prediction of task execution times
through analytic benchmarking for scheduling in a heterogeneous environment,” IEEE Trans. Computers, vol. 48, no. 12, pp. 1374–1379, 1999.
[138] E. Ipek, B. R. de Supinski, M. Schulz, and S. A. McKee, “An approach to performance
prediction for parallel applications,” inEuro-Par, 2005.
[139] P. Giusto, G. Martin, and E. A. Harcourt, “Reliable estimation of execution time of
embed-ded software,” inConference on Design, Automation and Test in Europe (DATE), 2001.
[140] M. A. Iverson, F. ¨Ozg¨uner, and G. J. Follen, “Run-time statistical estimation of task
ex-ecution times for heterogeneous distributed computing,” in International Symposium on High Performance Distributed Computing (HPDC), 1996.
[141] G. Bontempi and W. Kruijtzer, “A data analysis method for software performance
predic-tion,” inConference on Design, Automation and Test in Europe (DATE), 2002.
[142] S. Hares and M. Chen, “Summary of I2RS Use Case Requirements,”
draft-ietf-i2rs-usecase-reqs-summary-01, work in progress, IETF, 2015.
[143] M. Lipinski, “White Rabbit - Ethernet-based solution for sub-ns synchronization
and deterministic, reliable data delivery,”http://maciejlipinski.pl/myPage/docs/
presentations/WR_IEEE802-Tutorial-Geneve2013.pdf, 2013.
[144] K. M. Chandy and L. Lamport, “Distributed snapshots: Determining global states of
[145] S. Chisholm and H. Trevino, “NETCONF Event Notifications,” RFC 5277, IETF, 2008.
[146] Toaster YANG Module http://www.netconfcentral.org/modulereport/toaster,
2015.
[147] “Cron - Linux man page,”http://linux.die.net/man/8/cron, 2015.
[148] J. Lundelius and N. A. Lynch, “A new fault-tolerant algorithm for clock synchronization,”
inSymposium on Principles of Distributed Computing (PODC), 1984.
[149] R. E. Kalman, “A new approach to linear filtering and prediction problems,” Journal of Fluids Engineering, vol. 82, no. 1, pp. 35–45, 1960.
[150] A. Papoulis and S. U. Pillai,Probability, random variables, and stochastic processes. Tata McGraw-Hill Education, 2002.
[151] OpenYumahttps://github.com/OpenClovis/OpenYuma, 2015.
[152] “OneClock source code,”https://github.com/TimedSDN/Yuma-Time, 2015.
[153] Microsoft Azurehttps://azure.microsoft.com, 2015.
[154] Amazon Web Serviceshttp://aws.amazon.com, 2015.
[155] D. Carraway, “lookbusy — a synthetic load generator,” https://www.devin.com/
lookbusy, 2015.
[156] A. Bierman, M. Bjorklund, and K. Watsen, “RESTCONF Protocol,”
draft-ietf-netconf-restconf, work in progress, IETF, 2015.
[157] D. Veitch, J. Ridoux, and S. B. Korada, “Robust synchronization of absolute and
[158] K. Correll, N. Barendt, and M. Branicky, “Design considerations for software only
im-plementations of the IEEE 1588 precision time protocol,” inConference on IEEE 1588, pp. 10–12, 2005.
[159] Y. Zhao, J. Liu, E. Lee,et al., “A programming model for time-synchronized distributed real-time systems,” inIEEE Real Time and Embedded Technology and Applications Sym-posium (RTAS), 2007.
[160] P. Derler, J. C. Eidson, S. Goose, E. A. Lee, S. Matic, and M. Zimmer, “Using ptides and
synchronized clocks to design distributed systems with deterministic system wide timing,”
in International IEEE Symposium on Precision Clock Synchronization for Measurement Control and Communication (ISPCS), pp. 41–46, IEEE, 2013.
[161] ITU-T G.8265.1/Y.1365.1, “Precision time protocol telecom profile for frequency
syn-chronization,” 2010.
[162] J. Y. Halpern, B. Simons, R. Strong, and D. Dolev, “Fault-tolerant clock synchronization,”
inPODC, pp. 89–102, ACM, 1984.
[163] T. Srikanth and S. Toueg, “Optimal clock synchronization,”Journal of the ACM (JACM), vol. 34, no. 3, pp. 626–645, 1987.
[164] D. L. Mills, “Improved algorithms for synchronizing computer network clocks,”
IEEE/ACM Transactions on Networking (TON), vol. 3, no. 3, pp. 245–254, 1995.
[165] R. Tse and C. Ong, “Proposal for a standardized mechanism to transfer timing
informa-tion from an ingress port to an egress port of a PTP transparent clock,” Internainforma-tional IEEE
Symposium on Precision Clock Synchronization for Measurement Control and
Commu-nication (ISPCS), special session on proposed revisions of IEEE 1588-2008, 2012.
[166] Wiresharkhttp://www.wireshark.org/, 2014.
[167] G. M. Garner, “Effect of a frequency perturbation in a chain of syntonized transparent,”
