Abstract: A method for operating a distributed computing system includes transmitting, by a first node in a first level to an intermediate node in a second level, a first message and storing, by the first node, the first message. The method further includes receiving, by the intermediate node, the first message, generating a second message, and transmitting, to a third node, the second message. The method additionally includes receiving, by the intermediate node from the third node, a first acknowledgement message indicating that the second message was successfully received by the third node, and transmitting, by the intermediate node to the first node after receiving the first acknowledgement message, a second acknowledgement message. The method includes deleting, by the first node in response to receiving the second acknowledgment message, the stored first message.

Abstract: A method of transmitting packets wherein said packets are comprised in a plurality of flows, the flows comprising flow characteristics controlling admission of incoming flows. A plurality of admitted incoming flows with the same class of service are inserted into a queue. A committed information rate value corresponding to said queue and a bandwidth available for transmission of said queue according to the identified committed information rate value are identified. An order for transmission for the queues is established based on the class of service of the queue and the identified bandwidth. A plurality of cells of the same size are generated from a plurality of frames and the cells are distributed between a plurality of individual transmission channels according to the ordered defined for transmission. A transmitter equipment and a receiver equipment are also disclosed.

Abstract: A method for operating a distributed computing system includes transmitting, by a first node in a first level to an intermediate node in a second level, a first message and storing, by the first node, the first message. The method further includes receiving, by the intermediate node, the first message, generating a second message, and transmitting, to a third node, the second message. The method additionally includes receiving, by the intermediate node from the third node, a first acknowledgement message indicating that the second message was successfully received by the third node, and transmitting, by the intermediate node to the first node after receiving the first acknowledgement message, a second acknowledgement message. The method includes deleting, by the first node in response to receiving the second acknowledgment message, the stored first message.

Abstract: A method for operating a distributed computing system including a plurality of nodes connected in a general network topological sequential manner includes storing a first message on a first node; removing the first message from the first node only if an N-level acknowledgement message is received by the first node indicating that a second message based on the data of the first message was successfully received by a second node on a second level, wherein the difference between the values for the first and second level is a predefined value N; and saving a node state of at least the second node or a third node on a level higher than the first level before sending out an acknowledgement message to a node on a level below if an outgoing message towards the second node is generated based on the node state.

Abstract: A method for check pointing a global state of a distributed system with one or more distributed applications organized in a directed acyclic graph topology includes, upon receiving a marker in an active input channel of a first task application, putting an active input channel on hold, performing check pointing by saving an internal state of the first task application when all input channels have received a marker and are put on hold, forwarding the marker via all output channels of the first task application to at least one other task application of the one or more task applications, and reactivating all input channels of the first task application, wherein the global state is a union of all internal states of the task applications after each of the one or more task applications has been check pointed.

Abstract: A method for operating a distributed computing system including a plurality of nodes connected in a general network topological sequential manner includes storing a first message on a first node; removing the first message from the first node only if an N-level acknowledgement message is received by the first node indicating that a second message based on the data of the first message was successfully received by a second node on a second level, wherein the difference between the values for the first and second level is a predefined value N; and saving a node state of at least the second node or a third node on a level higher than the first level before sending out an acknowledgement message to a node on a level below if an outgoing message towards the second node is generated based on the node state.

Abstract: In a wireless network node, the MAC protocol is implemented through an extended finite state machine executed by the node. The operation of the wireless network node is changed by establishing a wireless connection between the present wireless network node and a remote wireless network node. One or more data packets containing a coded extended finite state machine corresponding to a specific MAC protocol are sent through the wireless connection from the remote wireless network node to the present wireless network node. An activation command from the remote wireless network node to the present wireless network node is sent through the wireless connection for activating the specific MAC protocol. This may be done during normal operation of the present wireless network node.

Abstract: In a wireless network node, the MAC protocol is implemented through an extended finite state machine executed by the node. The operation of the wireless network node is changed by establishing a wireless connection between the present wireless network node and a remote wireless network node. One or more data packets containing a coded extended finite state machine corresponding to a specific MAC protocol are sent through the wireless connection from the remote wireless network node to the present wireless network node. An activation command from the remote wireless network node to the present wireless network node is sent through the wireless connection for activating the specific MAC protocol. This may be done during normal operation of the present wireless network node.

Abstract: A method of transmitting packets wherein said packets are comprised in a plurality of flows, the flows comprising flow characteristics controlling admission of incoming flows. A plurality of admitted incoming flows with the same class of service are inserted into a queue. A committed information rate value corresponding to said queue and a bandwidth available for transmission of said queue according to the identified committed information rate value are identified. An order for transmission for the queues is established based on the class of service of the queue and the identified bandwidth. A plurality of cells of the same size are generated from a plurality of frames and the cells are distributed between a plurality of individual transmission channels according to the ordered defined for transmission. A transmitter equipment and a receiver equipment are also disclosed.

Abstract: A method to determine if an encrypted flow of packets (F) belongs to a predefined class of flows (?t), comprises the steps of giving probability density functions (p(xi|?t)) of the values of two measurable variables in a plurality of encrypted flows of packets (Fj) belonging to the predefined class of flows (?t), measuring the values (si,?t1) of the two measurable variables, apply the measured values (si,?t1) to the probability density functions (p(xi|?t)) to generate a sequence of values of probability density (p({right arrow over (x)}|?t)), process the sequence of values of probability density (p({right arrow over (x)}|?t)) to generate a reference value (S({right arrow over (x)}|?t)), and compare such reference value (S({right arrow over (x)}|?t)) to a threshold value (T) to determine whether the encrypted flow of packets (F) belongs to the predefined class of flows.

Abstract: A method to determine if an encrypted flow of packets (F) belongs to a predefined class of flows (?t), comprises the steps of giving probability density functions (p(xi|?t)) of the values of two measurable variables in a plurality of encrypted flows of packets (Fj) belonging to the predefined class of flows (?t), measuring the values (si,?t1) of the two measurable variables, apply the measured values (si,?t1) to the probability density functions (p(xi|?t)) to generate a sequence of values of probability density (p({right arrow over (x)}|?t)), process the sequence of values of probability density (p({right arrow over (x)}|?t)) to generate a reference value (S({right arrow over (x)}|?t)), and compare such reference value (S({right arrow over (x)}|?t)) to a threshold value (T) to determine whether the encrypted flow of packets (F) belongs to the predefined class of flows.