S
Suyong Eum
Researcher at Osaka University
Publications - 25
Citations - 294
Suyong Eum is an academic researcher from Osaka University. The author has contributed to research in topics: Information-centric networking & Network topology. The author has an hindex of 6, co-authored 23 publications receiving 257 citations. Previous affiliations of Suyong Eum include National Institute of Information and Communications Technology.
Papers
More filters
Proceedings ArticleDOI
CATT: potential based routing with content caching for ICN
TL;DR: In this article, potential based routing (PBR) is introduced to achieve several design goals such as availability, adaptability, diversity, and robustness for ICN, and the performance of a random caching policy is examined.
CATT : Potential Based Routing with Content Caching for ICN
TL;DR: In this paper, potential based routing (PBR) is introduced to achieve several design goals such as availability, adaptability, diversity, and robustness for ICN, and the performance of a random caching policy is examined.
Journal ArticleDOI
Information-Centric Networking: Research and Standardization Status
Keping Yu,Suyong Eum,Toshihiko Kurita,Qiaozhi Hua,Takuro Sato,Hidenori Nakazato,Tohru Asami,Ved P. Kafle +7 more
TL;DR: The history of global activities on ICN from 2010 is described, giving references to various projects and the recent progress in the standardization of ICN component technologies in ITU-T and various documents produced by ICNRG are described.
Journal ArticleDOI
CATT: Cache aware target identification for ICN
TL;DR: This article proposes an ICN architecture named Cache Aware Target identification (CATT) and introduces the architecture by focusing on two of its major components: routing and content caching.
Proceedings ArticleDOI
Toward bio-inspired network robustness - Step 1. Modularity
TL;DR: The numerical results show that the quantified modularity seems to be more important measure to understand robustness of IP networks than any other common properties such as clustering coefficient, degree distribution, and average path length.