The Cambridge Fast Ring Networking System (CFR)

The work

AuthorsAndy Hopper; Roger M. Needham
Editors
Typetechreport
Year1986
Citekeyhopper1986cambridge

Where it appeared

PublisherUniversity of Cambridge Computer Laboratory
Number in seriesUCAM-CL-TR-90
SchoolUniversity of Cambridge Computer Laboratory

Identifiers

report_numberUCAM-CL-TR-90
ISSN1476-2986

Access

Landing pagehttps://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-90.html

Related

Containsbillington1987highlevel
Containsgordon1985formal
Distinct fromcurzon1994formal
Distinct fromherbert1988case
Distinct frommelham1990formalizing

From bibtex.

Abstract

Local area networks have developed from slow systems operating at below 1MBs to fast systems at 50MBs or more. We discuss the choices facing a designer as faster speeds for networks are contemplated. The 100MBs Cambridge Fast Ring is described. The ring protocol allows one of a number of fixed size slots to be used once or repeatedly. The network design allows sets of rings to be constructed by pushing the bridge function to the lowest hardware level. Low cost and ease of use is normally achieved by design of special chips and we describe a two chip VLSI implementation. This VLSI hardware forms the basis of a kit-of-parts from which many different network components can be constructed.

A copy is held

pdf, 596.3 kB. Not published — it may be under copyright. The facts and links here are.

How it got here

How it got hereagent via bibtex
Added2026-09-15 22:41 UTC
Approved bya person 2026-09-16 09:21 UTC

Filed under

between-the-wire-and-the-packet where-the-wires-go

Cite it as

@techreport{hopper1986cambridge,
  title        = {The Cambridge Fast Ring Networking System (CFR)},
  author       = {Andy Hopper and Roger M. Needham},
  year         = {1986},
  publisher    = {University of Cambridge Computer Laboratory},
  school       = {University of Cambridge Computer Laboratory},
  issn         = {1476-2986},
}

This record lives at https://refs.drheap.org/hopper1986cambridge/ and will keep doing so.