Professional Documents
Culture Documents
A1.1 AT commands
The AT commands are preceded by the attention code AT. They are:
A1.3 S-registers
The modem contains various status registers called the S-registers which store modem
settings. Table Ap 1.2 lists these registers.
Sl4 Bitmapped options
0
Bit 1 EO El
Bit 2 Q.O Q1
Bit3 vo Vl
Bit4 Reserved
Bit 5 T (tone dial) P (pulse dial)
Bit 6 Reserved
and
{0, 0}. Host on this network. This address can only be used as a source
address
{0, <Host-number>} Host on this network
{ -1, -1}. Limited broadcast. This address can only be used as a destina-
tion address, and should not be forwarded outside the current
sub net.
{<Network-number>, -1} Directed broadcast to specified network. This address can only
be used as a destination address.
{<Network-number>, <Subnet-number>, -1}
Directed broadcast to specified subnet. This address can
only be used as a destination address.
{<Network-number>, -1, -1} Directed broadcast to all subnets of specified subnetted net-
work. This address can only be used as a destination address.
{127, <any>} Internal host loopback address. This address should never ap-
pear outside a host.
IPVersions
Decimal Keyword Version
0 Reserved
1-3 Unassigned
4 IP Internet Protocol
5 ST ST Datagram Mode
6 SIP Simple Internet Protocol
7 TP/IX TP/IX: The Next Internet
8 PIP The P Internet Protocol
9 TUBA TUBA
10-14 Unassigned
15 Reserved
IP protocol numbers
Decimal Keyword Protocol
0 Reserved
1 ICMP Internet Control Message
2 IGMP Internet Group Management
3 GGP Gateway-to-Gateway
4 IP IP in IP (encasulation)
5 ST Stream
6 TCP Transmission Control
7 UCL UCL
8 EGP Exterior Gateway Protocol
9 IGP any private interior gateway
10 BBN-RCC-MON BBN RCC Monitoring
11 NVP-II Network Voice Protocol
12 PUP PUP
13 ARGUS ARGUS
14 EM CON EM CON
15 XNET Cross Net Debugger
16 CHAOS Chaos
17 UDP User Datagram
18 MUX Multiplexing
19 DCN-MEAS DCN Measurement Subsystems
20 HMP Host Monitoring
21 PRM Packet Radio Measurement
22 XNS-IDP XEROX NS IDP
23 TRUNK-1 Trunk-1
24 TRUNK-2 Trunk-2
25 LEAF-1 Leaf-1
26 LEAF-2 Leaf-2
27 RDP Reliable Data Protocol
28 IRTP Internet Reliable Transaction
29 ISO-TP4 ISO Transport Protocol Class 4
30 NETBLT Bulk Data Transfer Protocol
31 MFE-NSP MFE Network Services Protocol
32 MERIT-INP MERIT Internodal Protocol
33 SEP Sequential Exchange Protocol
34 3PC Third Party Connect Protocol
35 IDPR Inter-Domain Policy Routing Protocol
36 XTP XTP
37 DDP Datagram Delivery Protocol
38 IDPR-CMTP IDPR Control Message Transport Proto
39 TP++ TP++ Transport Protocol
40 IL IL Transport Protocol
41 SIP Simple Internet Protocol
42 SDRP Source Demand Routing Protocol
43 SIP-SR SIP Source Route
44 SIP-FRAG SIP Fragment
45 IDRP Inter-Domain Routing Protocol
46 RSVP Reservation Protocol
47 GRE General Routing Encapsulation
48 MHRP Mobile Host Routing Protocol
49 BNA BNA
so SIPP-ESP SIPP Encap Security Payload
51 SIPP-AH SIPP Authentication Header
52 I-NLSP Integrated Net Layer Security TUBA
53 SWIPE IP with Encryption
54 NHRP NBMA Next Hop Resolution Protocol
61 any host internal protocol
62 CFTP CFTP
63 any local network
64 SAT-EXPAK SATNET and Backroom EXPAK
65 KRYPTOLAN Kryptolan
66 RVD MIT Remote Virtual Disk Protocol
Ports
0 Reserved
1 tcpmux TCP Port Service Multiplexer
2 compressnet Management Utility
3 compressnet Compression Process
5 rje Remote Job Entry
7 echo Echo
11 discard Discard
13 systat Active Users
15 daytime Daytime
17 qotd Quote of the Day
18 msp Message Send Protocol
19 chargen Character Generator
20 ftp-data File Transfer [Default Data]
21 ftp File Transfer [Control]
23 telnet Telnet
25 smtp Simple Mail Transfer
27 nsw-fe NSW User System FE
29 msg-icp MSG ICP
31 msg-auth MSG Authentication
33 dsp Display Support Protocol
37 time Time
38 rap Route Access Protocol
39 rlp Resource Location Protocol
41 graphics Graphics
42 nameserver Host Name Server
43 nicname Who Is
44 mpm-flags MPM FLAGS Protocol
Multicast
224.0.0.0 Base Address (Reserved)
224.0.0.1 All Systems on this Subnet
224.0.0.2 All Routers on this Subnet
224.0.0.3 Unassigned
224.0.0.4 DVMRP Routers
224.0.0.5 OSPFIGP OSPFIGP All Routers
224.0.0.6 OSPFIGP OSPFIGP Designated Routers
224.0.0.7 ST Routers
224.0.0.8 ST Hosts
224.0.0.9 RIP2 Routers
224.0.0.10 IGRP Routers
224.0.0.11 Mobile-Agents
224.0.0.12-224.0.0.255 Unassigned
224.0.1.0 VMTP Managers Group
224.0.1.1 NTP Network Time Protocol
224.0.1.2 SGI-Dogfight
224.0.1.3 Rwhod
224.0.1.4 VNP
224.0.1.5 Artificial Horizons - Aviator
224.0.1.6 NSS - Name Service Server
224.0.1.7 AUDIONEWS - Audio News Multicast
224.0 .1. 8 SUN NIS+ Information Service
224.0.1.9 MTP Multicast Transport Protocol
224.0.1.10 IETF-1-LOW-AUDIO
224.0.1.11 IETF-1-AUDIO
224.0.1.12 IETF-1-VIDEO
224.0.1.13 IETF-2-LOW-AUDIO
224.0.1.14 IETF-2-AUDIO
224.0.1.15 IETF-2-VIDEO
224.0.1.16 MUSIC-SERVICE
224.0.1.17 SEANET-TELEMETRY
224.0.1.18 SEANET-IMAGE
224.0.1.19 MLOADD
224.0.1.20 any private experiment
224.0.1.21 DVMRP on MOSPF
224.0.1.22 SVRLOC
224.0.1.23 XINGTV
224.0.1.24 microsoft-ds
224.0.1.25 nbc-pro
224.0.1.26 nbc-pfn
224.0.1.27-224.0.1.255 Unassigned
224.0.2.1 "rwho" Group (BSD) (unofficial)
IP type of service
TOS Value Description
0000 Default
0001 Minimize Monetary Cost
0010 Maximize Reliability
0100 Maximize Throughput
1000 Minimize Delay
1111 Maximize Security
Type Name
0 Echo Reply
Codes
0 No Code
3 Destination Unreachable
Codes
0 Net Unreachable
1 Host Unreachable
2 Protocol Unreachable
3 Port Unreachable
4 Fragmentation Needed and Don't Fragment was Set
5 Source Route Failed
6 Destination Network Unknown
7 Destination Host Unknown
8 Source Host Isolated
9 Communication with Destination Network is
Administratively Prohibited
10 Communication with Destination Host is
Administratively Prohibited
11 Destination Network Unreachable for Type of Service
12 Destination Host Unreachable for Type of Service
4 Source Quench
Codes
0 No Code
5 Redirect
Codes
0 Redirect Datagram for the Network (or subnet)
1 Redirect Datagram for the Host
2 Redirect Datagram for the Type of Service and Network
3 Redirect Datagram for the Type of Service and Host
6 Alternate Host Address
Codes
0 Alternate Address for Host
7 Unassigned
8 Echo
Codes
0 No Code
9 Router Advertisement
Codes
0 No Code
10 Router Selection
Codes
0 No Code
11 Time Exceeded
Codes
0 Time to Live exceeded in Transit
1 Fragment Reassembly Time Exceeded
TCP options
T;Q2e Length DescriEtion
0 End of Option List
1 No-Operation
2 4 Maximum Segment Lifetime
3 3 WSOPT - Window Scale
4 2 SACK Permitted
5 N SACK
6 6 Echo (obsoleted by option 8)
7 6 Echo Reply (obsoleted by option by 8)
8 10 TSOPT - Time Stamp Option
9 2 Partial Order Connection Permited
10 5 Partial Order Service Profile
11 cc
12 CC.NEW
13 CC.ECHO
14 3 TCP Alternate Checksum Request
15 N TCP Alternate Checksum Data
16 Skeeter
17 Bubba
18 3 Trailer Checksum Option
Domain Names
For the Internet (IN) class the following are defined:
Character Sets
US-ASCII IS0-8859-1 IS0-8859-2 IS0-8859-3
IS0-8859-4 IS0-8859-5 IS0-8859-6 IS0-8859-7
IS0-8859-8 IS0-8859-9
Access Types
FTP ANON-FTP TFTP AFS
LOCAL-FILE MAIL-SERVER
Conversion Values
?BIT 8BIT BASE64 BINARY
QUOTED-PRINTABLE
lnverseARP
Number 0Eeration Code (OE)
1 REQUEST
2 REPLY
3 request Reverse
4 reply Reverse
5 DRARP-Request
6 DRARP-Reply
7 DRARP-Error
8 InARP-Request
9 InARP-Reply
10 ARP-NAK
This address can be used with the multicast bit (which is the first bit to the address) to create an
Internet Multicast. It has the form:
1000 0000 0000 0000 0111 1010 xxxx xxxO xxxx xxxx xxxx xxxx
oooooc Cisco
OOOOOE Fujitsu
OOOOOF NeXT
000010 Sytek
00001D Cabletron
000020 DIAB
000022 Visual Technology
00002A TRW
000032 GEC Computers Ltd
00005A s & Koch
00005E IANA
000065 Network General
000068 MIPS
000077 MIPS
00007A Ardent
Ethernet Type
Address Field Usage
01-00-SE-00-00-00- OBOO Internet Multicast
01-00-SE-7F-FF-FF
01-00-SE-B0-00-00- ???? Internet reserved by IANA
01-00-SE-FF-FF-FF
01-BO-C2-00-00-00 -B02- Spanning tree (for bridges)
09-00-02-04-00-01? BOBO? Vitalink printer
09-00-02-04-00-02? BOBO? Vitalink management
09-00-09-00-00-01 BOOS HP Probe
09-00-09-00-00-01 -B02- HP Probe
09-00-09-00-00-04 BOOS? HP DTC
09-00-1E-00-00-00 B019? Apollo DOMAIN
09-00-2B-00-00-00 6009? DEC MUMPS?
09-00-2B-00-00-01 B039? DEC DSM/DTP?
09-00-2B-00-00-02 B03B? DEC VAXELN?
09-00-2B-00-00-03 B03B DEC Lanbridge Traffic Monitor (LTM)
09-00-2B-00-00-04 ???? DEC MAP End System Hello
09-00-2B-00-00-0S ???? DEC MAP Intermediate System Hello
09-00-2B-00-00-06 B03D? DEC CSMA/CD Encryption?
09-00-2B-00-00-07 B040? DEC NetBios Emulator?
09-00-2B-00-00-0F 6004 DEC Local Area Transport (LAT)
09-00-2B-00-00-1x ???? DEC Experimental
09-00-2B-01-00-00 B03B DEC LanBridge Copy packets
09-00-2B-01-00-01 B03B DEC LanBridge Hello packets
09-00-4E-00-00-02? B137? Novell IPX
09-00-S6-00-00-00- ???? Stanford reserved
09-00-S6-FE-FF-FF
09-00-S6-FF-00-00- BOSC Stanford V Kernel, version 6.0
09-00-S6-FF-FF-FF
09-00-77-00-00-01 ???? Retix spanning tree bridges
09-00-7C-02-00-0S BOBO? Vitalink diagnostics
OD-1E-1S-BA-DD-06 ???? HP
AB-00-00-01-00-00 6001 DEC Maintenance Operation Protocol
AB-00-00-02-00-00 6002 DEC Maintenance Operation Protocol
Ap4.1 Introduction
Characters which are not markup text are mapped directly to strings of data characters. An
ampersand followed by a character reference or a number value can be used to define a
character. Table Ap2.1 defines these characters (the equivalent ampersand character refer-
ence is given in brackets). For example:
Fred&#l74&Bert¿
In the HTML document character set only three control characters are allowed: Horizontal
Tab, Carriage Return, and Line Feed (code positions 9, 13, and 10).
The following gives a script which generates the range of the characters:
<script>
var i;
for (i=l;i<256;i++)
document.write("&#" + i);
</script>
Ap4.1.1 Tags
Tags are used to delimit elements such as headings, paragraphs, lists, character highlighting
and links. Normally an HTML element consists of a start-tag, which gives the element name
and attributes, followed by the content and then the end tag. A start-tags is defined between
a'<' and'>', and end tags between a '<I' and'>'. For example to display text as bold:
Some of the HTML only require a single start tag, these include:
Element content is a sequence of data character strings and nested elements. Some ele-
ments, such as anchors, cannot be nested.
Ap4.1.2 Names
Names consist of a letter followed by letters, digits, periods or hyphens (normally limited to
72 characters). Entity names are case sensitive, but element and attribute names are not.
• A string literal, delimited by single quotes or double quotes and not containing any oc-
currences of the delimiting character.
• A name token (a sequence ofletters, digits, periods, or hyphens). Name tokens are not
case sensitive.
Ap4.1.4 Comments
Comments are defined with a'<!' and ends with a'>'. Each comment starts with'--' and
includes all text up to and including the next occurrence of'--'. When defining a comment,
white space is allowed after each comment, but not before the first comment. The entire
comment declaration is ignored.
<HTML> Document element. Consists of a head and a body. The head contains the
title and optional elements, and the body is the main text consisting of
paragraphs, lists and other elements.
<HEAD> Head element. An unordered collection of information about the docu-
Ap4.3 Elements
!DOCTYPE A ACRONYM ADDRESS APPLET AREA
B BASE BASEFONT BOO BGSOUND BIG
BLOCKQUOTE BODY BR BUTTON CAPTION CENTER
CITE CODE COL COLGROUP COMMENT custom
DD DEL DFN DIR DIV DL
DT EM EMBED FIELDSET FONT FORM
*...;
∗
√
∗
√
asterisk operator, U2217 ISOtech
square root, =radical sign, U221A ISOtech
ex: ∝ ∝ proportional to, U221D ISOtech
00 ∞ ∞ infinity, U221E ISOtech
L ∠ ∠ angle, U2220 ISOamso
j_ ∧ ⊥ logical and, =wedge, U2227 ISOtech
∨ ⊦ logical or, =vee, U2228 ISOtech
n ∩ ∩ intersection, =cap, U2229 ISOtech
u ∪ ∪ union, =cup, U222A ISOtech
f ∫ ∫ integral, U222B ISOtech
∴ ∴ therefore, U2234 ISOtech
∼ ∼ tilde operator, =varies with, =similar to, U223C ISOtech
- ≅ ≅ approximately equal to, U2245 ISOtech
- ≈ ≅ almost equal to, =asymptotic to, U2248 ISOamsr
≠ ≠
* ≡ ≡
not equal to, U2260 ISOtech
- identical to, U2261 ISOtech
5 ≤ ≤ less-than or equal to, U2264 ISOtech
;;,: ≥ ≥ greater-than or equal to, U2265 ISOtech
c ⊂ ⊂ subset of, U2282 ISOtech
:::) ⊃ ⊃ superset of, U2283 ISOtech
([_ ⊄ ⊄ not a subset of, U2284 ISOamsn
,::; ⊆ ⊆ subset of or equal to, U2286 ISOtech
;:::1 ⊇ ⊇ superset of or equal to, U2287 ISOtech
E9 ⊕ ⊕ circled plus, =direct sum, U2295 ISOamsb
® ⊗ ⊗ circled times, =vector product, U2297 ISOamsb
j_ ⊥ ⊥ up tack, =orthogonal to, =perpendicular, U22A5 ISOtech
⋅ ⋅ dot operator, U22C5 ISOamsb
Miscellaneous Technical
⌈ ⌈ left ceiling, =apl upstile, U2308, ISOamsc
⌉ ⌉ right ceiling, U2309, ISOamsc
⌊ ⌊ left floor, =apl downstile, U230A, ISOamsc
&rtloor; ⌋ right floor, U230B, ISOamsc
⟨ 〈 left-pointing angle bracket, =bra, U2329 ISOtech
* ⟩ 〉 right-pointing angle bracket, =ket, U232A ISOtech
Geometric Shapes
<META HTTP-EQUIV="Content-Type"
CONTENT="text/html; CHARSET=windows-1251">
If the META element is inserted before the BODY element, it affects the whole document.
Example character sets are:
AP5.1 Introduction
Intel marketed the first microprocessor, named the 4004. This device caused a revolution in the
electronics industry because previous electronic systems had a fixed functionality. With this
processor the functionality could be programmed by software. Amazingly, by today's standards,
it could only handle four bits of data at a time (a nibble), contained 2000 transistors, had 46
instructions and allowed 4 KB of program code and 1 KB of data. From this humble start the PC
has since evolved using Intel microprocessors (Intel is a contraction of Integrated Electronics).
The second generation oflntel microprocessors began in 1974. These could handle 8 bits (a
byte) of data at a time and were named the 8008, 8080 and the 8085. They were much more
powerful than the previous 4-bit devices and were used in many early microcomputers and in
applications such as electronic instruments and printers. The 8008 has a 14-bit address bus and
can thus address up to 16KB of memory (the 8080 has a 16-bit address bus giving it a 64KB
limit).
The third generation of microprocessors began with the launch of the 16-bit processors. Intel
released the 8086 microprocessor which was mainly an extension to the original 8080 processor
and thus retained a degree of software compatibility. IBM's designers realized the power of the
8086 and used it in the original IBM PC and IBM XT (eXtended Technology). It has a 16-bit
data bus and a 20-bit address bus, and thus has a maximum addressable capacity of 1 MB. The
8086 could handle either 8 or 16 bits of data at a time (although in a messy way).
A stripped-down, 8-bit external data bus, version called the 8088 is also available. This
stripped-down processor allowed designers to produce less complex (and cheaper) computer
systems. An improved architecture version, called the 80286, was launched in 1982, and was
used in the IBM AT (Advanced Technology).
In 1985, Intel introduced its first 32-bit microprocessor, the 80386DX. This device was
compatible with the previous 8088/8086/80286 (80x86) processors and gave excellent perform-
ance, handling 8, 16 or 32 bits at a time. It has a full32-bit data and address buses and can thus
address up to 4GB of physical memory. A stripped-down 16-bit external data bus and 24-bit
address bus version called the 80386SX was released in 1988. This stripped-down processor can
thus only access up to 16MB of physical memory.
In 1989, Intel introduced the 80486DX which is basically an improved 80386DX with a
memory cache and math co-processor integrated onto the chip. It had an improved internal
structure making it around 50% faster with a comparable 80386. The 80486SX was also intro-
duced, which is merely an 80486DX with the link to the math co-processor broken. Clock
doublerltrebler 80486 processors were also released. In these the processor runs at a higher speed
than the system dock. Typically, systems with dock doubler processors are around 75% faster
than the comparable non-doubled processors. Typical dock doubler processors are DX2-66 and
DX2-50 which run from 33 MHz and 25 MHz clocks, respectively. Intel have also produced a
range of 80486 microprocessors which run at three or four times the system clock speed and are
referred to as DX4 processors. These include the Intel DX4-100 (25 MHz clock) and Intel DX4-
75 (25 MHz clock).
The Pentium (or P-5) is a 64-bit 'superscalar' processor. It can execute more than one in-
struction at a time and has a full 64-bit (8-byte) data bus and a 32-bit address bus. In terms of
performance, it operates almost twice as fast as the equivalent 80486. It also has improved float-
ing-point operations (roughly three times faster) and is fully compatible with previous 80x86
processors.
The Pentium II (or P-6) is an enhancement of the P-5 and has a bus that supports up to four
processors on the same bus without extra supporting logic, with clock multiplying speeds of over
300 MHz. It also has major savings of electrical power and the minimization of electromagnetic
interference (EMI). A great enhancement of the P-6 bus is that it detects and corrects all single-
bit data bus errors and also detects multiple-bit errors on the data bus.
• lOR (1/0 read) which means that the processor is reading from the contents of the address
which is on the 1/0 bus.
• lOW (1/0 write) which means that the processor is writing the contents of the data bus to
the address which is on the 1/0 bus.
• MEMR (memory read) which means that the processor is reading from the contents of the
address which is on the address bus.
• MEMW (memory write) which means that the processor is writing the contents of the data
bus to the address which is on the address bus.
• INTA (interrupt acknowledgement) which is used by the processor to acknowledge an inter-
rupt (so, S1 and S2 all go low). When a peripheral wants the attention of the processor it
sends an interrupt request to the 8259 which, if it is allowed, sets INTR high.
The processor either communicates directly with memory (with MEMW and MEMR) or com-
municates with peripherals through isolated 1/0 ports (with !OR and lOW).
All A17'S4
All All"'
AIO 1\llil).i)
A. \_\()
A!
A01
MN
RO "'
AOO
....
RQ {olO
NUt
Am RQ-'-Lll
AOJ "'"
"
AIU \I
AI> I <o IRQII
AOO 1)\Al IRQ I
N\11 Q\1 IRQZ
INTK 11,1
u• IUAIH
"'0 IU~II
IR(J7
AP5.2.1 Registers
Each of the Pe-based Intel microprocessors is compatible with the original 8086 processor and
is normally backwardly compatible. Thus, for example, a Pentium can run 8086, 80386 and
80486 code. Microprocessors use registers to perform their operations. These registers are basi-
cally special memory locations within the processor that have special names. The 8086/88 has 14
registers which are grouped into four categories, as illustrated in Figure Ap5.2.
General-purpose registers
There are four general-purpose registers that are AX, BX, ex and DX. Each can be used to ma-
nipulate a whole 16-bit word or with two separate 8-bit bytes. These bytes are called the lower
and upper order bytes. Each of these registers can be used as two 8-bit registers, for example, AL
represents an 8-bit register that is the lower half of AX and AH represents the upper half of AX.
The AX register is the most general purpose of the four registers and is normally used for all
types of operations. Each of the other registers has one or more implied extra functions. These
are:
• AX is the accumulator. It is used for all input/output operations and some arithmetic opera-
tions. For example, multiply, divide and translate instructions assume the use of AX.
• BX is the base register. It can be used as an address register.
• ex is the count register. It is used by instructions which require to count. Typically is it is
used for controlling the number of times a loop is repeated and in bit-shift operations.
• DX is the data register. It is used for some input/output and also when multiplying and di-
viding.
PC Processors 1779
AX (Aeeumator)
BX (BaS<! regiSter)
CX (Count regtster)
OX (Data regiSter)
SP (Sillck poonter)
BP (Base pomter)
SP (Source poonter)
Dl (Desttnahon 1nclex)
CS (Code segment)
OS (Data segment)
SS (Stack segment)
Flags
Addressing registers
The addressing registers are used in memory addressing operations, such as holding the source
address of the memory and the destination address. These address registers are named BP, SP, SI
and Dl, which are:
Status registers
Status registers are used to test for various conditions in an operations, such as 'is the result nega-
tive', 'is the result zero', and so on. The two status registers have 16 bits and are called the
instruction pointer (IP) and the flag register (F):
• IP is the instruction pointer and contains the address of the next instruction of the program.
• Flag register holds a collection of 16 different conditions. Table Ap5.1 outlines the most
used flags.
Segments registers
There are four areas of memory called segments, each of which are 16 bits and can thus address
up to 64 KB (from ooooh to FFFFh). These segments are:
• Code segment (cs register). This defines the memory location where the program code (or
instructions) is stored.
• Data segment (ds register). This defines where data from the program will be stored (ds
stands for data segment register).
• Stack segment (ss register). This defined where the stack is stored.
A 4 ct on 1/2 carry
0 II Set on overflow Indicates that an overflow has occurred in the most signifi -
cant b it from an arithmetic operation.
D 10 Direction
9 Interrupt enable Indi cates whether the inrerrupt has been disabled.
T 8 Trap
Memory addressing
There are several methods of accessing memory locations, these are:
• Implied addressing which uses an instruction in which it is known which registers are used.
• Immediate (or literal} addressing uses a simple constant number to define the address loca-
tion.
• Register addressing which uses the address registers for the addressing (such as AX, BX, and
so on}.
• Memory addressing which is used to read or write to a specified memory location.
PC Processors 1781
can only address up to 1 MB of physical memory. It also has a segmented memory architecture
and can only directly address 64 KB of data at a time. A chunk of memory is known as a seg-
ment and hence the phrase 'segmented memory architecture'.
Memory addresses are normally defined by their hexadecimal address. A 4-bit address bus
can address 16 locations from oooob to llllb. This can be represented in hexadecimal as oh to
Fh. An 8-bit bus can address up to 256 locations from o Oh to FFh. Section J.1 0 outlines the ad-
dressing capabilities for a given address bus size.
Two important addressing capabilities for the PC relate to a 16- and a 20-bit address bus. A
16-bit address bus addresses up to 64 KB of memory from ooooh to FFFFh and a 20-bit address
bus addresses up to 1MB from oooooh to FFFFFh. The 80386/80486/ Pentium processors have
a 32-bit address bus and can address from ooooooooh to FFFFFFFFh.
A segmented memory address location is identified with a segment and an offset address.
The standard notation is segment: offset . A segment address is a 4-digit hexadecimal address
which points to the start of a 64 KB chunk of data. The offset is also a 4-digit hexadecimal
address which defines the address offset from the segment base pointer. This is illustrated in Fig-
ureAp5.3.
The segment: offset address is defined as the logical address, the actual physical address is
calculated by shifting the segment address 4 bits to the left and adding the offset. The example
given next shows that the actual address of 2FB4: 0532 is 2FD72h.
Address location
segment: of f set 64KB of
data
0 ~ Seg ment
AP5.4 80386/80486
AP5.4.1 Introduction
The PC had grown from the 8086 processor, which could run 8-bit or 16-bit software. This
processor was fine with text-based applications, but struggled with graphical programs, especially
with GUis (Graphical User Interfaces). The original version of Microsoft Windows (Windows
Version 1.0 and Version 2.0) ran on these limited processes. The great leap in computing power
came with the development of the Intel 80386 processor and with Microsoft Windows 3.0. A
key to the success of the 80386 was that it was fully compatible with the previous
8088/8086/80286 processors. This allowed it run all existing DOS-based program and new 32-
bit applications. The DX version has full 32-bit data and address bus and can thus address up to
0
...
0
0
0 0
Voc. GNO
0 0
RES · RESET
ROY - ROY
AS A11 GNO
12 0 0 0 0 0 0
A7 A8 AIO
aeo . oeo
13 0 0 0 0 0 0
BEl - iiE1
A2 vee. GNO
14 0 0 0 0 0 0
tGN NMI FLH AM H0L KEN A6
BRD BE2 BEO PWT OIC LCK HLO BRO A3
BE2 · W
15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
BE3 - BE3
INT RES SS8 GN O ROY Vee VQc: 8E 1 Vee: Vee Vee WI Vet:. PI.K 81.T M
16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
AHOEAO ~US BOF GNOBE3 GNDGNOPCOGNDGNDGNOWIR GNDPCH ADS
Mn . MilO
17 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
PLK- PlOCK
A 8 c 0 E F G H J K L M N p 0 R s
Table Ap5.3 defines the how the control signals are interpreted. For the STOP/special bus
cycle, the byte enable signals ( BEO- BE3 ) further define the cycle. These are:
• Write back cycle BEO =1, BEl= 1, BE2 =1, BE3 =0.
• Halt cycle BEO =1, BEl= 1, BE2 =0, BE3 = 1.
• Flush cycle BEO =1, BEl =0, BE2 =1, BE3 = 1.
• Shutdown cycle BEO =0, BEl= 1, BE2 =1, BE3 = 1.
PC Processors 1783
Table Ap5.2 80486 signal lines
A 20M When active low, rhe processor internally masks rhe address bit A20
before every memory access.
AD Indicates rhat the processor has valid control signals and valid address
signals.
AHOLD When active a differenr bus controller can have access ro the address
bus. This is rypically used in a multi-processor system.
BEO - BEJ 0 The byre enable lines indicate which of rhe byres of rhe 32-bit data
bus are active.
BLA T Indicates that the current bursr cycle will end after rhe next BRDY
ignal.
B FF The backoff signal informs the proces or to deactivate rhe bus on rhe
nexr clock cycle.
BRDY The burst ready signal is used by an add ressed sy rem char has senr data
on the data bus or read data from the bus.
BREQ 0 Ind icates that the processor has inrernally requested the bus.
BSI6, BS8 The B 16 signal indicatesrhat a 16-bit data bus is used, rhe B 8
ignal indicates chat an 8-bit dara bus is used. If both are high rhen a
32-bir dara bus is used.
DPO-DP3 I/0 The data parity bits gives a parity heck for each byte of the 32-bit data
bus. The parity birs are always even parity.
EADS Indicate that an external bus conrroller has put a valid address on the
add ress bu .
FERR Indicates char rhe processor has detected an error in rhe internal float-
ing-point unit.
FLUS ! I When active rhe processor writes rhe complete contents of the cache ro
memory.
HOLD, HLDA II The bus hold (HOLD) and acknowledge (HLDA) are used for bus
arbitration and allow other bus controllers ro take control of the busses.
LOCK 0 If active the processor will not pass control to an external bus controller,
when it receives a HOLD signal.
PLOCK 0 The active pseudo lock signal identifies that the current data transfer
requires more than one bus cycle.
PWT,PCD 0 The page write-through (PWD and page cache disable (PCD) are used
with cache control.
ROY When active the addressed system has sent data on the data bus or read
data from the bus.
RESET If the reset signal is high for more than 15 clock cycles then the proces-
sor will reset itself.
The 486 integrates a processor, cache and a math co-processor onto a single IC. Figure Ap5.5
shows the main 80386/80486 processor connections. The Pentium processor connections are
similar but it has a 64-bit data bus. There are three main interface connections: the memory/10
interface, interrupt interface and DMA interface.
Mi lO DIC W/ R Description
0 0 0 lmerrupt acknowledge equence
0 0 I TOP/ pecial bus cycle
0 I 0 Reading from an !I port
0 l l Writing to an l/0 port
0 0 Reading an in truction from memory
0 I Reserved
0 Reading data from memory
Writing dam m memory
PC Processors 1785
~
c [ IIOLD
HLDA
8
803861 ~~
80486
[
0.8 INTR
g~
E~ ~Q
NMI
~~ Rf::SET
\V/- R
Dl-
M/- 10
The write/read ( W iR) line determines whether data is written to ( W ) or read from ( R)
memory. PCs can interface directly with memory or can interface to isolated memory. The sig-
nal line M I 10 differentiates between the two types. If it is high then the processor accesses direct
memory; else if it is low then it accesses isolated memory.
The 80386DX and 80486 have an external 32-bit data bus (D0-D,) and a 32-bit address
bus ranging from A, to A, 1• The two lower address lines, A, and A1, are decoded to produce the
byte enable signals BEO, BE l , BE2 and BE3 . The BEO line activates when A1A, is 00, BEl acti-
vates when A 1A, is 01, BE2 activates when A 1A, and BE3 actives when A 1A, is 11. Figure Ap5.6
illustrates this addressing.
The byte enable lines are also used to access either 8, 16, 24 or 32 bits of data at a time.
When addressing a single byte, only the BEO line is active (D 0-D 7), if 16 bits of data are to be
accessed then BEO and BEl are active (D0-D 1) , if 32 bits are to be accessed then BEO, BEl,
BE2 and BE3 are active (D0-D,).
The D I C line differentiates between data and control signals. When it is high then data is
read from or written to memory, else if it is low then a control operation is indicated, such as a
shutdown command.
16 bits 16 bits
EAX AH AL
EBX BH BL
ECX CH CL
EDX DH DL
ESI SI
EDI DI
EBP BP
32 bits
PC Processors 1787
can be increase with an off-chip (or near-chip) memory (second-level cache).
Cache DRAM
Microprocessor
controller memory
~~~~M.... "'""""
l~~
'-----lf-ca-ch-'oh:l
Cache
memory
(SRAM)
Cache architecture
The main cache architectures are:
• Look-through cache. In a look-through cache the system memory is isolated from the proc-
essor address and control busses. In this case the processor directly sends a memory request to
the cache controller which then determines whether it should forward it to its own memory
or the system memory. Figure Ap5.9 illustrates this type of cache. It can be seen that the
cache controls whether the processor address contents are latched through to the DRAM
memory and it also controls whether the contents of the DRAM's memory is loaded onto
the processor data bus (through the data transceiver). The operation is described as bus cycle
forwarding.
• Look-aside cache. A look-aside cache is where the cache and system memory connect to a
common bus. System memory and the cache controller see the beginning of the processor
bus cycle at the same time. If the cache controller detects a cache hit then it must inform the
system memory before it tries to find the data. If a cache miss is found then the memory ac-
cess is allowed to continue.
• Write-through cache. With a write-through cache all memory address accesses are seen by
the system memory when the processor performs a bus cycle.
• Write-back cache. With a write-back cache the cache controller controls all system writes. It
thus does not write the system memory unless it has to.
Second-level caches
An Ll-cache (first-level cache) provides a relatively small on-chip cache, where an L2-cache (sec-
ond-level cache) provides an external, on-board, cache, which provides a cache memory of
between 128 and 512 KB. The processor looks in its own Ll-cache for a cache hit; if none is
found then it searches in the on-board L2-cache. A cache hit in the Ll-cache will obviously be
faster than the off-chip cache.
Cache controller
DRAM
Processor data memory
SRAM control
control signals signal
SRAM
I
cache memory
System
data
bus
Processor
data
bus Data
L..---------....,---I.,~Transceiver .._
AP5.5.1 Introduction
Intel have gradually developed their range of processors from the original 16-bit 8086 processor
to the 32-bit processors, such as the Pentium II. Table Ap5.4 contrasts the Intel processor range.
It can also be seen from the table that the Pentium II processor is nearly more than a thousand
times more powerful than an 8086 processor. The original 8086 had just 29 000 transistors and
operated at a clock speed of 8 MHz. It had an external 20-bit bus and could thus only access up
to 1 MB of physical memory. Compare this with the Pentium II which can operate at over
300 MHz, contains over 6 000 000 transistors and can access up to 64GB of physical memory.
PC Processors 1789
Processor Clock Register siu Exumn/ MIIX. Cache Power
{whm data bus e:xumnl (M!Ps)
reknsed} memory
8086 8MHz 16 16 1MB 0.8
286 12.5 MHz 16 16 16MB 2.7
386DX 20MHz 32 32 4GB 6.0
486DX 25MHz 32 32 4GB 8 K.B L-1 20
Penrium 60MHz 32 64 4GB L6KB L-1 100
Penrium Pro 200MHz 32 64 64GB L6KB L-1 440
256 KL-2
Penrium II 200MHz 32 64 64GB L6K.B - 1 700
512 KB L-2
• The addition of parallel execution with the expansion of the Instruction decode and execu-
tion units into five pipelined stages. Each of these stages operate in parallel, with the others,
on up to five instructions in different stages of execution. This allows up to five instructions
to be completed at a time.
• The addition of an 8 KB on-chip cache to greatly reduce the data and code access times.
• The addition of an integrated floating-point unit.
• Support for more complex and powerful systems, such as off-board L-2 cache support and
multiprocessor operation.
With the increase in notebook and palmtop computers, the 80486 was also enhanced to support
many energy and system management capabilities. These processors were named the 80486SL
processors. The new enhancements included:
• System Management Mode. This mode is triggered by the processor's own interrupt pin and
allows complex system management features to be added to a system transparently to the op-
erating system and application programs.
• Stop Clock and Auto Halt Powerdown. These allow the processor to either shut itself down
(and preserve its current state) or run at a reduced clock rate.
The Intel Pentium processor added many enhancements to the previous processors, including:
• The addition of a second execution pipeline. These two pipelines, named u and v, can exe-
cute two instructions per clock cycle. This is known as superscalar operation.
• Increased on-chip L-1 cache, 8 KB for code and another 8 KB for data. It uses the MESI
protocol to support write-back mode, as well as the write-through mode (which is used by
the 80486 processor) .
• Branch prediction with an on-chip branch table that improves looping characteristics.
• Enhancement to the virtual-8086 mode to allow for 4MB as well as 4 KB pages.
The Pentium processor has been extremely successful and has helped support enhanced multi-
tasking operating systems such as Windows NT and Windows 95/98. The Intel Pentium Pro
enhanced the Pentium processor with the following:
• Addition of a 3-way superscalar architecture, as opposed to a 2-way for the Pentium. This
allows three instructions to be executed for every clock cycle.
• Uses enhanced prediction of parallel code (called dynamic execution micro-architecture) for
the superscalar operation. This includes methods such as micro-data flow analysis, out-of-
order execution, enhanced branch prediction and speculative execution. The three instruc-
tion decode units work in parallel to decode object code into smaller operations called micro-
ops. These micro-ops then go into an instruction pool, and, when there are no interdepend-
encies they can be executed out-of-order by the five parallel execution units (two integer
units, two for floating-point operations and one for memory). A retirement unit retires com-
pleted micro-ops in their original program order and takes account of any branches. This
recovers the original program flow.
• Addition of register renaming. Multiple instructions not dependent on each other, using the
same registers, allow the source and destination registers to be temporarily renamed. The
original register names are used when instructions are retired and program flow is main-
tained.
• Addition of a closely coupled, on-package, 256 KB L-2 cache that has a dedicated 64-bit full
clock speed bus. The L-2 cache also supports up to four concurrent accesses through a 64-bit
external data bus. Each of these accesses is transaction-oriented where each access is handled
as a separate request and response. This allows for numerous requests while awaiting a re-
sponse.
• Expanded 36-bit address bus to give a physical address size of 64GB.
The Pentium II processor is a further enhancement to the processor range. Apart from increasing
the clock speed it has several enhancements over the Pentium Pro, including:
AP5.7 Terms
Before introducing the Pentium Pro (P-6) various terms have to be defined. These are:
PC Processors 1791
Transaction Used to define a bus cycle. It consists of a set of phases, which re-
late to a single bus request.
Bus agent Devices that reside on the processor bus, that is, the processor, PCI
bridge and memory controller.
Priority agent The device handling reset, configuration, initialization, error detec-
tion and handling; generally the processor-to-PC! bridge.
Requesting agent The device driving the transaction, that is, busmaster.
Addressed agent The slave device addressed by the transaction, that is, target agent.
Responding agent The device that provides the transaction response on RS2 - RSO
signals.
Snooping agent A caching device that snoops on the transactions to maintain cache
coherency.
Implicit write-back When a hit to a modified line is detected during the snoop phase,
an implicit write-back occurs. This is the mechanism used to write-
back the cache line.
Processor
Memory
data path
and
memory
control
Memory 1/F
component r----.
Memory
Processor
1--
I-- PCI bridge
Processor
I-- f_
'
PCI bus
PC Processors 1793
AP5.10 Memory address reference
ZZl'XX"
where zz is the flag sequence, cis the repetitive character and xx the number of times the charac-
ter occurs. The zz flag sequence is chosen because, in a text file, it is unlikely to occur within the
file. File listing Ap6.1 shows a sample IN. DAT and File listing Ap6.2 shows the RLE encoded file
(OUT.DAT).
~ Program Ap6.1
/* ENCODE.C */
#include <Stdio.h>
int main(void)
{
FILE *in,*out;
char previous,current;
int count;
Program Ap6.2 gives a simple C program which unencodes the RLE file produced by the previ-
ous program.
~ Program Ap6.2
/* UNENCODE.C */
#include <stdio.h>
int main(void)
{
FILE *in, *out;
char ch;
int count,i;
if (ch=='Z')
{
ch=fgetc (in);
if (ch=='Z')
{
fscanf(in,"%c%02d",&ch,&count);
for (i=O;i<count;i++)
fprintf (out, "%c", ch) ;
else ungetc(ch,in);
else fprintf(out,"%c",ch);
while (!feof(in));
fclose (in);
fclose(out);
return(O);
The zz flag sequence is inefficient as it uses two characters to store the flag; a better flag could be
I@ Program Ap6.3
#include <Stdio.h>
#define FLAG Oxff /* 1111 1111b */
int main(void)
FILE *in,*out;
char previous,current;
int count;
if (count>1) fprintf(out,"%c%c%02d",FLAG,previous,count);
else fprintf(out,''%c'',previous);
while (!feof(in));
fclose(in); fclose(out); return(O);
I@ Program Ap6.4
/* UNENCODE.C */
#include <stdio.h>
#define FLAG Oxff /* 1111 1111b */
int main(void)
{
FILE *in,*out;
char ch;
int count,i;
do
{
ch=fgetc (in);
i f (ch==FLAG)
ch=fgetc(in);
fscanf (in, "%c%02d", &ch, &count);
for (i=O;i<count;i++) fprintf(out,"%c",ch);
else fprintf(out,"%c",ch);
In a binary file any bit sequence can occur. To overcome this, a flag sequence, such as 10101010
can be used to identifY the flag. If this sequence occurs within the data, it will be coded with two
flags two consecutive flags in the data are coded with three flags and so on.
thus, when the three flags are detected, one of them is deleted.
Ap7.1 SNR
gr=-~-2
If a waveform has a maximum signal amplitude ofV, then the relative signal power will be:
Signal power= ~s = (
If n-bit PCM coding is used then there will be 2" different levels, as illustrated in Figure A7.1.
2•-1------------------------------
2•-2------------------------------
2•-3------------------------------
2•-4------------------------------
P(e)
Full range
(2V)
-q/2 +q/2
3 ·~bability
2 Quantization / ~~rror
distance (q)
0
Quantization
levels
Thus, if the input signal ranges between + V and - V, the error in the quantization signal will
range from:
+!l to _!!_
2 2
2V
q=-
2n
Figure A7 .I shows that the probability of error will be constant from between -q/2 to +q/2. The
area over the interval the P(e) should equal unity, hence they-axis value for P(e) will be Ilq.
Thus the noise power will be:
Jqdv
+= +q/2 y2
Noisepower= JJ!Flv)dv=2
0
+q/2
=~ IJ!dv=~ 3
[v"l]+q/2
o = 32q
(t1J
23
=i_
12
SNR(dB)=10log10 (Si~alpower)=10log
Nmsepower
10 [ ~~2/2 ]=10log 10 ( 6~2 J
'I 'I
12
Class java.applet
The Applet class is a superclass of any applet. It provides a standard interface between applets
and their environment. The following are defined:
II Constructors
public Applet ()
II Methods
public void destroy()
public AppletContext getAppletContext()
public String getAppletinfo()
public AudioClip getAudioClip(URL url)
public AudioClip getAudioClip(URL url, String name)
public URL getCodeBase()
public URL getDocumentBase()
public Image getimage(URL url)
public Image getimage(URL url, String name)
public String getLocale() II Java 1.1
public String getParameter(String name)
public String [] [] getParameterinfo ()
public void init()
public boolean isActive()
public void play(URL url)
public void play(URL url, String name)
public void resize(Dimension d)
public void resize(int width, int height)
public final void setStub(AppletStub stub)
public void showStatus(String msg)
public void start()
public void stop()
Interface java.applet.AppletContext
The Appletcontext interface corresponds to the applet's environment. The following are de-
fined:
II Methods
public abstract Applet getApplet(String name)
public abstract Enumeration getApplets()
public abstract AudioClip getAudioClip(URL url)
public abstract Image getimage(URL url)
public abstract void showDocument(URL url)
public abstract void showDocument(URL url, String target)
public abstract void showStatus(String status)
Interface java.applet.AppletStub
The Appletstub interface acts as the interface between the applet and the browser environment
or applet viewer environment. The following are defined:
II Methods
public abstract void appletResize(int width, int height)
public abstract AppletContext getAppletContext()
public abstract URL getCodeBase()
public abstract URL getDocumentBase()
public abstract String getParameter(String name)
public abstract boolean isActive()
Interface java.applet.AudioCiip
The AudioClip interface is a simple abstraction for playing a sound clip. Multiple AudioClip
items can be playing at the same time, and the resulting sound is mixed together to produce a
composite. The following are defined:
II Methods
public abstract void loop()
public abstract void play()
public abstract void stop()
Class java.awt.ActiveEvent
An interface for events that know how to dispatch themselves. Its method is:
Class java.awt.Borderlayout
The BorderLayout class contains members named "North", "South", "East", "West", and
"Center". These are laid out with a given size and constraints. The "North" and "South" com-
ponents can be stretched horizontally and the "East" and 'West" components can be stretched
vertically. The "Center" component can be stretched horiwntally and vertically. The following
are defined:
II Constructors
public BorderLayout()
public BorderLayout(int hgap, int vgap)
II Constants
public static final String CENTER; //Java 1.1
public static final String EAST; II Java 1.1
public static final String NORTH; II Java 1.1
public static final String SOUTH; II Java 1.1
public static final String WEST; II Java 1.1
II Methods
public void addLayoutComponent(Component camp, Object obj) II Java 1.1
public void addLayoutComponent(String name, Component camp)// Java 1.0
public int getHgap() II Java 1.1
public float getLayoutAlignmentX(Container parent) II Java 1.1
public float getLayoutAlignmentY(Container parent) II Java 1.1
public int getVgap() II Java 1.1
public void invalidateLayout(Container target) II Java 1.1
public void layoutContainer(Container target)
public Dimension maximumLayoutSize(Container target) II Java 1.1
public Dimension minimumLayoutSize(Container target)
public Dimension preferredLayoutSize(Container target)
Class java.awt.Button
The Button class creates labeled buttons, which can have an associated action when pushed.
Three typical actions are: normal, when it has the input focus (the darkening of the outline lets
the user know that this is an active object) and when the user clicks the mouse over the button.
The following are defined:
II Constructors
public Button ()
public Button(String label)
II Methods
public synchronized void addActionListener(ActionListern llll Java 1.1
public void addNotify()
public String getActionCommand() II Java 1.1
public String getLabe1()
protected String paramString()
public synchronized void removeActionListener(ActionListener 1)
II Java 1.1
public setActionCommand(String command) II Java 1.1
public void setLabe1(String label)
Class java.awt.Checkbox
The Checkbox class contains a checkbox which has an on/off state. The following are defined:
II Constructors
public Checkbox()
public Checkbox(String label)
public Checkbox(String label, boolean state) II Java 1.1
public Checkbox(String label, boolean state, Checkbox group) II Java 1.1
public Checkbox(String label, CheckboxGroup group, boolean state)
II Methods
public synchronized void additemListener(ItemListener 1) II Java 1.1
public void addNotify()
public CheckboxGroup getCheckboxGroup()
public String getLabe1()
public boolean getState()
public Object[] getSelectedObject() II Java 1.1
protected String paramString()
public synchronized void removeitemListener(ItemListener 1) II Java 1.1
public void setCheckboxGroup(CheckboxGroup g)
public void setLabel(String label)
public void setState(boolean state)
Class java.awt.CheckboxGroup
The CheckGroup class groups a number of checkbox buttons. Only one of the checkboxes can
be true (on} at a time. When one button is made true (on} the others will become false (off). The
following are defined:
II Constructors
public CheckboxGroup()
Class java.awt.CheckboxMenultem
The CheckboxMenurtem class allows for a checkbox rhat can be included in a menu. The follow-
ing are defined:
II Constructors
public CheckboxMenuitem() II Java 1.1
public CheckboxMenuitem(String label)
public CheckboxMenuitem(String label, boolean state) II Java 1.1
II Methods
public synchronized void additemListener(ItemListener 1) II Java 1.1
public void addNotify()
public boolean getState()
public synchronized Object[] getSelectObjects() II Java 1.1
public String paramString()
public synchronized void removeitemListener(ItemListener llll Java 1.1
public void setState(boolean t)
Class java.awt.Choice
The Choice class allows for a pop-up menu. The following are defined:
II Constructors
public Choice ()
II Methods
public synchronized add(String item) II Java 1.1
public void additem(String item)
public synchronized void additemListener(ItemListener 1) II Java 1.1
public void addNotify()
public int countitems() II Java 1.0
public String getitem(int index)
public String getitemCount() II Java 1.1
public int getSe1ectedindex()
public String getSelecteditem()
protected String paramString()
public synchronized Object[] getSelectedObjects() II Java 1.1
public synchronized void insert(String item, int index) II Java 1.1
public synchronized void remove(String item) II Java 1.1
public synchronized void remove(int position) II Java 1.1
public synchronized void removeAll() II Java 1.1
public synchronized void removeitemListener(ItemListener llll Java 1.1
public void select(int pos)
public void select(String str)
Class java.awt.Color
This Color class supports rhe RGB color format. A color is represented by a 24-bit value of
which rhe red, green and blue components are represented by an 8-bit value (O to 255). The
minimum intensity is 0, and the maximum is 255. The following are defined:
II Constructors
public Color(float r, float g, float b)
public Color(int rgb)
public Color(int r, int g, int b)
II Methods
public Color brighter()
public Color darker()
public static Color decode (Strimg nm) II Java 1.1
public boolean equals(Object obj)
public int getBlue()
public static Color getColor(String nm)
public static Color getColor(String nm, Color v)
public static Color getColor(String nm, int v)
public int getGreen()
public static Color getHSBColor(float h, float s, float b)
public int getRed()
public int getRGB()
public int hashCode()
public static int HSBtoRGB(float hue, float saturation, float brightness)
public static float[] RGBtoHSB(int r, int g, int b, float hsbvals[])
public String toString()
Class java.awt.Component
The component class is the abstract superclass for many of the Abstract Window Toolkit classes.
The following are defined:
II Constants
public static final float BOTTOM_ALIGNMENT, CENTER_ALIGNMENT;
public static final float LEFT_ALIGNMENT, RIGHT_ALIGNMENT;
public static final float TOP_ALIGNMENT;
II Methods
public boolean action(Event evt, Object what) II Java 1.0
public synchronized void add(PopupMenu popup) II Java 1.1
public synchronized void addComponentListener(ComponentListener 1)
II Java 1.1
public synchronized void addFocusListener(FocusListener 1) II Java 1.1
public synchronized void addKeyListener(KeyListener 1) II Java 1.1
public synchronized void addMouseListener(MouseListener 1) II Java 1.1
public synchronized void addMouseMotionListener(MouseMotionListener 1)
I I Java 1.1
public void addNotify()
public Rectangle bounds() II Java 1.0
public int checkimage(Image image, ImageObserver observer)
public int checkimage(Image image, int width, int height,
ImageObserver observer)
public boolean contains(int x, int y) II Java 1.1
public boolean contains(Point p) II Java 1.1
public Image createimage(ImageProducer producer)
public Image createimage(int width, int height)
public void deliverEvent(Event evt) II Java 1.0
public void disable() II Java 1.0
public final void displayEvent(AWTEvent e) II Java 1.1
public void doLayout() II Java 1.1
Class java.awt.Container
The container class is the abstract superclass representing all components that can hold other
components. The following are defined:
II Methods
public Component add(Component camp)
public Component add(Component camp, int pas)
public Component add(String name, Component camp)
public void add(Component camp, Object constraints) II Java 1.1
public void add(Component camp, Object constraints, int index) II Java 1.1
public void addContainerListener(ContainerListener 1) II Java 1.1
public void addNotify()
public int countComponents() I I Java 1.0
public void deliverEvent(Event evt) II Java 1.0
public void doLayout() II Java 1.1
public void getAlignmentX() II Java 1.1
public void getAlignmentY() II Java 1.1
public Component getComponent(int n)
public Component getComponentAt(int x, int y) II Java 1.1
public Component getComponentAt(Point p) II Java 1.1
public int getComponentCount() II Java 1.1
public Component[] getComponents()
Class java.awt.Cursor
The cursor class represents a mouse cursor. The following are defined:
II Constructors
public Cursor(int type) II Java 1.1
II Constants
public static final int DEFAULT_CURSOR; II Java 1.1
public static final int CROSSHAIR_CURSOR, HAND_CURSOR; II Java 1.1
public static final int MOVE_CURSOR; II Java 1.1
public static final int TEXT_CURSOR, WAIT_CURSOR; II Java 1.1
public static final int N_RESIZE_CURSOR, S_RESIZE_CURSOR; II Java 1.1
public static final int E_RESIZE_CURSOR, W_RESIZE_CURSOR; II Java 1.1
public static final int NE_RESIZE_CURSOR, NW_RESIZE_CURSOR; II Java 1.1
public static final int SE_RESIZE_CURSOR, SW_RESIZE_CURSOR; II Java 1.1
I I Methods
public static Cursor getDefau1tCursor () I I Java 1.1
public static Cursor getPredefinedCursor() II Java 1.1
Class java.awt.Dialog
The Dialog class suppons a dialog window, in which a user can enter data. Dialog windows are
invisible until the show method is used. The following are defined:
II Constructors
public Dia1og(Frame parent) II Java 1.1
public Dialog(Frame parent, boolean modal)
public Dia1og(Frame parent, String title) I I Java 1.1
public Dialog(Frame parent, String title, boolean modal)
II Methods
public void addNotify()
Class java.awt.Dimension
The Dimension class contains the width and height of a component in an object. The following
ate defined:
II Fields
public int height;
public int width;
II Constructors
public Dimension()
public Dimension(Dimension d)
public Dimension(int width, int height)
II Methods
public boolean equals(Object obj) II Java 1.1
public Dimension getSize{) II Java 1.1
public void setSize(Dimension d) II Java 1.1
public void setSize(int width, int height) II Java 1.1
public String toString()
Class java.awt.Event
The Event class encapsulates user events from the GUI. The following ate defined:
II Fields
public Object arg;
public int clickCount;
public Event evt;
public int id;
public int key;
public int modifiers;
public Object target;
public long when;
public int x;
public int y;
II Constructors
public Event(Object target, int id, Object arg)
public Event(Object target, long when, int id,
int x, int y, int key, int modifiers)
public Event(Object target, long when, int id,
int x, int y, int key, int modifiers, Object arg)
II Methods
public boolean controlDown()
public boolean metaDown()
protected String paramString()
public boolean shiftDown()
public String toString()
public void translate(int dX, int dY)
Class java.awt.FileDialog
The FileDialog class displays a dialog window. The following are defined:
II Fields
public final static int LOAD, SAVE;
II Constructors
public FileDialog(Frame parent) II Java 1.1
public FileDialog(Frame parent, String title)
public FileDialog(Frame parent, String title, int mode)
II Methods
public void addNotify()
public String getDirectory()
public String getFile()
public FilenameFilter getFilenameFilter()
public int getMode()
protected String paramString()
public void setDirectory(String dir)
public void setFile(String file)
public void setFilenameFilter(FilenameFi lter filter)
Class java.awt.Fiowlayout
The FlowLayout class arranges components from left to right. The following are defined:
II Constructors
public FlowLayout()
public FlowLayout(int align)
public FlowLayout(int align, int hgap, int vgap)
II Methods
public void addLayoutComponent(String name, Component comp)
public int getAlignment() II Java 1.1
public int getHgap() II Java 1.1
public int getVgap() II Java 1.1
public void layoutContainer(Container target)
public Dimension minimumLayoutSize(Container target)
public Dimension preferredLayoutSize(Container target)
public void removeLayoutComponent(Component comp)
public void setAlignment(int align) II Java 1.1
public void setHgap(int hgap) II Java 1.1
public void setVgap(int vgap) II Java 1.1
public String toString()
Class java.awt.Font
The Font class represents fonts. The following are defined:
II Fields
protected String name;
protected int size;
protected int style;
II Constructors
public Font(String name, int style, int size)
II Methods
public static Font decode(String str) II Java 1.1
public boolean equals(Object obj)
public String getFamily()
public static Font getFont(String nm)
public static Font getFont(String nm, Font font)
public String getName()
public int getSize(}
public int getStyle()
public FontPeer getPeer() II Java 1.1
public int hashCode()
public boolean isBold(}
public boolean isitalic()
public boolean isPlain()
public String toString()
Class java.awt.FontMetrics
The FontMetrics class provides information about the rendering of a particular font. The fol-
lowing are defined:
II Fields
protected Font font;
II Methods
public int bytesWidth(byte data[], int off, int len}
public int charsWidth(char data[], int off, int len}
public int charWidth(char ch}
public int charWidth(int ch}
public int getAscent(}
public int getDescent(}
public Font getFont(}
public int getHeight(}
public int getLeading(}
public int getMaxAdvance(}
public int getMaxAscent(}
public int getMaxDescent(} II Java 1.0
public int[J getWidths(}
public int stringWidth(String str}
public String toString(}
Class java.awt.Frame
The Frame class contains information on the top-level window. The following are defined:
Class java.awt.Graphics
The Graphics class is an abstract class for all graphics contexts. This allows an application to
draw onto components or onto off-screen images. The following are defined:
II Constructors
protected Graphics(}
II Methods
public abstract void clearRect(int x, int y, int width, int height}
II Java 1.1
public void drawRect(int x, int y, int width, int height)
public abstract void drawRoundRect(int x, int y, int width,
int height, int arcWidth, int arcHeight)
public abstract void drawString(String str, int x, int y)
public void fill3DRect(int x, int y, int width, int height, boolean raised)
public abstract void fillArc(int x, int y, int width, int height,
int startAngle int arcAngle)
public abstract void fillOval(int x, int y, int width, int height)
public abstract void fillPolygon(int xPoints(], int yPoints(], int nPoints)
public void fillPolygon(Polygon p)
public abstract void fillRect(int x, int y, int width, int height)
public abstract void fillRoundRect(int x, int y, int width, int height,
int arcWidth, int arcHeight)
public void finalize()
public abstract Shape getClip() II Java 1.1
public abstract Rectangle getC1ipBounds() II Java 1.1
public abstract Rectangle getClipRect() II Java 1.0
public abstract Color getColor()
public abstract Font getFont()
public FontMetrics getFontMetrics()
public abstract FontMetrics getFontMetrics(Font f)
public abstract void setClip(int x, int y, int width, int height) II Java 1.1
public abstract void setClip(Shape clip) II Java 1.1
public abstract void setColor(Color c)
public abstract void setFont(Font font)
public abstract void setPaintMode()
public abstract void setXORMode(Color c1)
public String toString()
public abstract void translate(int x, int y)
Class java.awt.lmage
The Image abstract class is the superclass of all classes that represents graphical images.
II Constants
II Fields
public final static Object UndefinedProperty;
I I Constructors
public Image ()
II Methods
public abstract void flush()
public abstract Graphics getGraphics()
public abstract int getHeight(ImageObserver observer)
public abstract Object getProperty(String name, ImageObserver observer)
public Image getScaledinstance(int width, int height, int hints) II Java 1.1
public abstract ImageProducer getSource()
public abstract int getWidth(ImageObserver observer)
Class java.awt.lnsets
The Insets object represents borders of a container and specifies the space that should be left
around the edges of a container. The following are defined:
II Fields
public int bottom, left;
public int right, top;
I I Constructors
public Insets(int top, int left, int bottom, int right)
II Methods
public Object clone()
public boolean equals(Object obj) II Java 1.1
public String toString()
Class java.awt.Label
The label class is a component for placing text in a container. The following are defined:
II Fields
public final static int CENTER, LEFT, RIGHT;
II Constructors
public Label ()
public Label(String label)
public Label(String label, int alignment)
II Methods
public void addNotify()
public int getAlignment()
public String getText()
protected String paramString()
public void setAlignment(int alignment)
public void setText(String label)
Closs java.awt.List
The List object can be used to produce a scrolling list of text items. It can be set up so that the
user can either pick one or many items. The following are defined:
II Constructors
II Methods
public void add(String item) II Java 1.1
public void addActionListener(ActionListener 1) II Java 1.1
public void additem(String item)
public void additem(String item, int index)
public synchronized void additemListener(ItemListener 1) II Java 1.1
public void addNotify()
public boolean allowsMultipleSelections() II Java 1.0
public void clear() II Java 1.0
public int countitems() I I Java 1. 0
public void delitem(int position)
public void delitems(int start, int end) II Java 1.0
public void deselect(int index)
public String getitem(int index)
public int getitemCount() II Java 1.1
public synchronized String[] getitems() II Java 1.1
public Dimension getMinimumSize(int rows) II Java 1.1
public Dimension getMinimumSize() II Java 1.1
public Dimension getPreferredSize(int rows) II Java 1.1
public Dimension getPreferredSize() II Java 1.1
public int getRows()
public int getSelectedindex()
public int[] getSelectedindexes()
public String getSelecteditem()
public String[] getSelecteditems()
public Object[] getSelectedObjects() II Java 1.1
public int getVisibleindex()
public boolean isindexSelected(int index) II Java 1.1
public MultipleMode() I I Java 1.1
public boolean isSelected(int index) II Java 1.0
public void makeVisible(int index)
public Dimension minimumSize() II Java 1.0
public Dimension minimumSize(int rows) II Java 1.0
protected String paramString()
public Dimension preferredSize() II Java 1.0
public Dimension preferredSize(int rows) II Java 1.0
public synchronized void remove(String item) II Java 1.1
public synchronized void remove(int position) II Java 1.1
public synchronized void removeActionListener(ActionListener 1) II Java 1.1
public synchronized void removeAll() II Java 1.1
public synchronized void removeitemListener(ItemListener 1) II Java 1.1
public void removeNotify()
public void replaceitem(String newValue, int index)
public void select(int index)
public synchronized void setMultipleMode(boolean b) II Java 1.1
public void setMultipleSelections(boolean v)
Class java.awt.MediaTracker
The MediaTracker class contains a number of media objects, such as images and audio. The
following are defined:
II Fields
public final static int ABORTED, COMPLETE;
public final static int ERRORED, LOADING;
II Constructors
public MediaTracker(Component comp)
Class java.awt.Menu
The Menu object contains a pull-down component for a menu bar. The following are defined:
II Constructors
public Menu {) I I Java 1 . 1
public Menu{String label)
public Menu{String label, boolean tearOff)
II Methods
public Menuitem add{Menuitem mi)
public void add{String label)
public void addNotify{)
public void addSeparator()
public int countitems{)
public Menuitem getitem{int index)
public int getitemCount{) II Java 1.1
public synchronized void Insert{Menuitem menuitem, int index) II Java 1.1
public void InsertSepatator{int index) I I Java 1.1
public boolean isTearOff()
public void remove(int index)
public void remove(MenuComponent item)
public synchronized void removeAll{) II Java 1.1
public void removeNotify{)
Class java.awt.MenuBar
The MenuBar object contains a menu bar which is bound to a frame. The following are defined:
II Constructors
public MenuBar{)
II Methods
public Menu add{Menu m)
public void addNotify{)
public int countMenus()
public void deleteShortCut(MenuShortCut s) II Java 1.1
public Menu getHelpMenu{)
Class java.awt.MenuComponent
The Menucomponent abstract class is the superclass of all menu-related components. The follow-
ing are defined:
II Constructors
public MenuComponent()
II Methods
public final void dispatchEvent(AWTEvent e) II Java 1.1
public Font getFont()
public String getName() II Java 1.1
public MenuContainer getParent()
public MenuComponentPeer getPeer() II Java 1.0
protected String paramString()
public boolean postEvent(Event evt)
public void removeNotify()
public void setFont(Font f)
public void setName(String name) II Java 1.1
public String toString()
Class java.awt.Menultem
The Menurtem class contains all menu items. The following are defined:
II Constructors
public Menuitem() II Java 1.1
public Menuitem(String label)
public Menuitem(String label, MenuShortcut s) II Java 1.1
II Methods
public void addActionListener(ActionListener 1) II Java 1.1
public void addNotify ()
public void deleteShortcut() II Java 1.1
public void disable() II Java 1.0
public void enable() II Java 1.0
public void enable(boolean cond) II Java 1.0
public String getLabel()
public MenuShortcut getShortcut() II Java 1.1
public boolean isEnabled()
public String paramString()
public synchronized void removeActionListener(ActionListener l)
II Java 1.1
public void setActionCommand(String command) II Java 1.1
public synchronized void setEnabled(boolean b) II Java 1.1
public void setLabel(String label)
public void setShortcut(MenuShortcut s) II Java 1.1
Class java.awt.MenuShortcut
The MenuShortcut class has been added with Java 1.1. It represents a keystroke used to select a
II Constructors
public MenuShortcut(int key) II Java 1.1
public MenuShortcut(int key, boolean useShiftModifier) II Java 1.1
II Methods
public boolean equals(MenuShortcut s) II Java 1.1
public int getKey () II Java 1. 1
public String toString() II Java 1.1
public boolean usesShiftModifier() II Java 1.1
Class java.awt.Panel
The Panel class provides space into which an application can attach a component. The follow-
ing are defined:
II Constructors
public Panel ()
public Panel(LayoutManger layout) II Java 1.1
II Methods
public void addNotify()
Class java.awt.Point
The Point class represents an (x, y) co-ordinate. The following are defined:
II Fields
public int x;
public int y;
II Constructors
public Point () II Java 1 .1
public Point(Point p) II Java 1.1
public Point(int x, int y)
II Methods
public boolean equals(Object obj)
public Point getLocation() II Java 1.1
public int hashCode()
public void move(int x, int y)
public void setLocation(Point p) II Java 1.1
public void setLocation(int x, int y) II Java 1.1
public String toString()
public void translate(int dx, int dy)
Class java.awt.Polygon
The Polygon class consists of an array of (x, y), which define the sides of a polygon. The follow-
ing are defined:
II Fields
public int npoints, xpoints[] ,ypoints[];
II Constructors
public Polygon ()
public Polygon(int xpoints[], int ypoints[J, int npoints)
Class java.awt.PopupMenu
The PopupMenu class has been added with Java 1.1. It represetns a pop-up menu rather than a
pull-down menu. The following are defined:
II Constructors
public PopupMenu () I I Java 1.1
public PopupMenu(String label) II Java 1.1
II Methods
public synchronized void addNotify() II Java 1.1
public void show(Component origin, int x, int y) II Java 1.1
Class java.awt.Rectangle
The Rectangle class defines an area defined by its top-left (x, y) co-ordinate, its width and its
height. The following are defined:
II Fields
public int height, width, x, y;
II Constructors
public Rectangle()
public Rectangle(Rectangle r) II Java 1.1
public Rectangle(Dimension d)
public Rectangle(int width, int height)
public Rectangle(int x, int y, int width, int height)
public Rectangle(Point p)
public Rectangle(Point p, Dimension d)
II Methods
public void add(int newx, int newy)
public void add(Point pt)
public void add(Rectangle r)
public boolean contains(Point p) II Java 1.1
public boolean contains(int x, int y) II Java 1.1
public boolean equals(Object obj)
public Rectangle getBounds() II Java 1.1
public Point getLocation() II Java 1.1
public Dimension getSize() II Java 1.1
public void grow(int h, int v)
public int hashCode()
public boolean inside(int x, int y) II Java 1.0
public Rectangle intersection(Rectangle r)
public boolean intersects(Rectangle r)
public boolean isBmpty()
public void move(int x, int y) II Java 1.0
public void reshape(int x, int y, int width, int height) II Java 1.0
public void resize(int width, int height) II Java 1.0
public void setBounds(Rectangle r) II Java 1.1
public void setBounds(int x, int y, int width, int height) II Java 1.1
public void setLocation(Point p) II Java 1.1
public void setLocation(int x, int y) II Java 1.1
public void setSize(Dimension d) II Java 1.1
Closs java.awt.Scrollbar
The scrollbar class is a convenient means of allowing a user to select from a range of values.
The following are defined:
II Fields
public final static int HORIZONTAL, VERTICAL;
II Constructors
public Scrollbar()
public Scrollbar(int orientation)
public Scrollbar(int orientation, int value, int visible, int minimum,
int maximum)
II Methods
public synchronized void addAdjustmenuListener(AdjustmentListener 1)
II Java 1.1
public void addNotify()
public int getBlockincrement() II Java 1.1
public int getLineincrement() II Java 1.0
public int getMaximum()
public int getMinimum()
public int getOrientation()
public int getPageincrement() II Java 1. 0
public int getUnitincrement() II Java 1.1
public int getValue()
public int getVisible() II Java 1.0
protected String paramString()
public void setLineincrement(int 1) II Java 1.0
public synchronized void setMaximum(int max) II Java 1.1
public synchronized void setMinimum(int min) II Java 1.1
public synchronized void setOrientation(int orien) II Java 1.1
public void setPageincrement(int 1) II Java 1.0
public void setValue(int value)
public void setValues(int value, int visible, int minimum, int maximum)
public void setVisibleAmount(int am) II Java 1.1
Closs java.awt.TextArea
The TextArea class allows for a multi-line area for displaying text. The following are defined:
II Constructors
public TextArea()
public TextArea(int rows, int eels)
public TextArea(String text)
public TextArea(String text, int rows, int eels)
public TextArea(String text, int rows, int eels, int scrollbars)
II Java 1.1
II Constants
public static final int SCROLLBARS_BOTH; II Java 1.1
public static final int SCROLLBARS_HORIZONTAL_ONLY; II Java 1.1
public static final int SCROLLBARS_NONE; II Java 1.1
public static final int SCROLLBARS_VERTICAL_ONLY; II Java 1.1
II Methods
public void addNotify()
Class java.awt.TextComponent
The Textcomponent class is the superclass of any component that allows the editing of some
text. The following are defined:
II Methods
public void addTextListener{TextListener 1) II Java 1.1
public int getCaretPosition{) II Java 1.1
public String getSelectedText{)
public int getSelectionEnd{)
public int getSelectionStart{)
public String getText{)
public boolean isEditable{)
protected String paramString{)
public void ramoveNotify{)
public void removeTextListener{TextListener 1) II Java 1.1
public void select{int selStart, int selEnd)
public void selectAll{)
public void setCaretPosition{int position) II Java 1.1
public void setEditable{boolean t)
public synchronized setSelectionEnd{int selectionEnd) II Java 1.1
public synchronized setSelectionStart{int selectionStart) II Java 1.1
public void setText{String t)
Class java.awt.TextField
The Text Field class is a component that presents the user with a single editable line of text.
The following are defined:
II Constructors
public TextField{)
public TextField{int eels)
public TextField{String text)
public TextField{String text, int eels)
II Methods
public synchronized void addActionListener{ActionListener 1) II Java 1.1
public void addNotify{)
public boolean echoCharisSet{)
public int getColumns{)
public char getEchoChar{)
public Dimension getMinimumSize{int eels) II Java 1.1
Class java.awt.Toolkit
The Toolkit class is the abstract superclass of all actual implementations of the Abstract Win-
dow Toolkit. The following are defined:
II Constructors
public Toolkit()
II Methods
public abstract int beep() II Java 1.1
public abstract int checkimage(Image image, int width,
int height, ImageObserver observer)
public abstract Image createimage(ImageProducer producer)
public Image createimage(byte[] imagedatea) II Java 1.1
public Image createimage(byte[] imagedata, int imageoffset,
int imagelength) II Java 1.1
public abstract ColorModel getColorModel()
public static Toolkit getDefaultToolkit()
public abstract String[] getFontList()
public abstract FontMetrics getFontMetrics(Font font)
public abstract Image getimage(String filename)
public abstract Image getimage(URL url)
public int getMenuShortcutKeyMask() II Java 1.1
public abstract PrintJob getPrintJob(Frame frame, String jobtitle,
Properties props) II Java 1.1
public abstract int getScreenResolution()
public abstract Dimension getScreenSize()
public abstract Clipboard getSystemClipbaord() II Java 1.1
public abstract EventQueue getSystemEventQueue() II Java 1.1
public abstract boolean prepareimage(Image image, int width,
int height, ImageObserver observer)
public abstract void sync()
Class java.awt.Window
The Window class is the top-level window; it has no borders and no menu bar. The following are
defined:
II Constructors
public Window(Frame parent)
II Methods
public void addNotify()
public synchronized void addWindowListener(WindowListener 1) I I Java 1.1
public void dispose()
public Component getFocusOwner() II Java 1.1
public Locale getLocale() I I Java 1.1
public Toolkit getToolkit()
public final String getWarningString()
public boolean isShowing() II Java 1.1
Closs java.awt.datatransfer.Ciipboard
The Clipboard class has been added with Java 1.1. It represents a clipboard onto which data
can be transferred using cut-and-paste techniques. The following are defined:
II Constructors
public Clipboard(String name) II Java 1.1
II Methods
public synchronized Transferable getContents(Object requestor)
II Java 1.1
public String getName() II Java 1.1
public synchronized void setContents(Transferable contents,
Clipboard owner) II Java 1.1
Closs java.awt.event.ActionEvent
The ActionEvent class has been added with Java 1.1. It occurs when a event happens for a But-
ton, List, Menuitem or TextField. The following are defined:
II Constructors
public ActionEvent(Object src, String cmd) II Java 1.1
II Methods
public String getActionCommand() II Java 1.1
public int getModifiers() II Java 1.1
public int paramString() II Java 1.1
Interface java.awt.event.Actionlistener
The ActionListener interface has been added with Java 1.1. It defines the method which is
called by an ActionEvent. The following is defined:
Closs java.awt.event.AdjustmentEvent
The AdjustmentEvent class has been added with Java l.l.lt occurs when a event happens for a
Scrollbar. The following are defined:
II Constructors
II Methods
public Adjustable getAdjustable(} II Java 1.1
public int getAdjustmentType(} II Java 1.1
public int getValue(} II Java 1.1
public String paramString(} II Java 1.1
Class java.awt.event.Adjustmentlistener
The AdjustmentListener interface has been added with Java 1.1. It defines the method which
is called by an AdjustmentEvent. The following is defined:
Class java.awt.event.ComponentEvent
The ComponentEvent class has been added with Java 1.1. It occurs when a event happens for a
Component. The following are defined:
II Constructors
public ComponentEvent(Object src, int id, int type, int value}
II Methods
public Component getComponent(} II Java 1.1
public String paramString(} I I Java 1.1
Class java.awt.event.Componentlistener
The ComponentListener interface has been added with Java 1.1. It defines the method which is
called by a ComponentEvent. The following are defined:
Class java.awt.event.ContainerEvent
The ComponentEvent class has been added with Java 1.1. It occurs when a event happens for a
Container. The following are defined:
II Constructors
public ContainerEvent(Component src, int id, Compoent child}
II Methods
public Component getChild(} I I Java 1.1
public Component getContainer(} II Java 1.1
public String paramString(} I I Java 1.1
Class java.awt.event.Containerlistener
The ContainerListener interface has been added with Java 1.1. It defines the method which is
called by a ContainerEvent. The following are defined:
II Constructors
public ItemEvent(ItemSelectable src, int id, Object item, int stateChanged)
II Java 1.1
I I Methods
public Object get Item () II Java 1. 1
public ItemSelectable getitemSelectable() II Java 1.1
public int getStateChange () II Java 1. 1
public String paramString () II Java 1 .1
Closs java.awt.event.ltemlistener
The ItemListener interface has been added with Java 1.1. It defines the method which is called
by an ItemEvent. The following is defined:
Closs java.awt.event.KeyEvent
The KeyEvent class has been added with Java 1.1. It occurs when a event happens for a
keypress. The following are defined:
II Constructors
public KeyEvent(Component src, int id, long when, int modifiers,
int keyCode, char keyChar) II Java 1.1
II Constants
public static final int KEY_LAST, KEY_PRESSED, KEY_RELEASED, KEY_TYPED;
II Undefined Key and Character (Java 1.1)
public static final int VK_ONDEPINED, CHAR_UNDEPINED;
II Alphanumeric keys (Java 1.1)
public static final int VK_A, VK_B, VK_C, VK_D, VK_E, VK_P, VK_G, VK_H;
public static final int VK_I, VK_J, VK_K, VK_L, VK_M, VK_N, VK_O, VK_P;
public static final int VK_Q, VK_R, VK_S, VK_T, VK_U, VK_V, VK_W, VK_X;
public static final int VK Y, VK_Z;
public static final int VK_SPACE;
public static final int VK_O, VK_l, VK_2, VK_3, VK_4, VK_S, VK_6, VK_7;
public static final int VK_S, VK_9;
public static final int VK_NUMPADO, VK_NUMPADl, VK_NUMPAD2, VK_NUMPAD3;
public static final int VK NUMPAD4, VK_NUMPADS, VK_NUMPAD6, VK_NUMPAD7;
public static final int VK=NUMPADS, VK_NUMPAD9;
II Control keys (Java 1.1)
public static final int VK_BACK_SPACE, VK_ENTER, VK_ESCAPE, VK_TAB;
II Modifier keys (Java 1.1)
public static final int VK_ALT, VK_CAPS_LOCK, VK_CONTROL, VK META, VK_SHIPT;
II Function keys (Java 1.1)
public static final int VK_FO, VK_Fl, VK_F2, VK_F3, VK_F4, VK_FS, VK_F6;
public static final int VK_F7, VK_F8, VK_F9;
public static final int VK_PRINTSCREEN, VK_SCROLL_LOCK, VK_PAOSE;
public static final int VK_PAGE_DOWN, VK_PAGE_UP;
public static final int VK_DOWN, VK_UP, VK_RIGHT, VK_LEFT;
II Methods
public void getKeyChar() II Java 1.1
public int getKeyCode () II Java 1.1
public boolean isActionKey() II Java 1.1
public String paramString() II Java 1.1
public void setKeyChar(char keyChar) II Java 1.1
public void setKeyCode(int keyCode) II Java 1.1
public void setModifiers(int modifiers) II Java 1.1
Class java.awt.event.Keylistener
The KeyLi s tener interface has been added with Java 1.1. It defines the method which is called
by a KeyEvent. The following is defined:
Class java.awt.event.MouseEvent
The MouseEvent class has been added with Java 1.1. It occurs when a event happens for a
MouseEvent. The following are defined:
II Constructors
public MouseEvent(Component src, int id, long when, int modifiers, int x,
int y, intclickCount, boolean popupTrigger) II Java 1.1
II Constants
public static final int MOUSE_CLICKED, MOUSE_DRAGGED;
public static final int MOUSE_ENTERED, MOUSE_EXITED;
public static final int MOUSE_FIRST, MOUSE_LAST;
public static final int MOUSE_MOVED, MOUSE_PRESSED;
public static final int MOUSE_RELEASED;
II Methods
public int getClickCount() /1 Java 1.1
public Point getPoint() II Java 1.1
public int getX() II Java 1.1
public int getY() II Java 1.1
public boolean isPopupTrigger () II Java 1. 1
public String paramString() II Java 1.1
public synchronized void translatePoint(int x, int ylll Java 1.1
Class java.awt.event.Mouselistener
The MouseListener interface has been added with Java 1.1. It defines the method which is
called by a mouse dick event. The following are defined:
Class java.awt.event.MouseMouselistener
The MouseMouseListener interface has been added with Java 1.1. It defines the method which
is called by a mouse drag or move event. The following are defined:
II Constructors
public TextBvent(Object src, int id) II Java 1.1
II Constants
public static final int TBXT_FIRST, TBXT_LAST;
public static final int TBXT_VALUE_CHANGBD;
II Methods
public String paramString() II Java 1.1
Class java.awt.event.Textlistener
The TextListener interface has been added with Java 1.1. It defines the method which is called
by a TextEvent. The following is defined:
Class java.awt.eventWindowEvent
The WindowEvent class has been added with Java 1.1. It occurs when an event happens within a
Window object. The following are defined:
II Constructors
public WindowBvent(Window src, int id) II Java 1.1
II Constants
public static final int WINDOW_ACTIVATBD, WINDOW_CLOSBD;
public static final int WINDOW_CLOSING, WINDOW_DBACTIVATBD;
public static final int WINDOW_DBICONI:PIBD, WINDOW_PIRST;
public static final int WINDOW_ICONIPIBD, WINDOW_LAST;
public static final int WINDOW_OPBNBD;
II Methods
public Window getWindow () I I Java 1 . 1
public String paramString() II Java 1.1
Ap8.6 Packagejava.io
Class java.io.BufferedOutputStream
The BufferedOutputStream implements a buffered output stream. These streams allow the
program to write to an input device without having to worry about the interfacing method. The
following are defined:
II Fields
protected byte buf[];
protected int count;
II Constructors
public BufferedoutputStream(OutputStream out)
public BufferedoutputStream(OutputStream out, int size)
II Methods
public void flush()
public void write(byte b[], int off, int len)
public void write(int b)
II Constructors
public BufferedReader(Reader in, int sz) II Java 1.1
public BufferedReader(Reader in) I I Java 1.1
II Methods
public void close() throws IOException; II Java 1.1
public void mark(int readAheadLimit) throws IOException; II Java 1.1
public boolean markSupported() throws IOException; II Java 1.1
public int read() throws IOException; II Java 1.1
public int read(char [] cbuf, int off, int len) throws IOException; II Java 1.1
public String readLine() throws IOException; II Java 1.1
public boolean ready() throws IOException; II Java 1.1
public void reset() throws IOException; II Java 1.1
II Constrsuctors
public BufferedWriter(Writer out, int sz) II Java 1.1
public BufferedWriter(Writer in) II Java 1.1
II Methods
public void close() throws IOException; II Java 1.1
public void flush() throws IOException; II Java 1.1
public void newLine() throws IOException; II Java 1.1
public void write(int c) throws IOException; II Java 1.1
public void write(char [] cbuf, int off, int len) throws IOException;
I I Java 1.1
Class java.io.ByteArraylnputStream
The ByteArrayinputStream class supports input from a byte array. The following are defined:
II Fields
protected byte buf[];
protected int count;
protected int mark; II Java 1.1
protected int pos;
II Constructors
public ByteArrayinputStream(byte buf[])
public ByteArrayinputStream(byte buf[], int offset, int length)
II Methods
public int available()
public void mark(int markpos) II Java 1.1
public boolean markSupported() II Java 1.1
public int read()
public int read(byte b[], int off, int len)
public void reset()
public long skip(long n)
Closs java.io.ByteArrayOutputStream
The ByteArrayOutputStream class allows supports output to a byte array. The following are
defined:
II Fields
protected byte buf[];
protected int count;
II Constructors
public ByteArrayOutputStream()
public ByteArrayOutputStream(int size)
II Methods
public void reset()
public int size()
public byte[] toByteArray()
Interface java.io.Datalnput
The Datainput interface gives support for streams to read in a machine-independent way. The
following are defined:
II Methods
public abstract boolean readBoolean{)
public abstract byte readByte{)
public abstract char readChar{)
public abstract double readDouble{)
public abstract float readFloat{)
public abstract void readFu1ly{byte b[])
public abstract void readFully{byte b[], int off, int len)
public abstract int readint{)
public abstract String readLine{)
public abstract long readLong{)
public abstract short readShort{)
public abstract int readUnsignedByte{)
public abstract int readUnsignedShort{)
public abstract String readUTF{)
public abstract int skipBytes{int n)
Class java.io.DatalnputStream
The Datainputstream class allows an application to read data in a machine-independent way. It
uses standard Unicode strings which conforms to the UTF-81 specification. The following are
defined:
II Constructors
public DatainputStream{InputStream in)
II Methods
public final int read{byte b[])
public final int read{byte b[], int off, int len)
public final boolean readBoolean{)
public final byte readByte {)
public final char readChar { )
public final double readDouble{)
public final float readFloat{)
public final void readFully{byte b[])
public final void readFully{byte b [], int off, int len)
public final int readint {)
public final String readLine{) II Java 1.0
public final long readLong {)
public final short readShort{)
public final int readUnsignedByte{)
public final int readUnsignedShort{)
public final String readUTF{)
public final static String readUTF{Datainput in)
public final int skipBytes{int n)
II Methods
public abstract void write(byte b[])
public abstract void write(byte b[], int off, int len)
public abstract void write(int b)
public abstract void writeBoolean(boolean v)
public abstract void writeByte(int v)
public abstract void writeBytes(String s)
public abstract void writeChar(int v)
public abstract void writeChars(String s)
public abstract void writeDouble(double v)
public abstract void writeFloat(float v)
public abstract void writeint(int v)
public abstract void writeLong(long v)
public abstract void writeShort(int v)
public abstract void writeUTF(String str)
Closs java.io.DataOutputStream
The DataOutputStream class allows an application to write data in a machine-independent way.
It uses standard Unicode strings which conforms to the UTF-81 specification. The following are
defined:
II Fields
protected int written;
II Constructors
public DataOutputStream(OutputStream out)
II Methods
public void flush()
public final int size()
public void write(byte b[], int off, int len)
public void write(int b)
public final void writeBoolean(boolean v)
public final void writeByte(int v)
public final void writeBytes(String s)
public final void writeChar(int v)
public final void writeChars(String s)
public final void writeDouble(double v)
public final void writeFloat(float v)
public final void writeint(int v)
public final void writeLong(long v)
public final void writeShort(int v)
public final void writeUTF(String str)
Closs java.io.EOFException
Exception that identifies that the end-of-file has been reached unexpectedly during input. The
following are defined:
II Constructors
public BOFBxception()
public BOFBxception(String s)
II Fields
public final static String pathSeparator;
public final static char pathSeparatorChar;
public final static String separator;
public final static char separatorChar;
II Constructors
public File(File dir, String name)
public File(String path)
public File(String path, String name)
II Methods
public boolean canRead()
public boolean canWrite()
public boolean delete()
public boolean equals(Object obj)
public boolean exists()
public String getAbsolutePath()
public String getCanonicalPath() II Java 1.1
public String getName()
public String getParent()
public String getPath()
public int hashCode()
public boolean isAbsolute()
public boolean isDirectory()
public boolean isFile()
public long lastModified()
public long length()
public String[) list()
public String[) list(FilenameFilter filter)
public boolean mkdir()
public boolean mkdirs()
public boolean renameTo(File dest)
public String toString()
Class java.io.FileDescriptor
The FileDescriptor class provides a way to cope with opening files or sockets. The following
are defined:
II Fields
public final static FileDescriptor err, in, out;
II Constructors
public FileDescriptor()
II Methods
public void sync() II Java 1.1
public boolean valid()
Class java.io.FilelnputStream
The FileinputStream class provides supports for an input file. The following are defined:
II Constructors
II Methods
public int available()
public void close()
protected void finalize()
public final FileDescriptor getFD()
public int read()
public int read(byte b[])
public int read(byte b[], int off, int len)
public long skip(long n)
Interface java.io.FilenameFilter
The FilenameFile interface is used to filter filenames. The following is defined:
II Methods
public abstract boolean accept(File dir, String name)
Closs java.io.FileNotFoundException
Exception that identifies that a file could not be found. The following are defined:
II Constructors
public FileNotFoundException()
public FileNotFoundException(String s)
Closs java.io.FileOutputStream
The FileOutputStream class provides suppons for an output file. The following are defined:
II Constructors
public FileOutputStream(File file)
public FileOutputStream(String name, boolean append) II Java 1.1
public FileOutputStream(FileDescriptor fdObj)
public FileOutputStream(String name)
II Methods
public void close()
protected void finalize()
public final FileDescriptor getFD()
public void write(byte b[])
public void write(byte b[], int off, int len)
public void write(int b)
Closs java.io.FilterlnputStream
The FilterinputStream class is the superdass of all classes that filter input streams. The fol-
lowing are defined:
II Fields
protected InputStream in;
II Constructors
protected FilterinputStream(InputStream in)
II Methods
Closs java.io.FilterOutputStream
The FilterOutputstream class is the superclass of all classes that filter output streams. The
following are defined:
II Fields
protected OutputStream out;
II Constructors
public FilterOutputStream(OutputStream out)
II Methods
public void close()
public void flush()
public void write(byte b[])
public void write(byte b[], int off, int len)
public void write(int b)
Closs java.io.lnputStream
The InputStream class is the superclass of all classes representing an input stream of bytes. The
following are defined:
II Constructors
public InputStream()
II Methods
public int available()
public void close()
public void mark(int readlimit)
public boolean markSupported()
public abstract int read()
public int read(byte b[])
public int read(byte b[], int off, int len)
public void reset()
public long skip(long n)
II Fields
public int bytesTransferred;
II Constructors
public InterruptediOException()
public InterruptediOException(String s)
II Constructors
public IOException()
public IOException(String s)
Class java.io.LineNumberlnputStream
The LineNumberinputStream class provides suppon for the current line number in an input
stream. Each line is delimited by either a carriage return character ('\r'), new-line character ('\n')
or both together. The following are defined:
II Constructors
public LineNumberinputStream(InputStream in)
II Methods
public int available()
public int getLineNumber()
public void mark(int readlimit)
public int read()
public int read(byte b[], int off, int len)
public void reset()
public void setLineNumber(int lineNumber)
public long skip(long n)
Class java.io.OutputStream
The InputStream class is the superclass of all classes representing an output stream of bytes. The
following ate defined:
II Constructors
public OutputStream()
II Methods
public void close()
public void flush()
public void write(byte b[])
public void write(byte b[], int off, int len)
public abstract void write(int b)
Class java.io.PipedlnputStream
The PipedinputStream class provides suppon for pipelined input communications. The fol-
lowing ate defined:
II Constructors
public PipedinputStream()
public PipedinputStream(PipedOutputStream src)
II Methods
public void close()
public void connect(PipedOutputStream src)
public int read()
public int read(byte b[], int off, int len)
II Constructors
public PipedOutputStream()
public PipedOutputStream(PipedinputStream snk)
II Methods
public void close()
public void connect(PipedinputStream snk)
public void write(byte b[], int off, int len)
public void write(int b)
Class java.io.PrintStream
The PrintStream class provides support for output print streams. The following are defined:
II Constructors
public PrintStream(OutputStream out) II Java 1.0
public PrintStream(OutputStream out, boolean autoflush) II Java 1.0
II Methods
public boolean checkError()
public void close()
public void flush()
public void print(boolean b)
public void print (char c)
public void print (char s [])
public void print (double d)
public void print (float f)
public void print(int i)
public void print (long 1)
public void print(Object obj)
public void print(String s)
public void println()
public void println(boolean b)
public void println(char c)
public void println(char s[])
public void println(double d)
public void println(float f)
public void println(int i)
public void println(long 1)
public void println(Object obj)
public void println(String s)
public void write(byte b[], int off, int len)
public void write (int b)
Class java.io.PushbacklnputStream
The PushbackinputStream class provides support to put bytes back into an input stream. The
following are defined:
II Fields
protected int pushBack;
II Constructors
public PushbackinputStream(InputStream in)
Class java.io.RandomAccessFile
The RandomAccessFile class support reading and writing from a random access file. The fol-
lowing are defined:
II Constructors
public RandomAccessFile(File file, String mode)
public RandomAccessFile(String name, String mode)
II Methods
public void close()
public final FileDescriptor getFD()
public long getFilePointer()
public long length()
public int read()
public int read(byte b[))
public int read(byte b[), int off, int len)
public final boolean readBoolean()
public final byte readByte()
public final char readChar()
public final double readDouble()
public final float readFloat()
public final void readFully(byte b[))
public final void readFully(byte b[), int off, int len)
public final int readint()
public final String readLine()
public final long readLong()
public final short readShort()
public final int readUnsignedByte()
public final int readUnsignedShort()
public final String readUTF()
public void seek(long pos)
public int skipBytes(int n)
public void write(byte b[))
public void write(byte b[), int off, int len)
public void write(int b)
public final void writeBoolean(boolean v)
public final void writeByte(int v)
public final void writeBytes(String s)
public final void writeChar(int v)
public final void writeChars(String s)
public final void writeDouble(double v)
public final void writeFloat(float v)
public final void writeint(int v)
public final void writeLong(long v)
public final void writeShort(int v)
public final void writeUTF(String str)
Class java.io.SequencelnputStream
The SequenceinputStream supports the combination of several input streams into a single in-
put stream. The following are defined:
II Constructors
public SequenceinputStream(Enumeration e)
II Methods
public void avia1able() II Java 1.1
public void close()
public int read()
public int read(byte buf[], int pos, int len)
Closs java.io.StreamTokenizer
The StreamTokenizer class splits an input stream into tokens. These tokens can be defined by
number, quotes strings or comment styles. The following are defined:
II Fields
public double nval;
public String sval;
public int ttype;
II Constructors
public StreamTokenizer(InputStream I)
II Methods
public void commentChar(int ch)
public void eolisSignificant(boolean flag)
public int lineno()
public void lowerCaseMode(boolean fl)
public int nextToken()
public void ordinaryChar(int ch)
public void ordinaryChars(int low, int hi)
public void parseNUmbers()
public void pushBack()
public void quoteChar(int ch)
public void resetSyntax()
public void whitespaceChars(int low, int hi)
public void slashStarComments(boolean flag)
public String toString()
public void whitespaceChars(int low, int hi)
public void wordChars(int low, int hi)
Closs java.io.StringBufferlnputStream
The StringBufferinputStream class supports stream input buffers. The following are defined:
II Fields
protected String buffer;
protected int count, pos;
II Constructors
public StringBufferinputStream(String s)
II Methods
public int available()
public int read()
public int read(byte b[], int off, int len)
public void reset()
public long skip(long n)
II Constructors
public UTFDataFormatException()
public UTFDataFormatException(String s)
Class java.lang.ArithmeticException
Exception that is thrown when an exceptional arithmetic condition has occurred, such as a divi-
sion-by-zero or a square root of a negative number. The following are defined:
II Constructors
public ArithmeticException()
public ArithmeticException(String s)
II Constructors
public ArrayindexOutOfBoundsException()
public ArrayindexOutOfBoundsException(int index)
public ArrayindexOutOfBoundsException(String s)
Class java.lang.ArrayStoreException
Exception that is thrown when the wrong type of object is stored in an array of objects. The
following are defined:
II Constructors
public ArrayStoreException()
public ArrayStoreException(String s)
Class java.lang.Boolean
The Boolean class implements the primitive type boolean of an object. Other methods are in-
cluded for a converting a boolean to a String and vice versa. The following are defined:
II Constructors
public Boolean(boolean value)
public Boolean(String s)
II Methods
public boolean booleanValue()
II Constants
public final static int MAX_RADIX, MAX_VALUE;
public final static int MIN RADIX, MIN VALUE;
public final static int TYPE; I I Java l.1
II Character type constants
public final static byte COMBINING_SPACE_MARK; II Java 1.1
public final static byte CONNECTOR PUNCUATION, CONTROL; // Java 1.1
public final static byte CURRENCY SYMBOL, DASH PUNCTUATION;// Java 1.1
public final static byte DIGIT NUMBER, ENCLOSING MARK; //Java 1.1
public final static byte END PUNCTUATION, FORMAT7 //Java 1.1
public final static byte LETTER NUMBER, LINE SEPERATOR; //Java 1.1
public final static byte LOWERCASE_LETTER, MATH_SYMBOL; //Java 1.1
public final static byte MODIFIER LETTER, MODIFIER SYMBOL; // Java 1.1
public final static byte NON SPACING MARK, OTHER LETTER;// Java 1.1
public final static byte OTHER NUMBER, OTHER PUNCTUATION; //Java 1.1
public final static byte OTHER-SYMBOL, PARAGRAPH SEPARATOR;// Java 1.1
public final static byte PRIVATE USE, SPACE SEPARATOR; //Java 1.1
public final static byte START PUNCTUATION,-SORROGATE; // Java 1.1
public final static byte TITLECASE LETTER, UNASSIGNED; // Java 1.1
public final static byte UPPERCASE=LETTER; // Java 1.1
II Constructors
public Character(char value}
II Methods
public char charValue(}
public static int digit(char ch, int radix}
public boolean equals(Object obj}
public static char forDigit(int digit, int radix}
public static char getNUmericValue(char ch} // Java 1.1
public static char getType(char ch} // Java 1.1
public static boolean isDefined(char ch}
public static boolean isDigit(char ch}
public static boolean isiSOControl(char ch} //Java 1.1
public static boolean isidentifierignoreable(char ch} // Java 1.1
public static boolean isJavaindentierPart(char ch} // Java 1.1
public static boolean isJavaindentierStart(char ch} // Java 1.1
public static boolean isJavaLetter(char ch} // Java 1.0
public static boolean isJavaLetterOrDigit(char ch} //Java 1.0
public static boolean isLettsr(char ch}
public static boolean isLetterOrDigit(char ch}
public static boolean isLowerCase(char ch}
public static boolean isSpace(char ch} // Java 1.0
public static boolean isSpaceChar(char ch} // Java 1.0
public static boolean isTitleCase(char ch}
public static boolean isUnicodeidentifierPart(char ch} //Java 1.1
public static boolean isUnicodeidentifierStart(char ch} // Java 1.1
public static boolean isUpperCase(char ch}
Class java.lang.C/ass
The Class class implements the class Class and interfaces in a running Java application. The
following are defined:
II Methods
public static Class forName(String className)
public ClassLoader getC1assLoader()
public Class[) getinterfaces()
public String getName()
public Class getSuperclass()
public boolean isinterface()
public Object newinstance()
public String toString()
Class java.lang.C/asscastException
Exception that is thrown when an object is casted to a subclass which it is not an instance. The
following are defined:
II Constructors
public C1assCastException()
public ClassCastException(String s)
Class java.lang.Compiler
The Compiler class supports Java-to-native-code compilers and related services. The following
are defined:
II Methods
public static Object command(Object any)
public static boolean compileClass(Class clazz)
public static boolean compileClasses(String string)
public static void disable()
public static void enable()
Class java.lang.Double
The Double class implements the primitive type double of an object. Other methods are in-
cluded for a converting a double to a String and vice versa. The following are defined:
II Fields
public final static double MAX_VALUE, MIN_VALUE;
public final static double NaN, NEGATIVE INFINITY, POSITIVE_INFINITY;
public final static double TYPE; I I Java l.1
II Constructors
public Double(double value)
public Double(String s)
II Methods
public static long doubleToLongBits(double value)
Closs java.lang.Error
Exception that is thrown when there are serious problems that a reasonable application should
not try to catch. The following are defined:
II Constructors
public Error{)
public Error{String s)
Closs java.lang.Exception
Exception that is thrown that indicates conditions that a reasonable application might want to
catch.
II Constructors
public Exception{)
public Exception{String s)
Closs java.lang.Fioat
The Float class implements the primitive type float of an object. Other methods are included
for a converting a float to a String and vice versa. The following are defined:
II Fields
public final static float MAX_VALUE MIN_VALUE;
public final static float NaN, NEGATIVE INFINITY, POSITIVE_INPINITY;
public final static float TYPE; II Java-1.1
II Constructors
public Float{double value)
public Float{float value)
public Float{String s)
II Methods
public double doubleValue{)
public boolean equals{Object obj)
public static int floatTointBits{float value)
public float floatValue{)
public int hashCode{)
public static float intBitsToPloat{int bits)
public int intValue{)
public boolean isinfinite{)
public static boolean isinfinite{float v)
public boolean isNaN{)
Class java.lang.lllegaiAccessError
Exception that is thrown when an application attempts to access or modify a field, or to call a
method that it does not have access to. The following are defined:
II Constructors
public IllegalAccessError()
public IllegalAccessError(String s)
Class java.lang.lllegaiArgumentException
Exception that is thrown when a method has been passed an illegal or inappropriate argument.
The following are defined:
II Constructors
public IllegalArgumentException()
public IllegalArgumentException(String s)
II Constructors
public IllegalThreadStateException()
public IllegalThreadStateException(String s)
Class java.lang.lndexOutOfBoundsException
Exception that is thrown to indicate that an index term is out of range. The following are de-
fined:
II Constructors
public IndexOutOfBoundsException()
public IndexOutOfBoundsException(String s)
Class java.lang.lnteger
The Integer class implements the primitive type integer of an object. Other methods are in-
cluded for a converting a integer to a String and vice versa. The following are defined:
II Fields
public final static int MAX VALUE, MIN VALUE;
public final static int TYPE; I I Java l.l
II Constructors
public Integer(int value)
public Integer(String s)
Class java.lang.lnternaiError
Exception that is thrown when an unexpected internal error has occurs. The following are de-
fined:
II Constructors
public InternalError()
public InternalError(String s)
II Constructors
public InterruptedException()
public InterruptedException(String s)
Class java.lang.Long
The Long class implements the primitive type long of an object. Other methods are included for
a converting a long to a String and vice versa. The following are defined:
II Fields
public final static long MAX VALUE, MIN VALUE;
public final static long TYPE; II Java1.1
II Constructors
public Long(long value)
public Long(String s)
II Methods
public double doubleValue()
public boolean equals(Object obj)
public float floatValue()
public static Long getLong(String nm)
Class java.lang.Math
The Math class contains methods to perform basic mathematical operations. The following are
defined:
II Fields
public final static double E;
public final static double PI;
II Methods
public static double abs(double a)
public static float abs (float a)
public static int abs(int a)
public static long abs(long a)
public static double acos(double a)
public static double asin(double a)
public static double atan(double a)
public static double atan2(double a, double b)
public static double ceil(double a)
public static double cos(double a)
public static double exp(double a)
public static double floor(double a)
public static double IEEEremainder(double fl, double f2)
public static double log(double a)
public static double max(double a, double b)
public static float max(float a, float b)
public static int max(int a, int b)
public static long max(long a, long b)
public static double min(double a, double b)
public static float min(float a, float b)
public static int min(int a, int b)
public static long min(long a, long b)
public static double pow(double a, double b)
public static double random ()
public static double rint(double a)
public static long round(double a)
public static int round(float a)
public static double sin(double a)
public static double sqrt(double a)
public static double tan(double a)
Class java.lang.NegativeArraySizeException
Exception that is thrown when an array is created with a negative size.
Closs java.lang.NuiJPointerException
Exception that is thrown when an application attempts to use a null pointer. The following are
defined:
II Constructors
public NullPointerException()
public NullPointerException(String s)
Closs java.lang.Number
The Number class contains the superclass of classes for float, double, integer and long. It can be
used to convert values into int, long, float or double. The following are defined:
II Methods
public abstract double doubleValue()
public abstract float floatValue()
public abstract int intValue()
public abstract long longValue()
Closs java.lang.NumberFormatException
Exception rhat is thrown when an application attempts to convert a string to one of the numeric
types, but that the string does not have rhe appropriate format.
II Constructors
public NumberFormatException()
public NumberFormatException(String s)
Closs java.lang.Objed
The Object class contains the root of the class hierarchy. The following are defined:
II Constructors
public Object()
II Methods
protected Object clone()
public boolean equals(Object obj)
protected void finalize()
public final Class getClass()
public int hashCode()
public final void notify()
public final void notifyAll()
public String toString()
public final void wait()
public final void wait(long timeout)
public final void wait(long timeout, int nanos)
Closs java.lang.OutOfMemoryError
Exception that is thrown when an application runs out of memory. The following are defined:
Closs java.lang.Process
The Process class contains methods which are used to control the process. The following are
defined:
II Constructors
public Process ()
II Methods
public abstract void destroy()
public abstract int exitValue()
public abstract InputStream getBrrorStream()
public abstract InputStream getinputStream()
public abstract OutputStream getOutputStream()
public abstract int waitFor()
Closs java.lang.Runtime
The Runtime class allows the application to interface with the environment in which it is run-
ning. The following are defined:
II Methods
public Process exec(String command)
public Process exec(String command, String envp[])
public Process exec(String cmdarray[])
public Process exec(String cmdarray[], String envp[])
public void exit(int status)
public long freeMemory()
public void gc()
public InputStream getLocalizedinputStream(InputStream in) // Java 1.0
public OutputStream getLocalizedOutputStream(OutputStream out)// Java 1.0
public static Runtime getRuntime()
public void load(String filename)
public void loadLibrary(String libname)
public void runFinalization()
public long totalMemory()
public void traceinstructions(boolean on)
public void traceMethodCalls(boolean on)
Closs java.lang.SecurityManager
The securi tyManager class is an abstract class that allows applications to determine if it is safe
to execute a given operation. The following are defined:
II Fields
protected boolean inCheck;
II Constructors
protected SecurityManager()
II Methods
public void chackAccept(String host, int port)
public void chackAccass(Thread g)
public void checkAccess(ThreadGroup g)
public void checkConnect(String host, int port)
Class java.lang.StackOverflowError
Exception that is thrown when a stack overflow occurs. The following are defined:
II Constructors
public StackOverflowError()
public StackOverflowError(String s)
Class java.lang.String
The String class represents character strings. As in C, a string is delimted by inverted commas.
It contains string manipulation methods, such as concat (string concatenation), equals (if
string is equal to), toLowcase (to convert a string to lowercase), and so on. The following are
defined:
II Constructors
public String()
public String(byte ascii[], int hibyte) II Java 1.0
public String(byte ascii[], int hibyte, int offset, int count)// Java 1.0
public String(char value[])
public String(char value[], int offset, int count)
public String(String value)
public String(StringBuffer buffer)
public String(byte ascii[], int offset, int length, String enc) II Java 1.1
II Methods
public char charAt(int index)
public int compareTo(String anotherString)
public String concat(String str)
public static String copyValueOf(char data[])
public static String copyValueOf(char data[], int offset, unt count)
public boolean endsWith(String suffix)
public boolean equals(Object anObject)
Class java.lang.StringBuffer
The StringBuffer class implements a string buffer. The following are defined:
II Constructors
public StringBuffer()
public StringBuffer(int length)
public StringBuffer(String str)
II Methods
public StringBuffer append(boolean b)
public StringBuffer append(char c)
public StringBuffer append(char str[])
public StringBuffer append(char str[], int offset, int len)
public StringBuffer append(double d)
public StringBuffer append(float f)
public StringBuffer append(int i)
public StringBuffer append(long 1)
public StringBuffer append(Object obj)
public StringBuffer append(String str)
public int capacity()
public char charAt(int index)
public void ensureCapacity(int minimumCapacity)
public void getChars(int srcBegin, int srcEnd, char dst[], int dstBegin)
II Constructors
public StringindexOutOfBoundsException()
public StringindexOutOfBoundsException(int index)
public StringindexOutOfBoundsException(String s)
Closs java.lang.System
The System class implements a number of system methods. The following are defined:
II Fields
public static PrintStream err, in, out;
II Methods
public static void arraycopy(Object src, int src_position,
Object dst, int dst_position, int length)
public static long currentTUneMillis()
public static void exit(int status)
public static void gc()
public static Properties getProperties()
public static String getProperty(String key)
public static String getProperty(String key, String def)
public static SecurityManager getSecurityManager()
public static void load(String filename)
public static void loadLibrary(String libname)
public static void runFinalization()
public static void setProperties(Properties props)
public static void setSecurityManager(SecurityManager s)
Closs java.lang.Thread
The Thread class implements one or more threads. The following are defined:
II Fields
public final static int MAX_PRIORITY, MIN_PRIORITY, NORM_PRIORITY;
II Constructors
public Thread()
public Thread(Runnable target)
public Thread(Runnable target, String name)
public Thread(String name)
public Thread(ThreadGroup group, Runnable target)
II Methods
public static int activeCount()
public void checkAccess()
public int countStackFrames()
public static Thread currentThread()
public void destroy()
public static void dumpStack()
public static int enumerate(Thread tarray[])
public final String getName()
public final int getPriority()
public final ThreadGroup getThreadGroup()
public void interrupt()
public static boolean interrupted()
public final boolean isAlive()
public final boolean isDaemon()
public boolean isinterrupted()
public final void join()
public final void join(long millis)
public final void join(long millis, int nanos)
public final void resume()
public void run ()
public final void setDaemon(boolean on)
public final void setName(String name)
public final void setPriority(int newPriority)
public static void sleep(long millis)
public static void sleep(long millis, int nanos)
public void start()
public final void stop()
public final void stop(Throwable obj)
public final void suspend()
public String toString()
public static void yield()
Class java.lang.ThreadGroup
The ThreadGroup class implements a set of threads. The following are defined:
II Constructors
public ThreadGroup(String name)
public ThreadGroup(ThreadGroup parent, String name)
II Methods
public int activeCount()
public int activeGroupCount()
public final void checkAccess()
public final void destroy()
public int enumerate(Thread list[])
public int enumerate(Thread list[], boolean recurse)
public int enumerate(ThreadGroup list[])
public int enumerate(ThreadGroup list[], boolean recurse)
public final int getMaxPriority()
public final String getName()
public final ThreadGroup getParent()
public final boolean isDaemon()
public void list()
public final boolean parentOf(ThreadGroup g)
public final void resume()
public final void setDaemon(boolean daemon)
public final void setMaxPriority(int pri)
public final void stop()
Closs java.lang.Throwable
The Throwable class is the superclass of all errors and exceptions in the Java language. The fol-
lowing are defined:
II Constructors
public Throwable()
public Throwable(String message)
II Methods
public Throwable fillinStackTrace()
public String getMessage()
public void printStackTrace()
public void printStackTrace(PrintStream s)
public String toString()
Closs java.lang.UnknownError
Exception that is thrown when an unknown error occurs. The following are defined:
II Constructors
public UnknownError()
public UnknownError(String s)
Closs java.net.Authenicator
Authenticates a connection, and is used when a proxy or an HTTP server prompts for authenti-
cation.
Closs java.net.HttpURLConnection
The constructor is:
protected HttpURLConnection (URL u)
The methods implemented are: "GET", "POST", "HEAD", "OPTIONS", "PUT", "DELETE",
"TRACE".
Closs java.net.DatagramPacket
The DatagramPacket class implements datagram packets. The following are defined:
II Constructors
public DatagramPacket(byte ibuf[], int offset, int ilength)
public DatagramPacket(byte[] ibuf, int ilength)
public DatagramPacket(byte[] ibuf, int ilength, inetAddress iadd, int iport)
public DatagramPacket(byte buf[], int offset, int length, SocketAddress addr)
public DatagramPacket(byte buf[], int length, SocketAddress addr)
where:
Closs java.net.DatagramSocket
The DatagramSocket class represents sockets for sending and receiving daragrams. The follow-
ing are defined:
II Constructors
public DatagramSocket()
public DatagramSocket(int port)
II Methods
public synchronized void bind(SocketAddress addr)
public void close()
public void connect(InetAddress address, int port)
public void connect(SocketAddress addr)
protected DatagramSocket(DatagramSocketimpl impl)
public DatagramSocket(SocketAddress bindaddr)
public DatagramSocket(int port, InetAddress laddr)
public void disconnect()
public synchronized boolean getBroadcast()
forTC:
IPTOS LOWCOST II Ox02
IPTOS_RELIABILITY II Ox04
IPTOS THROUGHPUT II Ox OS
IPTOS LOWDELAY II Ox10
Class java.net.lnet4Address
This extends InetAddress, where the following are defined (http://www.ietf.org/rfc/
rfc2365.txt):
10.0.0.0/8
172.16.0.0/12
192.168.0.0/16
Global scope:
224.0.1.0 to 238.255.255.255
Class java.net.lnet6Address
This extends InetAddress, where the following are defined (http://www.ietf.org/rfc/
rfc2373.txt):
Multicast addresses are checked for alll's in the first byte (FF:xx:xx:xx:xx:xx:xx:xx) to see if the
following is true:
Utility routine to check if the multicast address has node scope (MCNodeLocal).
ipaddress[O] & Oxff) == Oxff && (ipaddress[1] & OxOf) == Ox01
Utility routine to check if the multicast address has site scope (MCSiteLocal)
Utility routine to check if the multicast address has organization scope (MCgLocal)
ipaddress[O] & Oxff) == Oxff && (ipaddress[1] & OxOf) == OxOB
Another format which is sometimes used in a mixed environment of IPv4 and IPv6 nodes is:
xx:xx:xx:xx:xx:xx:d.d.d.d
where xx: xx: xx: xx: xx: xx defines the 6 upper bytes of the IPv6 address, and d. d. d. d repre-
sents the lower 32 bits of the IPv4 for address.
II Methods
public boolean equals(Object obj)
public InetAddress[] getAllByName(String host)
public InetAddress getByName(String host)
public static InetAddress getByAddress(String host, byte[] addr)
public static InetAddress getByAddress(byte[] addr)
public InetAddress getLocalHost(String host)
public synchronized static InetAddress getLocalHost()
public byte[] getAddress()
public String getCanonicalHostName()
public String getHostAddress()
public String getHostName()
String getHostName(boolean check)
public int hashCode()
public boolean isMulticastAddress() II Java 1.1
public boolean isAnyLocalAddress()
public boolean isLoopbackAddress()
public boolean isLinkLocalAddress()
public boolean isSiteLocalAddress()
public boolean isMCGlobal()
public boolean isMCNodeLocal()
public boolean isMCLinkLocal()
public boolean isMCSiteLocal()
public boolean isMCOrgLocal()
public String toString()
Closs java.net.jarURLConnection
Implements a URL connection to a JAR Gava ARchive) Hie. The methods are:
For example:
jar:http:ltestsite.comljarltest.jar!ltestltest.class
Closs java.net.MulticastSocket
Implements a multicast socket. The following are defined:
II Constructor
public MulticastSocket()
public MulticastSocket(int port)
public MulticastSocket(SocketAddress bindaddr)
II Methods
public boolean getLoopbackMode()
public InetAddress getinterface()
public Networkinterface getNetworkinterface()
public int getTimeToLive()
public byte getTTL()
public void joinGroup(InetAddress mcastaddr)
public void joinGroup(SocketAddress mcastaddr, Networkinterface netif)
public void leaveGroup(InetAddress mcastaddr)
public void leaveGroup(SocketAddress mcastaddr, Networkinterface netif)
public void setinterface(InetAddress inf)
s1.leaveGroup(group)
Class java.net.NetPermission
Implements additional persmissions, and extends the basic permissions (java. security. Ba-
sicPermission). The following are defined:
II Constructor
public NetPermission(String name)
public NetPermission(String name, String actions)
"setDefaultAuthenticator"
Class java.net.Networklnterface
This class represents a network interface with a name, and a list of IP addresses assigned to the
interface. The following are defined:
Closs java.net.PasswordAuthentication
Datagram implementation. The methods are:
II constructor
public PasswordAuthentication(String userName, char[] password)
II methods
public String getUserName()
public char[] getPassword()
An example is:
import java.net.PasswordAuthentication;
Closs java.net.PiainDatagramSocketlmpl
Datagram implementation. The methods are:
SO_TIMEOUT
IP_TOS
SO_REUSEADDR
SO_BROADCAST
SO_BINDADDR
Closs java.net.PiainSocketlmpl
This is the default socket class and does not contain any security checks. The methods are:
Closs java.net.ServerSocket
The ServerSocket class represents servers which listen for a connection from clients. The fol-
lowing are defined:
II Constructors
public ServerSocket(int port)
Class java.net.Socket
The Socket class represents socket connections over a network. The following are defined:
II Constructors
public Socket ()
public Socket(String host, int port)
public Socket(InetAddress addr, int port)
public Socket(InetAddress addr, int port, boolean stream) II Java 1.0
public Socket(String host, int port, InetAddress addr, int localport)
II Java 1.1
public Socket(InetAddress addr, int port, InetAddress localAddress,
int localport) II Java 1.1
II Methods
public void bind(SocketAddress bindpoint)
public synchronized void close()
public void connect(SocketAddress endpoint)
public void connect(SocketAddress endpoint, int timeout)
public SocketChannel getChannel()
public InetAddress getinetAddress()
public InputStream getinputStream()
public boolean getKeepAlive()
public InetAddress getLocalAddress() II Java 1.1
public int getLocalPort()
public SocketAddress getLocalSocketAddress()
public boolean getOOBinline()
public OutputStream getOutputStream()
public int getPort()
public synchronized int getReceiveBufferSize()
public SocketAddress getRemoteSocketAddress()
public synchronized int getSendBufferSize()
public int getSoLinger() II Java 1.1
public synchronized int getSoTimeout()
public boolean getTcpNoDelay() II Java 1.1
public int getTrafficClass()
public boolean getReuseAddress()
public boolean isBound()
public boolean isClosed()
public boolean isConnected()
public boolean isinputShutdown()
Class java.net.Socketlmpl
The Socketimpl class represents socket connections over a network. The following are defined:
II Methods
public abstract void accept(Socketimpl s)
public abstract int available()
public abstract void bind(InetAddress host, int port)
public abstract void close()
public abstract void connect(String host, int port)
public abstract void connect(InetAddress addr, int port)
public abstract void create(boolean stream)
public FileDescriptor getFileDescriptor()
public InetAddress getinetAddress()
public abstract InetAddress getinputStream()
Class java.net.SocketPermission
The SocketPermission class implements socket permissions. The following are defined:
II Constructor
public SocketPermission(String host, String action)
II Methods
public void add(Permission permission)
public Enumeration elements()
public int hashCode()
public boolean implies(Permission p)
public String getActions()
Class java.net.URI
The URI class represents Uniform Resource Indicators (http://www.iet£org/rfc/rfc2732.txt). The
following are defined:
II Constructors
public URI(String str)
public URI(String scheme, String userinfo, String host, int port,
String path, String query, String fragment)
public URI(String scheme, String authority,
String path, String query, String fragment)
public URI(String scheme, String host, String path, String fragment)
public URI(String scheme, String ssp, String fragment)
II methods
public static URI create(String str)
public int compareTo(Object ob)
public boolean equa1s(Object ob)
public String getAuthority()
public String getFragment()
public String getHost()
public String getQuery()
public String getRawPath()
public String getRawSchemeSpecificPart()
public String getRawUserinfo()
public String getSchemeSpecificPart()
scheme
scheme-specific-part
authority
user-info
host
port
path
query
fragment
Class java.net.URL
The URL class represents Uniform Resource Locators. The following are defined:
II Constructors
public URL(String protocol, String host, int port, String file)
public URL(String protocol, String host, String file)
public URL(String spec)
public URL(URL context, String spec)
II Methods
public boolean equals(Object obj)
public final Object getContent()
public String getFile()
public String getHost()
public int getPort()
public String getProtocol()
public String getRef()
public int hashcode()
public URLConnection openConnection()
public final InputStream openStream()
public boolean sameFile(URL other)
public String toExternalForm()
public String toString()
II Exception: MalformedURLException
Class java.net.URlencoder
The URLencoder class represents URL encoder methods. The following are defined:
Closs java.utils.BitSet
The BitSet class implements boolean operations. The following are defined:
II Constructors
public BitSet ()
public BitSet(int nbits)
II Methods
public void and(BitSet set)
public void clear(int bit)
public Object clone()
public boolean equals(Object obj)
public boolean get(int bit)
public int hashCode()
public void or(BitSet set)
public void set(int bit)
public int size()
public String toString()
public void xor(BitSet set)
Closs java.utils.calender
The calender class has been added with Java 1.1. It supports dates and times.
Closs java.utils.Date
The Date class supports dates and times. The following are defined:
II Constructors
public Date()
public Date(int year, int month, int date) II Java 1.0
public Date ( int year, int month, int date, int hrs, int min) II Java 1.0
public Date (int year, int month, int date, int hrs, int min, int sec)
II Java 1.0
public Date(long date) II Java 1.0
public Date(String s) II Java 1.0
II Methods
public boolean after(Date when)
public boolean before(Date when)
public boolean equals(Object obj)
public int getDate() II Java 1.0
public int getDay() II Java 1.0
public int getHours() II Java 1.0
public int getMinutes () I I Java 1.0
public int getMonth() II Java 1.0
public int getSeconds() II Java 1.0
public long get Time ()
public int getTimezoneOffset() II Java 1.0
public int getYear () II Java 1.0
public int hashCode ()
public static long parse(String s)
public void setDate(int date) II Java 1.0
public void setHours(int hours) II Java 1.0
public void setMinutes(int minutes) II Java 1.0
public void setMonth(int month) II Java 1.0
public void setSeconds(int seconds) II Java 1.0
Closs java.utils.Dictionary
The Dictionary class is the abstract parent of any class which maps keys to values. The follow-
ing are defmed:
II Constructors
public Dictionary()
II Methods
public abstract Enumeration elements()
public abstract Object get(Object key)
public abstract boolean isEmpty()
public abstract Enumeration keys()
public abstract Object put(Object key, Object value)
public abstract Object remove(Object key)
public abstract int size()
Closs java.utils.EmptyStackException
The EmptyStackException is thrown when the stack is empty. The following is defined:
II Constructors
public EmptyStackException()
Closs java.utils.Hashtable
This Hashtable class supports a hashtable which maps keys to values. The following are de-
fined:
II Constructors
public Hashtable()
public Hashtable(int initialCapacity)
public Hashtable(int initialCapacity, float loadFactor)
II Methods
public void clear()
public Object clone()
public boolean contains(Object value)
public boolean containsKey(Object key)
public Enumeration elements()
public Object get(Object key)
public boolean isEmpty()
public Enumeration keys()
public Object put(Object key, Object value)
protected void rehash()
public Object remove(Object key)
public int size()
public String toString()
II Constructors
public NoSuchElementException()
public NoSuchElementException(String s)
Class java.utils.Observable
The Observable class represents an observable object. The following are defined:
II Constructors
public Observable()
II Methods
public void addObserver(Observer o)
protected void clearChanged()
public int countObservers()
public void deleteObserver(Observer o)
public void deleteObservers()
public boolean hasChanged()
public void notifyObservers()
public void notifyObservers(Object arg)
protected void setChanged()
Class java.utils.Properties
The Properties class represents a persistent set of properties. The following are defined:
II Fields
protected Properties defaults;
II Constructors
public Properties()
public Properties(Properties defaults)
II Methods
public String getProperty(String key)
public String getProperty(String key, String defaultValue)
public void list(PrintStream out)
public void load(InputStream in)
public Enumeration propertyNames()
public void save(OutputStream out, String header)
Class java.utils.Random
The Random class implements pseudo-random generator functions. The following are defined:
II Constructors
public Random ()
public Random(long seed)
II Methods
public double nextDouble()
public float nextFloat()
public double nextGaussian()
public int nextint()
public long nextLong()
public void setSeed(long seed)
II Constructors
public Stack ()
II Methods
public boolean empty()
public Object peek{)
public Object pop()
public Object push(Object item)
public int search(Object o)
Class java.utils.StringTokenizer
The stringTokenizer class allows strings to be split into tokens. The following are defined:
II Constructors
public StringTokenizer(String str)
public StringTokenizer(String str, String delim)
public StringTokenizer(String str, String delim, boolean returnTokens)
II Methods
public int countTokens{)
public boolean hasMoreElements()
public boolean hasMoreTokens()
public Object nextElement()
public String nextToken()
public String nextToken(String delim)
Class java.utils.Vector
The Vector class implements a growable array of objects. The following are defined:
II Fields
protected int capacityincrement;
protected int elementCount;
protected Object elementData[];
II Constructors
public Vector ()
public Vector(int initialCapacity)
public Vector(int initialCapacity, int capacity!ncrement)
II Methods
public final void addElement(Object obj)
public final int capacity()
public Object clone()
public final boolean contains(Object elem)
public final void copyinto(Object anArray[J)
public final Object elementAt(int index)
public final Enumeration elements()
public final void ensureCapacity(int minCapacity)
public final Object firstElement()
public final int indexOf(Object elem)
public final int indexOf(Object elem, int index)
public final void insertElementAt(Object obj, int index)
public final boolean isEmpty()
public final Object lastElement()
public final int lastindexOf(Object elem)
RFC's 1873
RFCI752 The Recommendation for the IP Next-Generation Protocol
RFCI771 A Border Gateway Protocol4 (BGP-4)
RFCI808 Relative Uniform Resource Identifiers
RFC1809 Using the Flow Label in IPv6
RFCI825 Security Architecture for the Internet Protocol
RFCI826 IP Authentication Header
RFC1827 IP Encapsulating Security Payload (ESP)
RFC1828 IP Authentication Using Keyed MD5
RFC1829 The ESP DES-CBC Transform
RFCI883 Internet Protocol, Version 6 Specification
RFCI884 IP Version 6 Addressing Architecture
RFC1885 Internet Control Message Protocol (ICMPv6) for the Internet Protocol Version-6
(IPv6) Specification
RFCI886 DNS Extensions to Support IP Version 6
RFC1887 An Architecture for IPv6 U nicast Address Allocation
RFC1901 Introduction to Community-Based SNMPv2
RFC1902 Structure of Management Information for SNMPv2
RFCI903 Textual Conventions for SNMPv2
RFC1904 Conformance Statements for SNMPv2
RFC1905 Protocol Operations for SNMPv2
RFC1906 Transpon Mappings for SNMPv2
RFC1907 Management Information Base for SNMPv2
RFC1908 Coexistence Between Version 1 and Version2 of the Internet-Standard Network
Management Framework
RFC1909 An Administrative Infrastructure for SNMPv2
RFC1910 User-based Security Model for SNMPv2
RFC1911 Voice Profile for Internet Mail
RFCI912 Common DNS Operational and Configuration Errors
RFC1913 Architecture of the Who is++ Index Service
RFCI914 How to Interact with a Whois++ Mesh
RFC1915 Variance for The PPP Connection Control Protocol and The PPP Encryption Con-
trol Protocol
RFC1916 Enterprise Renumbering: Experience and Information Solicitation
RFC1917 An Appeal to the Internet Community to Return Unused IP Networks (Prefixes) to
the lANA
RFC1918 Address Allocation for Private Internets
RFC1919 Classical versus Transparent IP Proxies
RFC1920 INTERNET OFFICIAL PROTOCOL STANDARDS
RFCI922 Chinese Character Encoding for Internet Messages
RFCI923 RIPv I Applicability Statement for Historic Status
RFCI924 A Compact Representation of IPv6 Addresses
RFCI925 The Twelve Networking Truths
RFCI926 An Experimental Encapsulation ofiP Datagrams on Top of ATM
RFCI927 Suggested Additional MIME Types for Associating Documents
RFC1928 SOCKS Protocol Version 5
RFCI929 Username/Password Authentication for SOCKS V5
RFCI930 Guidelines for creation, selection, and registration of an Autonomous System (AS)
RFCI931 Dynamic RARP Extensions for Automatic Network Address Acquisition
RFCI932 IP over ATM: A Framework Document
RFCI933 Transition Mechanisms for IPv6 Hosts and Routers
RFC1934 Ascend's Multilink Protocol Plus (MP+)
RFCI935 What is the Internet, Anyway?
RFC's 1875
RFCI987 Ipsilon's General Switch Management Protocol Specification Version I I
RFCI988 Conditional Grant of Rights to Specific Hewlett-Packard Patents In Conjunction
With the Internet Engineering Task Force's Internet-Standard Network Manage-
ment Framework
RFCI989 PPP Link Quality Monitoring
RFCI990 The PPP Multilink Protocol
RFCI99I PGP Message Exchange Formats
RFCI992 The Nimrod Routing Architecture
RFCI993 PPP Gandalf FZA Compression Protocol
RFCI994 PPP Challenge Handshake Authentication Protocol (CHAP)
RFCI995 Incremental Zone Transfer in DNS
RFCI996 A Mechanism for Prompt Notification of Zone Changes
RFCI997 BGP Communities Attribute
RFCI998 An Application of the BGP Community Attribute in Multi-home Routing
RFCI999 Request for Comments Summary RFC Numbers I900-I999
RFC2000 INTERNET OFFICIAL PROTOCOL STANDARDS
RFC200I TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast
RFC2002 IP Mobility Support
RFC2003 IP Encapsulation within IP
RFC2004 Minimal Encapsulation within IP
RFC2005 Applicability Statement for IP Mobility Support
RFC2006 The Definitions of Managed Objects for IP Mobility Support using SMiv2
RFC2007 Catalogue of Network Training Materials
RFC2008 Implications ofVarious Address Allocation Policies for Internet Routing
RFC2009 GPS-Based Addressing and Routing
RFC20IO Operational Criteria for Root Name Servers
RFC2011 SNMPv2 Management Information Base for the Internet Protocol using SMiv2
RFC20I2 SNMPv2 Management Information Base for the Transmission Control Protocol
usingSMiv2
RFC2013 SNMPv2 Management Information Base for the User Datagram Protocol using
SMiv2
RFC20I4 IRTF Research Group Guidelines and Procedures
RFC20I5 MIME Security with Pretty Good Privacy (PGP)
RFC20I6 Uniform Resource Agents (URAs)
RFC20I7 Definition of the URL MIME External-Body Access-Type
RFC20I8 TCP Selective Acknowledgement Options
RFC20I9 Transmission ofiPv6 Packets Over FDDI
RFC2020 IEEE 802 I2 Interface MIB
RFC202I Remote Network Monitoring Management Information Base Version2 using
SMiv2
RFC2022 Support for Multicast over UNI 3 0/3 I based ATM Networks
RFC2023 IP Version 6 over PPP
RFC2024 Definitions of Managed Objects for Data Link Switching using SMiv2
RFC2025 The Simple Public-Key GSS-API Mechanism (SPKM)
RFC2026 The Internet Standards Process -- Revision 3
RFC2027 lAB and IESG Selection, Confirmation, and Recall Process: Operation of the
Nominating and Recall Committees
RFC2028 The Organizations Involved in the IETF Standards Process
RFC2029 RTP Payload Format of Sun's CellB Video Encoding
RFC2030 Simple Network Time Protocol (SNTP)
RFC203I IETF-ISOC relationship
RFC2032 RTP Payload Format for H 26I Video Streams
RFC's 1877
source Identifiers (URis)
RFC2080 RIPng for 1Pv6
RFC2081 RIPng Protocol Applicability Statement
RFC2082 RIP-2 MD5 Authentication
RFC2083 PNG (Portable Network Graphics) Specification
RFC2084 Considerations for Web Transaction Security
RFC2085 HMAC-MD5 IP Authentication with Replay Prevention
RFC2086 IMAP4 ACL extension
RFC2087 IMAP4 QUOTA extension
RFC2088 IMAP4 non-synchronizing literals
RFC2089 V2ToV1 Mapping SNMPv2 onto SNMPvl within a bi-lingual SNMP agent
RFC2090 TFTP Multicast Option
RFC2091 Triggered Extensions to RIP to Support Demand Circuits
RFC2092 Protocol Analysis for Triggered RIP
RFC2093 Group Key Management Protocol (GKMP) Specification
RFC2094 Group Key Management Protocol (GKMP) Architecture
RFC2095 IMAP/POP AUTHorize Extension for Simple Challenge/Response
RFC2096 IP Fotwarding Table MIB
RFC2097 The PPP NetBIOS Frames Control Protocol (NBFCP)
RFC2098 Toshiba's Router Architecture Extensions for ATM: Overview
RFC2099 Request for Comments Summary RFC Numbers2000-2099
RFC2100 The Naming of Hosts
RFC2101 1Pv4 Address Behavior Today
RFC2102 Multicast Support for Nimrod : Requirements and Solution Approaches
RFC2103 Mobility Support for Nimrod : Challenges and Solution Approaches
RFC2104 HMAC: Keyed-Hashing for Message Authentication
RFC2105 Cisco Systems' Tag Switching Architecture Overview
RFC2106 Data Link Switching Remote Access Protocol
RFC2107 Ascend Tunnel Management Protocol- ATMP
RFC2108 Definitions of Managed Objects for IEEE 802 3 Repeater Devices using SMiv2
RFC2109 HTTP State Management Mechanism
RFC2110 MIME E-mail Encapsulation of Aggregate Documents, such as HTML (MHTML)
RFC2111 Content-ID and Message-ID Uniform Resource Locators
RFC2112 The MIME Multipart/Related Content-type
RFC2113 IP Router Alert Option
RFC2114 Data Link Switching Client Access Protocol
RFC2115 Management Information Base for Frame Relay DTEs Using SMiv2
RFC2116 X 500 Implementations Catalog-96
RFC2117 Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol
RFC2118 Microsoft Point-To-Point Compression (MPPC) Protocol
RFC2119 Key words for use in RFCs to Indicate Requirement Level
RFC2120 Managing the X 500 Root Naming Context
RFC2121 Issues affecting MARS Cluster Size
RFC2122 VEMMI URL Specification
RFC2123 Traffic Flow Measurement: Experiences with NeTraMet
RFC2124 Cabletron's Light-weight Flow Admission Protocol Specification
RFC2125 The PPP Bandwidth Allocation Protocol (BAP) I The PPP Bandwidth Allocation
Control Protocol (BACP)
RFC2126 ISO Transport Service on top ofTCP (ITOD
RFC2127 ISDN Management Information Base using SMiv2
RFC2128 Dial Control Management Information Base using SMiv2
RFC2129 Toshiba's Flow Attribute Notification Protocol (FANP)
RFC's 1879
Version 1 2
RFC2189 Core Based Trees (CBT version2) Multicast Routing
RFC2190 RTP Payload Format for H 263 Video Streams
RFC2191 VENUS- Very Extensive Non-Unicast Service
RFC2192 IMAP URL Scheme
RFC2193 IMAP4 Mailbox Referrals
RFC2194 Review of Roaming Implementations
RFC2195 IMAP/POP AUTHorize Extension for Simple Challenge/Response
RFC2196 Site Security Handbook
RFC2197 SMTP Service Extension for Command Pipelining
RFC2198 RTP Payload for Redundant Audio Data
RFC2200 INTERNET OFFICIAL PROTOCOL STANDARDS
RFC2201 Core Based Trees (CBT) Multicast Routing Architecture
RFC2202 Test Cases for HMAC-MD5 and HMAC-SHA-1
RFC2203 RPCSEC_GSS Protocol Specification
RFC2204 ODETTE File Transfer Protocol
RFC2205 Resource ReSerVation Protocol (RSVP) --Version 1 Functional Specification
RFC2206 RSVP Management Information Base using SMiv2
RFC2207 RSVP Extensions for IPSEC Data Flows
RFC2208 Resource ReSerVation Protocol (RSVP)-- Version 1 Applicability Statement Some
Guidelines on Deployment
RFC2209 Resource ReSerVation Protocol (RSVP)-- Version 1 Message Processing Rules
RFC2210 The Use of RSVP with IETF Integrated Services
RFC2211 Specification of the Controlled-Load Network Element Service
RFC2212 Specification of Guaranteed Quality of Service
RFC2213 Integrated Services Management Information Base using SMiv2
RFC2214 Integrated Services Management Information Base Guaranteed Service Extensions
using SMiv2
RFC2215 General Characterization Parameters for Integrated Service Network Elements
RFC2216 Network Element Service Specification Template
RFC2217 T elnet Com Port Control Option
RFC2218 A Common Schema for the Internet White Pages Service
RFC2219 Use ofDNS Aliases for Network Services
RFC2220 The Application/MARC Content-type
RFC2221 IMAP4 Login Referrals
RFC2222 Simple Authentication and Security Layer (SASL)
RFC2223 Instructions to RFC Authors
RFC2224 NFS URL Scheme
RFC2226 IP Broadcast over ATM Networks
RFC2227 Simple Hit-Metering and Usage-Limiting for HTTP
RFC2228 FTP Security Extensions
RFC2229 A Dictionary Server Protocol
RFC2230 Key Exchange Delegation Record for the DNS
RFC2231 MIME Parameter Value and Encoded Word Extensions: Character Sets, Languages,
and Continuations
RFC2232 Definitions of Managed Objects for DLUR using SMiv2
RFC2233 The Interfaces Group MIB using SMiv2
RFC2234 Augmented BNF for Syntax Specifications: ABNF
RFC2235 Hobbes' Internet Timeline
RFC2236 Internet Group Management Protocol, Version2
RFC2237 Japanese Character Encoding for Internet Messages
RFC2238 Definitions of Managed Objects for HPR using SMiv2
RFC's 1881
Nominating and Recall Committees
RFC2283 Multiprotocol Extensions for BGP-4
RFC2284 PPP Extensible Authentication Protocol (EAP)
RFC2285 Benchmarking Terminology for LAN Switching Devices
RFC2286 Test Cases for HMAC-RIPEMD160 and HMAC-RIPEMD128
RFC2287 Definitions of System-Level Managed Objects for Applications
RFC2288 Using Existing Bibliographic Identifiers as Uniform Resource Names
RFC2289 A One-Time Password System
RFC2290 Mobile-IPv4 Configuration Option for PPP IPCP
RFC2291 Requirements for a Distributed Authoring and Versioning Protocol for the World
Wide Web
RFC2292 Advanced Sockets API for IPv6
RFC2293 Representing Tables and Subtrees in the X 500 Directory
RFC2294 Representing the 0/RAddress hierarchy in the X 500 Directory Information Tree
RFC2295 Transparent Content Negotiation in HTTP
RFC2296 HTTP Remote Variant Selection Algorithm -- RVSN1
RFC2297 Ipsilon's General Switch Management Protocol Specification Version2 0
RFC2298 An Extensible Message Format for Message Disposition Notifications
RFC2300 INTERNET OFFICIAL PROTOCOL STANDARDS
RFC2301 File Format for Internet Fax
RFC2302 Tag Image File Format (TIFF)- image/tiff MIME Sub-type Registration
RFC2303 Minimal PSTN address format in Internet Mail
RFC2304 Minimal FAX address format in Internet Mail
RFC2305 A Simple Mode of Facsimile Using Internet Mail
RFC2306 Tag Image File Format (TIFF)- F Profile for Facsimile
RFC2307 An Approach for Using LDAP as a Network Information Service
RFC2308 Negative Caching ofDNS Queries (DNS NCACHE)
RFC2309 Recommendations on Queue Management and Congestion Avoidance in the Inter-
net
RFC2310 The Safe Response Header Field
RFC2311 S/MIME Version2 Message Specification
RFC2312 S/MIME Version2 Certificate Handling
RFC2313 PKCS #1: RSA Encryption Version 1 5
RFC2314 PKCS #10: Certification Request Syntax Version 1 5
RFC2315 PKCS #7: Cryptographic Message Syntax Version 1 5
RFC2316 Report of the lAB Securiry Architecture Workshop
RFC2317 Classless IN-ADDRARPA delegation
RFC2318 The text!css Media Type
RFC2319 Ukrainian Character Set KOI8-U
RFC2320 Definitions of Managed Objects for Classical IP andARP Over ATM Using
SMiv2 (IPOA-MIB)
RFC2321 RITA-- The Reliable Internetwork Troubleshooting Agent
RFC2322 Management of IP numbers by peg-dhcp
RFC2323 IETF Identification and Securiry Guidelines
RFC2324 Hyper Text Coffee Pot Control Protocol (HTCPCP/1 0)
RFC2325 Definitions of Managed Objects for Drip-Type Heated Beverage Hardware Devices
usingSMiv2
RFC2326 Real Time Streaming Protocol (RTSP)
RFC2327 SDP: Session Description Protocol
RFC2328 OSPF Version2
RFC2329 OSPF Standardization Report
RFC2330 Framework for IP Performance Metrics
RFC's 1883
RFC2378 The CCSO Nameserver (Ph) Architecture
RFC2379 RSVP over ATM Implementation Guidelines
RFC2380 RSVP over ATM Implementation Requirements
RFC2381 Interoperation of Controlled-Load Service and Guaranteed Service with ATM
RFC2382 A Framework for Integrated Services and RSVP over ATM
RFC2383 ST2+ over ATM Protocol Specification- UNI 3 1 Version
RFC2384 POP URL Scheme
RFC2385 Protection of BGP Sessions via the TCP MD5 Signature Option
RFC2386 A Framework for QoS-based Routing in the Internet
RFC2387 The MIME Multipart/Related Content-type
RFC2388 Returning Values from Forms: multipart/form-data
RFC2389 Feature negotiation mechanism for the File Transfer Protocol
RFC2390 Inverse Address Resolution Protocol
RFC2391 Load Sharing using IP Network Address Translation (LSNAT)
RFC2392 Content-ID and Message-ID Uniform Resource Locators
RFC2396 Uniform Resource Identifiers (URI): Generic Syntax
RFC2397 The 'data' URL scheme
RFC2398 Some Testing Tools for TCP Implementors
RFC2400 INTERNET OFFICIAL PROTOCOL STANDARDS
RFC2401 Security Architecture for the Internet Protocol
RFC2402 IP Authentication Header
RFC2410 The NULL Encryption Algorithm and Its Use With IPsec
RFC2411 IP Security Document Roadmap
RFC2413 Dublin Core Metadata for Resource Discovery
RFC2414 Increasing TCP's Initial Window
RFC2415 Simulation Studies of Increased Initial TCP Window Size
RFC2416 When TCP Starts Up With Four Packets Into Only Three Buffers
RFC2417 Definitions of Managed Objects for Multicast over UNI 3 0/3 1 based ATM Net-
works
RFC2418 IETF Working Group Guidelines and Procedures
RFC2419 The PPP DES Encryption Protocol, Version2 (DESE-bis)
RFC2420 The PPP Triple-DES Encryption Protocol (3DESE)
RFC2421 Voice Profile for Internet Mail - version2
RFC2422 Toll Quality Voice- 32 kbit/s ADPCM MIME Sub-type Registration
RFC2423 VPIM Voice Message MIME Sub-type Registration
RFC2424 Content Duration MIME Header Definition
RFC2425 A MIME Content-Type for Directory Information
RFC2426 vCard MIME Directory Profile
RFC2427 Multiprotocol Interconnect over Frame Relay
RFC2428 FTP Extensions for IPv6 and NATs
RFC2429 RTP Payload Format for the 1998 Version ofiTU-T Rec H 263 Video (H 263+)
RFC2430 A Provider Architecture for Differentiated Services and Traffic Engineering
(PASTE)
RFC2431 RTP Payload Format for BT 656 Video Encoding
RFC2432 Terminology for IP Multicast Benchmarking
RFC2433 Microsoft PPP CHAP Extensions
RFC2434 Guidelines for Writing an lANA Considerations Section in RFCs
RFC2435 RTP Payload Format for ]PEG-compressed Video
RFC2436 Collaboration between ISOC/IETF and ITU-T
RFC2437 PKCS #1: RSA Cryptography Specifications Version2 0
RFC2438 Advancement ofMIB specifications on the IETF Standards Track
RFC2439 BGP Route Flap Damping
Quick Guide
802o12-MIB RFC2020
80203-MIB RFC2108
802.5-MIB RFC1748
ABNF RFC2234
ACAP RFC2244
AGENTX RFC2257
APPN-MIB RFC2155
ARCH-SNMP RFC2271
ARP RFC26
ATM-ENCAP RFC83/1695/1755
BGP RFC177111745/1772/1657/1997/1269/1403
BOOTP RFC95112132
CLDAP RFC1798
CON-MD5 RFC1864
CONTENT RFC1049
DAA RFC2069
DASS RFC1507
DAYfiME RFC867
DC-MIB RFC2128
DECNET-MIB RFC1559
DHCP RFC213111534/2132/2241
DISCARD RFC863
DNS RFC2181/1886/1995/2163/974/2308/1996/1612/2065/161112136
DOMAIN RFC1034/1035
DSN RFC1894
ECHO RFC862
ENTITY-MIB RFC2037
ESP RFC1827
ETHER-MIB RFC1643
FDDI-MIB RFC1285/1512
FFIF RFC2301
FINGER RFC1288
FRAME-MIB RFC2115
FTP RFC959/2389/1415/2228
GQOS RFC2212
RFC's 1885
GSSAP RFC2078/1509/1964/ 1961
HOST-MIB RFC1514
HTML RFC1866/2070
HTTP-1.1 RFC2068/21 09
IARP RFC2390
ICMP RFC79211256/1885
IDENT RFC1413/1414
IGMP RFC2236/1112
IMAP RFC2086/ 1731/2177/2088/222112193/2342/2087
2359/2195/2192/2060
IP-ARC RFC1
IP-ARPA RFC22
IP-ATM RFC25
IP-FDDI RFC90
IP-FR RFC2427
IP-IEEE RFC42
IP-IPX RFC32
IP-NETBIOS RFC88
IPNG RFC1752
IP-SLIP RFC55
IP-SMDS RFC1209
IPV6 RFC1883/1826/197111972/2019/2147/1970/2023
IP RFC7/5611552/1234
ISDN-MIB RFC2127
IS-IS RFC1195
KERBEROS RFC1510
LDAP RFC2252/2253/1960/1959/2255/2251
MAIL RFC822/2249/2142
MHTML RFC2110
MIB RFC121211213/2011/2012/2013/1239
MIME RFC2045/2422/2049/1767/1847/2231/2046/2077
2047/2015/2387/1892/1848/2426/2421/2423
MOBILEIP RFC2005/2006/2002/2344
MODEM-MIB RFC1696
NETBIOS RFC100111002
NETFAX RFC1314
NETWAREIP RFC2242
NHRP RFC2332/2333/2335
NICNAME RFC954
NNTP RFC977
NTP RFC111911305
ONE-PASS RFC2289
OSI-NSAP RFC1629
OSI-UDP RFC1240
OSPF RFC2328/1793/2370/1850/1584/1587
PEM RFC1423/1422/1421/1424
POP3 RFC193911734/2384
ppp RFC1661/1662/147411473/1471/1472/ 2364/
1378/1638/1962/1994/1762/2284/1968/1973
2363/1332/1618/1570/1989/1990/2097/1377
2043/1619/1663/1598
QUOTE RFC865
RFC's 1887
Ap9.1 Standards
Ap9.1.1 Standard Protocols Ordered by STD
RFC's 1889
RIP2 RIP Version 2 56 2453
IP-FR Multiprotocol Interconnect over Frame Relay 55 2427
OSPF2 OSPF Version 2 54 2328
ONE-PASS A One-Time Password System 61 2289
POP3 Post Office Protocol - Version 3 53 1939
SMTP-SIZE SMTP Service Extension for Message Size Declaration 10 1870
RIP2-APP RIP Version 2 Protocol Applicability Statement 57 1722
PPP-HDLC PPP in HDLC-like Framing 51 1662
ppp The Point-to-Point Protocol {PPP) 51 1661
ETHER-MIB Definitions of Managed Objects for the Ethernet- so 1643
like Interface Types
IP-FDDI Transmission of IP and ARP over FDDI Networks 36 1390
TFTP The TFTP Protocol {Revision 2) 33 1350
MIB-II Management Information Base for Network Management 17 1213
of TCP/IP-based internets:MIB-II
Concise-MI Concise MIB definitions 16 1212
IP-SMDS Transmission of IP datagrams over the SMDS Service 52 1209
IP-ARC Transmitting IP traffic over ARCNET networks 46 1201
SNMP Simple Network Management Protocol {SNMP) 15 1157
SMI Structure and identification of management 16 1155
information for TCP/IP-based internets
IP-IPX Standard for the transmission of 802.2 packets 49 1132
over IPX networks
Requirements for Internet Hosts - Application 3 1123
and Support
Requirements for Internet Hosts - Communication 3 1122
Layers
IGMP Host extensions for IP multicasting 5 1112
IP-NETBIOS Standard for the transmission of IP datagrams 48 1088
over NetBIOS networks
IP-SLIP Nonstandard for transmission of IP datagrams 47 1055
over serial lines: SLIP
IP-HC Internet Protocol on Network System's HYPERchannel: 45 1044
Protocol specification
IP-IEEE Standard for the transmission of IP datagrams 43 1042
over IEEE 802 networks
DOMAIN Domain names - implementation and specification 13 1035
DOMAIN Domain names - concepts and facilities 13 1034
TP-TCP ISO transport services on top of the TCP: 35 1006
Version 3
NETBIOS Protocol standard for a NetBIOS service on 19 1002
a TCP/UDP transport: Detailed specifications
NETBIOS Protocol standard for a NetBIOS service on 19 1001
a TCP/UDP transport: Concepts and methods
FTP File Transfer Protocol 9 959
-------- Internet Standard Subnetting Procedure 5 950
--------- Broadcasting Internet datagrams in the presence 5 922
of subnets
--------- Broadcasting Internet Datagrams 5 919
IP-WB Host Access Protocol specification 40 907
RARP Reverse Address Resolution Protocol 38 903
IP-EE Standard for the transmission of IP datagrams 42 895
over experimental Ethernet networks
IP-E Standard for the transmission of IP datagrams 41 894
over Ethernet networks
IP-DC DCN local-network protocols 44 891
TIME Time Protocol 26 868
DAYTIME Daytime Protocol 25 867
USERS Active users 24 866
QUOTE Quote of the Day Protocol 23 865
CHARGEN Character Generator Protocol 22 864
DISCARD Discard Protocol 21 863
ECHO Echo Protocol 20 862
TOPT-EXTOP Telnet Extended Options: List Option 32 861
RFC's 1891
Part Five: Conformance Criteria and Examples
MIME-MSG MIME (Multipurpose Internet Mail Extensions) 2047
Part Three: Message Header Extensions for
Non-ASCII Text
MIME-MEDIA Mu1tipurpose Internet Mail Extensions (MIME) 2046
Part Two: Media Types
MIME Multipurpose Internet Mail Extensions (MIME) 2045
Part One: Format of Internet Message Bodies
PPP-CHAP PPP Challenge Handshake Authentication Protocol (CHAP) 1994
PPP-MP The PPP Multilink Protocol (MP) 1990
PPP-LINK PPP Link Quality Monitoring 1989
SNMPv2-MIB Management Information Base for Version 2 1907
of the Simple Network Management Protocol (SNMPv2)
TRANS-MIB Transport Mappings for Version 2 of the Simple 1906
Network Management Protocol (SNMPv2)
OPS-MIB Protocol Operations for Version 2 of the Simple 1905
Network Management Protocol (SNMPv2)
CON-MD5 The Content-MD5 Header Field 1864
OSPF-MIB OSPF Version 2 Management Information Base 1850
XDR XDR: External Data Representation Standard 1832
-------- The String Representation of Standard Attribute 1778
Syntaxes
-------- Lightweight Directory Access Protocol 1777
BGP-4-APP Application of the Border Gateway Protocol 1772
in the Internet
BGP-4 A Border Gateway Protocol 4 (BGP-4) 1771
PPP-DNCP The PPP DECnet Phase IV Control Protocol (DNCP) 1762
802.5-MIB IEEE 802.5 MIB using SMiv2 1748
RIP2-MIB RIP Version 2 MIB Extension 1724
SIP-MIB Definitions of Managed Objects for SMDS Interfaces 1694
using SMiv2
-------- Definitions of Managed Objects for Parallel- 1660
printer-like Hardware Devices using SMiv2
-------- Definitions of Managed Objects for RS-232- 1659
like Hardware Devices using SMiv2
-------- Definitions of Managed Objects for Character 1658
Stream Devices using SMiv2
BGP-4-MIB Definitions of Managed Objects for the Fourth 1657
Version of the Border Gateway Protocol (BGP-
4) using SMiv2
-------- SMTP Service Extension for 8bit-MIMEtransport 1652
OSI-NSAP Guidelines for OSI NSAP Allocation in the Internet 1629
ISO-TS-ECH An Echo Function for CLNP (ISO 8473) 1575
DECNET-MIB DECnet Phase IV MIB Extensions 1559
-------- Clarifications and Extensions for the Bootstrap 1542
Protocol
DHCP-BOOTP Interoperation Between DHCP and BOOTP 1534
BRIDGE-MIB Definitions of Managed Objects for Bridges 1493
RFC's 1893
Content Negotiation for Messaging Services based 3297*
on Email
Named Subordinate References in Lightweight Directory 3296*
Access Protocol {LDAP} Directories
Definitions of Managed Objects for the General 3295*
Switch Management Protocol (GSMP}
General Switch Management Protocol (GSMP} Packet 3293*
Encapsulations for Asynchronous Transfer Mode
(ATM}, Ethernet and Transmission Control Protocol
(TCP}
General Switch Management Protocol (GSMP} V3 3292*
Textual Conventions for Internet Network Addresses 3291*
Management Information Base for the Differentiated 3289*
Services Architecture
Using the Simple Object Access Protocol (SOAP} 3288*
in Blocks Extensible Exchange Protocol (BEEP}
Remote Monitoring MIB Extensions for Differentiated 3287*
Services
The VCDIFF Generic Differencing and Compression 3284*
Data Format
An Internet Attribute Certificate Profile for 3281*
Authorization
Internet X.509 Public Key Infrastructure Certificate 3280*
and Certificate Revocation List (CRL} Profile
Algorithms and Identifiers for the Internet X.509 3279*
Public Key Infrastructure Certificate and
Certificate Revocation List (CRL} Profile
Definitions of Managed Objects for High Bit-Rate 3276*
DSL - 2nd generation (HDSL2} and Single-Pair
High-Speed Digital Subscriber Line (SHDSL} Lines
Processing
Compressed Data Content Type for Cryptographic 3274*
Message Syntax (CMS}
Remote Network Monitoring Management Information 3273*
Base for High Capacity Networks
Multi-Protocol Label Switching (MPLS} Support of 3270*
Differentiated Services
Advanced Encryption Standard (AES} Ciphersuites 3268*
for Transport Layer Security (TLS}
Real-Time Transport Protocol (RTP} Payload Format 3267*
and File Storage Format for the Adaptive Multi-
Rate (AMR} and Adaptive Multi-Rate Wideband
(AMR-WB} Audio Codecs
Support for IPv6 in Session Description Protocol 3266*
(SDP}
SIP Session Initiation Protocol (SIP}-Specific Event 3265*
Notification
SIP An Offer/Answer Model with Session Description 3264*
Protocol (SDP}
SIP Session Initiation Protocol (SIP} : Locating SIP 3263*
Servers
SIP Reliability of Provisional Responses in Session 3262*
Initiation Protocol (SIP}
SIP SIP: Session Initiation Protocol 3261*
The DOCSIS (Data-Over-Cable Service Interface 3256*
Specifications} Device Class DHCP (Dynamic Host
Configuration Protocol} Relay Agent Information
Sub-option
Extending Point-to-Point Protocol (PPP} over 3255*
Synchronous Optical NETwork/Synchronous Digital
Hierarchy (SONET/SDH} with virtual concatenation,
high order and low order payloads
Versioning Extensions to WebDAV (Web Distributed 3253*
Authoring and Versioning}
RFC's 1895
SDP Carrying Label Information in BGP-4 3107
RSVP RSVP Cryptographic Authentication Updated Message 3097
Type Value
RObust Header Compression (ROHC) : Framework and 3095
four profiles
DNS Security Extension Clarification on Zone Status 3090
COPS-PR COPS Usage for Policy Provisioning (COPS-PR) 3084
Mapping the BEEP Core onto TCP 3081
BEEP The Blocks Extensible Exchange Protocol Core 3080
A Link-Layer Tunneling Mechanism for Unidirectional 3077
Links
DHC Load Balancing Algorithm 3074
L2TP-FR Layer Two Tunneling Protocol (L2TP) over Frame Relay 3070
An Anycast Prefix for 6to4 Relay Routers 3068
BGP-ASC Autonomous System Confederations for BGP 3065
LDAP Password Modify Extended Operation 3062
CIM Policy Core Information Model -- Version 1 3060
Specification
SLPv2 Attribute List Extension for the Service Location 3059
Protocol
ISDN Q.921-User Adaptation Layer 3057
Connection of IPv6 Domains via IPv4 Clouds 3056
Management Information Base for the PINT Services 3055
Architecture
TN3270E Service Location and Session Balancing 3049
RTP Payload Format for ITU-T Recommendation G.722.1 3047
DHCP Relay Agent Information Option 3046
Enhancing TCP's Loss Recovery Using Limited Transmit 3042
Privacy Extensions for Stateless Address 3041
Autoconfiguration in IPv6
Internet X.509 Public Key Infrastructure Qualified 3039
Certificates Profile
VCID Notification over ATM link for LDP 3038
LDP Specification 3036
MPLS using LDP and ATM VC Switching 3035
Use of Label Switching on Frame Relay Networks 3034
Specification
The Assignment of the Information Field and Protocol 3033
Identifier in the Q.2941 Generic Identifier
and Q.2957 User-to-user Signaling for the
Internet Protocol
MPLS Label Stack Encoding 3032
MPLS Multiprotocol Label Switching Architecture 3031
SMTP Service Extensions for Transmission of Large 3030
and Binary MIME Messages
Sieve: A Mail Filtering Language 3028
Reverse Tunneling for Mobile IP, revised 3024
XML Media Types 3023
Using 31-Bit Prefixes on IPv4 Point-to-Point Links 3021
Definitions of Managed Objects for Monitoring and 3020
Controlling the UNI/NNI Multilink Frame Relay
Function
IP Version 6 Management Information Base for The 3019
Multicast Listener Discovery Protocol
XML DTD for Roaming Access Phone Book 3017
RTP Payload Format for MPEG-4 Audio/Visual Streams 3016
MEGA CO Megaco Protocol Version 1.0 3015
Notification Log MIB 3014
Mobile IPv4 Challenge/Response Extensions 3012
The IPv4 Subnet Selection Option for DHCP 3011
NFSv4 NFS version 4 Protocol 3010
Registration of parityfec MIME types 3009
DNSSEC Domain Name System Security (DNSSEC) Signing Authority 3008
Secure Domain Name System (DNS) Dynamic Update 3007
RFC's 1897
Diffie-Hellman Proof-of-Possession Algorithms 2875
TCP Processing of the IPv4 Precedence Field 2873
Application and Sub Application Identity Policy 2872
Element for Use with RSVP
The Inverted Stack Table Extension to the Interfaces 2864
Group MIB
RTP Payload Format for Real-Time Pointers 2862
MEXT-BGP4 Multiprotocol Extensions for BGP-4 2858
The Use of HMAC-RIPEMD-160-96 within ESP and AH 2857
Textual Conventions for Additional High Capacity 2856
Data Types
DHCP for IEEE 1394 2855
Generic Security Service API Version 2 : Java Bindings 2853
Deliver By SMTP Service Extension 2852
LDIF The LDAP Data Interchange Format (LDIF) - Technical 2849
Specification
The PINT Service Protocol: Extensions to SIP and 2848
SDP for IP Access to Telephone Call Services
LIP KEY LIPKEY - A Low Infrastructure Public Key Mechanism 2847
Using SPKM
GSTN Address Element Extensions in E-mail Services 2846
TSIG Secret Key Transaction Authentication for DNS (TSIG) 2845
Capabilities Advertisement with BGP-4 2842
Definitions of Managed Objects for the Fabric Element 2837
in Fibre Channel Standard
GSN IP and ARP over HIPPI-6400 (GSN) 2835
ARP and IP Broadcast over HIPPI-800 2834
RTP Payload for DTMF Digits, Telephony Tones and 2833
Telephony Signals
Using Digest Authentication as a SASL Mechanism 2831
LDAP Lightweight Directory Access Protocol (v3): Extension 2830
for Transport Layer Security
Authentication Methods for LDAP 2829
MAIL Internet Message Format 2822*
SMTP Simple Mail Transfer Protocol 2821*
Integrated Service Mappings on IEEE 802 Networks 2815
SBM (Subnet Bandwidth Manager) : A Protocol for 2814
RSVP-based Admission Control over IEEE 802-
style networks
URLs for Telephone Calls 2806
Certificate Management Messages over CMS 2797
BGP Route Reflection - An Alternative to Full Mesh 2796
IBGP
Mobile IP Network Access Identifier Extension for IPv4 2794
RTP Payload for Text Conversation 2793
Mail Monitoring MIB 2789
Network Services Monitoring MIB 2788
Definitions of Managed Objects for the Virtual 2787
Router Redundancy Protocol
GRE Generic Routing Encapsulation (GRE) 2784
DNS-SRV A DNS RR for specifying the location of services 2782
(DNS SRV)
MZAP Multicast-Scope Zone Announcement Protocol (MZAP) 2776
RPSL Routing Policy System Replication 2769
NAT-PT Network Address Translation - Protocol Translation 2766
(NAT-PT)
SIIT Stateless IP/ICMP Translation Algorithm (SIIT) 2765
RSVP Extensions for Policy Control 2750
COPS usage for RSVP 2749
RFC's 1899
S/MIME Version 3 Message Specification 2633
S/MIME Version 3 Certificate Handling 2632
Diffie-Hellman Key Agreement Method 2631
IP and ARP over Fibre Channel 2625
NFS Version 2 and Version 3 Security Issues and 2623
the NFS Protocol's Use of RPCSEC_GSS and Kerberos
V5
RPSL Routing Policy Specification Language (RPSL) 2622
RADIUS Authentication Server MIB 2619
RADIUS Authentication Client MIB 2618
PPP over SONET/SDH 2615
Remote Network Monitoring MIB Extensions for Switched 2613
Networks Version 1.0
DHCP Options for Service Location Protocol 2610
Service Templates and Service: Schemes 2609
Directory Server Monitoring MIB 2605
ILMI-Based Server Discovery for NHRP 2603
ILMI-Based Server Discovery for MARS 2602
ILMI-Based Server Discovery for ATMARP 2601
An Expedited Forwarding PHB 2598
Assured Forwarding PHB Group 2597
Use of Language Codes in LDAP 2596
Using TLS with IMAP, POP3 and ACAP 2595
Definitions of Managed Objects for WWW Services 2594
Transmission of IPv6 Packets over Frame Relay Networks 2590
Specification
LDAPv3 Lightweight Directory Access Protocol (v3): Extensions 2589
for Dynamic Directory Services
RFC's 1901
Protocol (iTIP) Scheduling Events, BusyTime,
To-dos and Journal Entries
I CALENDAR Internet Calendaring and Scheduling Core Object 2445
Specification (iCalendar)
OTP-SASL The One-Time-Password SASL Mechanism 2444
OpenPGP Message Format 2440
BGP Route Flap Damping 2439
RTP Payload Format for JPEG-compressed Video 2435
RTP Payload Format for BT.656 Video Encoding 2431
RTP Payload Format for the 1998 Version of ITU- 2429
T Rec. H.263 Video (H.263+)
FTP Extensions for IPv6 and NATs 2428
MIME-VCARD vcard MIME Directory Profile 2426
TXT-DIR A MIME Content-Type for Directory Information 2425
CONT-DUR Content Duration MIME Header Definition 2424
MIME-VPIM VPIM Voice Message MIME Sub-type Registration 2423
MIME-ADPCM Toll Quality Voice - 32 kbit/s ADPCM MIME Sub-type 2422
Registration
MIME-VP2 Voice Profile for Internet Mail - version 2 2421
3DESE The PPP Triple-DES Encryption Protocol (3DESE) 2420
DESE-bis The PPP DES Encryption Protocol, Version 2 (DESE-bis) 2419
Definitions of Managed Objects for Multicast over 2417
UNI 3.0/3.1 based ATM Networks
The NULL Encryption Algorithm and Its Use With IPsec 2410
IKE The Internet Key Exchange (IKE) 2409
ISAKMP Internet Security Association and Key Management 2408
Protocol (ISAKMP)
ISAKMPSEC The Internet IP Security Domain of Interpretation 2407
for ISAKMP
ESP IP Encapsulating Security Payload (ESP) 2406
ESPDES-CBC The ESP DES-CBC Cipher Algorithm With Explicit IV 2405
-------- The Use of HMAC-SHA-1-96 within ESP and AH 2404
The Use of HMAC-MD5-96 within ESP and AH 2403
IP-AUTH IP Authentication Header 2402
IPSEC Security Architecture for the Internet Protocol 2401
DATA-URL The "data" URL scheme 2397
CIDMID-URL Content-ID and Message-ID Uniform Resource Locators 2392
Feature negotiation mechanism for the File Transfer 2389
Protocol
-------- Returning Values from Forms: multipart/form-data 2388
MIME-RELAT The MIME Multipart/Related Content-type 2387
-------- Protection of BGP Sessions via the TCP MD5 Signature 2385
Option
POP-URL POP URL Scheme 2384
-------- Interoperation of Controlled-Load Service and 2381
Guaranteed Service with ATM
-------- RSVP over ATM Implementation Requirements 2380
-------- An IPv6 Aggregatable Global Unicast Address Format 2374
-------- IP Version 6 Addressing Architecture 2373
TIPV3 Transaction Internet Protocol Version 3.0 2371
OSPF-LSA The OSPF Opaque LSA Option 2370
-------- The Use of URLs as Meta-Syntax for Core Mail List 2369
Commands and their Transport through Message
Header Fields
URLMAILTO The mailto URL scheme 2368
PPP-AAL PPP Over AAL5 2364
PPP-FUNI PPP Over FUNI 2363
IMAP4UIDPL IMAP4 UIDPLUS extension 2359
IMAP4NAME IMAP4 Namespace 2342
VRRP Virtual Router Redundancy Protocol 2338
NHRP-SCSP A Distributed NHRP Service Using SCSP 2335
SCSP Server Cache Synchronization Protocol (SCSP) 2334
-------- NHRP Protocol Applicability Statement 2333
NHRP NBMA Next Hop Resolution Protocol (NHRP) 2332
RFC's 1903
RPCSEC-GSS RPCSEC_GSS Protocol Specification 2203
RTP-RAD RTP Payload for Redundant Audio Data 2198
IMAPPOPAU IMAP/POP AUTHorize Extension for Simple 2195
Challenge/Response
IMAP4MAIL IMAP4 Mailbox Referrals 2193
IMAP-URL IMAP URL Scheme 2192
--------- RTP Payload Format for H.263 Video Streams 2190
--------- Communicating Presentation Information in Internet 2183
Messages: The Content-Disposition Header Field
DNS-CLAR Clarifications to the DNS Specification 2181
IMAP4-IDLE IMAP4 IDLE command 2177
SLP Service Location Protocol 2165
Use of an X.500/LDAP directory to support MIXER 2164
address mapping
DNS-MCGAM Using the Internet DNS to Distribute MIXER Conformant 2163
Global Address Mapping (MCGAM)
Carrying PostScript in X.400 and MIME 2160
A MIME Body Part for FAX 2159
X.400 Image Body Parts 2158
Mapping between X.400 and RFC 822/MIME Message Bodies 2157
MIXER MIXER (Mime Internet X.400 Enhanced Relay): Mapping 2156
between X.400 and RFC 822/MIME
MAIL-SERV Mailbox Names for Common Services, Roles and Functions 2142
URN-SYNTAX URN Syntax 2141
DNS-UPDATE Dynamic Updates in the Domain Name System (DNS UPDATE) 2136
DC-MIB Dial Control Management Information Base using SMiv2 2128
ISDN-MIB ISDN Management Information Base using SMiv2 2127
ITOT ISO Transport Service on top of TCP (ITOT) 2126
BAP-BACP The PPP Bandwidth Allocation Protocol (BAP) I The 2125
PPP Bandwidth Allocation Control Protocol (BACP)
VEMMI-URL VEMMI URL Specification 2122
ROUT-ALERT IP Router Alert Option 2113
802.3-MIB Definitions of Managed Objects for IEEE 802.3 Repeater 2108
Devices using SMiv2
PPP-NBFCP The PPP NetBIOS Frames Control Protocol (NBFCP) 2097
TABLE-MIB IP Forwarding Table MIB 2096
RIP-TRIG Triggered Extensions to RIP to Support Demand Circuits 2091
IMAP4-LIT IMAP4 non-synchronizing literals 2088
IMAP4-QUO IMAP4 QUOTA extension 2087
IMAP4-ACL IMAP4 ACL extension 2086
HMAC-MD5 HMAC-MD5 IP Authentication with Replay Prevention 2085
RIP2-MD5 RIP-2 MD5 Authentication 2082
RIPNG-IPV6 RIPng for IPv6 2080
URI-ATT Definition of an X.500 Attribute Type and an Object 2079
Class to Hold Uniform Resource Identifiers (URis)
MIME-MODEL The Model Primary Content Type for Multipurpose 2077
Internet Mail Extensions
IMAPV4 Internet Message Access Protocol - Version 4rev1 2060
URLZ39.50 Uniform Resource Locators for Z39.50 2056
SNANAU-APP Definitions of Managed Objects for APPC using SMiv2 2051
PPP-SNACP The PPP SNA Control Protocol (SNACP) 2043
SMTP-ENH SMTP Service Extension for Returning Enhanced Error 2034
Codes
RTP-H.261 RTP Payload Format for H.261 Video Streams 2032
RTP-CELLB RTP Payload Format of Sun's CellB Video Encoding 2029
SPKM The Simple Public-Key GSS-API Mechanism (SPKM) 2025
DLSW-MIB Definitions of Managed Objects for Data Link Switching 2024
using SMiv2
MULTI-UNI Support for Multicast over UNI 3.0/3.1 based ATM 2022
Networks
RMON-MIB Remote Network Monitoring Management Information 2021
Base Version 2 using SMiv2
802.12-MIB IEEE 802.12 Interface MIB 2020
TCP-ACK TCP Selective Acknowledgement Options 2018
RFC's 1905
SDLCSMiv2 Definitions of Managed Objects for SNA Data Link 1747
Control {SDLC) using SMiv2
AT-MIB AppleTalk Management Information Base II 1742
MacMIME MIME Encapsulation of Macintosh Files - MacMIME 1740
URL Uniform Resource Locators {URL) 1738
POP3-AUTH POP3 AUTHentication command 1734
IMAP4-AUTH IMAP4 Authentication Mechanisms 1731
RDBMS-MIB Relational Database Management System {RDBMS) 1697
Management Information Base {MIB) using SMiv2
MODEM-MIB Modem Management Information Base {MIB) using SMiv2 1696
TMUX Transport Multiplexing Protocol {TMux) 1692
SNANAU-MIB Definitions of Managed Objects for SNA NAUs using 1666
SMiv2
PPP-TRANS PPP Reliable Transmission 1663
Postmaster Convention for X.400 Operations 1648
UPS-MIB UPS Management Information Base 1628
PPP-ISDN PPP over ISDN 1618
PPP-X25 PPP in X.25 1598
OSPF-NSSA The OSPF NSSA Option 1587
OSPF-Multi Multicast Extensions to OSPF 1584
RIP-DC Extensions to RIP to Support Demand Circuits 1582
TOPT-ENVIR Telnet Environment Option 1572
PPP-LCP PPP LCP Extensions 1570
CIPX Compressing IPX Headers Over WAN Media {CIPX) 1553
IPXCP The PPP Internetworking Packet Exchange Control 1552
Protocol {IPXCP)
SRB-MIB Definitions of Managed Objects for Source Routing 1525
Bridges
CIDR-STRA Classless Inter-Domain Routing (CIDR) : an Address 1519
Assignment and Aggregation Strategy
CIDR-ARCH An Architecture for IP Address Allocation with CIDR 1518
CIDR Applicability Statement for the Implementation 1517
of Classless Inter-Domain Routing (CIDR)
Definitions of Managed Objects for IEEE 802.3 Medium 1515
Attachment Units (MAUs)
Token Ring Extensions to the Remote Network Monitoring 1513
MIB
FDDI-MIB FDDI Management Information Base 1512
KERBEROS The Kerberos Network Authentication Service (V5) 1510
X.400 Use of Extended Character Sets 1502
HARPOON Rules for downgrading messages from X.400/88 to 1496
X.400/84 when MIME content-types are present
in the messages
Equiv Equivalences between 1988 X.400 and RFC 822 Message 1494
Bodies
IDPR Inter-Domain Policy Routing Protocol Specification: 1479
Version 1
IDPR-ARCH An Architecture for Inter-Domain Policy Routing 1478
PPP/Bridge The Definitions of Managed Objects for the Bridge 1474
Network Control Protocol of the Point-to-Point
Protocol
PPP/IPMIB The Definitions of Managed Objects for the IP Network 1473
Control Protocol of the Point-to-Point Protocol
PPP/SECMIB The Definitions of Managed Objects for the Security 1472
Protocols of the Point-to-Point Protocol
PPP/LCPMIB The Definitions of Managed Objects for the Link 1471
Control Protocol of the Point-to-Point Protocol
IP-TR-MC IP Multicast over Token-Ring Local Area Networks 1469
X25-MIB SNMP MIB extension for Multiprotocol Interconnect 1461
over X.25
SNMPv2 Introduction to version 2 of the Internet-standard 1441
Network Management Framework
PEM-KEY Privacy Enhancement for Internet Electronic Mail: 1424
Part IV
RFC's 1907
Ap9.1.5 Best Current Practice by BCP
Mnemonic Title RFC# BCP#
RFC's 1909
MPLS Loop Prevention Mechanism 3063
Internet X.509 Public Key Infrastructure Data 3029
Validation and Certification Server Protocols
Unified Memory Space Protocol Specification 3018
SAP Session Announcement Protocol 2974
Protocol Independent Multicast MIB for IPv4 2934
MASC The Multicast Address-Set Claim (MASC} Protocol 2909
Generic AAA Architecture 2903
DNS Extensions to Support IPv6 Address Aggregation 2874*
and Renumbering
TCP Congestion Window Validation 2861
TSWTCM A Time Sliding Window Three Colour Marker (TSWTCM} 2859
OSPF over ATM and Proxy-PAR 2844
PPP-SDL PPP over Simple Data Link (SDL} using SONET/SDH 2823
with ATM-like framing
Diffie-Helman USM Key Management Information Base 2786
and Textual Convention
An HTTP Extension Framework 2774
Encryption using KEA and SKIPJACK 2773
Sampling of the Group Membership in RTP 2762
Definitions of Managed Objects for Service Level 2758
Agreements Performance Monitoring
HTCP Hyper Text Caching Protocol (HTCP/0.0} 2756
RTFM: New Attributes for Traffic Flow Measurement 2724
PPP EAP TLS Authentication Protocol 2716
SPKI Certificate Theory 2693
SPKI Requirements 2692
QoS Routing Mechanisms and OSPF Extensions 2676
DNS Binary Labels in the Domain Name System 2673*
RFC's 1911
Protocol Interface Version 2.0
CLNP-TUBA Use of ISO CLNP in TUBA Environments 1561
REM-PRINT Principles of Operation for the TPC.INT Subdomain: 1528
Remote Printing -- Technical Procedures
DASS DASS - Distributed Authentication Security Service 1507
EHF-MAIL Encoding Header Field for Internet Messages 1505
RAP RAP: Internet Route Access Protocol 1476
TP-IX TP/IX: The Next Internet 1475
Routing Coordination for X.400 MHS Services Within 1465
a Multi Protocol I Multi Network Environment
Table Format V3 for Static Routing
Using the Domain Name System To Store Arbitrary 1464
String Attributes
IRCP Internet Relay Chat Protocol 1459
SIFT SIFT/UFT: Sender-Initiated/Unsolicited File Transfer 1440
DIR-ARP Directed ARP 1433
TEL-SPX Telnet Authentication: SPX 1412
TEL-KER Telnet Authentication: Kerberos Version 4 1411
TRACE-IP Traceroute Using an IP Option 1393
DNS-IP An Experiment in DNS Based IP Routing 1383
RMCP Remote Mail Checking Protocol 1339
MSP2 Message Send Protocol 2 1312
DSLCP Dynamically Switched Link Control Protocol 1307
X.500 and Domains 1279
IN-ENCAP Scheme for an internet encapsulation protocol: 1241
Version 1
CLNS-MIB CLNS MIB for use with Connectionless Network Protocol 1238
(ISO 8473) and End System to Intermediate
System (ISO 9542)
CFDP Coherent File Distribution Protocol 1235
IP-AX.25 Internet protocol encapsulation of AX.25 frames 1226
ALERTS Techniques for managing asynchronously generated 1224
alerts
MPP Message Posting Protocol (MPP) 1204
SNMP-BULK Bulk Table Retrieval with the SNMP 1187
DNS-RR New DNS RR Definitions 1183
IMAP2 Interactive Mail Access Protocol: Version 2 1176
NTP-OSI Network Time Protocol (NTP) over the OS! Remote 1165
Operations Service
DMF-MAIL Digest message format 1153
RDP Version 2 of the Reliable Data Protocol (RDP) 1151
Standard for the transmission of IP datagrams 1149
on avian carriers
TCP-ACO TCP alternate checksum options 1146
The Q Method of Implementing TELNET Option Negotiation 1143
IP-DVMRP Distance Vector Multicast Routing Protocol 1075
VMTP VMTP: Versatile Message Transaction Protocol 1045
COOKIE-JAR Distributed-protocol authentication scheme 1004
NETBLT NETBLT: A bulk data transfer protocol 998
IRTP Internet Reliable Transaction Protocol functional 938
and interface specification
LOP Loader Debugger Protocol 909
RDP Reliable Data Protocol 908
~ S60SOYWN.
~ -" . -.
: ~odl•
II ~I ; ~ :l
0!
tM i~
~ ;~ ~lb HI
~lHI• .1m • .'.f.l," 0 ~=::===··
.. . .... -
71 ~I ~I 21 ~I ~I ;; I! 0
.. ... . Oaas
- vu:>£1
'l
• ~ ~ ~ ~ : : : ~ =
0401033S
elel:i > > l! Hi!
- ~ ... • .. • ~ - • t
illf.~ :i ~1a1e1~ 3 :I :;!
H,
I
g
: I OHI•
~·
i! \ ~, s[il s~ ~! 11
£6S1~L
< ,a
il~ I ~I
I .----
J=sJgJ al ~: "
~ "~
.-----2!- ~ :li!--
10
"'
~~~~
!. ~ :: :1 • -
~ II
- - ... .. ... . ... I;.:~..
~l·L
j~t
Ap 11 Quick questions
Question: I would like some discipline in the design of my network. Thus, what are the main design
steps?
It is important to properly design your network, as incorrect planning can cause problems in the
future. The basic steps are:
• Analyze requirements. This involves understanding and specifying the requirements of the
network, especially its major uses. If possible, future plans should be incorporated. One of
the key features is the bandwidth requirements and the size of the network.
• Develop LAN structure. This step involves developing a LAN structure for these require-
ments. Typically in organizational networks this will be based on a star topology using
Ethernet hubs/switches.
• Set up addressing and routing. The final step involves setting up IP addresses and subnets
to add structure.
The most important information that is required is the structure of the organization and how
information flows between the units, as the designed network is likely to reflect this structure.
The information will include:
• Understand the current network (if one exists) especially its strengths and weaknesses.
• Gather information on geographical locations.
• Determine current applications, and future plans for each site and for the organization.
• Develop organizational contacts. These will be the important people who will be involved
in the development of the network. A mixture of technical and business skills always helps.
Technical people tend to be driven by technology ('it should transfer files faster', 'it's easier
to install', and so on), whereas business people tend to be driven by applications ('I just
want access to a good spreadsheet', 'I want to be able to send e-mails to anyone in the com-
pany', and so on). It is also important to get someone involved who has experience oflegal
matters, and/or someone involved in Personnel matters.
• Determine the requirements for external network connections. This is an important deci-
sion as the security of the whole network may depend on the choices made on the external
connections. Many large companies have a single point of connection to the external Inter-
net as this allows organizations to properly manage internal and external connections to the
Internet.
• Determine key objectives of the organization, especially related to mission-critical data and
mission-critical operations. These should have top priority over other parts of the network.
For example, a hospital would declare its ambulance service as a mission-critical unit,
whereas the cuts and bruises unit (if there was one) would not be.
• Determine who is in control of information services. This may be distributed over the or-
ganization or over centralized in an MIS (Management Information Service) unit.
Question: I've analyzed the traffic on the network, and I've found that a large portion ofthe network
traffic is related to broadcasts. How can I reduce their effict?
Broadcasts are sent out when a node wants help from other nodes. Typically, this happens when
a node requires the MAC address for a known network address. The broadcast domain defines
the physical distance by which a broadcast will be propagated. Hub, bridges and switches all
propagate broadcasts, but routers do not. Thus, if you want to reduce the number of broadcasts
on a network segment, insert a router, and it will intelligently route data packets into and out of
a network segment without too many broadcasts (as the router handles external data routing).
• Physical layer. Network media (typically Cat-5 cable or fiber-optic cable), hubs and repeat-
ers. Cables are normally run conforming to the EWTIA-568A standard. This layer should
allow for future expansion.
• Data link layer. Switches and bridges. These devices will define the size of the collision and
broadcast domains.
• Network layer. Routers, addressing. This layer filters data packets between network seg-
ments.
Question: I have a local Ethernet hub which I connect to. How for can I run a cable from the hub to
my computer?
If you use Cat-5 horizontal cable, you can get a maximum distance of 100m (if you were to use
fiber cable you could get up to 400m). A hub can thus cover an area of 200 meters square
(assuming that the hub is located in the center of the area).
Question: Will I do damage if I connect using incorrectly wired cable, also how do I know that I've
connected everything correctly? For example, I have a fiber cable which has two connectors and both
are the same, how do I get the TX to the RX, and vice-versa?
It is unlikely that you will do any damage if you connect your cables round the wrong way, as all
the inputs and outputs are electrically buffered. This allows them to sustain short-circuits, and
incorrect wiring. The key of knowing if your connection is working is to look at the 'keep-alive'
signal, which is typically a green LED on the NIC, hub, switch or router. If it is active, or flash-
ing, you have made a proper connection.
With fiber-optic connections, the transceiver unit will activate two green LEDs when you
have made a correct connection. If they are not active, swap the connections round and recon-
nect.
Question: You have said that Ethernet connections have a cross-over, but when I look at my patch
cable, there isn't a cross-over, and pin 1 wires to pin 1, pin 2 to pin 2, and so on? Where s the cross-
over?
You are totally correct, and so am I. The standard Ethernet connection must have a cross-over to connect
the transmit to the receive, and vice-versa, but most hubs implement the cross-over inside the hub. Thus,
all you need is a straight-through cable. I've listed the standard cross-over connections in Section 12.18
(and Figure 11.24), but most of the time you do not need a cross-over when you're connecting to the front
of a hub or a switch. It is only at the back of the hub that you may need a ctoss-over cable. If in doubt look
at the 'keep-alive' LED. If it is off after you connect, it is likely that you've got the wrong cable (or the
power isn't on, or you've not connected the other end, or the power isn't on the computer, and so on).
Question: IfIP has been such a success, why do we need a new address scheme?
IP has been a victim of its own success. No one could have imagined how popular it would be.
As it has a 32-bit address it can only support up to 4 billion addresses. Unfortunately, not all
these addresses can be used, as network addresses are allocated to organizations for their maxi-
mum requirement. Also, if an organization uses subnets, then it is unlikely that every subnet has
its maximum capacity of hosts.
There are possibly enough IP addresses for all the computers in the world, but the next big
wave is going to come from granting IP addresses to virtually every electronic device, such as
mobile phones, faxes, printers, traffic lights, telephones, and so on. The stage after this is to
grant every object in the world an IP address. This could include cars, trains, people, and even
our pets.
• The Internet and its addressing structure was never really designed to be a global infrastruc-
ture and is constraining the access to resources and information.
• Information and databases tend to be static, and flxed to location.
• Difficult to group individual objects into larger objects.
• Difficult to add resources to the Internet (requires an ISP and a valid IP address).
• Search engines are not very good at gathering relevant information. On the WWW, typi-
cally users get pages of irrelevant information, which just happens to have the keyword
which they are searching for.
• Resources are gathered around local servers.
• Resources are tied to locations with an IP address.
• IP addresses are not logically organized. The IP address given does not give any information
about the geographical location of the destination. This then requires complex routing pro-
tocols in which routers pass on information about how to get to remote networks.
Question: Can devices have more than one IP address?
Yes. Many devices have more than one IP address. In fact each port that connects to a network
must have an IP address. A good example of this is with routers, as they connect to two or more
networks. Each of the ports of the router must have an IP address which relates to the network
to which it connects to. For example if a router connects to three networks of:
146.176.151.0
146.176.152.0
146.176.140.0
then one IP address from each of the networks must be assigned to the router. Thus, it could be
assigned the following addresses for its ports:
146.176.151.1
146.176.152.1
146.176.140.1
Question: Can these addresses be used again for one ofthe hosts on the connected networks?
No way. No two ports on the Internet can have the same address.
Question: Okay, sorry I asked. So what addresses cannot be used for the ports, or the hosts?
This is a common problem, and it is likely that you are connected to the Internet, but the Do-
main Name Server is not reachable. This means that you cannot resolve domain names into IP
addresses. The way to check this is to use the IP address in the URL. For example:
http://www.mypage.com/index.html
http://199.199.140.1 0/index.html
If you can get access with this, you should investigate your DNS. Remember you can normally
specify several DNS's, thus find out the address of a remote DNS, just in case your local one
goes off-line.
Question: When I connect to an ISP, what is my IP address, and my domain name? Can I have the
same IP address each time, and the same domain name?
When you connect to your ISP you will be granted an IP address from a pool of assigned IP
addresses. There is no guarantee that this will be the same each time you connect. Your domain
name will also change, as it is bound to the IP address. It is possible to be allocated a static IP
address, but you would have to pay some money to your ISP for the privilege. The advantage
of this is that remote computers could connect to you when you connected via your ISP.
You can determine your current IP address if you use the command WINIPCFG (or
IPCONFIG). This is particularly useful if you are playing games over the Internet.
Question: If I move my computer from one network to another, does the IP and MAC address stay
the same, and what do I need to change?
The MAC address will not change as the network card stays with the computer. If the computer
is moved to a different subnet or onto a completely different network, the IP address must
change, or the data will be routed back to the wrong network. Data would leave the relocated
computer, and would arrive at the destination, but any data coming back would be routed to the
previously attached network (and thus get lost). Another thing that is likely to change is the
gateway. Nodes cannot communicate with the hosts outside their network if they do not know
the IP address of the gateway (normally a router), thus if the network changes then the gateway
is likely to be different.
The user may also have to set a new Domain Name Server (although a host can have several
DNS entries). The first one listed in the DNS entries should be the one that is the most reliable
and, possibly, the fastest.
Other changes may be to change the subnet mask (on a Class B network, with a subnet this
is typically 255.255.255.0).
Question: So why do you only have to sped.fJ the IP address ofthe gateway?
Because the host uses an ARP request to determine the MAC address of the gateway.
Question. How is it possible to simply connect a computer to an Ethernet network, and all the com-
puters on the network are able to communicate with it, and how do they know when a computer has
been disconnected?
Computers use the ARP protocol, which allows nodes to determine the MAC address of com-
puters on the network, from given IP addresses. Once they discover the destination MAC
address, they update their ARP cache. After a given time, the entries in the table are updated
(known as aging the entry).
Question: Okay. I understand that both the MAC address and the IP address need to be specifiedfor
a node to receive data, but how does a node know the MAC address ofthe remote destination?
1. A host looks up its local ARP cache (which is in its own RAM, and not stored to the perma-
nent storage) to see if it knows the MAC address for a known IP address.
2. If it does not find the MAC address, it transmits an ARP request to the whole of the network
(ARP requests do not travel over routers). The host who matches the transmitted IP address
then responds with an ARP reply with its own MAC address in the source address field in
the data frame. This is received by the originator of the request, which updates its local ARP
cache, and then transmits with the required MAC address.
Question: Oh, yes. I think I see it now, but what if the destination is on another network, possibly in
another country, how does it determine the address ofthe destination?
1. The host knows the IP address of the gateway for the network (normally a router). It then
uses the MAC address of the gateway, but with the destination IP address of the host that the
data is destined for. The gateway senses that the data frame is addressed to itself, and for-
wards it to the next gateway, and so on.
2. If the node does not know the MAC address of the gateway it will send out an ARP request
to the network with the IP address of the gateway.
Question: Does it matter which port I connect my workstation to the hub with? Do I have to start
from port 1, then port 2, and so on.
No. Hubs and switches are autosensing and automatically use the port that you connect to. You
should hopefully see an LED become active when you connect to the port. You can also connect
to a cascaded hub/switch to any one of the ports.
Question: I've got a dual10/100 switching hub. Can I communicate at 100Mbps, even though I
only have a 10Mbps networking card?
Question: Whats the difference between a data segment and a data packet?
The transport layer uses data segments, whereas the network layer uses data packets. Data seg-
ments allow two or more applications to share the same transport connection. These segments
are then split into data packets which have a given maximum size (typically for IP packets this is
64 KB) and each are tagged with a source and destination network address. Different applica-
tions can send data segments on a first-come, first-served basis.
Question: How does a router know that it is getting routing information, and not an IP data packet?
A routing packet is identified in the protocol field in the IP header. For example the OSPF rout-
ing protocol is defined by an 89 in the IP protocol field of the IP header (TCP is defined as 6,
and UDP as 17). Example protocol numbers are:
Question: Most of the systems I have worked with use the RIP routing protocol If it is so popular,
why should I use anything else?
RIP is a distance-vector routing protocol which uses a metric to determine the best route to a
network. A metric-based system is not really a problem, but RIP uses a very simple method to
define the metric: the hop count. This in no way defines the bandwidth on any of the intercon-
nected networks, or the delay, or really anything, apart from the number of routers that it
encounters. Another major problem is that the maximum hop count is set at 15, thus if a desti-
nation is further than 15 routers away, it cannot be reached.
I could go on all day talking about the problems of RIP, but I will not because it's what
makes a lot of networks work. A major problem, though, is that, unlike link-state protocols, each
router transmits the complete contents of its routing table to all of its neighbors (even if there
have been no changes to its connected networks). This occurs every 30 seconds, and is thus
wasteful of bandwidth.
Routing loops can also occur, but these can be overcome with hold-down timers, which do
not allow any updates to the metric for a network which is known to be down, for a given time
(the hold-down time).
Question: You say that high-quality audio uses 16 bits for each sample, but my CD player says that it
uses 1- bit conversion. Is this right?
Yes. It is. It uses one bit at a time, as this is thought to give a smoother response. A major prob-
lem with CD recordings is that they sometimes lack warmth, and are a little sharp (as they are
too perfect). One bit tracking tries to follow the movement of the audio signal. So your CD still
uses 16-bit coding.
Question: I can't understand it. I've just bought a brand-new, state-ofthe-art 56kbps modem, and
all I ever get is a maximum transfer speed of 4.19 KB/s. Where am I going wrong, do I need a new
ISP?
No. Your ISP is providing an excellent service, as 56kbps is split between sending and receiving.
As users who access the Internet from modems typically need to receive more data than they
send, the bandwidth for receiving is greater than the bandwidth for sending. You can thus re-
ceive at a faster rate than you can send. The maximum receiving rate is 33 kbps, which relates to
a maximum transfer rate of 4.125 KB/s {there are 8 bits in a byte). If you need a higher-rate you
should try ISDN which gives a total transfer rate of 128kbps (16KB/s). Otherwise, consider
ADSL (Asymmetric Digital Subscriber Line), which gives up to 9Mbps receiving and 1.1Mbps
sending, over standard telephone lines.
Question: Everyone seems to be talking about MP-3, but whats so good about it?
MP-3 audio is set to revolutionize the way that music is distributed and licensed. A typical audio
track is sampled at 44 100 times per second, for two channels at 16 bits per sample. Thus the
data rate is 1.411Mbps (176400B/s), giving a total of 52920000B {50.47MB) for a five-
minute song. As the storage of a CD is around 650MB, it is possible to get 64 minutes
• The qualiry of the digital audio system only depends on the conversion process, whereas the
quality of an analogue audio system depends on the component parts of the system.
• Digital components tend to be easier and cheaper to produce than high-specification ana-
logue components.
• Copying digital information is relatively easy and does not lead to a degradation of the sig-
nal.
• Digital storage tends to use less physical space than equivalent analogue forms.
Advantages of routers:
• Intelligently route data to find the best path using the network address. A bridge will route
if the MAC address is not on the originating segment, whereas a router will intelligently de-
cide whether to forward, or not.
• They do not forward broadcasts, thus they reduce the effect of broadcast storms.
Disadvantages of routers:
• Slower than bridges, as they must process the data packet at a higher level. The data frame is
then forwarded in a modified form.
• They are network protocol dependent, whereas bridges will forward any high-level protocol
as it is operating on the level 2 (as long as it connects two networks of the same types, such
as Ethernet-to-Ethernet). Routers interpret the network level data using the required proto-
col, such as IP or IPX.
Question: I live in Edinburgh, and my friend lives in London. How long does it take for a digital
pulse to travel from Edinburgh to London?
Well, there are a lot of assumptions to be made. First we'll assume that there are no intermediate
devices in the cable that connects Edinburgh and London, and we'll assume that it is fiber-optic
cable, which propagates light pulses at one-third the speed of light (10 8 m/s). Thus for a distance
of 500 miles (804.65km,) the time will be:
Question: I use a Dial-up connection from home and an Ethernet connection at work. Is there any
difference in the way that my applications operate?
None at all (when you use TCP/IP communications). TCP/IP provides the interface between
the networking technology and the application program, and has been designed so that the net-
working type is transparent to the application program, so, for example, it doesn't marter to a
WWW browser that you connect to a modem or over a LAN.
Question: I'm a user administrator. What are good practices for user accounts, so that I can secure my
network?
1. GUEST ACCOUNT. A guest account should always have a password, and should only be
used in low-security domains.
2. RENAME ADMIN. If the network connects to the Internet, the administrator account
should be renamed to deter hackers.
3. LIMIT ADMINISTRATOR. Only log on as an administrator when required. This stops
the administrator from accidentally making changes which are incorrect, as the administra-
tor has the right to do anything (every user, no matter how good they are, has deleted
something that they didn't intend to).
4. PASSWORDS FOR ALL. User accounts should always have a password. On medium-
security and high-security domains, the password should expire after a given time, and will
require a completely new password (not just the same one as given previously). Some sys-
tems remember the best few passwords, and bar the user from using any of them.
5. CHANGE WHEN FIRST. New users should change their password after they first log
onto a domain. This forces users to protect their own account.
6. RANDOM NEW PASSWORDS. In medium-security and high-security networks, ini-
tial passwords should be random assigned.
7. BAD LOCK-OUTS. User accounts should be locked-out after a given number of bad log-
ins. In low-security domains this should be a simple time out for a number of minutes, but
on medium-security and high-securiry domains this should set to forever (that is, until the
system administrator has reset the account, possibly after investigating the cause).
8. PASSWORD SIZE. On medium-security and high-security domains, passwords should be
at least a given number of characters, and should typically not include words from a stan-
dard dictionary, and also include a number. Typically passwords are at least six characters
long.
9. GROUPS. The user must be assigned to a well-defined group, as members of their group
tend to have a high-privilege to the user's resources as any other user.
Microsoft Windows NT/2000 uses the C2 security level. It has the following features:
• Object control. Users own certain objects and they have control over how they are accessed.
• User names and passwords.
• No object reuse. Once a user or a group has been deleted, the user and group numerical
IDs are not used again. New users or groups are granted a new ID number.
• Security auditing system. This allows the system administrator to trace security aspects,
such as user login, bad logins, program access, file access, and so on.
• Defined keystroke for system access. In Windows NT/2000, the CNTRL-ALT-DEL key-
stroke is used by a user to log into the system.
Question: What does the orange book define?
The Orange Book produced by the US Department of Defense (DOD) defines levels of security
for systems. There are four main divisions, which split into seven main security ratings. Division
D is the lowest security level and Division A is the highest. The ratings are:
• Division D. This rating provides no protection on files or for users. For example, a DOS-
based computer has no real security on files and users, thus it has a Division D rating.
• Division C. This rating splits into two groups: Cl rating and C2 rating. Cl contains a trust
computing base (TCB) which separates users and data. It suffers from the fact that all the
data on the system has the same security level. Thus, users cannot make distinctions be-
tween highly secure data and not-so secure data. A Cl system has user names and
passwords, as well as some form of control of users and objects. C2 has a higher level of se-
curity and provides for some form of accountability and audit. This allows events to be
logged and traced, for example, it might contain a list of user logins, network address logins,
resource accesses, bad logins, and so on.
• Division B. This rating splits into three groups: Bl, B2 and B3. Division B rated systems
have all the security of a C2 rating, but have more security because they have a different
level of security for all system accesses. For example, each computer can have a different se-
curity level, each printer can also have different security levels, and so on. Each object (such
• Domain Admins. Used to assign the administrators group within the domain.
• Domain Users. Used to assign the users accounts in the domain.
• Domain Guests. Used to assign the guest accounts in the domain.
• Administrators. Contains the Administrators account and the Domain Admins domain
group.
• Account Operators, Backup Operators, Print Operators and Server Operators. Less privi-
leged than the Administrators but more than user accounts. Each perform a specific task for
an administrative function.
• Replicators. Used by the Directory Replicator Service, which allows for automatic copying
of files between systems within a domain.
• Users. A group which holds ordinary users.
• Guests. A group which holds guest accounts for the local domain.
On Microsoft Windows, the names in the WINS database can be shown with the nbs tat com-
mand.
#IP-address host-name
146.176.1.3 bills_pc
146.176.144.10 fred_pc #DOM:STAFF
where comments have a preceding '#' symbol. To preserve compatibility with previous versions
of Microsoft LAN Manager, special commands have been included after the comment symbol.
These include:
#PRE
#DOM: domain
#INCLUDE fname
#BEGIN_ALTERNATE
#END_ALTERNATE
where
#PRE specifies that the name is preloaded into the memory of the computer and no
further references to the LMHOSTS file will be made.
#DOM :domain specifies the name of the domain that the node belongs to.
#BEGIN_ALTERNATE and #END_ALTERNATE are used to group multiple #include's
#include fname specifies other LMHOST files to include.
The HOSTS file format is IP address followed by the fully qualified name (FQDN) and then any
aliases. Comments have a preceding '#' symbol. For example:
host name Displays the TCP/IP hostname of the local node. hostname
- S print_server
-P printer
nbs tat Displays mapping ofNetBIOS names co IP nbstat -A freds
addresses.
help
finger [username]
port=port
querytype=type
; type can be A (address),
; CNAME (canonical name which is an alias for
; another host), MX (mail exchanger which
; handles mail for a given host), NS (name server
; for the domain), PTR (pointer record which
; maps an IP address to a hostname), SOA (stan
; of authority record) or ANY.
convert
Convetts drive partition from FAT to convert d: lfs:ntfs
NTFS.
convlog Convetts flles from Microsoft Information convlog -sg -ncsa -o c:\temp
Server, FTP server and Gopher servers, and *.log
produces log files in NSCA or EMWAC
format.
net computer Adds or ddetes computers from current do- net computer \\freds /add
main. net computer \\bills /del
\\computer-name
I add; add computer
/del; delete computer
net group Creates, edits or deletes groups. net group "Staff" /add
net group "Staff" /add fred
/add
; add new group or users to the named
group
; specified group
/delete
; delete group or users to the named
group
; specified group
\ \computer-name
/delete ; delete job
net send Sends a text message to users or computers. net send bill "Hello"
• Kernel mode. This is a privileged mode of operation and allows all code direct access to the
hardware and memory, including memory allocated to user mode processes. Kernel mode
processes also have a higher priority over user mode processes.
• User mode. This is a lower privileged mode than kernel mode. It has no direct access to the
hardware or to memory. It interfaces to the operating system through well-defined API
(Application Program Interface) calls.
Figure Apl2.1 shows an outline of the architecture of NT/2000. It can be seen that only the
kernel mode has access to the hardware. This kernel includes executive services which include
managers (for 1/0, interprocess communications, and so on) and device drivers (which control
the hardware) . Its parts include:
• Microkernel. Controls basic operating system services, such as interrupt handling and
scheduling.
• HAL (Hardware Abstraction Layer). This is a library of hardware-specific programs which
give a standard interface between the hardware and sofrware. This can either be Microsoft-
written or manufacturer-provided. They have the advantage of allowing for transportability
of programs across different hardware platforms.
• Win32 Window Manager. Supports Win32, MS-DOS and Windows 3.x applications.
I -· I
I ~~~ _ I
Figure Ap12.1 Windows architecture
• An option-type byte.
• An option-type byte, followed by an option-length byte, and then the actual option-data
bytes. The option-length byte counts all the bytes in the options field.
The option-type byte is the first byte and has three fields, as illustrated in Figure £1.20. The
copied flag indicates that this option is (or is not) copied into all fragments on fragmentation.
••
10 - Debugging
11 - Reserved
I I I I I
t t t t t t
Number
Copied flag
0- No copied 0- End of Option Ust (followed by 0 bytes)
1-Copied 1 - No operation (followed by 0 bytes)
2- Security (followed by 11 bytes)
3- loose Source Routing (followed by variable bytes)
4- Internet Timestamp (followed by variable bytes)
7 - Record Route (followed by variable bytes)
8- Stream 10 (followed by 4 bytes)
9 - Strict Source Routing (followed by variable bytes)
• SSS ... SSS, security (16 bits) -These specify one of 16 levels of security, such as
• CCC ... CCC, compartments (16 bits) -When this field contains all zero values then the
transmitted information is not compartmented, other values can be obtained from the De-
fense Intelligence Agency.
• HHH ... HHH, handling restrictions (16 bits)- This field is defined in the Defense Intelli-
gence Agency Manual DIAM 65-19.
• TCC, transmission control code (24 bits) - This field allows the segregation of traffic and to
define controlled communities of interest among subscribers (available from HQ DCA
Code 530). Must be copied on fragmentation.
where
• Length - this is a single byte which contains the number of bytes in the option field.
• Pointer - this is a pointer, which is relative to this option, into the route data which indi-
cates the byte which begins the next source address to be processed. The smallest value is 4.
• Route data - this is constructed with a number of internet addresses, each of 4 bytes in
length. If the pointer is greater than the length, the source route is empty (and the recorded
route full) and the routing is to be based on the destination address field.
When reaching the address in the destination address field, and when the pointer is not greater
than the length in the route data, then the next address in the source route data replaces the ad-
dress in the destination field. The pointer is also incremented by 4, to point to the next address.
It is loose as the gateways are allowed to use any route to get to the next specified address in the
routing table.
It must be copied on fragmentation and occurs, at the most, once in a datagram.
It is not copied on fragmentation, and goes in the first fragment only. In addition, it occurs, at
the most, once in a datagram.
+--------+--------+--------+--------+
jOlOOOlOOj Length J Pointerjov jFlgj
+--------+--------+--------+--------+
internet address
+--------+--------+--------+--------+
timestamp
+--------+--------+--------+--------+
where
• Length. - is a single byte which contains the number of bytes in the option field (maximum
is 40).
• Pointer- this is a pointer, which is relative to this option, into the route data which indi-
cates the byte at which the next timestamp should be added to. The smallest value is 5.
• Overflow (Ov)- this has four bits and holds the number ofiP modules that cannot register
timestamps due to lack of space.
• Timestamp- this is a 32-bit value for the number of milliseconds since midnight UT (uni-
versal time). If this is not possible then it is any time, as long as the high-order bit of the
timestamp is set to a 1 to indicate that it is non-standard time.
The originating host must reserve enough area for the total number of timestamps, the size of
this option does not change as it transverses over the Internet. If there is a problem adding the
address then an ICMP parameter problem can be sent back to the source host. Initially the con-
tents of the timestamp data area is either zero, or has IP addresses with zero time stamps. The
timestamp area is full when the pointer is greater than the length.
It is not copied on fragmentation, and goes in the first fragment only. In addition, it occurs,
at most once in a datagram.
+--------+--------+--------+--------+
I10001000I00000010I Stream ID
+--------+--------+--------+--------+
Abbreviations 1949
EOT end of transmission
EPP enhanced parallel port
EPROM erasable PROM
EPS encapsulated postscript
ESP IP encapsulating security payload
ETB end of transmitted block
ETHER-MIB ethernet MIB
ETX end of text
FAT file allocation table
PATMAN Fife and Tayside MAN
FAX facsimile
FC frame control
FCS frame check sequence
FDDI fiber distributed data interface
FDDI-MIB FDDI management information base
FDM frequency division multiplexing
FDX full duplex
FEC forward error correction
FF full flag
FFIF file format for internet fax
FIFO first in, first out
FINGER finger protocol
FM frequency modulation
FRMR frame reject
FS frame status
FSK frequency-shift keying
FTP file transfer protocol
FYI for your information
GFI group format identifier
GGP gateway-gateway protocol
GIF graphics interface format
GQOS guaranteed quality of service
GSSAP generic security service application
GUI graphical user interface
HAL hardware abstraction layer
HD high density
HDB3 high-density bipolar code no. 3
HDLC high-level data link control
HD1V high-definition television
HDX half duplex
HEFCE Higher Education Funding Councils of England
HEFCW Higher Education Funding Councils of Wales
HF high frequency
HMUX hybrid multiplexer
HPFS high performance file system
HTML Hypertext Mark-up Language
HTTP Hypertext Transfer Protocol
Hz Hertz
Abbreviations 1951
IPX Internet packet exchange
IP-X.25 IPoveriSDN
IPX-IP IPXoveriP
IRQ interrupt request
ISA international standard interface
ISDN integrated services digital network
IS-IS immediate system to intermediate system
ISO International Standards Organization
ISP internet service provider
ITOT ISO transport service on top ofTCP
ITU International Telecommunications Union
JANET joint academic network
JFIF JPEG file interchange format
JISC Joint Information Systems Committee
JPEG Joint Photographic Expert Group
KDC key distribution centre
KERBEROS Kerberos network authentication service
LAN local area network
LAPB link access procedure balanced
LAPD link access procedure
LCN logical channel number
LDAP-URL LDAP URL Format
LD-CELP low-delay code excited linear prediction
LED light emitting diode
LGN logical group number
UP large IPX packets
LLC logical link control
LRC longitudinal redundancy check
LSL link support level
LSP link state protocol
LSRR loose source and record route
LZ Lempel-Ziv
LZW LZ-Welsh
MAC media access control
MAIL-MIB mail monitoring MIB
MAN metropolitan area network
MAP messaging API
MAU multi-station access unit
MD message digest
MDCT modified discrete cosine transform
MDI media dependent interface
MHS message handling service
MIB-11 management information base-II
MIC media interface connector
MIME multi-purpose internet mail extension
MUD multi -link interface driver
MODEM modulation/ demodulator
MOS metal oxide semiconductor
Abbreviations 1953
PMD physical medium dependent
POP3 post office protocol, Version 3
PO P-URL POP URL Scheme
ppp point-to-point protocol
PPP-AAL PPPoverAAL
PPP-CCP PPP compression control protocol
PPP-CHAP PPP challenge handshake authentication
PPP-EAP PPP extensible authentication protocol
PPP-HDLC PPP in HDLC framing
PPP-IPCP PPP control protocol
PPP-ISDN PPP over ISDN
PPP-UNK PPP link quality monitoring
PPP-MP PPP multilink protocol
PPP-NBFCP PPP NetBIOS frames control protocol
PPP-SNACP PPP SNA control protocol
PPP-SONET PPP over SONET/SDH
PPP-X25 PPPinX.25
PPSDN public packet-switched data network
PS postscript
PSDN packet-switched data network
PSE packet switched exchange
PSK phase-shift keying
PSTN public-switched telephone network
QAM quadrature amplitude modulation
QCIF quarter common interface format
QIC quarter inch cartridge
QoS quality of service
QT quicktime
QUOTE quote of the day protocol
RADIUS remote authentication dial-in service
RAID redundant array of inexpensive disks
RAM random-access memory
RD receive data
REJ reject
RFC request for comment
RGB red, green and blue
RI ring in
RIF routing information field
RIP routing information protocol
RIP2-MD5 RIP-2 MDS Authentication
RIP2-MIB RIP Version 2 MIB Extension
RIPNG-IPV6 RIPng for IPv6
RIP-TRIG Trigger RIP
RLE run-length encoding
RMON remote monitoring
RMON-MIB remote network monitoring MIB
RNR receiver not ready
RO ring out
Abbreviations 1955
SNMP-AT SNMP over AppleTalk
SNMP-IPX SNMP over IPX
SNMP-OSI SNMP over OSI
SNR signal-to-noise ratio
SO NET synchronous optical network
SPKM simple public-keyGSS-API mechanism
SPX sequenced packet exchange
SQ1V studio-quality television
SRAM static RAM
SSL secure socket layer
SSM single sequence message
SSRR strict source and record route
STA spanning-tree architecture
STM synchronous transfer mode
STP shielded twisted-pair
SVGA superVGA
TCB transmission control block
TCC transmission control code
TCP transmission control protocol
TDAC time-division aliasing cancellation
TDM time-division multiplexing
TEl terminal equipment identifier
TELNET telnet protocol
TFTP trivial file transfer protocol
TIFF tag image flle format
TIFF tagged input flle format
TIME time server protocol
TIP transaction internet protocol
TMUX transport multiplexing protocol
TOS type of service
TP-TCP ISO transport service on top of the TCP
TR transmit data
TSR terminate and stay resident
TTL time-to-live
TUBA TCP and UDP with bigger addresses
UDP user datagram protocol
UI unnumbered information
UNI universal network interface
UNI user network interface
UPS uninterruptable power supplies
URI universal resource identifier
URL uniform resource locator
USB universal serial bus
USERS active users protocol
UTF-8 UTF-8 transformation format of ISO 10646
UTP unshielded twisted pair
uv ultra violet
VCI virtual circuit identifier
Abbreviations 1957
Ap14 Glossary
Glossary 1961
Address resolution A method which resolves differences in addressing schemes, typi-
cally between data link and network addresses.
Administrative distance Used on Cisco routers to define the trustworthiness of a routing
information source. It varies between 0 and 255, where 255 gives
the lowest trustworthiness rating.
Advertising Method used by routers where routing or service updates are sent
at specified intervals so that other routers on the network can
maintain lists of usable routes.
AEP AppleTalk Echo Protocol. This is used to test the connectivity be-
tween two AppleTalk nodes.
Agent A program which allows users to configure or fault-find nodes on a
network, and also a program that processes queries and returns re-
plies on behalf of an application.
Aging The removal of an address from the address table of a router or
switch that is no longer referenced to forward a packet.
A-law The ITU-T companding standard used in the conversion between
analog and digital signals in PCM systems. Used mainly in Euro-
pean telephone networks.
Alignment error In Ethernet, an error that occurs when the total number of bits of a
received frame is not divisible by eight.
AM Amplitude modulation. Modulation technique which represents
the data as the amplitude of a carrier signal.
ANSI American National Standards Institute. ANSI is a non-profit mak-
ing organization which is made up of expert committees that
publish standards for national industries.
ASCII American Standard Code for Information Interchange. An ANSI-
defined character alphabet which has since been adopted as a stan-
dard international alphabet for the interchange of characters.
AM Amplitude modulation. Information is contained in the amplitude
of a carrier.
ASK Amplitude-Shift Keying. Uses two, or more, amplitudes to
represent binary digits. Typically used to transmit binary over
speech-limited channels.
AppleTalk Series of communications protocols designed by Apple Computer.
Application layer The highest layer of the OSI model.
ARP Address Resolution Protocol. Internet protocol used to map an
IP address to a MAC address.
ARPA Advanced Research Projects Agency. Research and development
organization that is part of DoD. ARPA evolved into DARPA, but
have since changed back to ARPA.
ARPANET Advanced Research Projects Agency Network, which was devel-
oped in the 1970s (funded by ARPA, then DARPA).
Glossary 1963
Back pressure Technique which slows the incoming data rate into the buffer of a
802.3 port preventing it from receiving too much data. Switches
which implement back pressure will transmit a jam signal to stop
data input.
Backbone cabling Cabling interconnects wiring closets, wiring closets, and be-
tween buildings.
Backbone The primary path for networked traffic.
Backoff The retransmission delay enforced when a collision occurs.
BACP Bandwidth allocation control protocol. Protocol which monitors
network traffic and allows or disallows access to users, depending
on their needs. It is awaiting approval by the IETF.
Bandwidth In an analogue system it is defined as the range of frequencies con-
tained in a signal. As an approximation it is the difference between
the highest and lowest frequency in the signal. In a digital trans-
mission system it is normally quoted as bits per second.
Baseband Data transmission using unmodulated signals.
BRI Basic rate interface. Connection between ISDN and the user. It has
three separate channels, one D-channel (which carries control in-
formation) and two B channels (which carry data).
Baud rate The number of signaling elements sent per second with RS-232, or
modem, communications. In RS-232 the baud rate is equal to the
bit-rate. With modems, two or more bits can be encoded as a single
signaling element, such as 2 bits being represented by four different
phase shifts (or one signaling element). The signaling element
could change its amplitude, frequency or phase-shift to increase the
bit-rate. Thus the bit-rate is a better measure of information trans-
fer.
BER Bit error rate. The ratio of received bits that contain errors.
BGP Border Gateway Protocol. Interdomain routing protocol that re-
places EGP.
Big-endian Method of storing or transmitting data in which the most signifi-
cant bit or byte is presented first.
Bit stuffing The insertion of extra bits to prevent the appearance of a defined
sequence. In HDLC the bit sequence 01111110 delimits the start
and end of a frame. Bit stuffing stops this bit sequence from occur-
ring anywhere in the frame by the receiver inserting a 0 whenever
there are five consecutive 1's transmitted. At the receiver if five
consecutive l's are followed by a 0 then the 0 is deleted.
BNC A commonly used connector for coaxial cable.
BOOTP A standard TCP/IP protocol which allows nodes to be dynamically
allocated an IP address from an Ethernet MAC address.
Border gateway Router that communicates with routers in other autonomous sys-
tems.
Glossary 1965
Cell The basic unit for ATM switching and multiplexing. Cells contain
identifiers that specify the data stream to which they belong. Each
cell consists of a 5-byte header and 48 bytes of payload.
CEPT Conference Europeenne des Postes et des Telecommunications.
Association
CHAP Challenge-handshake authentication protocol. Identification
method used by PPP to determine the originator of a connection.
Cheapernet IEEE 802.3 10Base2 standard.
Checksum An error-detection scheme in which bits are grouped to form inte-
ger values which are then summated. Normally, the negative of this
value is then added as a checksum. At the receiver, all the grouped
values and the checksum are summated and, in the absence of er-
rors, the result should be zero.
Circuit switching Switching system in which a dedicated physical circuit path must
exist between sender and receiver for the call duration
Cisco I OS software Cisco Internetwork Operating System software. Provides an oper-
ating system for a Cisco router.
Client Node or program that connects to a server node or program.
CLP Cell loss priority. Field in the ATM cell header that determines the
probability of a cell being dropped if the network becomes con-
gested.
Coaxial cable A transmission medium consisting of one or more central wire
conductors surrounded by an insulating layer and encased in either
a wire mesh or extruded metal sheathing. It supports RF frequen-
cies from 50 to about 500 MHz. It comes in either a 10-mm
diameter (thick coax) or a 5-mm diameter (thin coax).
Collapsed backbone Non-distributed backbone in which all network segments are inter-
connected by way of an internetworking device.
Collision domain The network area within which frames that have collided are
propagated. Repeaters and hubs propagate collisions, but switches,
bridges and routers do not.
Collision Occurs when one or more devices tty to transmit over an Ethernet
network simultaneously.
Connectionless Describes data transfer without the existence of a virtual circuit.
Connection-oriented Describes data transfer that requires the establishment of a virtual
circuit. See also connectionless.
Contention Access method in which network devices compete to get access the
physical medium.
Convergence The speed and ability of a group of internetworking devices run-
ning a specific routing protocol to agree on the topology of an
internetwork after a change in that topology.
CDDI Copper distributed data interface. FDDI over copper.
Glossary 1967
Destination MAC address A 6-byte data unique of the destination MAC address. It is nor-
mally quoted as a 12-digit hexadecimal number (such as
A5:B2: 10:64:01 :44).
Destination network address
A unique Internet Protocol (IP) or Internet Packet Exchange (IPX)
address of the destination node.
Differential encoding Source coding method which is used to code the difference be-
tween two samples. Typically used in real-time signals where there
is limited change between one sample and the next, such as in au-
dio and speech.
Distance vector routing algorithm
Routing algorithms which use the number of hops in a route to
find a shortest-path spanning tree. With distance vector routing
algorithms, each router to send its entire routing table in each
update, but only to its neighbors. They be prone to routing loops,
but are relatively simple as compared with link state routing algo-
rithms.
DNS Domain Naming System. Used on the Internet to translated do-
main names into IP addresses.
Dot address Notation for IP addresses in the form <w.x.y.z> where each num-
ber represents, in decimal, 1 byte of the 4-byte IP address.
DQDB Distributed Queue Dual Bus. Data link layer communication
protocol, specified in the IEEE 802.6 standard, designed for use in
MANs.
DTE Data terminal equipment. Device at the user end of a user-network
interface that is a data source, destination, or both.
Dual homing Topology where devices connect to the network by two independ-
ent access points (points of attachment). One gives the primary
connection, and the other is the standby connection that is acti-
vated in the event of a failure of the primary connection.
Dynamic address resolution
Use of an address resolution protocol to determine and store ad-
dress information on demand.
DHCP Dynamic host control protocol. It manages a pool of IP addresses
for computers without a known IP address. This allows a finite
number of IP addresses to be reused quickly and efficiently by
many clients.
Dynamic routing Routing that adjusts automatically to network topology or traffic
changes.
E1 Wide-area digital transmission scheme that is used in Europe to
carry data at a rate of 2.048 Mbps.
Early token release Used in Token Ring networks that allows stations to release the
token onto the ring immediately after transmitting, instead of wait-
ing for the first frame to return.
Glossary 1969
FTP File transfer protocol. A protocol for transmitting flles between
host computers using the TCP/IP protocol.
Firewall Device which filters incoming and outgoing traffic.
Flow control Procedure to regulate the flow of data between two nodes.
Forward adaptive bit allocation
This technique is used in audio compression and makes bit alloca-
tion decisions adaptively, depending on signal content.
Fragment free cut-through switching
A modified cut-through switching technique where a switch or
switch module waits until it has received a large enough packet to
determine if it is error free.
FCS Frame check sequence. Standard error detection scheme.
Frame Normally associated with a packet which has layer 2 information
added to it. Packets are thus contained within frames. Frames and
packets have variable lengths as opposed to cells which have fixed
lengths.
FSK Frequency-shift Keying. Uses two, or more, frequencies to repre-
sent binary digits. Typically used to transmit binary data over
speech-limited channels.
Full duplex Simultaneous, two-way communications.
Gateway A device that connects networks using different communications
protocols, such as between Ethernet and FDDI. It provides proto-
col translation, in contrast to a bridge which connects two
networks that are of the same protocol.
GIF Standard image compression technique which is copyrighted by
CompuServe Incorporated. It uses LZW compression and supports
a palette of 256 24-bit colors (16.7M colors). GIF support local
and global color tables and animated images.
Half-duplex (HDX) Two-way communications, one at a time.
Handshake Messages or signals exchanged between two or more network de-
vices to ensure transmission synchronization.
Handshaking A reliable method for two devices to pass data.
HCC Horizontal cross-connect. Wiring closet where the horizontal ca-
bling connects to a patch panel which is connected by backbone
cabling to the main distribution facility.
HDLC ISO standard for the data link layer.
Hello packet Message transmitted fi:om a root bridge to all other bridges in the
network to constantly verify the Spanning Tree setup.
Heterogeneous network Network consisting of dissimilar devices that run dissimilar proto-
cols.
Hierarchical routing Routing based on a hierarchical addressing system. IP has a hierar-
chical structure as they use network numbers, subnet numbers, and
host numbers.
Glossary 1971
col. A unique, four byte number identifies a host or gateway on the
Internet. This consists of a network number followed by a host
number. The host number can be further divided into a subnet
number.
IETF Internet Engineering Task Force. A committee that reviews and
supports Internet protocol proposals.
Internet Connection of nodes on a global network which use a DARPA-
defined Internet address.
internet Two or more connected networks that may, or may not, use the
same communication protocol.
Intranet A company specific network which has additional security
against external users.
InverseARP Inverse Address Resolution Protocol. This is a method of building
dynamic routes in a network, and allows an access server to dis-
cover the network address of a device associated with a virtual
circuit.
IP (Internet Protocol) Part of the TCP/IP which provides for node addressing.
IP address An address which is used to identify a node on the Internet.
IP multicast Addressing technique that allows IP traffic to be propagated from
one source to a group of destinations.
IPX Internet Packet Exchange. Novell NetWare communications pro-
tocol which is similar to the IP protocol. The packets include
network addresses and can be routed from one network to another.
IPXaddress Station address on a Novell NetWare network. It consists of two
fields: a network number field and a node number field. The node
number is the station address of the device and the network num-
ber is assigned to the network when the network is started up. It is
written in the form: NNNNNNNN:XXXXXX-XXXXXX:, where
N's represent the network number and X's represent the station
address. An example of an IPX address is: DCI05333:542CIO-
FFI432.
ISO International Standards Organization.
Isochronous transmission Asynchronous transmission over a synchronous data link. Isochro-
nous signals require a constant bit rate for reliable transport.
ITU-T The Consultative Committee for International Telephone and
Telegraph (now known at the ITU-TSS) is an advisory committee
established by the United Nations. It attempts to establish stan-
dards for inter-country data transmission on a worldwide basis.
Jabber Occurs when the transmission of network signals exceeds the
maximum allowable transmission time (20 ms to 150 ms). The
medium becomes overrun with data packets. This is caused by a
faulty node or wiring connection.
Jitter Movement of the edges of pulse over time, that may introduce
error and loss of synchronization.
Glossary 1973
MDI Medium Dependent Interface. The IEEE standard for the twisted-
pair interface to lOBase-T (or lOOBase-TX}.
MAC Media Access Control. Media-specific access-control for Token
Ring and Ethernet.
MIC Media Interface Controller. Media-specific access-control for To-
ken Ring and Ethernet.
MAU Medium Attachment Unit. Method of converting digital data into
a form which can be transmitted over a band-limited channel.
Methods use either ASK, FSK, PSK or a mixture of ASK, FSK and
PSK.
Microsegmentation Division of a network into smaller segments. This helps to increase
aggregate bandwidth to network devices.
Modem Modulator-Demodulator. A device which converts binary digits
into a form which can be transmitted over a speech-limited
transmission channel.
MTU Maximum Transmission Unit. The largest packet that the IP pro-
tocol will send through the selected interface or segment.
Multicast Packets which are sent to all nodes on a subnet of a group within a
network. This differs from a broadcast which forwards packet to all
users on the network.
Multimode fiber Fiber-optic cable that has the ability to carry more than one fre-
quency (mode) of light at a time.
NDIS Network driver interface specification. Software specification for
network adapter drivers. It supports multiple protocols and multi-
ple adapters, and is sed in many operating systems, such as
Windows.
Network layer Third layer of the OSI model, which is responsible for ensuring
that data passed to it from the transport layer is routed and deliv-
ered through the network. It provides end-to-end addressing and
routing. It provides support for a number of protocols, including
IP, IPX, CLNP, X.25, or DDP.
NTI Network termination. Network termination for ISDN.
NFS Network File System. Standard defined by Sun Microsystems for
accessing remote file systems over a network.
NIS Network Information Service. Standard defined by Sun Microsys-
tems for the administration of network-wide databases.
NLM NetWare Loadable Module. Program that can be loaded into the
NetWare NOS.
Node Any point in a network which provides communications services or
where devices interconnect.
N-series connectors Connector used with thick coaxial cable.
Octet Same as a byte, a group of eight bits (typically used in communica-
tions terminology).
Glossary 1975
Repeater A device that receives, restores, and re-times signals from one seg-
ment of a network and passes them on to another. Both segments
must have the same type of transmission medium and share the
same set of protocols. A repeater cannot translate protocols.
RARP Reverse address resolution protocol. The opposite of ARP which
maps an IP address to a MAC address.
RJ-45 Connector used with US telephones and with twisted-pair cables.
It is also used in ISDN networks, hubs and switches.
RMON An SNMP MIB that specifies the types of information listed in a
number of special MIB groups that are commonly used for traffic
management. Some of the popular groups used are Statistics, His-
tory, Alarms, Hosts, Hosts Top N, Matrix, Filters, Events, and
Packet Capture.
Routing node A node that transmits packets between similar networks. A node
that transmits packets between dissimilar networks is called a gate-
way.
RS-232C EIA-defined standard for serial communications.
RS-422,423 EIA-defined standard which uses higher transmission rates and
cable lengths than RS-232.
RS-449 EIA-defined standard for the interface between a DTE and DCE
for 9- and 37-way 0-type connectors.
RS-485 EIA-defined standard which is similar to RS-422 but uses a bal-
anced connection.
RLE Run-length encoding. Coding technique which represents long
runs of a certain bit sequence with a special character.
SAP Service Access Point. Field defined by the IEEE 802.2 specification
that is part of the address specification.
SAP Service Advertisement Protocol. Used by the IPX protocol to pro-
vide a means of informing network clients, via routers and servers
of available network resources and services.
Segment A segment is any length of LAN cable terminated at both ends. In
a bus network, segments are electrically continuous pieces of the
bus, connected by repeaters. It can also be bounded by bridges and
routers.
SLIP Serial line internet protocol. A standard used for the point-to-point
serial connections running TCP/IP.
Simplex One-way communication.
SNMP Simple Network Management Protocol. Standard protocol for
managing network devices, such as hubs, bridges, and switches.
Source encoding Coding method which takes into account the characteristics of the
information. Typically used in motion video and still image
compression.
Glossary 1977
V.35 ITU-T standard describing a synchronous, physical layer protocol
used for communications between a network access device and a
packet network.
V.42 ITU-T standard protocol for error correction.
VLC-LZW code Variable-length-code LZW code. Uses a variation of LZW coding
where variable-length codes are used to replace patterns detected in
the original data.
Vertical cabling Backbone cabling.
Virtual circuit Logical circuit which connects two networked devices together.
Workgroup Collection of nodes on a LAN which exchange data with each
other.
X.121 ITU-T standard for an addressing scheme used in X.25 networks.
X.21 ITU-T-defined specification for the interconnection ofDTEs and
DCEs for synchronous communications.
X.21bis ITU-T standard for the physical layer protocol for communication
between DCE and DTE in an X.25 network.
X.25 ITU-T-defined for packet-switched network connections.
X.28 ITU-T recommendation for terminal-to-PAD interface in X.25
networks.
X.29 ITU-T recommendation for control information in the terminal-
to-PAD interface used in X.25 networks.
X.3 ITU-T recommendation for PAD parameters used in X.25 net-
works.
X.400 ITU-T recommendation for electronic mail transfer.
X.500 ITU-T recommendation for distributed maintenance of files and
directories.
X3T9.5 ANSI Task Group definition of FOOl.
X-ON/X-OFF The Transmitter On/ Transmitter Off characters are used to con-
trol the flow of information between two nodes.
The associated CD contains a version of Snon (www.snon.org), which is Snon (one of the most widely
used Intrusion Detection Systems. The format of the alen is:
Index 1983
content advisor, 1272, 1273 data rate, 439,444,446,447,448,451,452,488,
contention, 57, 749, 771, 786, 787, 789, 814 501,528,571,572,575.577,580,596,630,781,
control field, 559, 701-703, 709, 710, 775-777, 826, 843
827,838,850,852,867,869-871,873,874,882- database, 1607, 1616, 1618, 1622, 1623, 1664, 1670
884, 1383, 1944, 1959 datagram, 965-968, 985, 986, 991, 1005, 1008,
control register, 568, 586, 587, 590, 644, 660, 663 1020, 1038, 1039, 1066, 1102, 1417, 1442, 1487,
control signals, 1785 1952
control token, 747, 748, 825, 826, 827 datastream-oriented, I 004
cookies, 1548, 1549, 1559, 1561, 1607, 1637-1641, dB,28,29,30,31, 761,1509-1512,1520,1944
1651, 1652, 1671 DB25S, 615
co-operative multitasking, 46, 47 DC balancing, 880, 881
CPU, 10, 37, 77, 80,475,499, 500, 513, 573, 596, DCD, 1724, 1945
606,718,919,1506,1548,1549,1672,1944 DCE, 615,616,620,621, 627,892, 893, 1725,
CR, 1350, 1352, 1353 1875, 1945, 1963, 1972, 1973, 1974
CRC, 572, 580, 679, 681, 682, 686, 709, 710, 711, D-channel contention, 885
773,774,789,826,839,860,861,872,885,1155, DCT, 1945, 1969, 1973
1944, 1957, 1963 DD, 497, 547,794,795, 1263, 1264, 1564, 1736,
crossed-pair, 767 1760, 1762, 1945
crosstalk, 23, 28, 30, 31,754,755,760, 767,791, deadlock, 41, 65
792, 1509, 1511, 1512, 1520, 1963 debugger, 1625
cryptographic keys, 1219, 1224 DECNET, 724, 1003
CSDN, 891, 1944 Demand Prioriry Access Method, 786
CSMAJCD, 692, 749, 750, 772, 778, 788, 789, 806, demand-paged, 53
814,906,1944,1955.1963 demodulator, 1948
Ctrl-Alt-Del, 80 DES, 1220, 1222, 1236-1239, 1242, 1247, 1248,
CTS, 616,618,619,620,910, 1725, 1730, 1731, 1875, 1884, 1945
1944 mangler function, 1236, 1240, 1242, 1244
cut sheet, 766, 1963 overview, 1237
cut-through switching, 816, 1963 S-box, 1240-1242
cyclic redundancy check, 536, 580, 773, 774, 826, Triple DES, 1242
872, 885, 1944, 1963 desktop switch, 814, 815
cylinders, 527, 536, 537,758, 1517 device driver, 43-45, 54, 573, 1442, 1935, 1953
DAS, 841, 842, 1944 DHCP, 985,988,989, 1071, 1149, 1405-1412,
data 1447, 1879, 1881, 1885, 1945, 1964
compression, 736, 1727, 1731, 1875, 1973 DIB,52,988, 1396,1410,1945
computer-rype, 541, 847, 848, 864, 877 dictionary, 695, 1198, 1431, 1969
rypes, 694 dielectric, 30,758, 1511, 1517, 1535
data frame, 709-711,730,734-739, 746-748,751, differential encoding, 1964
753,771,772,776,792,794,795,798,816,817, Diffie-Hellman, 1247, 1259, 1261
818,820,825-827,834,837,838,840,843,844, digital audio, 1923, 1924
858,872,910,964,1064 digital cenificates, 1268
data Handshaking, 641 digital modulation
data integriry, 834 ASK, 1943, 1958, 1970
data link, 963, 1875, 1876, 1878 FSK, 1946, 1966, 1970
data link layer, 700,701,706, 729-733,738,741, PSK, 1945, 1950, 1970, 1971
773.776,777,792,820,857,867,882,892,894, digital signatures, 1262
963, 1024, 1156, 1219, 1490, 1955. 1957. 1959, digital TV, 7, 509, 522
1963, 1966, 1969 digital-to-analogue, 25, 1519, 1944
Index 1985
end delimiter, 700, 826, 827, 837, 883 Fast Ethernet, 771, 780, 782, 783, 786, 787, 790,
end-of-interrupt, 634,636,638,649-651,653,715, 791,806, 1955, 1965
718 interframe gap, 789
end-to-end flow control, 862 LLC protocol, 776
enhanced parallel port, 444, 446, 502, 641, 653, 654, MDI, 778
658,659,660,662,663,665,670-672,675,1946 migration, 787
byte mode, 653, 657, 658, 665, 669, 670 PLS, 777, 778
nibble mode, 653-657, 665-669 SNAP, 775, 1021, 1487
protocol, 658, 670 SSAP, 775, 776
registers, 659, 671 thick-wire, 780, 781
entropy coding, 1965 thinner, 780, 781
EOT, 1946 transceiver, 779,789, 803, 818
EPROM, 1946 event-driven, 8, 1163, 1172, 1202
error exceptions, 51
control, 776, 852, 894, 967, I 004, 1963, 1969 explorer packets, 739
detection, 492, 539, 691, 701, 709, 730, 773, extended capability port, 444, 446, 502, 641, 653,
774, 816, 817, 827, 867, 872, 882, 885, 891, 660-663,672-675,1875,1945
967, 1024, 1490, 1792, 1966 channel address, 660, 672
probability, 1162 forward data, 662, 674
Esc, 639 mode signals, 661, 673
ESDI, 527, 529 protocol, 660
ETB, 1733, 1946 extended parallel port
ether, 779, 800, I 025, 1026, 1405 mode signals, 659, 671
Ethernet, I, 3, 62, 444, 448, 456, 467, 490, 689, 691, register definitions, 659, 672
699, 731, 732, 734, 735, 739-750, 753, 762, 764, FAT, 542, 543, 1450, 1451
768-783,786-793,796,800-804,806,814,816, fault tolerance, 747, 825, 837, 840, 1443, 1444, 1495
817,818,825,827,833,840,847,856,874,905, Fault tolerance, 836, 1506
907,963,964,968,981,997,1000,1004,1021, FAX, 1727, 1882, 1946
1024,1026,1033,1040,1070,1071,1144,1150, FC,610,838,839, 1563,1736,1946
1151, 1154, 1156, 1157, 134& 1405, 1407, 1408, FCS, 701,774,776,778,826,869,872,885,892,
1431, 1442, 1443, 1487, 1490, 1501, 1526, 1871, 1946, 1966
1872, 1875, 1913, 1940, 1955, 1958-1963, 1965, FDDI, 467, 612,613,731,739,748, 771,788, 791,
1966, 1970 806,817,833-847,864,963,1004,1348,1404,
I 00 Mbps, 456, 782, 1955 1443, 1525, 1873, 1876, 1946, 1947, 1962-1966,
IOOBASE-4T, 785, 1527, 1528 1974
IOOBASE-FX, 782 applications, 840
IOOBASE-T, 780,782-791,799,806,814 attachments, 791, 841
IOOBASE-TX, 780,782,783,786,787,791,814 backbone nerwork, 840, 841
IOOVG-AnyLAN, 780, 782, 783, 786, 787, 806, DAS, 841,842, 1944
1404, 1526, 1955, 1971 data frame format, 837, 838
IOBASE2, 739,780,781,806 frame format, 83 7
IOBASE5, 780, 781 layers, 834
IOBASE-FL, 780 management, 834, 1946
IOBASE-T, 739, 767, 780-784, 787, 788, 814, media, 840
1955 restricted token, 834
IOBASE-T connections, 785 SAC, 841, 1951
AU!, 778, 1943 SAS, 841, 842, 1951
DSAP, 775, 776 timed token, 834
Index 1987
hardware interrupts, 55 110
HD, 488, 547, 1946 addressing, 469
HDLC, 867-870, 872, 874, 892, 894, 1030, 1946, controller, 502, 509, 512, 515, 516, 518, 522,641
1950, 1956, 1960, 1966 port, 532, 662, 675
HDTV, 1946 read, 438,454,455,564,591, 1778
HDX, 1946, 1966 write, 438, 454, 455, 459, 461, 463, 464, 473,
HFS, 540, 1437 564,591,658,671,1778
hold-down timer, 1169,1170 IA5, 1733, 1947
hop count, 1024, 1163, 1166-1169, 1176, 1490, lAP, 1370, 1947
1963, 1967 IC11P,967,986,989,990,992,995,996, 1065,
host layers, 731 1066, 1067, 1075, 1409, 1460, 1871, 1886, 1936,
hot fixing, 543, 546, 1451 1939, 1940, 1947, 1967, 1971
hot plugging, 43 ICP, 1370
HPFS, 542,543,1450,1451 IDE, 441, 444, 445, 450, 467, 487-489, 497, 499,
HTIP, 33, 39, 913, 919, 920, 922, 926-933, 1008, 501,506,510-512,515,518,522,525-537,545,
1017, 1063, 1100, 1117, 1121, 1125, 1126-1129, 546,549,550,575.710
1186, 1187, 1188, 1219, 1267, 1268, 1271, 1272, communication, 532
1367, 1372-1386, 1390, 1391, 1430, 1447, 1545, connections, 445, 528, 530
1607, 1611, 1617, 1622, 1624, 1639, 1641, 1642, interface, 497,499, 501, 518, 528-530, 532
1651, 1652, 1670, 1673-1880, 1882, 1946 !SA interface, 497
GET, 33, 927, 1121, 1122, 1125-1129, 1378- 101,903,904, 1947
1380, 1384-1391, 1642, 1643 IDLE, 835, 836, 1879
HEAD, 1125, 1127, 1129, 1379, 1384, 1385, lOP, 903, 1947
1391 IEC,30,579,690, 715,1511,1969
POST, 927, 933, 1125, 1379, 1380, 1384, 1385, IEEE
1616, 1617, 1619-1626, 1652 -1284,641,654,662,665,674
PlJT, 1122,1125,1379,1380,1384 802.12,783, 786, 1876, 1955
entity header fields, 1384 802.2, 775, 1969, 1972
full requests/responses, 1378 802.2 and Ethernet SNAP, 775
general header fields, 1383 802.3, 749, 762, 771-778, 782, 783, 786-790,
message, 1271, 1378, 1385 1151, 1878, 1881, 1955, 1959, 1962, 1963,
reference, 1384 1965
request example, 1379 802.3 frame format, 773, 774
simple requests/responses, 1378 802.3u, 782, 783, 1959, 1965
HTIPS, 1272, 1642 802.4, 1873
hub,30,57,489,490,499, 509-522,570-573,575, 802.5, 786,825,826,827,839,1873,1955
576,610,612,613,744,745,750,753,764-767, 802.6, 837, 850, 1964
771,772,780-790,806,814,825,905,910,1064, standards, 772
1144, 1150, 1393, 1511, 1526, 1955-1957, 1962, IEEE-1394 packet formats, 580
1967, 1971, 1972 IEEE-488, 444, 715, 716, 718
hub-based, 509 IETF, 1158, 1159, 1173, 1271, 1376, 1761, 1876,
SlOE chipset, 521 1880-1884, 1960, 1967, 1968
820 chipset, 511 ILD, 1515, 1516, 1519, 1947
840 chipset, 518 image compression, 1969
huffman, 1957, 1967, 1969 impedance, 1532
hypertext, 924, 1063, 1367, 1371, 1372, 1374, 1376, 111R,635,636,637,649-652
1558, 1875, 1877. 1946, 1967 increment, 498, 502, 1169, 1562, 1963
inetd, 1404, 1415, 1417, 1439, 1440
Index 1989
IRQ, 51, 57-59,441,468,490-492,498 515, 521, kernel, 4, 5, 39, 40, 42, 50, 51, 54, 66, 73, 1021,
532,549,456,490-498,515,521,529-532,535, 1487, 1507, 1935
536,588,589-593,618,646,649,1948 key distribution centre, 1261, 1948
ISA,437-450,459,467,487-494,497,498,499, key exchange, 1259, 1261
506,509-512,515,518,521,527,529-531,575, keyboard, 7, 58,447,502,583,588,589,591-593,
592,659,662,671,674,692, 1793, 1948 1470, 1472, 1473, 1478
ISDN, I, 444,723, 849, 877-887, 1000, 1191, data ready, 58
1369, 1370, 1878, 1943, 1948, 1950, 1960, 1967, interface, 588-592
1970, 1972 keystroke, 1473
basic rate, 877, 878, 880, 918 LAN, 28, 30,448, 517,518,689,691,723,725,
B-channels, 878, 881, 885 739, 743, 744, 749, 752, 753, 762-764, 772, 780,
B-ISON, 877, 878, 1943 814,818,830,863,867,905,907,912,1020,
call clearing/establish, 887 1024,1035,1040,1144,1174,1200,1202,1404,
channels, 878 1441-1443, 1487, 1490, 1507, 1509, 1511, 1882,
data link layer, 882 1927, 1947, 1948, 1955, 1956, 1972, 1974
0-channels, 875, 878, 880-882, 885, 1960 LAPD, 875, 882, 885, 1948
dial-up, 1370 laser, 525, 537-539, 611, 726,789, 1516, 1519,
frame format, 880, 881 1613, 1928, 1929, 1947
HO, 878, 1723 LCN, 894, 902, 1948
Hll/12, 878, 879 LCR, 622, 623, 624, 636
network layer, 878, 885 LD-CELP, 888, 1948
network messages, 887 LED,647, 760,1064,1515-1519,1948
physical, 878, 879 lempel-ziv, 1386, 1475, 1948, 1969
supervisory frame, 883 LF, 1351, 1352, 1353
system connections, 513, 621, 622, 664, 880 LGN, 894, 902, 1948
TEl, 882, 883, 884, 886, 1952 line break, 615, 833, 1763
ISN, 1006, 1013 line discipline, 734
ISC>,30, 539,540,579,627,705,707,713,724, line driver, 629, 800
729,844,867,880,904,922,926-932,963,986, link access procedure, 882, 894
1018,1387,1430,1511,1877,1878,1881,1948, link support layer, 1442
1952, 1966, 1968, 1969 link-state, 1166,1170,1171,1174,1969
ISC> 9660, 539, 540 little endian, 17
ISC>/IEC, 30, 579, 1511, 1969 LLC, 773-778,838,840,867,874,1026,1948,
isochronous, 571, 573, 579, 580, 1947, 1956 1955, 1969
ISR,54-57,636,637,638,652 L()CK# timing diagram, 458
ITU, 627,629,630, 847, 888, 1948, 1956, 1958, logical block address, 534, 537, 559
1961, 1967, 1968, 1973, 1974 logical link control, 826, 874, 1948
jamming signal, 749, 772 logical unit number, 559
Java, loopback, 621,749,1154,1725,1728
applet, 1099, 1103-1106, 1109, 1274 lossless compression, 1969
interpreter, 1099 lossy compression, 1969
JavaScript, 4, 921, 1367, 1370, 1543-1631, 1671 LPT!,58,446,494,644,650,652
JFIF, 1358, 1948 LPT2, 58, 644
JISC, 1948 LRC,679,680,68!,682,683,684,685,686, 1948
joliet, 540 LSR,622,623,624,625,634,635,636,639
joypad, 516 LUC, 1247
]PEG, 25, 1358, 1367, 1948, 1969 LZ coding, 1386, 1475, 1948, 1969
keep-alive, 1154 LZS, 1875
Index 1991
MR, 1429 loadable modules, I 021, 1488
multicast, 705, 971,983, 1039, 1160, 1947, 1970 NCP, 1023, 1026, 1028, 1031, 1032, 1489,
multidrop, 610, 628, 692 1490, 1492-1494, 1496, 1506, 1949
multiplexing, 452, 505,611,641,854, 877, 878, NLMs, 1021, 1488
913, 1005, 1946, 1952, 1962 protocols, I 023, 1489
multiprocessing, 43, 60, 1457, 1555 SAP, 775, 1023-1030, 1040, 1489, 1492, 1493,
multi-station access unit, 749, 778, 829, 830, 1948 1504, 1951, 1972
multitasking, 38, 39, 41, 43,45--47, 52, 53, 60, 62, setup, 1032
65, 66, 76,727, 1441, 1457, 1791 SMP, 1507
co-operative, 46, 47 VLM, 1506
pre-emptive, 43, 46, 47, 60, 1457 network,
multi-threading, 43, 47, 53 addresses, 14, 735, 736, 738, 741, 882, 915, 971,
MlD<,497, 505,843,1873,1944 981, 988, 1029, 1103, 1144, 1406, 1412,
NACK, 867 1460, 1461, 1927, 1957, 1968
NAK, 687, 1733, 1949 connection, 517
name resolution, 736 information center, 972, 1174
NCP packet format, I 032, 1494 layer, 729, 730-741, 776, 848, 878, 885, 894,
NCSA, 1367, 1371, 1931, 1949 963, 966, 999-100 I, I 004, I 020, 1023, 1162,
NDIS, I 032, 1442, 1949, 1970 1442, 1443, 1487, 1489, 1957, 1963
NDS, 1020, 1441, 1494-1506, 1548, 1949 layer, 776, 878, 885, 1004, I 020, 1023, 1442,
bindery services, 1022, 1488, 1503, 1504 1443, 1487, 1489
country object, 1496, 1497, 1502 malfunctions, 83 7
ex, 780, 789, 15oo, 1so 1 malfunctions, 83 7
naming syntax, 1499 management, 714, 747, 787, 825, 826, 854, 1021,
object names, 1499 1393, 1394, 1403, 1487, 1495, 1951
structure, 1496, 1498 management, 747, 787, 825, 826, 1021, 1462,
timestamp, 1505 1487
tree, 1496-1499 operating systems, I, 1441, 1457, 1487, 1543,
user class, 1503 1571, 1607, 1629, 1661, 1675, 1693, 1713
VLMs, 1506 topologies, 744
NetBEUI, 45, 771, 907, 1003, 1035, 1442, 1443, topologies, 744
1944 topology, 734, 982
NetBIOS traffic, 697, 747, 753, 779, 794, 814, 819, 825,
name rypes, 1927 862,864,990, 1027-1029,1161, 1172,1377,
netstat, 1012, 1017, 1069, 1070, 1071, 1430, 1929 1393, 1491, 1492, 1495, 1504, 1506, 1507,
NetstatiiPConfig, 1070 1960
NetWare, 2, 33, 38, 39, 41, 45, 63, 549, 730, 734, transport protocol, 1348
735,771,775,776,819, 1003, 1019-1028, 1031, Types and Cables, 743
1032,1033,1197,1349,1441,1442,1487,1488- NETx, 1021, 1031, 1032, 1033, 1487, 1493, 1506
1497, 1501-1507, 1881, 1932, 1949, 1968, 1970, NFS, 985, 1008, 1427, 1431, 1432, 1435, 1437,
1971 1457, 1461, 1495, 1872, 1880, 1883, 1970
4.1, 1023, 1028, 1489, 1492, 1494, 1495, 1503, RPC, 73, 1066, 1462, 1887, 1951
1505-1507 XDR, 18,736, 1480, 1485, 1872, 1887, 1953
architecture, I 021, I 022, 1487, 1488 nfsd, 1431, 1432
bindery services, 1022, 1488, 1503, 1504 nibble, 13
container obects, 1495 NIC, 733-735,753,771,775,783,787,791,800,
directory services, 1023, 1489, 1495 972,1021,1032, 1033,1174,1442, 1487,1949,
leaf objects, 1495 1957, 1959, 1967
Index 1993
adaptive delta modulation, 1957 1128,1372,1374, 1390,1439,1440, 1565,1567,
delta modulation, 888, 1963 1625, 1626, 1642, 1643
low-delay CELP, 888 port number, 818, 1005, 1006, 1008, 1012, 1070,
PCMCJA, I, 437, 444, 445, 563-565, 566, 568, 569, 1075, 1082, 1091, 1102, 1107, 1186, 1192, 1372.
775,907 1625
interface controller, 565 portmap, 1432
register, 565 ports and sockets, I 006
type II/III/IV, 445, 563 post office protocol. 1362
PCM-TDM, 847, 849, 879 postscript, 1367, 1883
pcnfsd, 1435 PPSDN, 1950
PDN, 891, 1949 preamble, 700, 773-779, 801, 837, 838, 910
PDU, 741, 859-862, 964 pre-emptive, 52, 53, 60, 66, 69, 71, 1457
peer-to-peer, 23, 31, 32, 33, 63,691,697, 727, 905, multitasking. 46, 47, 60, 1457
1010, 1441, 1446 presentation layer, 729,730, 736, 1219, 1480
PGP, 1221, 1252-1258, 1265-1267, 1876, 1949 primary rate access, 878
authentication, 1265 print servers, 1441
key management options, 1254 priority scheduling, 71
Pl1P,929,930,932, 1607-1627,1631 private-key, 1220, 1222, 1224, 1236, 1242, 1247-
Pl1Y,834,844,857,913, 1949 1250, 1253-1256, 1259, 1260, 1262, 1265, 1266,
ph~iaU,610,699, 706,730,732,734,777,778, 1271
800,834,836,844,912,913,963,1040,1071, probability, 709, 1162, 1225, 1228, 1229, 1244,
1072, 1193, 1442, 1965, 1971 1800, 1962, 1967
addresses, 734 process scheduling. 52, 53
layer, 690, 699, 701, 705-707, 729-733, 738, process status, 77
777, 782, 789, 790, 843, 857, 858, 878, 879, processes, 42, 43, 65, 68, 72, 81
892,894,1442,1949,1974 producer-consumer problem, 1553, 1573
media dependent, 834 programmable interrupt controller, 56, 521,636, 637,
Ph~iaU signaling (PLS), 778 649,652,1791
PIC, 56,636, 1791 PROM, 1945, 1946
ping,963,989, 1026,1063,1065,1066,1069,1158, proxy, I, 919, 1121, 1185, 1186, 1187, 1188, 1271,
1159, 1929, 1931, 1949, 1971 1274, 1380, 1383, 1388, 1413, 1652, 1959
pipelined, 492, 503, 596, 597, 599, 601, 602, 1790 ps (process status), 77
pipes, 73, 74, 1474 PSK, 1945, 1950, 1970, 1971
PISO, 1949 PSTN, 891, 1731, 1882, 1885, 1950
PKP, 1221, 1949 public telephone network, 877, 891, 1370
plaintext, 1221, 1224, 1228, 1236, 1237, 1242, 1247, public-key, 1220-1224, 1236, 1247-1249, 1254,
1253, 1254, 1262, 1376 1256, 1257. 1265, 1949, 1952
PLL,801,802, 1949,1971 pulse distortion, 629
plug-and-play, 45,467,484,488,490, 511, 571 pulse shaping, 791
PMD,834,844, 1950 QAM, 1950
point-to-point protocol. 827, 966, 1071, 1158-1160, QCIF, 1950
1190, 1874-1879, 1882-1884, 1886, 1947, 1950, QIC, 541, 1950
1962, 1971 QoS,613, 790,847,856,862,863,913,986,1950,
polarization, 537, 1369 1956
poll/final bit, 883 quanta time slice, 43
port, 8, 50, 57, 58, 74, 509, 513, 516, 518, 522, 530, quantization, 1799, 1971
532,583,586,589-592,595-601,606,641-675, process, 1971
907, 1024,1029, 1070, 1075, 1076, 1078-1117, RAID, 613, 1444, 1445, 1950
Index 1995
RS-422, 615,627,629,630, 1972 host, 551,612
RS-422A, 627 10,549,551,554
RS-423, 627, 630 interface, 525, 528, 550
RS-449,615,627, 1972 logical unit number, 559
RS-485,445,627-631,689,690, 707,1972 message codes, 55 7
RSA, 1221, 1222, 1236, 1237, 1247-1255, 1259, message format, 556
1266, 1269, 1276, 1346, 1882, 1884, 1951 message system, 5 56
key generation, 1255 operation, 553
program, 1249 P-cable, 550
RSVP, 790, 791, 1951 tagged command queue, 549, 550
RTF, 1951 50,530,543,700,826,837,838,1446,1951
RTS, 6!6-620, 628,631,910, 1725, 1730, 1731 SOH, 858, 864,917, 918, 1879, 1950, 1951
RTU, 678-682 SECAM, 1951
run-length encoding, 660, 672, 1795, 1796, 1950, second- level cache, 502
1972 secondary scheduler, 75
running-config, 115 5 secret-key, 1193, 1220, 1222, 1235, 1254-!267
S/PDIF, 1951 sectors, 526, 527, 532-539, 544-547, 1201
SABME, 873, 884, 1951 secure socket layer, 1267, 1268
SAC, 1951 security, I, 543, 921, 1005, 1016, 1193, 1197, 1221,
SAFER, 1237 1237, 1269, 1273, 1274, 1346, 1445, 1449
sampling, 447, 448, 457, 587, 713, 847, 848, 887, hardware, 1198
888, 1358, 1945, 1963 permissions, 543, 14 51
SAP packet format, 1029, 1031, 1493 policies, 1197
SAP!, 882, 886, 1951 settings, 1274
satellite TV, 756, 1513 zones, 1273
SB-ADCMP, 1951 segment switch, 814, 815
s-box, 1240, 1241, 1242 segmentation, 857, 859
scalability, 61 0, 784 semaphore, 72
scheduler, 65-73, 75, 1436, 1437 semaphore values, 1553
long-term, 67 sensor, 537, 695, 697
medium-term, 67 sequence number prediction, 1194
primary, 75 serial communications, 437, 446, 615, 627, 633, 644,
secondary, 75 719, 1972
short-term, 67 serial copy management, 1951
scheduling, 40, 51, 52, 53-54, 66-75, 573, 694, 696, service quality, 849
1935 session hi-jacking, 1194
algorithms, 68 session layer, 729, 730, 736, I 004
multilevel queue, 71 shielded twisted pair, 580, 825, 830, 1961
priority, 71 shielding, 754
queues, 67 shortest-job-first, 70
SCMS, 1951 S-HTTP, 1267, 1271
scrambled, 1219 signal-to-noise ratio, 791, 1800, 1952
SCSI, 437, 445, 446, 450, 467, 525-529, 549-562, SIMMs, 492, 496
577,578,609-613,715,1951 simplex, 1972
A-cable, 550 single-tasking, 41, 65
B-cable, 550 SIPO, 1951
commands, 558 SIPP, 984, 1951
Fast/wide, 5 50 skin effect, 30
Index 1997
TCP, 3, 33, 39, 41, 45, 49, 50, 60, 63,609,724, ports and sockets, I 006
730,731,736,749,771-776,848,857,907,963- protocols, 1460, 1973
968,984,986,988,991,992,999-1039.1063, services reference, I 0 I 7
1065-1075, 1082, 1087, 1088, 1092, 1094, 1095, version number, 966
1098, 1102, 1156, 1160, 118~ 1186,1192,1194, TCP/UDP, 1004, 1035, 1429, 1430
1219, 1268, 1346, 1349-1352, 1367, 1376, 1383, TD,616-624,631, 799,1667-1670
1394, !405, !406, 1408, 1412, 1417, 1429-1431, TDAC, 1952
!442, 1443, 1457-1461, 1487, 1490, 1492, 1494, TDI, 451,466,483, 1442, 1443
1506, 1507, 1871-1879, 1884, 1887, 1927-1930, TOM, 847, 849, 879, 1952
1936, 1948, 1952, 1960, 1966-1973 TE,620, 880,881,882,885,886,1246
connection, I 009 TEI,882,883,884,886, 1952
connection states, I 011 telnet, I, 23, 34, 39, 730, 736, 963, 985, 999, 1005-
header format, 1005, 1006, 1007 1010, 1017, 1063, 1090, 1071, 1094, 1100, 1101,
internets, 968 1117,1118,1144, 1152,1157,1159,1160,1186,
ISN selection, I 013 1192-1196,1219,1268,1367,1372,1416-1418,
opening and closing a connection, I 014 1430, 1440, 1461, 1872, 1873, 1880, 1930, 1952,
ports and sockets, I 006 1973
Protocol Data Unit, 964, 1005 thread, 43, 48, 49, 51, 53, 75, 1200
sequence numbers, 1005, 1009, 1012 threading, 47
specification, I 009 threads, 48, 75
TCB parameters, 1012, 1013 three-way handshake, 1010, 1013, 1014
user commands, 1015 throughput, 53,439,444,447,449, 511, 715, 729,
TCP user commands 740,783,784,787,814,847,896,901,966,1025,
ABORT, 1011, 1017 1172, 1200
CLOSE, 1009-1016, 1071, 1122, 1124, 1617, TIFF, 1882, 1887, 1952, 1973
1619, 1621, 1623, 1624 time
OPEN, 1009-1011, 1015, 1089, 1091, 1095, server types, 1505
1180-1183 synchronization, 1504
RECEIVE, 73, 74,799, 1009-1011, 1014, 1016 timer, 51, 57, 58, 66, 532,605,606,923,929, 1636,
SEND, 73, 74, 1009-1011, 1016, 1122, 1351 1655
STATUS,646,647,648,650, 1010,1011,1017 timestamp, 990, 991, 995, 996, 1069, 1265, 1505,
TCP/IP, 3, 33, 39, 41, 45, 49, 50, 60, 63, 609, 724, 1939, 1940
730,736,749,771,773,775.776,857.907,963- timing attack, 1247
968,988,999-1004,1017,1020,1021,1028, token ring, 63, 612, 731, 743, 746-749, 762, 764,
1033, 1035, 1038, 1039, 1063, 1065, 1066, 1069, 771,786,806,817,825-834,840,843,847,874,
I 070, I 073, 1102, 1185, 1186, 1192, 1194, 1268, 963,964,968,981,1024,1404,1442,1490,1873,
1346, 1349, 1367, 1376, 1394, 1405, 1406, 1408, 1955, 1957. 1961, 1964, 1970, 1973
1412, 1429, 1442, 1443, 1457. 1460, 1487, 1492, adding to the ring, 748, 828
1494, 1506, 1507, 1871-1873, 1879, 1927, 1928, cable, 825
1929, 1930, 1960, 1966-1973 deletion from ring, 748, 828
class A, 969, 973 fault management, 749, 828
class B, 859, 969, 970, 973 jitter suppression, 831
class C, 859, 969, 973 maintenance, 748, 828
commands, !063 MAUs, 749, 778, 825, 829-831, 1881, 1948,
gateways and hosts, 964, 968, I 028, 1492 1959. 1970
implementation, 968 ring initialization, 748, 828
internets, 968 topology,447,571,578,579,580,6!2,613,614,
model, 1003, 1004 69!,692,693, 743-750,753.764,766,772,783,
Index 1999
WINS, 1036, 1071, 1412, 1413, 1447, 1927, 1932, X/Open, 61, 1457
1953 X3T9.5, 841,844, 1974
WinSock, 1015, 1073, 1074, 1082, 1083, 1085, XDbus, 1793
I 086, 1127, 1390, 1443 XDR, 18,736, 1480, 1485, 1953
WINSOCK.DLL, 49, 50, 1443 X-OFF/ON, 619,628, 1974
WINSOCK32.DLL, 1443 XOR,646,682, 1230,1232,1233,1235-1237,
wireless, 26, 905-913 1240, 1241, 1243, 1444, 1953
wiring closets, 763, 766 X-Windows, 3, 39,981, 1457, 1461, 1470, 1872,
workgroups, 62, 1446, 1448, 1495 1873
WorldFIP, 690, 691,699-703 ypinit, 1434
WORM, 525, 538, 1953 ypwhich, 1434
X.21,892, 893,1974 YIN, 499
X.25,867, 874,892,894,897-903,1151,1160, zero bit-stuffing, 882, 883
1174, 1948, 1950, 1970, 1974 ZIP, 1367, 1384, 1953
X.400, 1348, 1349, 1974