본문 바로가기
  • Home

An Efficient Algorithm for Constructing a Maximal Request Bandwidth Tree on Public-shared Network

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(4), pp.87-93
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Kyun Rak Chong 1

1홍익대학교

Accredited

ABSTRACT

Recently, an idea has been suggested in which members construct the network by sharing their surplus bandwidth of their own access point. This kind of network is called public-shared network. As an application, SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients, a tree structure is constructed where the root is a stream server, internal nodes are sharable access points, and leafs are clients. The previous researches have focused on constructing the minimal sharable-bandwidth tree which can serve all video streaming requests using the minimal sharable bandwidth. In this paper, we have shown that the problem of constructing a tree structure with given sharable access points to serve maximal video streaming requests is NP-hard. We also have developed an efficient heuristic algorithm for this problem and evaluated experimentally our algorithm.

Citation status

* References for papers published after 2023 are currently being built.