Mean flow scheduling and optimal construction of a treelike communication network

Yehoshua Perl, Yaacov Yesha

Research output: Contribution to journalArticle

1 Scopus citations


Horn's algorithm for weighted mean flow scheduling with treelike precedence constraints is reexamined. A new analysis of an efficient implementation of Horn's algorithm shows an O(n log n) complexity. This is an improvement on the known O(n2) complexity of this algorithm. An application of Horn's algorithm to a problem of optimal scheduling of a treelike communication network is presented.

Original languageEnglish (US)
Pages (from-to)87-92
Number of pages6
Issue number1
StatePublished - Jan 1 1981
Externally publishedYes


All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this