Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lay Kuan Loh

dblp:164/6240 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 50% Storage systems · 50%
Computer networks
1 paper
Network management and operations · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
distributed coordination and fault tolerance
0.312017
Distributed Provenance Compression · SIGMOD Conference 2017
Storage systems › data compression
provenance compression
0.312017
Distributed Provenance Compression · SIGMOD Conference 2017
Network management and operations › fault management
fault diagnosis
0.112017
Distributed Provenance Compression · SIGMOD Conference 2017

Methods — techniques the papers use, named apart from their topics

static analysis · 0.6distributed event-based linear programs · 0.6
YearPublicationVenuePosition
2017 Distributed Provenance Compression
abstract
Network provenance, which records the execution history of network events as meta-data, is becoming increasingly important for network accountability and failure diagnosis. For example, network provenance may be used to trace the path that a message traversed in a network, or to reveal how a particular routing entry was derived and the parties involved in its derivation. A challenge when storing the provenance of a live network is that the large number of the arriving messages may incur substantial storage overhead. In this paper, we explore techniques to dynamically compress distributed provenance stored at scale. Logically, the compression is achieved by grouping equivalent provenance trees and maintaining only one concrete copy for each equivalence class. To efficiently identify equivalent provenance, we (1) introduce distributed event-based linear programs (DELP) to specify distributed network applications, and (2) statically analyze DELPs to allow for quick detection of provenance equivalence at runtime. Our experimental results demonstrate that our approach leads to significant storage reduction and query latency improvement over alternative approaches.
Chen Chen 0019, Harshal Tushar Lehri, Lay Kuan Loh, Anupam Alur, Limin Jia 0001, Boon Thau Loo, Wenchao Zhou
SIGMOD Conference3
2015 Automated verification of safety properties of declarative networking programs
abstract
Networks are complex systems that unfortunately are ridden with errors. Such errors can lead to disruption of services, which may have grave consequences. Verification of networks is key to eliminating errors and building robust networks. In this paper, we propose an approach to verify networks using declarative networking, where networks are specified in NDlog, a declarative language. We focus on analyzing safety properties. We develop a technique to statically analyze NDlog programs: first, we build a dependency graph of the predicates of NDlog programs; then, we build a summary data structure called a derivation pool to represent all possible derivations and their associated constraints for predicates in the program; finally, properties specified in first-order logic are checked on the data structure with the help of the SMT solver Z3. We build a prototype tool and demonstrate the effectiveness of the tool in validating and debugging several SDN applications.
Chen Chen 0019, Lay Kuan Loh, Limin Jia 0001, Wenchao Zhou, Boon Thau Loo
PPDP2