Hot-Potato Routing
The article discusses a digital simulation of hot-potato routing in a broadband distributed communications network. This routing method allows for real-time data transmission while utilizing store-and-forward techniques. The research is part of a broader study aimed at enhancing the resilience of command and control communications networks.
- ▪The hot-potato switching doctrine differs from traditional store-and-forward switching.
- ▪The study is part of the Distributed Adaptive Message Block Network project.
- ▪This research was sponsored by the United States Air Force.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Rand |
| Canonical URL | https://www.rand.org/pubs/research_memoranda/RM3103.html |
| Publication time | Wed, 20 May 2026 19:30:13 +0000 |
| Retrieval time | 2026-05-20T19:35:02.977Z |
| Last seen | 2026-05-20T19:35:02.977Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | e8dkw4vKMHNc |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
On Distributed Communications II. Digital Simulation of Hot-Potato Routing in a Broadband Distributed Communications Network Paul Baran, Sharla P. Boehm ResearchPublished 1964 Download PDF Share on LinkedInShare on XShare on FacebookEmail One in a series of eleven Memoranda detailing the Distributed Adaptive Message Block Network, a proposed digital data communications system based on a distributed network concept. It describes preliminary computer simulation of a message routing scheme investigated as part of a study of ways of reducing the vulnerability of command and control communications networks.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Rand.