• DocumentCode
    1939264
  • Title

    Exploring efficient and scalable multicast routing in future data center networks

  • Author

    Li, Dan ; Yu, Jiangwei ; Yu, Junbiao ; Wu, Jianping

  • Author_Institution
    Tsinghua Univ., Beijing, China
  • fYear
    2011
  • fDate
    10-15 April 2011
  • Firstpage
    1368
  • Lastpage
    1376
  • Abstract
    Multicast benefits group communications in saving network traffic and improving application throughput, both of which are important for data center applications. However, the technical trend of future data center design poses new challenges for efficient and scalable Multicast routing. First, the densely connected networks make traditional receiver-driven Multicast routing protocols inefficient in Multicast tree formation. Second, it is quite difficult for the low-end switches largely used in data centers to hold the routing entries of massive Multicast groups.
  • Keywords
    computational complexity; computer centres; multicast protocols; routing protocols; telecommunication network topology; trees (mathematics); Steiner-tree algorithm; bloom filter; computation complexity; data center networks; low-end switch; network traffic; regular topology; scalable multicast routing protocol; source-to-receiver expansion approach; Approximation algorithms; Bandwidth; Buildings; Receivers; Routing; Servers; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2011 Proceedings IEEE
  • Conference_Location
    Shanghai
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-9919-9
  • Type

    conf

  • DOI
    10.1109/INFCOM.2011.5934921
  • Filename
    5934921