Login / Signup

A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks.

Thilmee M. BadugeAkihito HiromoriHirozumi YamaguchiTeruo Higashino
Published in: Systems and Computers in Japan (2006)
Keyphrases
  • spanning tree
  • computational complexity
  • worst case
  • objective function
  • minimum spanning tree
  • real time
  • peer to peer
  • edge disjoint
  • overlay network
  • publish subscribe