DMCA
On Packet Switches With Infinite Storage (1985)
| Venue: | RFC 970, FACC Palo Alto |
| Citations: | 192 - 0 self |
BibTeX
@INPROCEEDINGS{Nagle85onpacket,
author = {John Nagle},
title = {On Packet Switches With Infinite Storage},
booktitle = {RFC 970, FACC Palo Alto},
year = {1985}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The purpose of this RFC is to focus discussion on particular problems in the ARPA-Internet and possible methods of solution. No proposed solutions in this document are intended as standards for the ARPA-Internet at this time. Rather, it is hoped that a general consensus will emerge as to the appropriate solution to such problems, leading eventually to the adoption of standards. Distribution of this memo is unlimited. Most prior work on congestion in datagram systems focuses on buffer management. We find it illuminating to consider the case of a packet switch with infinite storage. 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. We demonstrate the unexpected result that 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, we discover new solutions applicable to switches with finite storage.
Keyphrases
packet switch infinite storage general consensus particular problem possible method appropriate solution datagram network infinite-storage case datagram system unexpected result buffer management proposed solution infinite-storage system new solution prior work finite storage first-in-first-out queuing finite packet lifetime
