Proceedings of the May 5-7, 1970, Spring Joint Computer Conference on - AFIPS '70 (Spring) 1970
DOI: 10.1145/1476936.1477023
|View full text |Cite
|
Sign up to set email alerts
|

Topological considerations in the design of the ARPA computer network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

1971
1971
2016
2016

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 75 publications
(16 citation statements)
references
References 3 publications
0
16
0
Order By: Relevance
“…This is because of the enormous number of combinations of links that can be used to connect a relatively small number of nodes. It is not possible to examine even a small fraction of the possible topologies that might lead to economic designs (Frank et al 1970). …”
Section: The Wan Design Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…This is because of the enormous number of combinations of links that can be used to connect a relatively small number of nodes. It is not possible to examine even a small fraction of the possible topologies that might lead to economic designs (Frank et al 1970). …”
Section: The Wan Design Problemmentioning
confidence: 99%
“…The problem may be stated as determining the number, location, and capacity of the backbone hub sites in order to minimize the monthly recurring cost of the interconnect trunks for a given traffic matrix. The reason this is particularly difficult is that the techniques used to solve the backbone design assume that the backbone hub-to-hub traffic is known, which is not the case if it is not known which remote locations are connected to each backbone hub (Frank et al 1970). …”
Section: Selecting Backbone Hub Locationsmentioning
confidence: 99%
“…Such efforts are currently well exemplified by the ARPA network (7,13,18,23). The ARPANET (18) achieves intercommunication not by line switching whereby dedicated paths are established between two interacting computers but by message switching (16) To obtain fundamental results without undue complication we will assume transmission time of a message between any pair of modules to be the same.…”
Section: ^706mentioning
confidence: 99%
“…Three sequences of designs were performed: 20-100 nodes, 200 nodes and 1000 nodes. The first series of networks were thoroughly optimized using the optimization techniques discussed [11]. The 200 node networks were partially optimized (within the limitations of a small finite computer time budget), while the 1000 node network designs represent workable network designs whose structure was chosen for both buildability and mathematical tractability.…”
Section: Costmentioning
confidence: 99%