Telefonaktiebolaget Lm Ericsson (publ)

Fetahi Wuhib

Joao Monteiro Soares

Yue Lu

Ying Liu

A system and method for creating and updating a distributed indexing table for peer nodes in a peer-to-peer network. In one embodiment, a method includes providing, from a first node to a second node of the peer-to-peer network, a first level of a first plurality of levels for a first designator identifying the first node and entered in a first distributed indexing table stored in the first node. The method also includes receiving, at the first node from the second node, a corresponding first level of a second plurality of levels for a second designator identifying the second node and entered in a second distributed indexing table stored in the second node, and updating the corresponding first level of the second plurality of levels for the second designator within the first distributed indexing table of the first node.

System and method for distributed indexing in peer-to-peer networks

It is disclosed an agent of a first cloudlet and a method performed therein, the first cloudlet having one or more service properties, the first agent having associated a first group of one or more other cloudlets. Based on an exchange of information about service properties of cloudlets accessible to each agent, a comparison is made between service properties from different cloudlets, and if a certain cloudlet has at least one service property that exceeds a service property of any one of the first group of cloudlets, the certain cloudlet is added to a group of cloudlets, which efficiently represents service properties available to the first agent.

Method and agent for sharing information about cloudlet properties in distributed cloud environments

A method and job scheduling node () for scheduling data processing across a set of processing machines (), each processing machine comprising at least one data processor. When receiving () a request for a data processing job, the job scheduling node () obtains () a current processor resource status of each processing machine, the processor resource status indicating at least current usage of each data processor in said processing machine. The job scheduling node () further selects () at least one vacant data processor in the set of processing machines based on the obtained processor resource status, for executing the data processing job, and dispatches () the data processing job to at least one processing machine () where the at least one selected data processor is located.

Growing community of inventors

Sundbyberg, Sweden

Fetahi Wuhib