Methods, media, and systems are disclosed for adding new users to a channel in a group-based communication system. The system receives a request to add new users to a channel. The system adds a new user by classifying the new user's email address domain as internal or external. If the domain is internal, the first user is added to the channel as a member, and if the domain is external, the user is prompted for a type of access for the new user. If the new user's access type is guest, the new user is added to the channel as a guest. If the type of access is shared, the channel is shared with an organization associated with the domain, and the new user is added as a member of the channel that has been shared.

A method for managing persistent group information of an electronic device is provided. The electronic device is a group member of a persistent group. The method includes when the persistent group information is deleted in response to a specific event, the electronic device transmits, to the group members, a message requesting the deletion of the persistent group information stored by group members of the persistent group, thus making it possible to delete the persistent group information and enabling synchronization to proceed.

Orchestration of data services in multiple cloud infrastructures using the same user interface. In an embodiment, a customer provisions a first data service on a first cloud infrastructure and then a second data service on a second cloud infrastructure, while using the same user interface. An orchestration server may receive a respective count of nodes (“universe”) desired for each data service and issue commands to the corresponding cloud infrastructure to cause the desired data service to be provisioned. Another aspect facilitates creation/provisioning of a data service spanning multiple cloud infrastructures. In an embodiment, an orchestration server receives as inputs, the set of cloud infrastructures and count of nodes (“universe”) desired for the data service, and thereafter issues commands to provisioning systems of the respective cloud infrastructures to cause the desired data service to be created/provisioned.

The embodiment herein provides a system and method for providing a novel leader election mechanism in distributed systems that is randomized in twin dimensions of space and time using the concept of a colliding random walk (CRW). Leader election is randomized in space in terms of the node identified as the leader and the time taken to identify the leader. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. A novel fault tolerance mechanism is provided to identify several leaders for same set of coupons. In this system and method, the source vertex generates multiple CRWs for each piece of work that needs to be done. The fault tolerance mechanism reduces the time to collision, increases the number of leaders and also offers increased resilience and tolerance to faults.

An apparatus for managing data in a network is provided. The apparatus includes a memory, and a processor configured to identify a first leader device and a second leader device in a swarm comprising a plurality of devices based device parameters, receive a request for downloading data, download, as the first leader device, the data from a content device in response to the request, store the downloaded data to the memory, transmit the data to the second leader device, and divide the swarm into a first sub swarm comprising the first leader device and a second sub swarm comprising the second leader device.

The present invention generally relates to network-attack-resilient intrusion-tolerant Supervisory Control and Data Acquisition (SCADA) systems. Some implementations utilize redundant, proactively-recovery-configured servers at multiple centers communally executing a replication protocol. Some implementations, in addition to control centers, include data centers, which participate in the replication protocol, except that they may not be capable of controlling remote units such as Remote Terminal Units (RTUs).

A method performed by a first peer node for acting as a P2P proxy for a user device is provided. The first peer node operates in a communications network. The first peer node establishes (201) a renewable energy profile of the first peer node used for powering the first peer node. The renewable energy profile indicates to what extent one or more energy sources are renewable. When a proportion of renewable energy according to the established renewable energy profile exceeds a first threshold, the first peer node acts (205) as a P2P proxy for the user device for downloading a piece of data to the user device by being powered according to its renewable energy profile.

An arbitration method, apparatus, and system, relates to the field of computer technologies, where the arbitration method, executed by a first data center, includes viewing a preset arbitration policy when determining that communication between the first data center and a second data center is interrupted, and an arbitration device cannot perform arbitration, and continuing providing a service when determining, according to the arbitration policy, that the first data center is a preferred data center, or stopping providing the service when determining, according to the preset arbitration policy, that the first data center is not the preferred data center, where the first data center and the second data center are active-active data centers. Hence, the arbitration method, apparatus, and system solve a problem of a service interruption caused by a fault of the arbitration device, therefore an uninterrupted service is provided for a user.

Various systems and methods may be used to implement a software defined industrial system. For example, an orchestrated system of distributed nodes may run an application, including modules implemented on the distributed nodes. The orchestrated system may include an orchestration server, a first node executing a first module, and a second node executing a second module. In response to the second node failing, the second module may be redeployed to a replacement node (e.g., the first node or a different node). The replacement mode may be determined by the first node or another node, for example based on connections to or from the second node.

The embodiments herein provide a fair, high speed and lightweight consensus mechanism for leader election in distributed systems using coupons. The consensus mechanism uses a leader election mechanism that is randomized in twin dimensions of space and time using the concept of a colliding random walk. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. Two novel coupon processing mechanisms called Process Execution Time Synchronization (PETS) mechanism and Single Queue (SQ) mechanism are used to process the coupons and find matches. The use of PETS optimizes memory and time requirements while SQ is extremely fast and efficient to handle large volumes of coupons. Also, the coupon forwarding to neighbouring nodes is performed based on three algorithms namely Uniform, Delay and Adaptive Delay forward. These forwarding algorithms effect high fairness even in case of open networks.