摘要:

AbstractA model for a communication system which consists of a computer and a number of buffered terminals connected by means of a loop channel is analyzed. Data flows in two directions: from the computer to the terminals and from the terminals to the computer. The channel is alternately available to the computer and the terminals to effect these data transfers. The transient behavior of the system is determined and the stationary or limiting expected queue lengths at all terminals are calculated.

ISSN:0028-3045    

DOI:10.1002/net.3230010402

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractThis is the third and final part of a study of the analysis and control of the flow of air traffic. Part I developed a traffic flow model to compute the means and variances of delays experienced by individual aircraft. Part II was concerned with the arrival and departure processes, and with the question of model validation. In this part, we consider an approach to the problem of designing a (real‐time) flow control system. Central to the approach is the problem of minimizing a measure of system delay subject to constraints on the allowable departure and arrival time

ISSN:0028-3045    

DOI:10.1002/net.3230010403

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractAn algorithm for solving min‐cost or max‐flow multicommodity flow problems is described. It is a specialization of the simplex method, which takes advantage of the special structure of the multicommodity problem. The only nongraph or nonadditive operations in a cycle involve the inverse of a working basis, whose dimension is the number of currently saturated arcs. Efficient relations for updating this inverse are deri

ISSN:0028-3045    

DOI:10.1002/net.3230010404

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractThe problem of routing a desired flow at minimum cost through a network in which associated with each arc is a capacity, a linear cost, a fixed cost and a flow multiplier is considered. The equivalence of the problems on a general graph and a bipartite graph is shown; feasibility is discussed and properties of solutions are investigated.

ISSN:0028-3045    

DOI:10.1002/net.3230010405

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

摘要:

AbstractA switching network may be informally described as a collection of single‐pole, single‐throw switches arranged so as to connect a set of terminals called inputs to another set of terminals called outputs. It is non‐blocking if, given any set of connections from some of the inputs to some of the outputs, and an idle input terminal x and idle output terminal y, then it is possible to connect x to y without disturbing any of the existing connections. Denote by σ(a, b) the minimal number of switches necessary to connect a inputs to b outputs using a non‐blocking network. We are interested in studying the growth of σ(a, a) as a → ∞. Results of C. Clos show that σ(a, a) ⩽ C ae2√log a·log 2. We show that

ISSN:0028-3045    

DOI:10.1002/net.3230010406

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230010407

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230010401

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1971

数据来源: WILEY