ANALYSIS AND DESIGN OF COMMUNICATION NETWORKS WITH MEMORY

被引：4

作者：

HAKIMI, SL

机构：

[1] Department of Electrical Engineering Northwestern University, Evanston, IL

来源：

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS | 1969年 / 287卷 / 01期

关键词：

D O I：

10.1016/0016-0032(69)90028-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A mathematical formulation of the communication networks with memory is presented assuming that the sources of traffic are deterministic but not necessarily time invariant. The formulation leads to a linear programming problem. Some generalizations and justifications of the choice of the model are discussed. The same basic formulation can be used as a tool for analysis as well as least-cost design or improvement of an existing network. Design of the memory systems and its relation with messages with priorities is considered. Similar concepts are used to arrive at an approximate linear programming formulation of street traffic". © 1969."

引用

页码：1 / &

共 20 条

[1]

BROOKS HE, 1966, WESTERN UNION TECH R, V20, P70

[2]

CARRUTH DE, 1966, WESTERN UNION TECH R, V20, P8

[3]

CHARNES A, 1961, MANAGEMENT MODELS IN, V2, P785

[4]

Dantzig G.B., 1963, LINEAR PROGRAMMING

[5] THE DECOMPOSITION ALGORITHM FOR LINEAR-PROGRAMS [J].

DANTZIG, GB ;

WOLFE, P .

ECONOMETRICA, 1961, 29 (04) :767-778

[6]

DEO N, 1966, IEEE T COMMUNICATION, VCO14, P63

[7]

Ford L. R., 1956, CAN J MATH, V8, P399, DOI [10.4153/CJM-1956-045-5, DOI 10.4153/CJM-1956-045-5]

[8]

Ford Lester R., 1962, FLOWS NETWORKS

[9]

FRANK H, 1967, IEEE T COMMUNICATION, VCO15, P156

[10]

FRANK H, 1965, IEEE T CIRCUIT THEOR, VCT12, P413

← 1 2 →