Technology and engineering · 1985

RFC 970: On Packet Switches With Infinite Storage

by J. Nagle

The purpose of this RFC is to focus discussion on a particular problem in the ARPA-Internet and possible methods of solution. Most prior work on congestion in datagram systems focuses on buffer management. In this memo the case of a packet switch with infinite storage is considered. Such a packet switch can never run out of buffers. It can, however, still become congested. The meaning of congestion in an infinite-storage system is explored. An unexpected result is found that shows a datagram network with infinite storage, first-in-first-out queuing, at least two packet switches, and a finite packet lifetime will, under overload, drop all packets. By attacking the problem of congestion for the infinite-storage case, new solutions applicable to switches with finite storage may be found. No proposed solutions this document are intended as standards for the ARPA-Internet at this time.

Anyone can see what's on the shelves. Open a book with a free account, and stay in touch with its book club.

First published
1985
Status
Unknown
Pages
9
Copyright
✓ Free to read · Copied in full, as published

Where it comes from

RFC Editor · IETF Datatracker · IETF Trust Legal Provisions

Copied in full and unchanged from the RFC Editor, with the RFC's own notices. © IETF Trust and the persons identified as the document authors. The IETF Trust allows copying and distributing an RFC in full and without modification, so Micwyn shows it exactly as published and makes no study guide, audio or other version of it.

Discuss a passage

Select any passage in the reader and press Discuss to talk about it in public.

Join free to discuss a passage

Ask Micwyn about this book

Join (free) to ask about a PDF
Try asking

If you like this one