A first computing device is part of a distributed electronic storage system (DESS) that also comprises one or more second computing devices. The first computing device comprises client process circuitry and DESS interface circuitry. The DESS interface circuitry is operable to: receive, from client process circuitry of the first computing device, a first client file system request that requires accessing a storage resource on one or more of the second computing devices; determine resources required for servicing of the first client file system request; generate a plurality of DESS file system requests for the first file system request; and transmit the plurality of DESS file system requests onto the one or more network links. How many such DESS file system requests are generated is determined based on the resources required for servicing the first client file system request.

According to an embodiment, a communication apparatus includes a memory and one or more hardware processors configured to function as a distribution unit. The memory is configured to store frame information for referring to first storage areas in each of which a frame to be transmitted or received is stored, in a plurality of second storage areas depending on priorities of frames. The distribution unit is configured to distribute and store the frame information of the frames into the plurality of second storage areas according to the priorities of the frames.

A method and apparatus for transmitting a service flow based on a flexible Ethernet, where a bandwidth resource corresponding to a bundling group (BG) of a flexible Ethernet is divided into M timeslots, service data of a service flow is encapsulated in N timeslots in the M timeslots, and the method includes: when a first PHY in the BG fails, determining, based on a preconfigured first timeslot configuration table (TCT), a target timeslot (TTS) in the N timeslots that is mapped to the first PHY; searching the M timeslots for an idle timeslot (ITS) based on the first TCT; adjusting the first TCT when a quantity of ITSs is greater than or equal to a quantity of TTSs, so that all the N timeslots are mapped to PHYs other than the first PHY; and transmitting the service flow by using the mapped PHYs of the bundling group.

An improved system and method for detecting smoke using a sensor is disclosed. The method can comprise the steps of storing in memory a plurality of smoke signatures, wherein each of the smoke signatures relates to how the sensor senses one of a plurality of particulates, each of the plurality of particulates indicative or non-indicative of a fire, and receiving current data from the sensor. Moreover, the method can comprise the steps of comparing the current data with the plurality of smoke signatures to determine if the current data matches any of the plurality of smoke signatures, and initiating an alarm sequence based at least in part on a determination as to whether the current data matches a smoke signature related to a fire-indicative particulate of the plurality of particulates.

Providing a template for orchestration of a cloud provided service in a datacenter. This template can include virtual processing services, virtual networking services, storage services, and service level requirements that a user or administrator can select for the cloud provided service. Based on the template the cloud provided service can be provisioned according to the requirements of the service level agreement.

A method for selecting a transmission of a network device is disclosed. In particular, a method for selecting a transmission of a network device comprising a plurality of queues for storing data frames is disclosed. Here, each of the plurality of queues corresponds to a different traffic class, the method comprising: a step of obtaining information about a transmission selection algorithm for the plurality of queues; and a step of selecting data frames for transmission from a corresponding queue on the basis of transmission selection algorithm information. Here, the transmission selection algorithm may correspond to a strict priority algorithm, a credit-based shaper algorithm, or a burst transmission algorithm.

A method is provided for packet broadcasting in a mesh-interconnected multi-computer network having a plurality of routers interconnected to a plurality of arbiters. The method includes live-lock free arbitering, by each of the plurality of arbiters, between two or more packet broadcast requests using a shared priority matrix, implemented by a binary matrix, that selects one of the two or more packet broadcast requests and includes a column for each of the plurality of routers, the shared priority matrix being shared amongst the plurality of arbiters and storing priority information determined from summing the matrix column values and relating to a correspondence between a plurality of packet broadcast requests, including the two or more packet broadcast requests, with respect to priorities assigned to each of the plurality of packet broadcast requests. Each of the columns of the shared priority matrix corresponds to a respective one of the routers.

A system is provided for packet broadcasting in a mesh-interconnected multi-computer network having a plurality of routers. The system includes a plurality of arbiters, interconnected to each of the plurality of routers, configured to live-lock free arbiter between the two or more packet broadcast requests using a shared priority matrix, implemented by a binary matrix, that selects one of the two or more packet broadcast requests and includes a column for each of the plurality of routers. The shared priority matrix is shared amongst the plurality of arbiters and stores priority information determined from summing the matrix column values and relating to a correspondence between a plurality of packet broadcast requests, including the two or more packet broadcast requests, with respect to priorities assigned to each of the plurality of packet broadcast requests. Each of columns of the shared priority matrix corresponds to a respective one of the routers.

A method for data transmission may be implemented on an electronic device having one or more processors. The one or more processors may include a master queue including a master queue head and a plurality of primary ports that are connected to each other using a serial link. The method may include operating the master queue head to obtain a message. The method may also include operating the master queue head to segment the message into a plurality of segments. The method may also include operating the master queue head to transmit the plurality of segments to a first primary port of the plurality of primary ports in the master queue. The method may also include operating the first primary port to transmit the plurality of segments to a second primary port of the plurality of primary ports in the master queue.

The present invention relates to a method (100) for sending a data packet (430, 440) from a first communication unit (300) of a communication system via a transmission channel that is shared with at least one further communication unit (500). The method (100) comprises determining (110) a current access priority for the shared transmission channel by the first communication unit (300), wherein the current access priority is directed towards data currently transmitted over the transmission channel. The data packet (430, 440) is segmented (120) into packet segments (432, 434), wherein the packet segments (432, 434) have a priority value (410) which corresponds to a priority value (410) of the data packet (430, 440). The method also comprises sending (130) the packet segments (432, 434) from the first communication unit (300) via the shared transmission channel, wherein the packet segments (432, 434) are sent successively depending on the priority value and the current access priority.