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.

Naoki Moriyama

dblp:98/458 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Computer networks · 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 networks
1 paper
Internet architecture and protocols · 33% Network measurement and analytics · 33% Network optimization and economics · 33%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics
flow aggregation
0.412019
A Study on Effective Congestion Control to Retrieve Distributed Data in ICN · ICNP 2019
Internet architecture and protocols
information-centric networking
0.412019
A Study on Effective Congestion Control to Retrieve Distributed Data in ICN · ICNP 2019
Network optimization and economics › resource allocation
rate allocation
0.412019
A Study on Effective Congestion Control to Retrieve Distributed Data in ICN · ICNP 2019

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

simulation · 0.4
YearPublicationVenuePosition
2019 A Study on Effective Congestion Control to Retrieve Distributed Data in ICN
abstract
Information-centric networking (ICN) is expected as a novel network architecture for content delivery services. In ICN, content routers (CRs) with a cache function store a chunk received from upstream CRs or servers. Therefore, clients can retrieve distributed chunks from multiple nodes simultaneously. However, it will cause heavy congestion due to competition of multiple flows in a network as well as long time to acquire content. In this study, we propose an efficient congestion control scheme to retrieve distributed chunks from multiple nodes in ICN. This scheme aggregates competing flows and then allocates an adequate transmission rate to the aggregated flows. We show the effictiveness of the proposed scheme through simulation evaluations.
Naoki Moriyama, Yusuke Ito, Hiroyuki Koga
ICNP1