Abstract: A coverage robot including a chassis, multiple drive wheel assemblies disposed on the chassis, and a cleaning assembly carried by the chassis. Each drive wheel assembly including a drive wheel assembly housing, a wheel rotatably coupled to the housing, and a wheel drive motor carried by the drive wheel assembly housing and operable to drive the wheel. The cleaning assembly including a cleaning assembly housing, a cleaning head rotatably coupled to the cleaning assembly housing, and a cleaning drive motor carried by cleaning assembly housing and operable to drive the cleaning head. The wheel assemblies and the cleaning assembly are each separately and independently removable from respective receptacles of the chassis as complete units.

Abstract: Implementations generally relate to data transmission in networks. In some implementations, a method includes receiving a first management protocol message from a first edge device, where the first management protocol message includes first edge device information associated with the first edge device, receiver device information associated with a receiver device, and a request by the receiver device to receive multicast data. The method also includes receiving a second management protocol message from a second edge device, where the second management protocol message includes second edge device information associated with the second edge device and sender device information associated with a sender device. The method also includes enabling unicast communication between the sender device and the receiver device based on the first management protocol message and the second management protocol message.

Abstract: This application relates to apparatus and methods for determining, assigning, and displaying order deliveries. In some examples, a computing device may obtain order data identifying at least one order for delivery during a timeslot. The computing device may transmit, to a driver's computing device, a request for deliveries for a first price during the timeslot. The computing device may receive, from the driver's computing device, a response accepting the request. The computing device may then assign the driver to the order, and determine a delivery status based on the assignment of the first driver to the first order. The delivery status may identify, for example, that the order has been assigned to the driver, an estimated delivery time, the number of items being delivered, the weight of the items, and a route taken by the driver. The computing device may also display the delivery status.

Abstract: This application relates to apparatus and methods for determining, assigning, and displaying order deliveries. In some examples, a computing device may obtain order data identifying at least one order for delivery during a timeslot. The computing device may transmit, to a driver's computing device, a request for deliveries for a first price during the timeslot. The computing device may receive, from the driver's computing device, a response accepting the request. The computing device may then assign the driver to the order, and determine a delivery status based on the assignment of the first driver to the first order. The delivery status may identify, for example, that the order has been assigned to the driver, an estimated delivery time, the number of items being delivered, the weight of the items, and a route taken by the driver. The computing device may also display the delivery status.

Abstract: A system and method of automated driver selection is disclosed. A plurality of driver profiles and a first order are received. Each of the driver profiles includes at least one driver parameter. The first order includes at least one order parameter. A driver score is calculated for each of the plurality of driver profiles for the first order. The driver score is calculated based on the at least one driver parameter and the at least one order parameter. Each driver profile is ranked based on the calculated driver score and a first delivery assignment request is transmitted to a system associated with a first-ranked driver profile. A response is received to the first delivery assignment request.

Abstract: Broad cerebrospinal fluid (CSF) distribution of an agent is achievable by delivering the agent in a liquid formulation to the CSF at flow rates less than 500 microliters per hour, such as between about 2 microliters per hour and about 100 microliters per hour.

Abstract: Broad cerebrospinal fluid (CSF) distribution of an agent is achievable by delivering the agent in a liquid formulation to the CSF at flow rates less than 500 microliters per hour, such as between about 2 microliters per hour and about 100 microliters per hour.

Abstract: A coverage robot including a chassis, multiple drive wheel assemblies disposed on the chassis, and a cleaning assembly carried by the chassis. Each drive wheel assembly including a drive wheel assembly housing, a wheel rotatably coupled to the housing, and a wheel drive motor carried by the drive wheel assembly housing and operable to drive the wheel. The cleaning assembly including a cleaning assembly housing, a cleaning head rotatably coupled to the cleaning assembly housing, and a cleaning drive motor carried by cleaning assembly housing and operable to drive the cleaning head. The wheel assemblies and the cleaning assembly are each separately and independently removable from respective receptacles of the chassis as complete units.

Abstract: A coverage robot including a chassis, multiple drive wheel assemblies disposed on the chassis, and a cleaning assembly carried by the chassis. Each drive wheel assembly including a drive wheel assembly housing, a wheel rotatably coupled to the housing, and a wheel drive motor carried by the drive wheel assembly housing and operable to drive the wheel. The cleaning assembly including a cleaning assembly housing, a cleaning head rotatably coupled to the cleaning assembly housing, and a cleaning drive motor carried by cleaning assembly housing and operable to drive the cleaning head. The wheel assemblies and the cleaning assembly are each separately and independently removable from respective receptacles of the chassis as complete units.

Abstract: Implementations generally relate to data transmission in networks. In some implementations, a method includes determining communication paths in a network, where the communication paths connect a plurality of network nodes, and where the network nodes include one or more edge devices and one or more core devices. The method further includes determining if a forwarding information base (FIB) is permitted at at least one network node. The method further includes filtering one or more packets at the at least one network node if the FIB is not permitted. The method further includes enabling traffic flow of one or more packets at the at least one network node if the FIB is permitted.

Abstract: Implementations generally relate to data transmission in networks. In some implementations, a method includes determining communication paths in a network, where the communication paths connect a plurality of network nodes, and where the network nodes include one or more edge devices and one or more core devices. The method further includes determining if a forwarding information base (FIB) is permitted at at least one network node. The method further includes filtering one or more packets at the at least one network node if the FIB is not permitted. The method further includes enabling traffic flow of one or more packets at the at least one network node if the FIB is permitted.

Abstract: Implementations generally relate to data transmission in networks. In some implementations, a method includes determining communication paths in a network, where the communication paths connect a plurality of network nodes, and where the network nodes include one or more edge devices and one or more core devices. The method further includes determining if a forwarding information base (FIB) is permitted at at least one network node. The method further includes filtering one or more packets at the at least one network node if the FIB is not permitted. The method further includes enabling traffic flow of one or more packets at the at least one network node if the FIB is permitted.

Abstract: A coverage robot including a chassis, multiple drive wheel assemblies disposed on the chassis, and a cleaning assembly carried by the chassis. Each drive wheel assembly including a drive wheel assembly housing, a wheel rotatably coupled to the housing, and a wheel drive motor carried by the drive wheel assembly housing and operable to drive the wheel. The cleaning assembly including a cleaning assembly housing, a cleaning head rotatably coupled to the cleaning assembly housing, and a cleaning drive motor carried by cleaning assembly housing and operable to drive the cleaning head. The wheel assemblies and the cleaning assembly are each separately and independently removable from respective receptacles of the chassis as complete units.

Abstract: Implementations generally relate to data transmission in networks. In some implementations, a method includes receiving a first management protocol message from a first edge device, where the first management protocol message includes first edge device information associated with the first edge device, receiver device information associated with a receiver device, and a request by the receiver device to receive multicast data. The method also includes receiving a second management protocol message from a second edge device, where the second management protocol message includes second edge device information associated with the second edge device and sender device information associated with a sender device. The method also includes enabling unicast communication between the sender device and the receiver device based on the first management protocol message and the second management protocol message.

Abstract: Implementations generally relate to network services. In some implementations, a method includes providing a network service having a service mode and a service type. The method further includes generating a network service advertisement message including a service identifier, a service mode portion, and a service type portion. The method further includes-forwarding the network service advertisement message from a first system to one or more other systems via a network. The method further includes-incrementing a counter corresponding to a service mode and a service type pair of each network service advertisement message having a same service identifier. The method further includes, when the counter corresponding to a service mode and a service type pair reaches a predetermined value, blocking configuration of another service having the same service identifier value, service mode and service type as that corresponding to the counter that reached the predetermined value.

Abstract: The present disclosure describes a method for dynamically modifying allocated bandwidth of one or more applications running on a communication device. The method comprises obtaining information regarding one or more applications running on the device, the applications using a communication network of the device; receiving a user input for determining priority levels of the one or more applications; and dynamically distributing bandwidth of a communication network to the one or more applications running on the communication device based on the user input.

Abstract: A coverage robot including a chassis, multiple drive wheel assemblies disposed on the chassis, and a cleaning assembly carried by the chassis. Each drive wheel assembly including a drive wheel assembly housing, a wheel rotatably coupled to the housing, and a wheel drive motor carried by the drive wheel assembly housing and operable to drive the wheel. The cleaning assembly including a cleaning assembly housing, a cleaning head rotatably coupled to the cleaning assembly housing, and a cleaning drive motor carried by cleaning assembly housing and operable to drive the cleaning head. The wheel assemblies and the cleaning assembly are each separately and independently removable from respective receptacles of the chassis as complete units.

Abstract: Systems, methods and computer readable media for network loop detection and prevention are described. Some implementations can include a computerized method comprising detecting, at a first switch, a loop condition in a network, and generating, at the first switch, a localize loop message having an instance count and a path list. The method can also include setting, at the first switch, the instance count of the localize loop message to a first value, and transmitting, from the first switch, the localize loop message to a second switch. The method can further include detecting, at the second switch, a loop in the network; and sending, from the second switch, a localize loop response message to the first switch.

Abstract: Methods, systems and computer readable media for L2 redirection in multi-chassis link access group (LAG) environments are described. In some implementations, the method can include determining, at a core switch, a failure of a link in a split multi-link trunk (SMLT), and building, at the core switch, a table mapping each destination media access control (MAC) address to an incoming split multi-link trunk port. The method can also include sending, from the core switch, a link layer discovery protocol (LLDP) redirect message on a per-destination MAC address and per-source access switch basis. The method can further include maintaining a same mapping for each MAC address not hashed to a cluster peer with the failed link or being mapped to a non-inter switch trunk (IST) port.

Abstract: One or more implementations can include methods, systems and computer readable media for multi-threaded multipath processing. In some implementations, the method can include determining that a next hop for a destination includes a first next hop and a second next hop. The method can also include generating a first packet having a first destination address based on a nickname of a remote switch and on an identifier of a first path. The method can further include generating a second packet having a second destination address based on the nickname of the remote switch and on an identifier of a second path.