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

Fengyun Cao

dblp:62/805 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2005
0000-0002-4005-069XORCID · corroborated

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

Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

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 · 100%
Computer networks
1 paper
Network performance modeling · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › publish/subscribe systems
content-based event matching
0.012004
Efficient event routing in content-based publish/subscribe service network · INFOCOM 2004
Distributed systems
publish/subscribe systems
0.012004
Efficient event routing in content-based publish/subscribe service network · INFOCOM 2004

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

simulation · 0.1
YearPublicationVenuePosition
2005 MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks
Fengyun Cao, Jaswinder Pal Singh
Middleware1
2004 Efficient event routing in content-based publish/subscribe service network
abstract
Efficient event delivery in a content-based publish/subscribe system has been a challenging problem. Existing group communication solutions, such as IP multicast or application-level multicast techniques, are not readily applicable due to the highly heterogeneous communication pattern in such systems. We first explore the design space of event routing strategies for content-based publish/subscribe systems. Two major existing approaches are studied: filter-hosed approach, which performs content-based filtering on intermediate routing servers to dynamically guide routing decisions, and multicast-based approach, which delivers events through a few high-quality multicast groups that are pre-constructed to approximately match user interests. These approaches have different trade-offs in the routing quality achieved and the implementation cost and system load generated. We then present a new routing scheme called Kyra that carefully balance these trade-offs. Kyra combines the advantages of content-based filtering and event-space partitioning in the existing approaches to achieve better overall routing efficiency. We use detailed simulations to evaluate Kyra and compare it with existing approaches. The results demonstrate the effectiveness of Kyra in achieving high network efficiency, reducing implementation cost and balancing system load across the publish-subscribe service network.
Fengyun Cao, Jaswinder Pal Singh
INFOCOM1