• DocumentCode
    1892556
  • Title

    Conferencing on trees

  • Author

    Jalali, Ali ; Love, David J. ; Sanghavi, Sujay ; Hochwald, Bertrand M.

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN
  • fYear
    2009
  • fDate
    18-20 March 2009
  • Firstpage
    763
  • Lastpage
    768
  • Abstract
    In this paper, we develop an optimal scheme for conferencing (i.e. all-to-all communication), in communication networks. Our scheme uses the minimum sum rate. First we state a lower bound on sum rate and show how to achieve it on networks with tree topology. This result can be used on general networks considering the spanning tree which connects the conferencing nodes.
  • Keywords
    telecommunication network routing; telecommunication network topology; trees (mathematics); communication networks; conferencing nodes; optimal scheme; spanning tree; tree topology; Communication industry; Communication networks; Computer networks; Electronic mail; Entropy; Intelligent networks; Network topology; Telecommunication network topology; Telecommunication traffic; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems, 2009. CISS 2009. 43rd Annual Conference on
  • Conference_Location
    Baltimore, MD
  • Print_ISBN
    978-1-4244-2733-8
  • Electronic_ISBN
    978-1-4244-2734-5
  • Type

    conf

  • DOI
    10.1109/CISS.2009.5054820
  • Filename
    5054820
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1892556