Mean flow scheduling and optimal construction of a treelike communication network

Yehoshua Perl; Yaacov Yesha

doi:10.1002/net.3230110111

Mean flow scheduling and optimal construction of a treelike communication network

Yehoshua Perl, Yaacov Yesha

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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(n²) complexity of this algorithm. An application of Horn's algorithm to a problem of optimal scheduling of a treelike communication network is presented.

Original language	English (US)
Pages (from-to)	87-92
Number of pages	6
Journal	Networks
Volume	11
Issue number	1
DOIs	https://doi.org/10.1002/net.3230110111
State	Published - 1981
Externally published	Yes

All Science Journal Classification (ASJC) codes

Software
Information Systems
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1002/net.3230110111

Cite this

@article{38085b47af1b4c7d8492980fb1cc6693,

title = "Mean flow scheduling and optimal construction of a treelike communication network",

abstract = "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.",

author = "Yehoshua Perl and Yaacov Yesha",

year = "1981",

doi = "10.1002/net.3230110111",

language = "English (US)",

volume = "11",

pages = "87--92",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

number = "1",

}

TY - JOUR

T1 - Mean flow scheduling and optimal construction of a treelike communication network

AU - Perl, Yehoshua

AU - Yesha, Yaacov

PY - 1981

Y1 - 1981

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0019537435&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019537435&partnerID=8YFLogxK

U2 - 10.1002/net.3230110111

DO - 10.1002/net.3230110111

M3 - Article

AN - SCOPUS:0019537435

SN - 0028-3045

VL - 11

SP - 87

EP - 92

JO - Networks

JF - Networks

IS - 1

ER -

Mean flow scheduling and optimal construction of a treelike communication network

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this