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

Fan Ping

dblp:84/7639 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · conflict

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

Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 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
3 papers
Distributed systems · 86% Cloud and datacenter computing · 11% Interconnection networks and networks-on-chip · 3%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed database
0.412020
Millions of Tiny Databases · NSDI 2020
Distributed systems
fault tolerance
0.222010
iFlow: An Approach for Fast and Reliable Internet-Scale Stream Processing Utilizing Detouring and Replication · Proc. VLDB Endow. 2010
Detouring and replication for fast and reliable internet-scale stream processing · HPDC 2010
Distributed systems
replication
0.222010
iFlow: An Approach for Fast and Reliable Internet-Scale Stream Processing Utilizing Detouring and Replication · Proc. VLDB Endow. 2010
Detouring and replication for fast and reliable internet-scale stream processing · HPDC 2010
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.112020
Millions of Tiny Databases · NSDI 2020
Data stream processing
distributed stream processing
0.112010
iFlow: An Approach for Fast and Reliable Internet-Scale Stream Processing Utilizing Detouring and Replication · Proc. VLDB Endow. 2010
Distributed systems
stream processing
0.112010
Detouring and replication for fast and reliable internet-scale stream processing · HPDC 2010
Physical-layer communications
outage probability
0.012010
iFlow: An Approach for Fast and Reliable Internet-Scale Stream Processing Utilizing Detouring and Replication · Proc. VLDB Endow. 2010
Interconnection networks and networks-on-chip
network congestion
0.012010
Detouring and replication for fast and reliable internet-scale stream processing · HPDC 2010

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

replication · 0.5detouring · 0.4consensus · 0.4replica migration · 0.3operator migration · 0.1
YearPublicationVenuePosition
2020 Millions of Tiny Databases
Marc Brooker, Fan Ping
NSDI3
2017 Global Adaptive and Local Scheduling Control for Smart Isolated Intersection Based on Real-Time Phase Saturability
Shi-Yuan Han, Fan Ping, Yuehui Chen, Jin Zhou 0003, Dong Wang 0021
ICIC (2)2
2010 Detouring and replication for fast and reliable internet-scale stream processing
abstract
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in conjunction with detouring techniques to overcome network congestion and outages. Computation over iFlow can be expressed as a graph of operators. To cope with varying system conditions these operators continually migrate in a manner that improves performance and availability at the same time.
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
HPDC2
2010 A Retrospective Approach for Accurate Network Latency Prediction
abstract
Network coordinate systems can efficiently predict the round-trip time between any pair of nodes on the Internet. These systems map nodes onto a multi-dimensional coordinate space such that the round-trip time between two arbitrary nodes can be estimated by the distance between the corresponding pair of points in the coordinate space. In these systems, each node continuously updates its coordinates based on the latencies of new communications and the coordinates of other nodes. Node coordinates obtained in this manner, however, may be misled by erroneous information, such as extraordinary roundtrip times. Previous techniques attempt to overcome this problem by having nodes reject new information if it is inconsistent with the current coordinates. These techniques are still inappropriate if the coordinates are not sufficiently accurate. In this paper, we develop a new approach where each node preserves recent communication history. To update a node's coordinates more accurately, our approach re-evaluates the records in the node's history while ignoring inconsistent communication records and applying a higher weight to more reliable records. This approach thus can prevent node coordinates from being affected by erroneous information that was difficult to detect in the past. Through evaluations based on real network trace data, we demonstrate that our approach can reduce network latency prediction errors by 50% compared to previous approaches.
Fan Ping, Christopher McConnell, Jeong-Hyon Hwang
ICCCN1
2010 iFlow: An Approach for Fast and Reliable Internet-Scale Stream Processing Utilizing Detouring and Replication
abstract
We propose to demonstrate iFlow, our replication-based system that supports both fast and reliable processing of data streams over the Internet. iFlow uses a low degree of replication in conjunction with detouring techniques to overcome network outages. iFlow also deploys replicas in a manner that improves performance and availability at the same time, and can cope with varying system conditions by continually migrating replicas. Based on a live network monitoring application, our demonstration will substantiate the strengths of iFlow. During the demonstration, various visual tools will provide graphical evidence of improvements with regards to availability, performance, and resource usage. To show iFlow's adaptivity, these tools will also allow us to control the demonstration situation including injecting different types of failures.
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
Proc. VLDB Endow.2
2009 Clustering and Tailoring User Session Data for Testing Web Applications
abstract
Web applications have become major driving forces for world business. Effective and efficient testing of evolving Web applications is essential for providing reliable services. In this paper, we present a user session based testing technique that clusters user sessions based on the service profile and selects a set of representative user sessions from each cluster. Then each selected user session is tailored by augmentation with additional requests to cover the dependence relationships between Web pages. The created test suite not only can significantly reduce the size of the collected user sessions, but is also viable to exercise fault sensitive paths. We conducted two empirical studies to investigate the effectiveness of our approach- one was in a controlled environment using seeded faults, and the other was conducted on an industrial system with real faults. The results demonstrate that our approach consistently detected the majority of the known faults by using a relatively small number of test cases in both studies.
Xingmin Luo, Fan Ping, Mei-Hwa Chen
ICST2