Demo Data from EDBT 2026 / reviewers in the wild / expert
Chinatsu Ikeda
dblp:93/560
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 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 networks
2 papers |
Transport protocols and congestion control · 39% Internet architecture and protocols · 31% Wireless networking · 15% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transport protocols and congestion control › TCP
TCP over ATM |
0.0 | 1 | 1996 | A Simulation Study of TCP Performance in ATM Networks with ABR and UBR Services · INFOCOM 1996 |
Transport protocols and congestion control
TCP performance |
0.0 | 1 | 1996 | A Simulation Study of TCP Performance in ATM Networks with ABR and UBR Services · INFOCOM 1996 |
Internet architecture and protocols › resource reservation
bandwidth reservation |
0.0 | 1 | 1994 | Adaptive Congestion Control Schemes for ATM LANs · INFOCOM 1994 |
Wireless networking › link adaptation
rate adaptation |
0.0 | 1 | 1994 | Adaptive Congestion Control Schemes for ATM LANs · INFOCOM 1994 |
Network optimization and economics
resource allocation |
0.0 | 1 | 1994 | Adaptive Congestion Control Schemes for ATM LANs · INFOCOM 1994 |
Internet architecture and protocols › ATM networks
available bit rate service |
0.0 | 1 | 1996 | A Simulation Study of TCP Performance in ATM Networks with ABR and UBR Services · INFOCOM 1996 |
Internet architecture and protocols › ATM networks
ATM LAN |
0.0 | 1 | 1994 | Adaptive Congestion Control Schemes for ATM LANs · INFOCOM 1994 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | A Simulation Study of TCP Performance in ATM Networks with ABR and UBR ServicesabstractWe present a simulation study of the TCP performance in ATM networks with available bit rate (ABR) service and unspecified bit rate (UBR) service with early packet discard (EPD) schemes. We focus our study in a LAN environment using some benchmark network configurations proposed in the ATM Forum. Our simulation results show the following: (1) with UBR service and EPD schemes, TCP suffers significant performance degradation in terms of fairness and requires relatively large switch buffer even with a small number of active virtual connections over a LAN configuration, and (2) for the same set of network configurations and with ABR service using explicit rate feedback schemes, TCP achieves a good performance in terms of fairness and link utilization, and requires a relatively small switch buffer. Hongqing Li, Kai-Yeung Siu, Henry H.-Y. Tzeng, Chinatsu Ikeda, Hiroshi Suzuki |
INFOCOM | 4 |
| 1996 | On TCP performance in ATM networks with per-VC early packet discard mechanisms
Hongqing Li, Kai-Yeung Siu, Henry H.-Y. Tzeng, Chinatsu Ikeda, Hiroshi Suzuki |
Comput. Commun. | 4 |
| 1994 | Adaptive Congestion Control Schemes for ATM LANsabstractNew congestion control schemes using the adaptive rate control for ATM LANs are presented. It is preferable for hosts in LANs to be able to send bursts at the same speed as the interface link speed in a lightly loaded condition, and as the network load increases, to reduce their traffic rate adaptively in order to avoid network congestion. The authors propose to apply such a rate control concept for two different traffic classes in the ATM LANs. For the first traffic class requiring no bandwidth reservation, i.e. a best effort service class, a combination of the end-to-end adaptive peak rate control with the link-by-link backpressure control is proposed. For the second traffic class, requiring the bandwidth reservation for the burst transmission, i.e. a guaranteed burst service class, a combination of the adaptive peak rate control with the fast bandwidth reservation (FRP) is proposed. It is shown through simulations that, in the first class traffic, cell loss is avoided by the backpressure, while the unfairness problems caused by the backpressure in a heavy load situation are resolved with the adaptive rate control. In the second class traffic, the network throughput characteristics are shown to be improved in the heavily loaded situations, owing to the fact that the adaptive rate control reduces the bandwidth reservation blocking probability.> Chinatsu Ikeda, Hiroshi Suzuki |
INFOCOM | 1 |