Demo Data from VLDB 2026 / reviewers in the wild / expert
Cheuk H. Lam
dblp:17/2244
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1997
0000-0002-1765-4831ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2
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 networks
2 papers |
Routing and switching · 59% Internet architecture and protocols · 23% Network optimization and economics · 18% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › ATM networks
ATM switch |
0.0 | 1 | 1997 | Performance and Complexity of Multicast Cross-Path ATM Switches · INFOCOM 1997 |
Network optimization and economics › network flow
capacity and flow assignment |
0.0 | 1 | 1997 | Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet Switches · IEEE J. Sel. Areas Commun. 1997 |
Routing and switching › switching networks
multicast switching |
0.0 | 1 | 1997 | Performance and Complexity of Multicast Cross-Path ATM Switches · INFOCOM 1997 |
Routing and switching
switch scheduling |
0.0 | 1 | 1997 | Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet Switches · IEEE J. Sel. Areas Commun. 1997 |
Internet architecture and protocols › ATM networks
ATM switching |
0.0 | 1 | 1997 | Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet Switches · IEEE J. Sel. Areas Commun. 1997 |
Routing and switching › switching networks › multistage interconnection network
clos network |
0.0 | 1 | 1997 | Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet Switches · IEEE J. Sel. Areas Commun. 1997 |
Performance modeling and evaluation › network performance analysis
switch performance |
0.0 | 1 | 1997 | Performance and Complexity of Multicast Cross-Path ATM Switches · INFOCOM 1997 |
Methods — techniques the papers use, named apart from their topics
queueing analysis · 0.0look-ahead selection · 0.0bipartite multigraph coloring · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Performance and Complexity of Multicast Cross-Path ATM SwitchesabstractA newly proposed large-scale ATM switch called the cross-path switch has been shown to be capable of handling multirate traffic efficiently. We study two replication approaches to enhance the switch to support multicasting. The first approach replicates multicast cells at both the input and output stages, while the second one replicates cells at the input stage only. A feasible configuration for each scheme is considered and the effect of multicast traffic on the switch performance in terms of the throughput and cell loss probability is studied. We observed that, to achieve the same throughput and loss requirement, the second architecture may require fewer switching elements than the first one. Raymond H. Lin, Cheuk H. Lam, Tony T. Lee |
INFOCOM | 2 |
| 1997 | Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet SwitchesabstractA quasi-static routing scheme called path switching for large-scale ATM packet switch systems is proposed. Previously the Clos network has been used as the model for many large-scale ATM switch architectures, in which the most difficult issue is path and bandwidth assignment for each connection request. The static routing scheme, such as multirate circuit switching, does not fully exploit the statistical multiplexing gain. In contrast, the dynamic routing scheme, such as straight matching, requires slot-by-slot computation of route assignment. Path switching is a compromise of these two routing schemes. It uses a predetermined periodical connection pattern in the central stage, look-ahead selection in the input stage, and output queueing in the last stage. The scheduling of path switching consists of capacity assignment and route assignment. The capacity assignment is constrained by the quality of service of connection requests. The route assignment is based on the timespace interleaving of the coloring of bipartite multigraphs. We show that path switching can handle multirate and multimedia traffic effectively in the Clos network. Tony T. Lee, Cheuk H. Lam |
IEEE J. Sel. Areas Commun. | 2 |