Abstract: A docking station for a mobile cleaning robot can include a canister and a base configured to receive the mobile cleaning robot thereon, where the base can include a front portion and a back portion opposite the front portion. The base can include a vacuum port extending at least partially through the base. The canister can be connected to the back portion of the base and can be located at least partially above the base. The canister can include a debris bin connected to the vacuum port to receive debris therefrom and a fan compartment connected to a side wall of the debris bin and including a fan system operable to draw debris through the vacuum port and the debris bin.

Abstract: Methods for load rebalancing by clients in a network are disclosed. Client load rebalancing allows the clients to optimize throughput between themselves and the resources accessed by the nodes. A network, which implements this embodiment of the invention, can dynamically rebalance itself to optimize throughput by migrating client I/O requests from over_utilized pathways to under_utilized pathways. Client load rebalancing allows a client to re-map a path through a plurality of nodes to a resource. The re-mapping may take place in response to a redirection command from an overloaded node.

Abstract: Methods for load rebalancing by clients in a network are disclosed. Client load rebalancing allows the clients to optimize throughput between themselves and the resources accessed by the nodes. A network which implements this embodiment of the invention can dynamically rebalance itself to optimize throughput by migrating client I/O requests from overutilized pathways to underutilized pathways.

Abstract: Methods for load rebalancing by clients in a network are disclosed. Client load rebalancing allows the clients to optimize throughput between themselves and the resources accessed by the nodes. A network, which implements this embodiment of the invention, can dynamically rebalance itself to optimize throughput by migrating client I/O requests from over utilized pathways to under utilized pathways. Client load rebalancing allows a client to re-map a path through a plurality of nodes to a resource. The re-mapping may take place in response to a redirection command from an overloaded node.

Abstract: Methods for operating a network as a clustered file system is disclosed. The methods involve client load rebalancing, distributed Input and Output (I/O) and resource load rebalancing. Client load rebalancing refers to the ability of a client enabled with processes in accordance with the current invention to remap a path through a plurality of nodes to a resource. Distributed I/O refers to the methods on the network which provide concurrent input/output through a plurality of nodes to resources. Resource rebalancing includes remapping of pathways between nodes, e.g. servers, and resources, e.g. volumes/file systems. The network includes client nodes, server nodes and resources. Each of the resources couples to at least two of the server nodes.

Abstract: A distributed project management system is disclosed. In this embodiment multiple clients on a network share control over and responsibility for a project defined in a project management folder that is stored on the network and that is accessible by the clients. The project management folder contains one or more records each including source and destination file names and application program code. Each client on the network executes a management process to locate the project management folders and to undertake using their resident applications those records which are both incomplete and which call for an application found on the processing client.

Abstract: Methods for load balancing a network are disclosed. Resource rebalancing includes remapping of pathways between nodes, e.g. servers, and resources, e.g. volumes/file systems. Resource rebalancing allows the network to reconfigure itself as components come on-line/off-line, as components fail, and as components fail back. In an embodiment of the invention a method for load balancing on a network is disclosed. The network includes server nodes and resources. Each of the resources are coupled to at least two of the server nodes. The method for load balancing comprises the acts of detecting a change in an availability of the server nodes; defining a first set of available server nodes and a second set of available resources and selecting for each one of the members of the second set a corresponding member of the first set to server as the administrative server for handling an administrative portion of an I/O request for the corresponding resource of the second set.

Abstract: The current invention provides a method for improving throughput to or from a resource by allowing multiple servers to concurrently access the resource without affecting the integrity of the resource. Generally, by allowing one server to handle the administrative management of a resource, while allowing all servers, including the administrative server, to handle the actual passing of data associated with the I/O request, allows for increased bandwidth between clients and the resource. An I/O request to a first server node is converted into an access portion and a data transfer portion. The access portion is passed to a corresponding administrative server node for the resource. Subsequently, the administrative server may issue an access grant to the first server node. In response, the first server completes the data transfer for the resource.

Abstract: A distributed database-management system is disclosed in which multiple clients on a network share control over and responsibility for the coherency of a shared database with multiple records. The clients arbitrate between each other for exclusive editing access to each of the fields within each record. The database-management system includes lock fields associated with each field in the multiple records. Each client executes a resident coherency process which is responsive to a request to edit a field. The process grants the request if there is not a field lock on the field. When the request is granted the coherency process asserts exclusive ownership of the field by placing a lock on the field. The coherency process is also responsive to a request to exit editing the field and in response thereto de-asserts exclusive ownership of the field.

Abstract: A distributed volume management system is disclosed in which clients on a network share responsibility for the coherency of a data storage volume. The system includes: a control table which includes availability indicia for indicating whether the control table is available and identification indicia for indicating ownership of the data storage volume. The system also includes control processes each executed on a client. The control processes request and acquire exclusive ownership of the control table to provide to the clients exclusive write access to the data storage volume.