January 2019 - talks - lists.cs.princeton.edu

Colloquium Speaker-Cynthia Sturton, Monday, Feb 4
by Emily C. Lawrence 29 Jan '19

29 Jan '19

Colloquium Speaker Cynthia Sturton , from University of North Carolina at Chapel Hill Monday, February 4- 12:30pm Computer Science - Room 105 “Hardware is the New Software: Finding Exploitable Bugs in Hardware Designs” Bugs in hardware designs can create vulnerabilities that open the machine to malicious exploit. Despite mature functional validation tools and new research in designing secure hardware, the question of how to find and recognize those bugs remains open. My students and I have developed two tools in response to this question. The first is a security specification miner; it semi-automatically identifies security-critical properties of a design specified at the register transfer level. The second tool, Coppelia , is a symbolic execution engine that explores a hardware design and generates complete exploits for the security bugs it finds. We use Coppelia and our set of generated security properties to find new bugs in the open-source RISC-V and OR1k CPU architectures. Bio: Cynthia Sturton is an Assistant Professor and Peter Thacher Grauer Fellow at the University of North Carolina at Chapel Hill. She leads the Hardware Security @ UNC research group to investigate the use of static and dynamic analysis to protect against vulnerable hardware designs. Her research is funded by several National Science Foundation awards, the Semiconductor Research Corporation, Intel, a Junior Faculty Development Award from the University of North Carolina, and a Google Faculty Research Award. She was recently awarded the Computer Science Departmental Teaching Award at the University of North Carolina. Sturton received her B.S.E. from Arizona State University and her M.S. and Ph.D. from the University of California, Berkeley.

1 0

Mina Tahmasbi Arashloo will present her Pre FPO "Stateful Programming of High-Speed Network Hardware" on Monday, February 4, 2019 at 3pm in CS 302.
by Nicki Gotsis 28 Jan '19

28 Jan '19

Mina Tahmasbi Arashloo will present her Pre FPO "Stateful Programming of High-Speed Network Hardware" on Monday, February 4, 2019 at 3pm in CS 302. The members of her committee are as follows: Jennifer Rexford (adviser); Readers: David Walker, Arvind Krishnamurthy; Examiners: Nick Feamster, Mike Freedman Everyone is invited to attend her talk. The talk title and abstract follow below. Title: Stateful Programming of High-Speed Network Hardware Abstract: Traditionally, network hardware, i.e. switches inside the network and Network Interface Cards (NICs) at the end hosts, have been fixed-function ASICs, performing simple stateless packet processing. Stateful packet processing, on the other hand, was mostly implemented in software in the higher layers of the network stack at the end hosts. Today, with link speeds increasing to 100Gbps and beyond, the CPU cost of software packet processing is becoming prohibitive. That, together with the need for network-enforced reliability, security, and efficiency, are forcing more complex, stateful packet processing functionality to be implemented in hardware in network switches and NICs. Moreover, there is an increasing need for programmable network hardware, as opposed to fixed-function ASICs, to enable networks to adapt to the rapidly evolving requirements of online services. Designing programmable network hardware with support for stateful packet processing at high-speed is notoriously difficult. At today’s link speeds, network switches and NICs should transmit a packet every few nanoseconds. However, stateful packet processing reduces opportunities for parallel computation by creating dependencies between operations across packets, and supporting programmability reduces opportunities for protocol-specific optimizations, both making it challenging to keep up with line-rate. Moreover, the need for high speed has kept the programming interfaces of current programmable network hardware quite low-level and only suitable for specifying the behavior of a single device. Thus, programming collections of stateful network devices to realize a local or network-wide functionality efficiently and correctly is known to be extremely difficult and error-prone. This thesis focuses on the design and programming of high-speed stateful network hardware, both at the end hosts and inside the network. At the end host, the transport layer is the most complicated and stateful component of the network stack that is pushed into the NIC’s hardware and is currently implemented as a fixed-function ASIC. We propose Tonic, a programmable hardware architecture for running transport protocols at 100Gbps. At such speed, the transport layer must generate a data segment every few nanoseconds using only a few kilobits of per-flow state, due to the limited memory on the NIC. The per-flow state can potentially be updated by multiple concurrent transport events every few nanoseconds, making it challenging to process them at line rate. As a result, we decompose transport-protocol functionality into operations that must affect the transmission of each packet and those that can safely run at microsecond timescales, hence enabling optimizations for the former. Moreover, by identifying common patterns across transport protocols, we offer programmers a simple API while further optimizing Tonic’s design. Experiments with our FPGA-based prototype show that Tonic can support a wide range of transport protocols and meet timing for 100 Gbps of back-to-back 128-byte packets. To facilitate network-wide stateful packet processing, we propose SNAP, a programming language that abstracts the entire network as “one big stateful switch”. Using SNAP, network operators can develop programs that contain reads and writes to global, persistent arrays, to implement a broad range of in-network applications, from stateful firewalls to fine-grained traffic monitoring. The SNAP compiler takes care of distribution, placement, and optimization of access to these stateful arrays. More specifically, the compiler discovers read/write dependencies between arrays and translates one-big-switch programs into an efficient internal representation based on a variant of binary decision diagrams. This internal representation is used to construct a mixed-integer linear program, which jointly optimizes the placement of state and the routing of traffic across the underlying physical topology. The internal representation is also used to derive the primitive stateful operations required in programmable switches to support SNAP’s network-wide abstractions. All in all, Tonic’s modular interface and SNAP’s one-big-stateful-switch abstraction relieve programmers from dealing with the low-level details of stateful programming of high-speed network hardware throughout the entire network.

1 0

Maciej Halber will present his Pre FPO on Monday, January 28, 2019 at 11am in CS 301.
by Nicki Gotsis 23 Jan '19

23 Jan '19

Maciej Halber will present his Pre FPO on Monday, January 28, 2019 at 11am in CS 301. The members of his committee members are as follows: Thomas Funkhouser (adviser), Adam Finkelstein, Olga Russakovsky, Matthias Niessner (Technical University of Munich), and Szymon Rusinkiewicz Everyone is invited to attend his talk. The talk title and abstract follow below: Title: RGBD Pipeline for 3D Indoor Scene Understanding Abstract: RGBD cameras, devices capable of capturing both color and distance information have became a standard data acquisition device for many computer vision tasks. While providing especially valuable source of data for applications like 3D reconstruction and understanding, pipelines able to solve such problems are complex systems and come with a wide range of new challenges. In this talk, I will present my work on improving several stages of such RGBD pipeline. First, I discuss issues that arise when capturing the data with a commodity RGBD camera, alongside a calibration method to improve it. Second, I describe a method for robustly recovering camera poses from a RGBD video sequence, where I introduce a novel optimization strategy which allows for effective incorporation of man-made priors. Finally, I discuss an algorithm for transferring information between 3D reconstructions of indoor scenes captured at different times, with applications in instance and semantic segmentation.

1 0

Distinguished Colloquium-Larry Peterson TODAY at 2:00pm
by Emily C. Lawrence 23 Jan '19

23 Jan '19

Title: Democratizing the Network Edge Speaker: Larry Peterson, Princeton University and Open Networking Foundation Date/time: 2-3pm Wed Jan 23 Location: CS 105 (the “small auditorium”) Abstract: The network edge—where the access networks that connect homes, businesses, and mobile users to the Internet are implemented—is in the midst of a transformation. Network operators ( Telcos and CableCos ) are transitioning from closed and proprietary hardware to disaggregated and virtualized software running on white-box servers, switches, and access devices. This transformation is partly motivated by the CAPEX savings that come from replacing purpose-built appliances with commodity hardware, but it is mostly driven by the need to increase feature velocity through the softwarization of the access network. The goal is to enable new classes of edge services—e.g., Autonomous Vehicles, Internet-of-Things ( IoT ), Immersive User Interfaces—that benefit from low latency connectivity. This is all part of the growing trend to move functionality to the network edge. This transformation faces two technical challenges. The first is to disaggregate and virtualize existing hardware appliances. This is done, for example, by applying SDN principles (decoupling the network control and data planes) and by breaking monolithic applications into a set of micro-services. The second is to integrate the resulting disaggregated components back into a functioning system, packaged with sufficient configuration and life cycle management tools to make it deployable in a production environment. This talk describes CORD, a community-based open source effort to address these challenges. CORD is being deployed in Telco field trials, but more interestingly, it lowers the barrier for anyone (not just global carriers) to deploy edge solutions that incorporate the latest 5G (wireless) and XGS-PON (fiber) access technologies. The talk concludes with some remarks on the opportunity this democratization of the network edge opens for the research community. Bio: Larry Peterson is the Robert E. Kahn Professor of Computer Science, Emeritus at Princeton University, where he served as Chair from 2003-2009. He is a co-author of the best-selling networking textbook Computer Networks: A Systems Approach (5e). His research focuses on the design, implementation, and deployment of Internet-scale distributed systems, including the widely used PlanetLab and MeasurementLab platforms. He is currently working on a new access edge cloud called CORD, an open source project of the Open Networking Foundation.

1 0

Joshua Wetzel will present his FPO, "Structure-aware Approaches for Deciphering Sequence-specific Protein-DNA Interactions" on Tuesday, 1/29/2019 at 1PM in CS 402.
by Nicki Gotsis 22 Jan '19

22 Jan '19

Joshua Wetzel will present his FPO, "Structure-aware Approaches for Deciphering Sequence-specific Protein-DNA Interactions" on Tuesday, 1/29/2019 at 1PM in CS 402. The members of his committee are: Examiners: Mona Singh (adviser), Shvartsman (CBE), and Barbara Engelhardt; Readers: Ben Raphael and Olga Troyanskaya Everyone is invited to attend his talk. The talk abstract follows below: Abstract Interactions between proteins and specific genomic loci are critical to the proper functioning of all cells. The ability of a DNA-binding protein (DBP) to distinguish between its target binding sites and other genomic regions is required for a myriad of crucial functions, including transcriptional regulation, meiotic recombination, chromatin remodeling, and genome organization. However, the fundamental relationship between the amino acid sequence of a DBP and its DNA-binding preferences remains largely elusive. High-throughput experimental technologies for detecting protein-DNA interactions have advanced substantially in the past decade and have enabled measurements for thousands of natural and synthetic DBP variants. However, these technologies typically require sophisticated analyses to uncover intrinsic DNA-binding specificities from the measured signals, often have poorly understood noise and sampling profiles, and provide little insight into the underlying mechanism of interaction. Meanwhile, precise co-complex structural data provide great insight into the mechanistic principles guiding interactions between DBPs and their DNA ligands, albeit at substantially lower throughput. These two types of data are complementary but rarely considered in concert. In this dissertation, I describe novel computational approaches that improve the accuracy and interpretability of inferences derived from high-throughput protein-DNA interaction data, via direct consideration of the underlying protein-DNA structural interaction interface shared across proteins within the same DNA-binding family. First, I describe a systematic exploration of the DNA-binding landscape for Cys2His2 zinc finger (C2H2- ZF) proteins, the most abundant DNA-binding family in eukaryotes. Here we inferred the largest set of C2H2-ZF specificities to date and developed a state-of-the-art structurallyinspired method for predicting specificities for novel C2H2-ZFs. Second, I demonstrate how to leverage the large amounts of specificity data available for DBDs to develop a general framework that improves accuracy of high-throughput DNA-binding specificity inferences by jointly considering interaction preferences for groups of proteins from the same DNA-binding family, rewarding global consistency according to an expected similarity measure reflecting family-level structural considerations. Finally, I provide a probabilistic framework for improving interpretability of high-throughput data by mapping inferred specificities of DBPs from the same DNA-binding family onto a common “reference” structural interface model derived from aggregated family-level co-complex data.

1 0

Khiem's General Exam will take place (today) Tuesday, January 22, 2019 in CS 105 at 12pm. The members of his committee are as follows: Wyatt Lloyd (Adviser), Michael Freedman, and Amit Levy.
by Nicki Gotsis 22 Jan '19

22 Jan '19

Khiem's General Exam will take place on Tuesday, January 22, 2019 in CS 105 at 12pm. The members of his committee are as follows: Wyatt Lloyd (Adviser), Michael Freedman, and Amit Levy. BQ_BEGIN Everyone is invited to attend his talk, and those faculty wishing to remain for the oral exam following are welcome to do so. His abstract and reading list follow below. BQ_END Title: K2: Lower Latency for Partial Replication Across Many Datacenters Abstract: The infrastructure available to large-scale web services now spans dozens of geographically dispersed datacenters. Utilizing this large number of datacenters to scale storage capacity requires a backend storage system to partially replicate data, i.e., to store only a subset of data in each datacenter. Partial replication, however, sacrifices the low latency benefits of having many datacenters: accessing data that is not replicated in a local datacenter incurs higher delay from contacting far-away datacenters. K2, a causally-consistent data store with read-only transactions and write-only transactions, shows it is possible for a partially-replicated storage system to provide local datacenter latency in many settings. This is powered by our novel replication approach, MetaDC, and a novel read-only transaction algorithm. With only simple writes, MetaDC provides the best possible worst-case latency for read-only transactions in K2: a single round trip to remote datacenters. The novel read-only transaction algorithm allows many read-only transactions to execute entirely in their local datacenters by exploiting a small data cache. Our evaluation shows that K2 achieves much lower latency than a baseline that directly adapts causal consistency for partial replication. Reading List Textbook: TANENBAUM, A. S., AND vAN STEEN, M. Distributed Systems: Principles and Paradigms (2nd Edition).Pearson Education, 2006. Paper list: AHAMAD, M., NEIGER, G., KOHLI, P., BURNS, J., AND HUTTO, P. Causal Memory: Definitions, Implementation, and Programming. Distributed Computing 9, 1 (1995). ANNAMALAI, M., RAVICHANDRAN, K., SRINIVAS, H., ZINKOVSKY, I., PAN, L., SAVOR, T., NAGLE, D., AND STUMM, M. Sharding the Shards: Managing Datastore Locality at Scale with Akkio. In Proc. OSDI (2018). BELARAMANI, N., DAHLIN, M., GAO, L., NAYATE, A., VENKATARAMANI, A., YALAGANDULA, P., AND ZHENG, J. PRACTI replication. In Proc. NSDI (2006). CORBETT, J. C., DEAN, J., EPSTEIN, M., FIKES, A., FROST, C., FURMAN, J., GHEMAWAT, S., GUBAREV, A., HEISER, C., HOCHSCHILD, P., HSIEH, W., KANTHAK, S., KOGAN, E., LI, H., LLOYD, A., MELNIK, S., MWAURA, D., NAGLE, D., QUINLAN, S., RAO, R., ROLIG, L., SAITO, Y., SZYMANIAK, M., TAYLOR, C., WANG, R., ANDWOODFORD, D. Spanner: Google’s Globally-Distributed Database. In Proc. OSDI (2012). DECANDIA, G., HASTORUN, D., JAMPANI, M., KAKULAPATI, G., LAKSHMAN, A., PILCHIN, A., SIVASUBRAMANIAN, S., VOSSHALL, P., AND VOGELS , W. Dynamo: Amazon’s highly available key-value store. In Proc. SOSP (2007). LAMPORT, L. Time, clocks, and the ordering of events in a distributed system. Comm. ACM 21, 7 (1978). LAMPORT, L. The Part-Time Parliament. ACM TOCS 16, 2 (1998). LLOYD, W., FREEDMAN, M. J., KAMINSKY, M., AND ANDERSEN, D. G. Don’t Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS. In Proc. SOSP (2011). LLOYD, W., FREEDMAN, M. J., KAMINSKY, M., AND ANDERSEN, D. G. Stronger Semantics for Low- Latency Geo-Replicated Storage. In Proc. NSDI (2013). MAHMOOD, T., NARAYANAN, S. P., RAO, S., VIJAYKUMAR, T. N., AND THOTTETHODI, M. Karma: Cost-effective geo-replicated cloud storage with dynamic enforcement of causal consistency. IEEE TCC (2018). PETERSEN, K., SPREITZER, M., TERRY, D., THEIMER, M., AND DEMERS, A. Flexible update propagation for weakly consistent replication. In Proc.SOSP (1997). ZAWIRSKI, M., PREGUIC ̧A, N., DUARTE, S., BIENIUSA, A., BALEGAS, V., AND SHAPIRO, M. Write Fast, Read in the Past: Causal Consistency for Client-Side Applications. In ACM/IFIP/USENIX International Middleware Conference (2015).

1 0

Reminder: Distinguished Colloquium-Larry Peterson tomorrow at 2:00pm
by Emily C. Lawrence 22 Jan '19

22 Jan '19

Title: Democratizing the Network Edge Speaker: Larry Peterson, Princeton University and Open Networking Foundation Date/time: 2-3pm Wed Jan 23 Location: CS 105 (the “small auditorium”) Abstract: The network edge—where the access networks that connect homes, businesses, and mobile users to the Internet are implemented—is in the midst of a transformation. Network operators (Telcos and CableCos) are transitioning from closed and proprietary hardware to disaggregated and virtualized software running on white-box servers, switches, and access devices. This transformation is partly motivated by the CAPEX savings that come from replacing purpose-built appliances with commodity hardware, but it is mostly driven by the need to increase feature velocity through the softwarization of the access network. The goal is to enable new classes of edge services—e.g., Autonomous Vehicles, Internet-of-Things (IoT), Immersive User Interfaces—that benefit from low latency connectivity. This is all part of the growing trend to move functionality to the network edge. This transformation faces two technical challenges. The first is to disaggregate and virtualize existing hardware appliances. This is done, for example, by applying SDN principles (decoupling the network control and data planes) and by breaking monolithic applications into a set of micro-services. The second is to integrate the resulting disaggregated components back into a functioning system, packaged with sufficient configuration and life cycle management tools to make it deployable in a production environment. This talk describes CORD, a community-based open source effort to address these challenges. CORD is being deployed in Telco field trials, but more interestingly, it lowers the barrier for anyone (not just global carriers) to deploy edge solutions that incorporate the latest 5G (wireless) and XGS-PON (fiber) access technologies. The talk concludes with some remarks on the opportunity this democratization of the network edge opens for the research community. Bio: Larry Peterson is the Robert E. Kahn Professor of Computer Science, Emeritus at Princeton University, where he served as Chair from 2003-2009. He is a co-author of the best-selling networking textbook Computer Networks: A Systems Approach (5e). His research focuses on the design, implementation, and deployment of Internet-scale distributed systems, including the widely used PlanetLab and MeasurementLab platforms. He is currently working on a new access edge cloud called CORD, an open source project of the Open Networking Foundation.

1 0

Christopher Hodsdon will present his general exam on Tuesday, January 22, 2019 at 3pm in CS 302.
by Nicki Gotsis 16 Jan '19

16 Jan '19

Christopher Hodsdon will present his general exam on Tuesday, January 22, 2019 at 3pm in CS 302. The members of his committee are as follows: Wyatt Lloyd (Adviser), Michael Freedman, and Amit Levy. Everyone is invited to attend his talk, and those faculty wishing to remain for the oral exam following are welcome to do so. His abstract and reading list follow below. Title: "Holeless, Fault Tolerant, and Scalable Sequencing" Abstract: Some recent distributed systems use a monolithic sequencer, a single server handing out sequence numbers, as a building block for ordering operations in the system. Monolithic sequencers can simplify the design of distributed systems by replacing complex distributed ordering protocols, such as two-phase locking and Paxos, with a single round trip to the sequencer. Sequencers can also improve system throughput by ordering operations before they are executed, reducing contention. However, existing monolithic sequencers have two limitations. First, they allow holes in the sequence, which makes it difficult to build correct and efficient systems. Second, they impose a scalability ceiling on the system. We present CATS, a sequencing subsystem that overcomes these limitations while still providing the simplicity and throughput benefits of a monolithic sequencer. CATS provides a holeless sequence with a specialized reliable transport protocol, a sequencer recovery protocol, and a replicated layer of proxies interposed between clients and the sequencer. CATS also leverages the replicated layer of proxies to provide infinitely scalable throughput through two complementary scaling mechanisms. ------- Reading List: Balakrishnan, Mahesh, Dahlia Malkhi, Vijayan Prabhakaran, Ted Wobber, Michael Wei, and John D. Davis. "Corfu: A shared log design for flash clusters." In Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation, pp. 1-1. USENIX Association, 2012. Wei, Michael, Amy Tai, Christopher J. Rossbach, Ittai Abraham, Maithem Munshed, Medhavi Dhawan, Jim Stabile, Udi Wieder, Scott Fritchie, Steven Swanson, Michael J. Freedman, and Dahlia Malkhi. "vCorfu: A Cloud-Scale Object Store on a Shared Log." In NSDI, pp. 35-49. 2017. Li, Jialin, Ellis Michael, and Dan RK Ports. "Eris: Coordination-free consistent transactions using in-network concurrency control." In Proceedings of the 26th Symposium on Operating Systems Principles, pp. 104-120. ACM, 2017. Li, Jialin, Ellis Michael, Naveen Kr Sharma, Adriana Szekeres, and Dan RK Ports. "Just Say NO to Paxos Overhead: Replacing Consensus with Network Ordering." In OSDI, pp. 467-483. 2016. Lamport, Leslie. "The part-time parliament." ACM Transactions on Computer Systems (TOCS) 16, no. 2 (1998): 133-169. Liskov, Barbara, and James Cowling. "Viewstamped replication revisited." (2012). Moraru, Iulian, David G. Andersen, and Michael Kaminsky. "Egalitarian paxos." In ACM Symposium on Operating Systems Principles. 2012. Kapritsos, Manos, Yang Wang, Vivien Quema, Allen Clement, Lorenzo Alvisi, and Mike Dahlin. "All about Eve: Execute-Verify Replication for Multi-Core Servers." In OSDI, vol. 12, pp. 237-250. 2012. Schneider, Fred B. "Implementing fault-tolerant services using the state machine approach: A tutorial." ACM Computing Surveys (CSUR) 22, no. 4 (1990): 299-319. Lamport, Leslie. "Time, clocks, and the ordering of events in a distributed system." Communications of the ACM 21, no. 7 (1978): 558-565. Textbook: Tanenbaum, Andrew S., and Maarten Van Steen. Distributed systems: principles and paradigms. Prentice-Hall, 2007.

1 0

Khiem's General Exam will take place on Tuesday, January 22, 2019 in CS 105 at 12pm.
by Nicki Gotsis 16 Jan '19

16 Jan '19

BQ_BEGIN Khiem's General Exam will take place on Tuesday, January 22, 2019 in CS 105 at 12pm. The members of his committee are as follows: Wyatt Lloyd (Adviser), Michael Freedman, and Amit Levy. BQ_BEGIN Everyone is invited to attend his talk, and those faculty wishing to remain for the oral exam following are welcome to do so. His abstract and reading list follow below. BQ_END Title: K2: Lower Latency for Partial Replication Across Many Datacenters Abstract: The infrastructure available to large-scale web services now spans dozens of geographically dispersed datacenters. Utilizing this large number of datacenters to scale storage capacity requires a backend storage system to partially replicate data, i.e., to store only a subset of data in each datacenter. Partial replication, however, sacrifices the low latency benefits of having many datacenters: accessing data that is not replicated in a local datacenter incurs higher delay from contacting far-away datacenters. K2, a causally-consistent data store with read-only transactions and write-only transactions, shows it is possible for a partially-replicated storage system to provide local datacenter latency in many settings. This is powered by our novel replication approach, MetaDC, and a novel read-only transaction algorithm. With only simple writes, MetaDC provides the best possible worst-case latency for read-only transactions in K2: a single round trip to remote datacenters. The novel read-only transaction algorithm allows many read-only transactions to execute entirely in their local datacenters by exploiting a small data cache. Our evaluation shows that K2 achieves much lower latency than a baseline that directly adapts causal consistency for partial replication. Reading List Textbook: TANENBAUM, A. S., AND vAN STEEN, M. Distributed Systems: Principles and Paradigms (2nd Edition).Pearson Education, 2006. Paper list: AHAMAD, M., NEIGER, G., KOHLI, P., BURNS, J., AND HUTTO, P. Causal Memory: Definitions, Implementation, and Programming. Distributed Computing 9, 1 (1995). ANNAMALAI, M., RAVICHANDRAN, K., SRINIVAS, H., ZINKOVSKY, I., PAN, L., SAVOR, T., NAGLE, D., AND STUMM, M. Sharding the Shards: Managing Datastore Locality at Scale with Akkio. In Proc. OSDI (2018). BELARAMANI, N., DAHLIN, M., GAO, L., NAYATE, A., VENKATARAMANI, A., YALAGANDULA, P., AND ZHENG, J. PRACTI replication. In Proc. NSDI (2006). CORBETT, J. C., DEAN, J., EPSTEIN, M., FIKES, A., FROST, C., FURMAN, J., GHEMAWAT, S., GUBAREV, A., HEISER, C., HOCHSCHILD, P., HSIEH, W., KANTHAK, S., KOGAN, E., LI, H., LLOYD, A., MELNIK, S., MWAURA, D., NAGLE, D., QUINLAN, S., RAO, R., ROLIG, L., SAITO, Y., SZYMANIAK, M., TAYLOR, C., WANG, R., ANDWOODFORD, D. Spanner: Google’s Globally-Distributed Database. In Proc. OSDI (2012). DECANDIA, G., HASTORUN, D., JAMPANI, M., KAKULAPATI, G., LAKSHMAN, A., PILCHIN, A., SIVASUBRAMANIAN, S., VOSSHALL, P., AND VOGELS , W. Dynamo: Amazon’s highly available key-value store. In Proc. SOSP (2007). LAMPORT, L. Time, clocks, and the ordering of events in a distributed system. Comm. ACM 21, 7 (1978). LAMPORT, L. The Part-Time Parliament. ACM TOCS 16, 2 (1998). LLOYD, W., FREEDMAN, M. J., KAMINSKY, M., AND ANDERSEN, D. G. Don’t Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS. In Proc. SOSP (2011). LLOYD, W., FREEDMAN, M. J., KAMINSKY, M., AND ANDERSEN, D. G. Stronger Semantics for Low- Latency Geo-Replicated Storage. In Proc. NSDI (2013). MAHMOOD, T., NARAYANAN, S. P., RAO, S., VIJAYKUMAR, T. N., AND THOTTETHODI, M. Karma: Cost-effective geo-replicated cloud storage with dynamic enforcement of causal consistency. IEEE TCC (2018). PETERSEN, K., SPREITZER, M., TERRY, D., THEIMER, M., AND DEMERS, A. Flexible update propagation for weakly consistent replication. In Proc.SOSP (1997). ZAWIRSKI, M., PREGUIC ̧A, N., DUARTE, S., BIENIUSA, A., BALEGAS, V., AND SHAPIRO, M. Write Fast, Read in the Past: Causal Consistency for Client-Side Applications. In ACM/IFIP/USENIX International Middleware Conference (2015). BQ_END

1 0

2-3pm Wed Jan 23rd Larry Peterson distinguished colloquium in CS 105
by Jennifer Rexford 14 Jan '19

14 Jan '19

On Wednesday January 23rd, Larry Peterson, emeritus faculty and former chair of computer science at Princeton, will give a distinguished colloquium talk. Note the unusual 2pm start time. Title: Democratizing the Network Edge Speaker: Larry Peterson, Princeton University and Open Networking Foundation Date/time: 2-3pm Wed Jan 23 Location: CS 105 (the “small auditorium”) Abstract: The network edge—where the access networks that connect homes, businesses, and mobile users to the Internet are implemented—is in the midst of a transformation. Network operators (Telcos and CableCos) are transitioning from closed and proprietary hardware to disaggregated and virtualized software running on white-box servers, switches, and access devices. This transformation is partly motivated by the CAPEX savings that come from replacing purpose-built appliances with commodity hardware, but it is mostly driven by the need to increase feature velocity through the softwarization of the access network. The goal is to enable new classes of edge services—e.g., Autonomous Vehicles, Internet-of-Things (IoT), Immersive User Interfaces—that benefit from low latency connectivity. This is all part of the growing trend to move functionality to the network edge. This transformation faces two technical challenges. The first is to disaggregate and virtualize existing hardware appliances. This is done, for example, by applying SDN principles (decoupling the network control and data planes) and by breaking monolithic applications into a set of micro-services. The second is to integrate the resulting disaggregated components back into a functioning system, packaged with sufficient configuration and life cycle management tools to make it deployable in a production environment. This talk describes CORD, a community-based open source effort to address these challenges. CORD is being deployed in Telco field trials, but more interestingly, it lowers the barrier for anyone (not just global carriers) to deploy edge solutions that incorporate the latest 5G (wireless) and XGS-PON (fiber) access technologies. The talk concludes with some remarks on the opportunity this democratization of the network edge opens for the research community. Bio: Larry Peterson is the Robert E. Kahn Professor of Computer Science, Emeritus at Princeton University, where he served as Chair from 2003-2009. He is a co-author of the best selling networking textbook Computer Networks: A Systems Approach (5e). His research focuses on the design, implementation, and deployment of Internet-scale distributed systems, including the widely used PlanetLab and MeasurementLab platforms. He is currently working on a new access edge cloud called CORD, an open source project of the Open Networking Foundation.

1 0