A Caltech Library Service

How Far Can Data Loops Go?

Pierce, John R. (1972) How Far Can Data Loops Go? IEEE Transactions on Communications, 20 (3). pp. 527-530. ISSN 0096-2244. doi:10.1109/TCOM.1972.1091170.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


The switching of addressed blocks of data through a network (message switching) is particularly suited to the sort of inquiry-response communication characteristic of many business transactions. In a system of interconnected loops, efficient message switching can be attained with distributed control rather than common control. The initial capital investment in such a system would be low and the investment would grow only as the system grew.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 1972 IEEE. Manuscript received September 22, 1971; revised December 30, 1971.
Issue or Number:3
Record Number:CaltechAUTHORS:20170412-165632495
Persistent URL:
Official Citation:J. Pierce, "How Far Can Data Loops Go?," in IEEE Transactions on Communications, vol. 20, no. 3, pp. 527-530, Jun 1972. doi: 10.1109/TCOM.1972.1091170
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:76545
Deposited On:13 Apr 2017 02:56
Last Modified:15 Nov 2021 17:00

Repository Staff Only: item control page