|
|
1.1 ! root 1: .\" Copyright (c) 1983, 1986 The Regents of the University of California. ! 2: .\" All rights reserved. ! 3: .\" ! 4: .\" Redistribution and use in source and binary forms are permitted ! 5: .\" provided that the above copyright notice and this paragraph are ! 6: .\" duplicated in all such forms and that any documentation, ! 7: .\" advertising materials, and other materials related to such ! 8: .\" distribution and use acknowledge that the software was developed ! 9: .\" by the University of California, Berkeley. The name of the ! 10: .\" University may not be used to endorse or promote products derived ! 11: .\" from this software without specific prior written permission. ! 12: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 13: .\" IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 14: .\" WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 15: .\" ! 16: .\" @(#)3.t 6.4 (Berkeley) 3/7/89 ! 17: .\" ! 18: .nr H2 1 ! 19: .\".ds RH Goals ! 20: .br ! 21: .ne 2i ! 22: .NH ! 23: \s+2Goals\s0 ! 24: .PP ! 25: The networking system was designed with the goal of supporting ! 26: multiple \fIprotocol families\fP and addressing styles. This required ! 27: information to be ``hidden'' in common data structures which ! 28: could be manipulated by all the pieces of the system, but which ! 29: required interpretation only by the protocols which ``controlled'' ! 30: it. The system described here attempts to minimize ! 31: the use of shared data structures to those kept by a suite of ! 32: protocols (a \fIprotocol family\fP), and those used for rendezvous ! 33: between ``synchronous'' and ``asynchronous'' portions of the ! 34: system (e.g. queues of data packets are filled at interrupt ! 35: time and emptied based on user requests). ! 36: .PP ! 37: A major goal of the system was to provide a framework within ! 38: which new protocols and hardware could be easily be supported. ! 39: To this end, a great deal of effort has been extended to ! 40: create utility routines which hide many of the more ! 41: complex and/or hardware dependent chores of networking. ! 42: Later sections describe the utility routines and the underlying ! 43: data structures they manipulate.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.