Abstract: A software network bridge which allows connected network segments to be presented as a single network unit to the host computer. The software bridge can be implemented as an intermediate network driver, abstracting multiple network segments into a single network interface for higher level protocols and applications. The intermediate network driver can simultaneously send the same data packet through multiple network interfaces by creating multiple packet descriptors, each pointing to the same data, but each given individually to the underlying network interfaces to control during their transmission.

Abstract: A software network bridge is disclosed which allows the connected network segments to be presented as a single network unit to the host computer. The software bridge can be implemented as an intermediate network driver, abstracting multiple network segments into a single network interface for higher level protocols and applications. While the intermediate network driver acts as a software bridge implementing the Spanning Tree Algorithm, it also acts a network interface driver to higher level protocols, conglomerating information from the multiple underlying network interface cards and forwarding along commands from the higher level software to the appropriate network interface card. The intermediate network driver can also simultaneously send the same data packet through multiple network interfaces by creating multiple packet descriptors, each pointing to the same data, but each given individually to the underlying network interfaces to control during their transmission.

Abstract: A software network bridge is disclosed which allows the connected network segments to be presented as a single network unit to the host computer. The software bridge can be implemented as an intermediate network driver, abstracting multiple network segments into a single network interface for higher level protocols and applications. While the intermediate network driver acts as a software bridge implementing the Spanning Tree Algorithm, it also acts a network interface driver to higher level protocols, conglomerating information from the multiple underlying network interface cards and forwarding along commands from the higher level software to the appropriate network interface card. The intermediate network driver can also simultaneously send the same data packet through multiple network interfaces by creating multiple packet descriptors, each pointing to the same data, but each given individually to the underlying network interfaces to control during their transmission.

Abstract: A method and system allows nodes on different segments to communicate with one another as if they were on a single segment. In one implementation, an intermediate computer linked in communication with the different segments relays data between the nodes and selectively substitutes the hardware addresses of its own network interface cards for the hardware addresses of the nodes themselves. The nodes are then able to communicate with one another using hardware addresses of the intermediate computer while still using their own network addresses.

Abstract: A dynamic resource allocation scheme is disclosed which allows flexibility in granting resources to a requestor, while maintaining a safety buffer should other requesters need resources. A portion of available resources are declared to be a “safety buffer”, and all of the available resources are divided amongst the requesters. The resulting divisions are each requestors “fair share”. A requestor is granted resources so long as their resource usage is less than their fair share and so long as there are any available resources. A requestor is also granted resources, even if they are currently exceeding their fair share if the available resources exceed the safety buffer. The application of these two rules results in a dynamic resource allocation scheme which decreases the number of times a request is denied without unfairly limiting the access to resources by other requesters.

Abstract: A method and system allows nodes on different segments to communicate with one another as if they were on a single segment. In one implementation, an intermediate computer linked in communication with the different segments relays data between the nodes and selectively substitutes the hardware addresses of its own network interface cards for the hardware addresses of the nodes themselves. The nodes are then able to communicate with one another using hardware addresses of the intermediate computer while still using their own network addresses.

Abstract: A software network bridge is disclosed which allows the connected network segments to be presented as a single network unit to the host computer. The software bridge can be implemented as an intermediate network driver, abstracting multiple network segments into a single network interface for higher level protocols and applications. While the intermediate network driver acts as a software bridge implementing the Spanning Tree Algorithm, it also acts a network interface driver to higher level protocols, conglomerating information from the multiple underlying network interface cards and forwarding along commands from the higher level software to the appropriate network interface card. The intermediate network driver can also simultaneously send the same data packet through multiple network interfaces by creating multiple packet descriptors, each pointing to the same data, but each given individually to the underlying network interfaces to control during their transmission.

Abstract: A dynamic resource allocation scheme is disclosed which allows flexibility in granting resources to a requestor, while maintaining a safety buffer should other requesters need resources. A portion of available resources are declared to be a “safety buffer”, and all of the available resources are divided amongst the requesters. The resulting divisions are each requestors “fair share”. A requestor is granted resources so long as their resource usage is less than their fair share and so long as there are any available resources. A requestor is also granted resources, even if they are currently exceeding their fair share if the available resources exceed the safety buffer. The application of these two rules results in a dynamic resource allocation scheme which decreases the number of times a request is denied without unfairly limiting the access to resources by other requesters.