The DOI matches its Crossref record.
On Distributed Communications Networks
Abstract
This paper briefly reviews the distributed communication network concept in which each station is connected to all adjacent stations rather than to a few switching points, as in a centralized system. The payoff for a distributed configuration in terms of survivability in the cases of enemy attack directed against nodes, links or combinations of nodes and links is demonstrated. A comparison is made between diversity of assignment and perfect switching in distributed networks, and the feasibility of using low-cost unreliable communication links, even links so unreliable as to be unusable in present type networks, to form highly reliable networks is discussed. The requirements for a future all-digital data distributed network which provides common user service for a wide range of users having different requirements is considered. The use of a standard format message block permits building relatively simple switching mechanisms using an adaptive store-and-forward routing policy to handle all forms of digital data including digital voice. This network rapidly responds to changes in the network status. Recent history of measured network traffic is used to modify path selection. Simulation results are shown to indicate that highly efficient routing can be performed by local control without the necessity for any central, and therefore vulnerable, control point.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Marketing in Hypermedia Computer-Mediated Environments: Conceptual Foundations
Hoffman, D. L., & Novak, T. P. (1996) · Journal of Marketing · doi:10.1177/002224299606000304 · Cited by 5,625
Weaponized Interdependence: How Global Economic Networks Shape State Coercion
Farrell, H., & Newman, A. L. (2019) · International Security · doi:10.1162/isec_a_00351 · Cited by 1,879
A brief history of the internet
Leiner, B. M., Cerf, V. G., Clark, D. D., Kahn, R. E., Kleinrock, L., Lynch, D. C., Postel, J., Roberts, L. G., & Wolff, S. (2009) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1629607.1629613 · Cited by 989
High-rate measurement-device-independent quantum cryptography
Pirandola, S., Ottaviani, C., Spedalieri, G., Weedbrook, C., Braunstein, S. L., Lloyd, S., Gehring, T., Jacobsen, C. S., & Andersen, U. L. (2015) · Nature Photonics · doi:10.1038/nphoton.2015.83 · Cited by 476
A case for stateful forwarding plane
Yi, C., Afanasyev, A., Moiseenko, I., Wang, L., Zhang, B., & Zhang, L. (2013) · Computer Communications · doi:10.1016/j.comcom.2013.01.005 · Cited by 474
Recursive position estimation in sensor networks
Albowicz, J., Chen, A., & Zhang, L. (2005) · Proceedings Ninth International Conference on Network Protocols. ICNP 2001 · doi:10.1109/icnp.2001.992758 · Cited by 363
Blockchain: Emergent Industry Adoption and Implications for Accounting
Kokina, J., Mancha, R., & Pachamanova, D. (2017) · Journal of Emerging Technologies in Accounting · doi:10.2308/jeta-51911 · Cited by 352
An Autonomous Multi-UAV System for Search and Rescue
Scherer, J., Yahyanejad, S., Hayat, S., Yanmaz, E., Andre, T., Khan, A., Vukadinovic, V., Bettstetter, C., Hellwagner, H., & Rinner, B. (2015) · Proceedings of the First Workshop on Micro Aerial Vehicle Networks, Systems, and Applications for Civilian Use · doi:10.1145/2750675.2750683 · Cited by 308
Adaptive forwarding in named data networking
Yi, C., Afanasyev, A., Wang, L., Zhang, B., & Zhang, L. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2317307.2317319 · Cited by 308
Blockchain Mutability: Challenges and Proposed Solutions
Politou, E., Casino, F., Alepis, E., & Patsakis, C. (2021) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2019.2949510 · Cited by 292
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
“a robust, fault-tolerant network to connect hosts for military and scientific applications [1].”
BackgroundCalifornia fault lines: understanding the causes and impact of network failures
Turner, D., Levchenko, K., Snoeren, A. C., & Savage, S. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851220 · Cited by 164
Barandiaran, X. E., Calleja-López, A., Monterde, A., & Romero, C. (2024) · SpringerBriefs in Political Science · doi:10.1007/978-3-031-50784-7 · Cited by 44
Metadata
- Authors
- Baran, P.
- Venue
- IEEE Transactions on Communications
- Published
- 1964-03
- Volume
- 12
- Issue
- 1
- Pages
- 1-9
- ISSN
- 0096-2244 (ISSN-L)
- OpenAlex
- W2096825367
- Cited by
- 775
- References
- 0
- FWCI
- 8.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.