Shinji Sugawara
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Shinji Sugawara has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Toshinobu Hayashi
Nagoya Institute of Technology
2 shared publications- Yutaka Ishibashi
Nagoya Institute of Technology, Nagoya, Japan
2 shared publications Chikara Miura
Nagoya Institute of Technology
1 shared publicationD.-L. Pham
University of Electro-Communications, Tokyo, Japan
1 shared publicationDaiki Takeda
Nagoya Institute of Technology
1 shared publication- Hitoshi Nagai
Chiba Institute of Technology, Narashino, Japan
1 shared publication
Latest Publications
- Open Access
- 21 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 113-118
Enhancing Content Availability and Consistency in Application-Layer CCN via RAID-like Redundancy
- 21 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 113-118
Open AccessEnhancing Content Availability and Consistency in Application-Layer CCN via RAID-like Redundancy
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3132 (1) , 040002
Efficient content sharing using multi-cloud storage with selective RAID-like chunk retention control
Recently, a method to avoid system failure, information leakage, and vendor-lock-in has been proposed by bundling storage services of multiple cloud vendors usi Recently, a method to avoid system failure, information leakage, and vendor-lock-in has been proposed by bundling storage services of multiple cloud vendors usi
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3132 (1) , 040002
Efficient content sharing using multi-cloud storage with selective RAID-like chunk retention control
Recently, a method to avoid system failure, information leakage, and vendor-lock-in has been proposed by bundling storage services of multiple cloud vendors usi Recently, a method to avoid system failure, information leakage, and vendor-lock-in has been proposed by bundling storage services of multiple cloud vendors usi
- 18 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 567-571
An Improved Method of Reliable Content Extraction from Partially Unreliable Publications in Plural Number of Sources over the Network
This paper discusses a method of simplifying the model of information dissemination and mainly eliminating errors statistically without going into semantics for the same content collected from many information sources scattered over the network. In the methods we proposed in the past, it is assumed that the same content collected from the sources can be divided into parts that have independent values. By taking a majority vote about the value of each part, the content consisting of only the part with major values is reconstructed. For the improvement of the extraction accuracy of the reliable part of the target content, more efficient weighting ways of majority voting and their effects are discussed.
- 18 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 567-571
An Improved Method of Reliable Content Extraction from Partially Unreliable Publications in Plural Number of Sources over the Network
This paper discusses a method of simplifying the model of information dissemination and mainly eliminating errors statistically without going into semantics for the same content collected from many information sources scattered over the network. In the methods we proposed in the past, it is assumed that the same content collected from the sources can be divided into parts that have independent values. By taking a majority vote about the value of each part, the content consisting of only the part with major values is reconstructed. For the improvement of the extraction accuracy of the reliable part of the target content, more efficient weighting ways of majority voting and their effects are discussed.
- 17 June 2022
- Published by Springer Nature
- p. 517-527
Efficient Content Sharing Using Dynamic Fog in Cloud-Fog-Edge Three-Tiered Network
- 17 June 2022
- Published by Springer Nature
- p. 517-527
Efficient Content Sharing Using Dynamic Fog in Cloud-Fog-Edge Three-Tiered Network
- 30 June 2021
- Published by Springer Nature
- p. 715-726
Dynamic Fog Configuration for Content Sharing with Peer-to-Peer Network Using Mobile Terminals in a City
- 30 June 2021
- Published by Springer Nature
- p. 715-726
Dynamic Fog Configuration for Content Sharing with Peer-to-Peer Network Using Mobile Terminals in a City
- 27 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 380-385
In-advance Deployment of Shared Content Replicas over Hybrid Peer-to-Peer Network Using Linear Popularity Prediction
This paper proposes an efficient content deployment method over a Peer-to-Peer network in advance, before issuing content retrieval requests from the users, according to the users' location and whose content preferences. In that situation, the proposed method predicts the temporal alteration of each content items' popularity using simple linear approximation and deploys each item to its appropriate place. As a result, the method can be expected that the network load, content loss, and storage cost required for redundant replica deployment will be reduced. On top of that, the proposal is evaluated by computer simulations from the viewpoint of those three costs mentioned above, and from the results, the effectiveness of the proposed method is finally discussed.
- 27 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 380-385
In-advance Deployment of Shared Content Replicas over Hybrid Peer-to-Peer Network Using Linear Popularity Prediction
This paper proposes an efficient content deployment method over a Peer-to-Peer network in advance, before issuing content retrieval requests from the users, according to the users' location and whose content preferences. In that situation, the proposed method predicts the temporal alteration of each content items' popularity using simple linear approximation and deploys each item to its appropriate place. As a result, the method can be expected that the network load, content loss, and storage cost required for redundant replica deployment will be reduced. On top of that, the proposal is evaluated by computer simulations from the viewpoint of those three costs mentioned above, and from the results, the effectiveness of the proposed method is finally discussed.
- 11 June 2020
- Published by Springer Nature
- p. 548-559
In-Advance Replica Arrangement of Shared Data over Hybrid Peer-to-Peer Network According to Users’ Locations and Preferences
- 11 June 2020
- Published by Springer Nature
- p. 548-559
In-Advance Replica Arrangement of Shared Data over Hybrid Peer-to-Peer Network According to Users’ Locations and Preferences
- 18 October 2019
- Published by Springer Nature
- p. 293-302
Digital Content Refinement by Collecting Partly Unreliable Attributes over a Network
- 18 October 2019
- Published by Springer Nature
- p. 293-302
Digital Content Refinement by Collecting Partly Unreliable Attributes over a Network
- 19 October 2018
- Published by Springer Nature
- p. 271-284
Efficient Scheduling for Concurrent Contents Searching with Idle Computational Resources
- 19 October 2018
- Published by Springer Nature
- p. 271-284
Efficient Scheduling for Concurrent Contents Searching with Idle Computational Resources