Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
216 words
A method of achieving network separation within a computing system having a plurality of network interfaces, including a first and a second network interface, the method comprising the steps of: defining a plurality of burbs, wherein the plurality of burbs includes a first and a second burb and wherein the first burb includes a fit protocol stack and the second burb includes a second protocol stack separate from the first protocol stack; assigning each of the plurality of network interfaces to one of the plurality of burbs, wherein more than one network interface can be assigned to a particular burb, wherein the step of assigning includes the steps of assigning the first network interface to the first burb and the second network interface to the second burb; binding processes to burbs; and restricting communication between processes bound to different burbs, wherein the of restricting communication between processes includes the steps of: examining a message received by the first network interface; and if the message is to be routed through the second network interface, routing the message up through the first protocol stack to a process bound to the first burb, transferring the message to a process bound to the second burb and routine the message down through the second protocol stack to the second network interface.
Claim 2
Independent Claim
216 words
A method of achieving network separation within a computing system having a plurality of network interfaces, including a first and a second network interface, the method comprising the steps of: defining a plurality of burbs, wherein the plurality of burbs includes a first and a second burb and wherein the first burb includes a fit protocol stack and the second burb includes a second protocol stack separate from the first protocol stack; assigning each of the plurality of network interfaces to one of the plurality of burbs, wherein more than one network interface can be assigned to a particular burb, wherein the step of assigning includes the steps of assigning the first network interface to the first burb and the second network interface to the second burb; binding processes to burbs; and restricting communication between processes bound to different burbs, wherein the of restricting communication between processes includes the steps of: examining a message received by the first network interface; and if the message is to be routed through the second network interface, routing the message up through the first protocol stack to a process bound to the first burb, transferring the message to a process bound to the second burb and routine the message down through the second protocol stack to the second network interface.
Claim 3
Dependent Claim
94 words
The method according to claim 1, wherein the step of restricting communication between processes includes the steps of: preventing a process from accessing burbs other than the burb to which the process is bound; limiting transfer of incoming packets such that incoming packets can only go to processes bound to the burb associated with the network interface the packet arrived on; defining a proxy; and ensuring that data passing from the first network interface to the second network interface must pass through the proxy before moving from the first burb to the second burb.
Claim 4
Dependent Claim
42 words
The method according to claim 1, wherein each burb has its own routing table and wherein the step of restricting communication includes the step of examining an incoming packet to determine if its destination is an address in the burb's routing table.
Claim 5
Dependent Claim
65 words
The method according to claim 1, wherein the step of restricting communication includes the steps of: defining a plurality of types; assigning each data object to one of the plurality of types, wherein the step of assigning data objects includes defining type enforcement rules for accesses by processes to said data objects; and applying a type enforcement check of accesses by processes to data objects.
Claim 6
Dependent Claim
110 words
A secure server, comprising: an operating system kernel; a plurality of network interfaces which communicate with the operating system kernel; and a plurality of burbs, including a first and a second burb; wherein each network interface is assigned to one burb from the plurality of burbs, wherein each burb includes a separate protocol stack for handling communication across the network interface, wherein each protocol stack is associated with only one burb, wherein a first protocol stack is associated with the first burb, and wherein communication from a process bound to the first burb must pass through the first protocol stack to a proxy before being sent to the second burb.
Claim 7
Dependent Claim
110 words
A secure server, comprising: an operating system kernel; a plurality of network interfaces which communicate with the operating system kernel; and a plurality of burbs, including a first and a second burb; wherein each network interface is assigned to one burb from the plurality of burbs, wherein each burb includes a separate protocol stack for handling communication across the network interface, wherein each protocol stack is associated with only one burb, wherein a first protocol stack is associated with the first burb, and wherein communication from a process bound to the first burb must pass through the first protocol stack to a proxy before being sent to the second burb.
Claim 8
Dependent Claim
40 words
The secure server according to claim 5, wherein each burb has its own routing table and wherein each burb further includes means for examining an incoming packet to determine if its destination is an address in the burb's routing table.
Claim 9
Dependent Claim
51 words
The secure server according to claim 5, wherein the operating system kernel includes type enforcing means for applying a type enforcement check of accesses by processes to data objects, wherein the type enforcing means includes type defining means for defining the modes and consequences of accesses by processes to data objects.
Claim 10
Dependent Claim
22 words
The secure server according to claim 5, wherein the operating system further includes a domain interaction table which enforces interactions between processes.
Claim 11
Dependent Claim
50 words
The method according to claim 2, wherein the step of preventing a process from accessing burbs other than the burb to which the process is bound includes the step of limiting each single user process to sending and receiving information from only one burb during the lifetime of that process.