Gecko [ lms.clinion.com ]

Name	Size	Permission
NAT-HOWTO-1.html	1.05 KB	-rw-r--r--
NAT-HOWTO-10.html	2.39 KB	-rw-r--r--
NAT-HOWTO-11.html	836 B	-rw-r--r--
NAT-HOWTO-2.html	4.17 KB	-rw-r--r--
NAT-HOWTO-3.html	1.34 KB	-rw-r--r--
NAT-HOWTO-4.html	4.22 KB	-rw-r--r--
NAT-HOWTO-5.html	4.95 KB	-rw-r--r--
NAT-HOWTO-6.html	8.13 KB	-rw-r--r--
NAT-HOWTO-7.html	1.22 KB	-rw-r--r--
NAT-HOWTO-8.html	1.04 KB	-rw-r--r--
NAT-HOWTO-9.html	1.97 KB	-rw-r--r--
NAT-HOWTO.html	2.53 KB	-rw-r--r--
packet-filtering-HOWTO-1.html	1.77 KB	-rw-r--r--
packet-filtering-HOWTO-10.html	2.44 KB	-rw-r--r--
packet-filtering-HOWTO-11.html	3.58 KB	-rw-r--r--
packet-filtering-HOWTO-2.html	1.48 KB	-rw-r--r--
packet-filtering-HOWTO-3.html	5.57 KB	-rw-r--r--
packet-filtering-HOWTO-4.html	2.07 KB	-rw-r--r--
packet-filtering-HOWTO-5.html	1.53 KB	-rw-r--r--
packet-filtering-HOWTO-6.html	3.35 KB	-rw-r--r--
packet-filtering-HOWTO-7.html	34.71 KB	-rw-r--r--
packet-filtering-HOWTO-8.html	1.35 KB	-rw-r--r--
packet-filtering-HOWTO-9.html	2.21 KB	-rw-r--r--
packet-filtering-HOWTO.html	2.69 KB	-rw-r--r--

Code Editor : packet-filtering-HOWTO-6.html

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
<HTML>
<HEAD>
 <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.72">
 <TITLE>Linux 2.4 Packet Filtering HOWTO: How Packets Traverse The Filters</TITLE>
 <LINK HREF="packet-filtering-HOWTO-7.html" REL=next>
 <LINK HREF="packet-filtering-HOWTO-5.html" REL=previous>
 <LINK HREF="packet-filtering-HOWTO.html#toc6" REL=contents>
</HEAD>
<BODY>
<A HREF="packet-filtering-HOWTO-7.html">Next</A>
<A HREF="packet-filtering-HOWTO-5.html">Previous</A>
<A HREF="packet-filtering-HOWTO.html#toc6">Contents</A>
<HR>
<H2><A NAME="s6">6.</A> <A HREF="packet-filtering-HOWTO.html#toc6">How Packets Traverse The Filters</A></H2>

The kernel starts with three lists of rules in the `filter' table;
these lists are called firewall chains or just
chains. The three chains are called INPUT,
OUTPUT and FORWARD.

The three circles represent the three chains mentioned above. When
a packet reaches a circle in the diagram, that chain is examined to
decide the fate of the packet. If the chain says to DROP the packet,
it is killed there, but if the chain says to ACCEPT the packet, it
continues traversing the diagram.

A chain is a checklist of rules. Each rule says `if the packet
header looks like this, then here's what to do with the packet'. If
the rule doesn't match the packet, then the next rule in the chain is
consulted. Finally, if there are no more rules to consult, then the
kernel looks at the chain policy to decide what to do. In a
security-conscious system, this policy usually tells the kernel to
DROP the packet.

<OL>
<LI>When a packet comes in (say, through the Ethernet card) the kernel
first looks at the destination of the packet: this is called
`routing'.
</LI>
<LI>If it's destined for this box, the packet passes downwards
in the diagram, to the INPUT chain. If it passes this, any processes
waiting for that packet will receive it.
</LI>
<LI>Otherwise, if the kernel does not have forwarding enabled, or it
doesn't know how to forward the packet, the packet is dropped. If
forwarding is enabled, and the packet is destined for another network
interface (if you have another one), then the packet goes rightwards
on our diagram to the FORWARD chain. If it is ACCEPTed, it will be
sent out.
</LI>
<LI>Finally, a program running on the box can send network packets.
These packets pass through the OUTPUT chain immediately: if it says
ACCEPT, then the packet continues out to whatever interface it is
destined for.</LI>
</OL>

<HR>
<A HREF="packet-filtering-HOWTO-7.html">Next</A>
<A HREF="packet-filtering-HOWTO-5.html">Previous</A>
<A HREF="packet-filtering-HOWTO.html#toc6">Contents</A>
</BODY>
</HTML>

${this.title}

Code Editor : packet-filtering-HOWTO-6.html