본문 바로가기
  • Home

A Linear Time Algorithm for Constructing a Sharable-Bandwidth Tree in Public-shared Network

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2012, 17(6), pp.93-100
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Kyun Rak Chong 1

1홍익대학교

Accredited

ABSTRACT

In this paper we have proposed a linear time algorithm for solving the minimum sharable-bandwidth tree construction problem. The public-shared network is a user generated infrastructure on which a user can access the Internet and transfer data from any place via access points with sharable bandwidth. Recently, the idea of constructing the SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients on public-shared network, a tree structure is constructed. The problem of constructing a tree structure to serve the video streaming requests by using minimum amount of sharable bandwidth has been shown to be NP-hard. The previously published algorithms for solving this problem are either unable to find solutions frequently or less efficient. The experimental results showed that our algorithm is excellent both in the success rate of finding solutions and in the quality of solutions.

Citation status

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