Abstract: Methods and apparatus for Internet-scale routing using small-scale border routers and IP tunneling are described. Each border router is directly connected to a transit provider. Routing protocol peerings may be passed via the border routers through tunnels to a routing service; the routing service and the transit provider router(s) appear to be directly adjacent routing peers. The routing service receives routing data from the transit provider(s), maintains the routing data in a routing table, and processes the routing data in the routing table to select best paths. A mapping service may be informed, by the routing service, of a best exit point (or points) for each Internet prefix of each packet to be routed on the Internet. Outbound packets from devices on the network to the Internet, and inbound packets from the Internet to the network devices, may be encapsulated and passed through tunnels as directed by the mapping service.

Abstract: Encapsulated packets including sequencing information may be generated for packets to be transmitted between a source instance and destination instance. The source instance and destination instance may be implemented by different physical hosts linked by multiple network paths. Each encapsulated packet comprises contents of a corresponding packet, and one or more data values selected in accordance with whether sequencing is enable. Sequencing for network transmissions may be selective based at least in part one or more attributes of the source instance or destination instance.

Abstract: A plug may be coupled with a cable and include a fiber ferrule extending from the plug. A biasing mechanism may be arranged to bias a cover toward a covered configuration in which the fiber ferrule is situated within an internal volume defined by the cover and away from an uncovered configuration in which the fiber ferrule is situated at least partially outside of the internal volume defined by the cover. Bristles or other blockers may be positioned along or within a boundary of the internal volume of the cover, may be arranged to block particulate entry through the blockers into the internal volume of the cover in the covered configuration, and may be movable to permit passage of the fiber ferrule through the blockers in response to movement of the cover between the covered configuration and uncovered configuration.

Abstract: Generally described, systems and methods are provided for detecting the impact of network failures. The system collects performance information from a plurality of nodes and links in a network, aggregates the collected performance information across paths in the network, processes the aggregated performance information for detecting failures on the paths, adjusts the set of performance information by removing the performance information for any nodes considered to be associated with performance information that is statistically different from performance information from other nodes at a given location or extrapolates the collected information to other paths, and determines the impact to customers of the network failures detected using the adjusted set of performance information.

Abstract: A method for adjusting capacity in a multi-stage routing network includes monitoring a number of available connections between a router in a first stage of a multi-stage router network and one or more routers in a second stage of the multi-stage router network. Each of the stages of the multi-stage router network may include a plurality of routers. The method may also include detecting that the number of available connections falls below a threshold number. A notification can be sent to one or more routers in a third stage of the multi-stage router network that the router in the first stage is deprioritized. The one or more routers in the third stage can be operated so that communications to the first stage are routed to one or more other routers in the first stage.

Abstract: Generally described, systems and methods are provided for detecting the impact of network failures. The system collects performance information from a plurality of nodes and links in a network, aggregates the collected performance information across paths in the network, processes the aggregated performance information for detecting failures on the paths, adjusts the set of performance information by removing the performance information for any nodes considered to be associated with performance information that is statistically different from performance information from other nodes at a given location or extrapolates the collected information to other paths, and determines the impact to customers of the network failures detected using the adjusted set of performance information.

Abstract: Techniques and solutions for distributing routing updates using timing information are described. For example, inter-device messaging protocols can support timing information (e.g., routing protocols be extended to support timing information). The timing information can indicate a time at which the routing update is to be put into effect where the time decreases the further away a given routing device is from the source of the routing update. For example, each routing device can determine a decayed update reference time when the given routing device will put the routing update into effect according to a decay mode. Routing updates can be managed between routing devices that support timing information and routing devices that do not support timing information.

Abstract: Example embodiments are related to a wheel coupling system for a vehicle. The wheel coupling system according to example embodiments may include a torque transmission element having a rotatable member to generate a torque force and a torque receiver for releasably engaging the torque transmission element. The wheel coupling system may further include a wheel coupled to the torque receiver such that removal of the wheel disengages the torque receiver from the torque transmission element to allow the torque transmission element to remain intact.

Abstract: Encapsulated packets may be generated for different packets transmitted between a source instance and destination instance in a computer system. The source instance and destination instance may be implemented by different physical hosts linked by multiple network paths. Congestion of the multiple network paths may be determined and path-balancing polices may be implemented in response to the determined congestion. Each encapsulation packet comprises contents of a corresponding packet, and one or more data values selected in accordance with a path-balancing policy. The data values added to one encapsulation packet may differ from those added to another. Different network paths to the destination may be selected for different encapsulation packets of a given transmission based at least in part on the added data values.

Abstract: Encapsulated packets may be generated for different packets transmitted between a source instance and destination instance in a computer system. The source instance and destination instance may be implemented by different physical hosts linked by multiple network paths. Congestion of the multiple network paths may be determined and path-balancing polices may be implemented in response to the determined congestion. Each encapsulation packet comprises contents of a corresponding packet, and one or more data values selected in accordance with a path-balancing policy. The data values added to one encapsulation packet may differ from those added to another. Different network paths to the destination may be selected for different encapsulation packets of a given transmission based at least in part on the added data values.

Abstract: Methods and apparatus for Internet-scale routing using small-scale border routers and IP tunneling are described. Each border router is directly connected to a transit provider. Routing protocol peerings may be passed via the border routers through tunnels to a routing service; the routing service and the transit provider router(s) appear to be directly adjacent routing peers. The routing service receives routing data from the transit provider(s), maintains the routing data in a routing table, and processes the routing data in the routing table to select best paths. A mapping service may be informed, by the routing service, of a best exit point (or points) for each Internet prefix of each packet to be routed on the Internet. Outbound packets from devices on the network to the Internet, and inbound packets from the Internet to the network devices, may be encapsulated and passed through tunnels as directed by the mapping service.

Abstract: Techniques and solutions for distributing routing updates using timing information are described. For example, inter-device messaging protocols can support timing information (e.g., routing protocols be extended to support timing information). The timing information can comprise an indication of a time at which the routing update is to be put into effect. Using the timing information, a number of routing devices can put the routing update into effect at the same time (e.g., at an update reference time) according to a synchronous mode. Routing updates can be managed between routing devices that support timing information and routing devices that do not support timing information.

Abstract: Encapsulated packets may be generated for different packets transmitted between a source instance and destination instance in a computer system. The source instance and destination instance may be implemented by different physical hosts linked by multiple network paths. Congestion of the multiple network paths may be determined and path-balancing polices may be implemented in response to the determined congestion. Each encapsulation packet comprises contents of a corresponding packet, and one or more data values selected in accordance with a path-balancing policy. The data values added to one encapsulation packet may differ from those added to another. Different network paths to the destination may be selected for different encapsulation packets of a given transmission based at least in part on the added data values.

Abstract: Methods and apparatus for transparent multipath utilization through encapsulation are disclosed. Respective encapsulation packets are generated for at least two different baseline packets transmitted between a source and destination linked by multiple network paths. Each encapsulation packet comprises contents of a corresponding baseline packet, and one or more data values selected in accordance with a path balancing policy. The data values added to one encapsulation packet may differ from those added to another. Different network paths to the destination may be selected for different encapsulation packets of a given transmission based at least in part on the added data values.

Abstract: Example embodiments are related to a wheel coupling system for a vehicle. The wheel coupling system according to example embodiments may include a torque transmission element having a rotatable member to generate a torque force and a torque receiver for releasably engaging the torque transmission element. The wheel coupling system may further include a wheel coupled to the torque receiver such that removal of the wheel disengages the torque receiver from the torque transmission element to allow the torque transmission element to remain intact.

Abstract: A method for electrically predrying a moist blank of a ceramic raw mixture is provided, the blank being connected into a circuit and an alternating current being passed through the blank. In this case, the alternating current is passed through the blank at an increased frequency in comparison with the mains frequency. Significantly less electrical energy is required to achieve an identical drying result.

Abstract: A location sharing system and related processes across computer networks are provided that efficiently utilize resources by adjusting location determination techniques at client devices. A rule-based architecture including user-based heuristics facilitates location determination that is accurate while optimizing resource consumption. Current interest in or other behavior associated with a target user or requesting user can be used in selecting a location determination protocol at the client device. An accurate portrayal of a user's location can be provided efficiently by correlating interest to utilize more accurate but larger resource-intensive components when interest is higher and to utilize less accurate but lower resource-intensive components when interest is lower.

Abstract: A location sharing system and related processes across computer networks are provided that efficiently utilize resources by adjusting location determination techniques at client devices. A rule-based architecture including user-based heuristics facilitates location determination that is accurate while optimizing resource consumption. Current interest in or other behavior associated with a target user or requesting user can be used in selecting a location determination protocol at the client device. An accurate portrayal of a user's location can be provided efficiently by correlating interest to utilize more accurate but larger resource-intensive components when interest is higher and to utilize less accurate but lower resource-intensive components when interest is lower.

Abstract: A game chip organizer having: a base portion having a bottom and four sides; a top portion having a top and four sides, at least one side hindgedly attached to the base portion to provide a organizer that opens and closes wherein the outside of the top has an indented portion for applying an advertisement, the front portion of the organizer may be transparent and the inside of the organizer contains at least one game chip tray; at least one support to support the game chip trays; a drawer in the base portion of the game chip organizer; and an opening in the base portion, below the game chip tray and having an adjustable spring loaded bottom and a sliding cover, wherein the adjustable spring loaded bottom may be adjusted to change the size of the opening.