Full TCP/IP for 8-bit architectures
Published 5 May 2003
Adam Dunkels
Citations390
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We describe two small and portable TCP/IP implementations fulfilling the subset of RFC1122 requirements needed for full host-to-host interoperability. Our TCP/IP implementations do not sacrifice any of TCP's mechanisms such as urgent data or congestion control. They support IP fragment reassembly and the number of multiple simultaneous connections is limited only by the available RAM. Despite being small and simple, our implementations do not require their peers to have complex, full-size stacks, but can communicate with peers running a similarly light-weight stack. The code size is on the order of 10 kilobytes and RAM usage can be configured to be as low as a few hundred bytes.
Keywords
Computer Science
ACM SIGCOMM Computer Communication ReviewCongestion avoidance and control
5,337 Citations1995Van Jacobson
The measurements and the reports of beta testers suggest that the final product is fairly good at dealing with congested conditions on the Internet, and an algorithm recently developed by Phil Karn of Bell Communications Research is described in a soon-to-be-published RFC.
ACM SIGPLAN NoticesSystem architecture directions for networked sensors
3,110 Citations2000Jason Hill, Robert Szewczyk +4 more
Key requirements are identified, a small device is developed that is representative of the class, a tiny event-driven operating system is designed, and it is shown that it provides support for efficient modularity and concurrency-intensive operation.
Congestion avoidance and control
2,447 Citations1988Van Jacobson
In October of '86, the Internet had the first of what became a series of 'congestion collapses' during this period, the data throughput from LBL to UC Berkeley dropped from 32 Kbps to 40 bps.
IEEE/ACM Transactions on NetworkingPromoting the use of end-to-end congestion control in the Internet
1,645 Citations1999Sally Floyd, Kevin Fall
It is argued that router mechanisms are needed to identify and restrict the bandwidth of selected high-bandwidth best-effort flows in times of congestion, and several general approaches are discussed for identifying those flows suitable for bandwidth regulation.
Requirements for Internet Hosts - Communication Layers
1,353 Citations1989
This RFC is an official specification for the Internet community that incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts.
ACM SIGCOMM Computer Communication ReviewDummynet
896 Citations1997Luigi Rizzo
D dummynet works by intercepting communications of the protocol layer under test and simulating the effects of finite queues, bandwidth limitations and communication delays, and runs in a fully operational system, hence allowing the use of real traffic generators and protocol implementations.
The Design and implementation of the 4.3BSD UNIX operating system
616 Citations1991Marshall Kirk McKusick, Keith Bostic +2 more
ACM SIGCOMM Computer Communication ReviewImproving round-trip time estimates in reliable transport protocols
325 Citations1995P. Karn, Craig Partridge
This paper reviews the various approaches to retransmission and presents a novel and effective approach to the retransmissions ambiguity problem.
The importance of non-data touching processing overheads in TCP/IP
158 Citations1993Jonathan Kay, Joseph Pasquale
It is asserted that it will be difficult to significantly reduce the cumulative processing time due to non-data touching overheads when one considers realistic message size distributions, where the majority of messages are small.
Window and Acknowledgement Strategy in TCP
140 Citations1982D Clark
This RFC describes implementation strategies to deal with two mechanisms in TCP, the window and the acknowledgement, and presents a particular set of algorithms which have received testing in the field, and which appear to work properly with each other.
Computation of the Internet Checksum via Incremental Update
91 Citations1994A. Rijsinghani
This memo describes an updated technique for incremental computation of the standard Internet checksum, which updates the method described in RFC 1141.
IEEE/ACM Transactions on NetworkingBeyond folklore: observations on fragmented traffic
88 Citations2002Colleen Shannon, David Moore +1 more
The causes and attributes of measured fragment traffic are examined, in particular, the effects of NFS, streaming media, networked video games, tunneled traffic, and the prevalence of packet fragmentation due to improperly configured machines.
IEEE/ACM Transactions on NetworkingA faster UDP (user datagram protocol)
82 Citations1993Craig Partridge, Stephen Pink
The authors describe the successful optimizations that were done, along with measurements that shows a UDP performance improvement of up to 25-35% on CISC and RISC systems, and overall kernal improvement of between 12% and 18%.
Improving round-trip time estimates in reliable transport protocols
80 Citations1987P. Karn, Craig Partridge
This paper reviews the various approaches to retransmission and presents a novel and effective approach to the retransmissions ambiguity problem.
TCP/IP Lean: Web Servers for Embedded Systems
57 Citations2002Jeremy Bentham
The Lean Plan getting started software introduction network hardware device drivers configuration file format process timer state machines buffering coding conventions, and high-speed data transfer.
Efficient demultiplexing of incoming TCP packets
47 Citations1992Paul E. McKenney, Ken F. Dove
A simple analytic approach is used to examine how different PCB lookup schemes perform with OLTP traffic, and one scheme is shown to work an order of magnitude better forOLTP traffic than the one-PCB cache approach while still maintaining good performance for packet-train traffic.