• DocumentCode
    3182849
  • Title

    Relay Assignment in AMT-Based Multicast Content Distribution

  • Author

    Patel, Suhel ; Sarac, Kamil ; Chandrasekaran, R. ; Turgay, Korkmaz ; Mittal, Neeraj

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Texas at Dallas, Dallas, TX, USA
  • fYear
    2011
  • fDate
    2-5 May 2011
  • Firstpage
    263
  • Lastpage
    270
  • Abstract
    Automatic IP Multicast Without Explicit Tunnels (AMT) has recently been proposed as an enabling technology to expand multicast content availability in the Internet. Using AMT, clients in unicast-only networks can establish tunnels to AMT relay servers to receive multicast content over unicast-only networks. In this paper, we study the task of mapping unicast clients to AMT relay servers in a way to minimize bandwidth use in the content providers´ network while maintaining load balanced situation across relays. We formulate the relay assignment problem as an instance of NP-hard bin packing problem and propose different solutions for application scenarios with or without considering client-relay server proximity. Our evaluations demonstrate the potential benefits of the proposed solutions under different scenarios.
  • Keywords
    IP networks; Internet; computational complexity; multicast communication; AMT relay servers; AMT-based multicast content distribution; Internet; NP-hard bin packing problem; automatic IP multicast without explicit tunnels; client-relay server proximity; multicast content availability; relay assignment problem; unicast-only networks; Bandwidth; Color; IP networks; Measurement; Relays; Servers; Unicast; Content distribution; bandwidth efficiency;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Networks and Services Research Conference (CNSR), 2011 Ninth Annual
  • Conference_Location
    Ottawa, ON
  • Print_ISBN
    978-1-4577-0040-8
  • Electronic_ISBN
    978-0-7695-4393-2
  • Type

    conf

  • DOI
    10.1109/CNSR.2011.45
  • Filename
    5771220