Demo Data from EDBT 2026 / reviewers in the wild / expert
Yurino Sato
dblp:141/1987
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 2 first-author · 1 since 2021
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 |
Internet architecture and protocols · 51% Transport protocols and congestion control · 19% Content delivery and video streaming · 15% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › information-centric networking
content-centric networking |
0.6 | 1 | 2022 | Poster: A Content Popularity Classification-Based Content Search Scheme for CCN · ICNP 2022 |
Content delivery and video streaming
caching |
0.2 | 1 | 2022 | Poster: A Content Popularity Classification-Based Content Search Scheme for CCN · ICNP 2022 |
Physical-layer communications › channel coding › error control coding
forward error correction |
0.2 | 1 | 2013 | Redundancy control and duplicate ACK suppression methods for TCP with FEC · ICNP 2013 |
Transport protocols and congestion control
TCP performance |
0.2 | 1 | 2013 | Redundancy control and duplicate ACK suppression methods for TCP with FEC · ICNP 2013 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Poster: A Content Popularity Classification-Based Content Search Scheme for CCNabstractThis paper presents a novel content search scheme based on classified content popularity for CCN. Some existing research focuses mainly on improving the cache hit rate to resolve the on-path caching problem. We decide this problem by reducing acquisition hops to obtain requested contents. Our proposed scheme can reduce the number of acquisition hops by determining the forwarding range of search packets using classified content popularity calculated on each CR. In this paper, we clarify that the proposed scheme reduces the number of acquisition hops by up to 10% compared to previous work through simulation evaluation. Yurino Sato, Hiroyuki Koga |
ICNP | 1 |
| 2018 | An Effective Scheme to Utilize Caches for Streaming Services in Mobile CCNabstractA content-centric networking (CCN) is expected for high quality streaming services with in-network caching. In mobile environment, users cannot frequently receive requested segments due to handovers. This will cause retransmissions of missing segments from a server as well as playback delays and interruptions. In this study, we propose a more effective scheme to utilize caches near users for high quality streaming services in mobile CCN, and demonstrate the effectiveness of our scheme through simulation evaluations. Go Nakagawa, Yusuke Ito, Yurino Sato, Hiroyuki Koga |
IPCCC | 3 |
| 2013 | Redundancy control and duplicate ACK suppression methods for TCP with FECabstractPacket losses significantly degrade TCP performance in high latency networks. To improve TCP performance in such networks, we proposed two methods to suppress the return of duplicate ACKs and to control minimum redundancy because FEC technology cannot work effectively when simply applied to TCP operation. Simulation evaluations show that the proposed methods enable higher throughput than the conventional methods, especially in high latency environments. In our future work, we will consider a scheme to more appropriately determine the appropriate redundancy level for network conditions and to more effectively recover lost packets in a real environment, such as where burst packet losses occur. Yurino Sato, Hiroyuki Koga, Masayoshi Shimamura, Takeshi Ikenaga |
ICNP | 1 |