摘要:

AbstractWe consider a model which is applicable to time‐multi‐plexed systems, such as multiplexed communication channels and time‐shared computing facilities. In this (processor‐sharing) queueing model, all jobs currently in the system share equally the processing capability of the server. In this paper, we investigate the processor‐sharing model for the case of bulk arrivals. The mean response time of the system as a function of required service time is derived. An example is given to show the effect of bulk arrivals versus single arrivals for a constant ut

ISSN:0028-3045    

DOI:10.1002/net.3230010103

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

年代:1971

数据来源: WILEY

摘要:

AbstractThis paper contains the results of an exploratory study aimed at developing a model which could form the basis of a comprehensive analysis of the Air Traffic Control system. This model could be used to evaluate the effects of proposed changes in the system.The results will be presented in three parts. Part I is intended to provide an overview of the results as well as a detailed description of a traffic flow model which computes the means and variances of delays experienced by individual aircraft. Since this model requires as an input a statistical description of the arrival and departure service processes, Part II describes a model which relates these processes to more basic quantities (e.g., aircraft mix, runway configuration). Since the models which are developed represent a physical system, the question of validation arises and is also discussed in Part II. Part III of the paper considers the question of designing a (real‐time) flow control system. It is formulated as a problem of minimizing a measure of system delay subject to constraints on the allowable departure and arrival times. Illustrative results are included through‐out the pa

ISSN:0028-3045    

DOI:10.1002/net.3230010104

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

年代:1971

数据来源: WILEY

摘要:

AbstractMajor design problems for centralized computer networks are link layout and capacity assignment. The objective is to select link locations and capacities so that the average time delay required to transmit a message from any node to the central node does not exceed a specified maximum. The design problem is to find the least cost system which satisfies the time delay constraints for given levels of traffic. In this paper, we describe an algorithm to select globally optimum link capacities for specified tree structures. We also give a heuristic method for finding low cost tree structures. The methods have been programmed and are capable of handling networks with thousands of nodes. In addition, they can consider any finite set of link capacities with an arbitrary cost structure and do not depend on the mathematical model used to calculate average time delay.

ISSN:0028-3045    

DOI:10.1002/net.3230010105

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

年代:1971

数据来源: WILEY

摘要:

AbstractThe problem considered in this paper is the determination of the operating policy over time of a network of water reservoirs or dams arranged according to an arbitrary topology. If streamflow was a known quantity, the problem could be formulated as a large nonlinear program (several hundred nonlinear) constraints as a minimum) and solved by the two methods proposed in this paper. Since streamflow is random, the problem becomes a large stochastic program which can be solved by a procedure given in the literature. The key step in solving this stochastic program is the solution of the nonlinear program by the methods we propose.

ISSN:0028-3045    

DOI:10.1002/net.3230010106

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

年代:1971

数据来源: WILEY

摘要:

AbstractIn this paper an algorithm is presented for solving a certain class of multi‐commodity flow problems. The class of problems considered consist of integer capacity multi‐source and multi‐sink problems for which each node is a source of sink for all but at most one commodity. The algorithm is described in the case that any edge connecting a source and sink of a commodity can be used for flow of that comm

ISSN:0028-3045    

DOI:10.1002/net.3230010107

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

年代:1971

数据来源: WILEY

摘要:

AbstractA graph is k‐arc‐connected if it is necessary to remove at least k arcs in order to disconnect the graph. This paper solves the problem of determining the least number of arcs required in a k‐arc‐connected graph on n nodes by describing constructions that produce such graphs having kn/2 arcs (for kn éven) or (kn+1) /2 arcs (for kn odd). These results have application to the practical problem of synthesizing minimum cost, “k‐reliable” communic

ISSN:0028-3045    

DOI:10.1002/net.3230010108

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

年代:1971

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230010102

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

年代:1971

数据来源: WILEY