• DocumentCode
    3430323
  • Title

    Degree-Constrained ALM Tree Construction Algorithm for Heterogeneous Access Environment

  • Author

    Takahashi, E. ; Osuga, T. ; Taniguchi, K. ; Wakamiya, N.

  • Author_Institution
    NEC Corp., Ikoma
  • fYear
    2007
  • fDate
    22-24 Aug. 2007
  • Firstpage
    464
  • Lastpage
    467
  • Abstract
    Point-to-multipoint bulk data transfer using application-layer multicast (ALM) is discussed. In ALM, each host participating in an application session makes copies of received data by application-layer manipulation and forwards the copies to other hosts via unicast connections. Therefore, the performance, especially for access link speed, of hosts strongly affects overall delivery performance. In heterogeneous access environments, there is a strong possibility that some hosts with low-speed links decrease overall delivery performance. However, many previous solutions constructed ALM trees by introducing arbitrary degree allocations and by not well considering a diversity of access link speeds of hosts. This paper proposes an algorithm to construct an efficient ALM tree from hosts with heterogeneous access lines. This algorithm minimizes delivery completion time and lets many hosts complete reception of all data as fast as possible. The effectiveness of the algorithm is verified using simulations.
  • Keywords
    Internet; application-layer manipulation; degree-constrained ALM tree construction algorithm; heterogeneous access environment; heterogeneous access lines; point-to-multipoint bulk data transfer; unicast connections; File servers; Greedy algorithms; IP networks; Information science; Multicast algorithms; National electric code; Throughput; Tree graphs; Unicast; Web and internet services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, Computers and Signal Processing, 2007. PacRim 2007. IEEE Pacific Rim Conference on
  • Conference_Location
    Victoria, BC
  • Print_ISBN
    978-1-4244-1189-4
  • Electronic_ISBN
    1-4244-1190-4
  • Type

    conf

  • DOI
    10.1109/PACRIM.2007.4313274
  • Filename
    4313274