The search functionality is under construction.

Author Search Result

[Author] HyunYong LEE(6hit)

1-6hit
  • Caching-Based Multi-Swarm Collaboration for Improving Content Availability in BitTorrent

    HyunYong LEE  Masahiro YOSHIDA  Akihiro NAKAO  

     
    PAPER-Information Network

      Vol:
    E95-D No:5
      Page(s):
    1446-1453

    Despite its great success, BitTorrent suffers from the content unavailability problem where peers cannot complete their content downloads due to some missing chunks, which is caused by a shortage of seeders who hold the content in its entirety. The multi-swarm collaboration approach is a natural choice for improving content availability, since content unavailability cannot be overcome by one swarm easily. Most existing multi-swarm collaboration approaches, however, suffer from content-related limitations, which limit their application scopes. In this paper, we introduce a new kind of multi-swarm collaboration utilizing a swarm as temporal storage. In a nutshell, the collaborating swarms cache some chunks of each other that are likely to be unavailable before the content unavailability happens and share the cached chunks when the content unavailability happens. Our approach enables any swarms to collaborate with each other without the content-related limitations. Simulation results show that our approach increases the number of download completions by over 50% (26%) compared to normal BitTorrent (existing bundling approach) with low overhead. In addition, our approach shows around 30% improved download completion time compared to the existing bundling approach. The results also show that our approach enables the peers participating in our approach to enjoy better performance than other peers, which can be a peer incentive.

  • Understanding of Network Operator-Friendly P2P Traffic Control Techniques

    HyunYong LEE  Akihiro NAKAO  

     
    PAPER-Information Network

      Vol:
    E94-D No:12
      Page(s):
    2460-2467

    In the network operator-friendly P2P traffic control technique such as P4P, peers are supposed to select their communication partners by following a guidance issued by the network operator. Thus, the guidance has significant impact on the traffic control. However, detailed performance study of available guidances is missing. Most existing approaches do not show how they affect intra-domain traffic control in detail while mostly focusing on inter-domain traffic control. In this paper, we try to understand how the guidances affect the intra and inter-domain traffic control for better guidance improving the traffic control. Through simulations, we reveal the following. The performance-based guidance reflecting the networking status shows attractive results in distributing the traffic over intra-domain links and in reducing the cross-domain traffic and the charging volume of inter-domain link compared to the distance-based guidance enforcing simple localization. However, the performance-based guidance shows one limitation that can cause unstable traffic control. To overcome the identified limitation, we propose peer-assisted measurement and traffic estimation approach. Then, we verify our approach through simulations.

  • A Feasibility Study of P2P Traffic Localization through Network Delay Insertion

    HyunYong LEE  Akihiro NAKAO  

     
    PAPER-Network

      Vol:
    E95-B No:11
      Page(s):
    3464-3471

    In this paper, we examine a new P2P traffic localization approach that exploits peer selection adaptation (i.e., preferring peers who are likely to provide better performance), called Netpherd. Netpherd enables peers to communicate with local domain peers by manipulating networking performance across network domains (i.e., adding an artificial delay to inter-domain traffic). Our feasibility study shows that Netpherd reduces the inter-domain traffic by influencing peer selection adaptation. Netpherd also improves download performance of the peers who know many local domain peers. We discuss one guideline to improve Netpherd based on the feasibility study and verify the guideline with evaluation results.

  • An Approach for Utilizing User Resources in Information-Centric Network

    HyunYong LEE  Akihiro NAKAO  

     
    PAPER

      Vol:
    E96-B No:1
      Page(s):
    48-55

    As one innovative research that heavily depends on the network virtualization for its realization and deployment on an Internet-scale, we propose an approach to utilize user resources in information-centric network (ICN). We try to fully benefit from the in-network cache that is one attractive feature of ICN by expanding the in-network cache indirectly based on the user resources. To achieve this, in this paper, we focus on how to encourage users to contribute their resources in ICN. Through simulations, we examine a feasibility of our approach and an effect of user participation on the content distribution performance in ICN. We also briefly discuss how the network virtualization technique can be utilized for our research in terms of its evaluation and deployment.

  • User-Assisted Content Distribution in Information-Centric Network

    HyunYong LEE  Akihiro NAKAO  

     
    LETTER-Network

      Vol:
    E95-B No:12
      Page(s):
    3873-3874

    In this letter, we argue that user resources will be still useful in the information-centric network (ICN). From this point of view, we first examine how P2P utilizing user resources looks like in ICN. Then, we identify challenging research issues to utilize user resources in ICN.

  • ISP-Driven Delay Insertion for P2P Traffic Localization

    HyunYong LEE  Akihiro NAKAO  

     
    PAPER

      Vol:
    E96-B No:1
      Page(s):
    40-47

    We introduce a new kind of P2P traffic localization technique, called Netpherd, benefiting from the network virtualization technique for its successful deployment. Netpherd exploits one feature of P2P applications, a peer selection adaptation (i.e., preferring peers who are likely to provide better performance) for the traffic localization. Netpherd tries to enable local peers (i.e., peers in target network domain) to communicate with each other by affecting the peer selection adaptation. To affect the peer selection adaptation, Netpherd adds artificial delay to inter-domain traffic going to local peers. Our experiment conducted over Internet testbed verifies that Netpherd achieves the traffic localization and also improves the content download performance with the network delay insertion. In addition, we show that how the network virtualization technique can be utilized for efficient and graceful implementation of Netpherd.