Un poco de investigación histórica
¿El comienzo?
Nota del Editor: Por razones de respeto
histórico de la fuente reproducimos los textos en Inglés y solo nuestros
comentarios en Español.
Si buscamos en la Rand por Baran encontramos 27 informes.
“Buceando” en ellos encontramos que todo comenzó así (o pudo haber comenzado
así). En el año 1964 La Rand Corporation concreta la publicación de un Informe
secreto encargado por la Fuerza Aérea de Estados Unidos. Su Autor es Paul Baran
MEMORANDUM
RM-3420-PR
AUGUST 1964
On
Distributed Communications:
I. Introduction to Distributed Communications Network
Paul Baran
Que en su Introducción plantea el siguiente problema de
Estrategia en las Comunicaciones:
I. Introduction
Let us consider the synthesis of a
communication network which will allow several hundred major communications
stations to talk with one another after an enemy attack. As a criterion of
survivability we elect to use the percentage of stations both surviving the
physical attack and remaining in electrical connection with the largest single
group of surviving stations. This criterion is chosen as a conservative measure
of the ability of the surviving stations to operate together as a coherent
entity after the attack. This means that small groups of stations isolated from
the single largest group are considered to be ineffective.
Although one can draw a wide variety of
networks, they all factor into two components: centralized (or star) and
distributed (or grid or mesh) (see Fig. 1).
The centralized
network is obviously vulnerable as destruction of a single central node
destroys communication between the end stations. In practice, a mixture of star
and mesh components is used to form communications networks. For example, type
(b) in Fig. 1 shows the hierarchical structure of a set of stars connected in
the form of a larger star with an additional link forming a loop. Such a
network is sometimes called a "decentralized" network, because
complete reliance upon a single point is not always required.
Como puede apreciarse se plantean tres
formas de conectar los mismos n nodos. Luego hay que encontrar cuál de esas
formas es la que soporta mejor todo tipo de ataques, ya sea empleando
razonamientos lógicos o mediante modelos de simulación.