Abstract: Apparatuses and methods for distributing and/or receiving buffer content advertisements continuously to and/or from a plurality of neighboring peer apparatuses joined in a network are described. The buffer content advertisements identify the stored packets of data in a packet buffer. The continuously distributed and/or received buffer content advertisements may include incremental updates of content of the packet buffer piggybacked to every outgoing and/or incoming packet of data. The apparatus may determine packets of data advertised by a plurality of neighboring peers that the apparatus does not have in its packet buffer, and may request packets of data, of the advertised packets, from at least one of the plurality of neighboring peers. The apparatus may include a communication module to communicate buffer content advertisements continuously to the plurality of neighboring peers.

Abstract: Apparatuses and methods for distributing and/or receiving buffer content advertisements continuously to and/or from a plurality of neighboring peer apparatuses joined in a network are described. The buffer content advertisements identify the stored packets of data in a packet buffer. The continuously distributed and/or received buffer content advertisements may include incremental updates of content of the packet buffer piggybacked to every outgoing and/or incoming packet of data. The apparatus may determine packets of data advertised by a plurality of neighboring peers that the apparatus does not have in its packet buffer, and may request packets of data, of the advertised packets, from at least one of the plurality of neighboring peers. The apparatus may include a communication module to communicate buffer content advertisements continuously to the plurality of neighboring peers.

Abstract: A system for providing step-ahead computing may include a client and a server. The client may include a communication element, a user interface element and a processor. The communication element may be configured to receive a set of pre-computed actions. The set of pre-computed actions may be based on at least one possible future state of the client. The user interface element may be configured to receive a user input corresponding to a particular action. The processor may be in communication with the communication element and the user interface element. The processor may be configured to determine whether the set of pre-computed actions include an action corresponding to the particular action and to execute the action in response to a determination that the set of pre-computed actions include the action corresponding to the particular action. The server may include a processing element, a pre-computing element and a server side communication element.

Abstract: Apparatuses and methods for distributing and/or receiving buffer content advertisements continuously to and/or from a plurality of neighboring peer apparatuses joined in a network are described. The buffer content advertisements identify the stored packets of data in a packet buffer. The continuously distributed and/or received buffer content advertisements may include incremental updates of content of the packet buffer piggybacked to every outgoing and/or incoming packet of data. The apparatus may determine packets of data advertised by a plurality of neighboring peers that the apparatus does not have in its packet buffer, and may request packets of data, of the advertised packets, from at least one of the plurality of neighboring peers. The apparatus may include a communication module to communicate buffer content advertisements continuously to the plurality of neighboring peers.

Abstract: A system for providing step-ahead computing may include a client and a server. The client may include a communication element, a user interface element and a processor. The communication element may be configured to receive a set of pre-computed actions. The set of pre-computed actions may be based on at least one possible future state of the client. The user interface element may be configured to receive a user input corresponding to a particular action. The processor may be in communication with the communication element and the user interface element. The processor may be configured to determine whether the set of pre-computed actions include an action corresponding to the particular action and to execute the action in response to a determination that the set of pre-computed actions include the action corresponding to the particular action. The server may include a processing element, a pre-computing element and a server side communication element.

Abstract: A system for providing step-ahead computing may include a client and a server. The client may include a communication element, a user interface element and a processor. The communication element may be configured to receive a set of pre-computed actions. The set of pre-computed actions may be based on at least one possible future state of the client. The user interface element may be configured to receive a user input corresponding to a particular action. The processor may be in communication with the communication element and the user interface element. The processor may be configured to determine whether the set of pre-computed actions include an action corresponding to the particular action and to execute the action in response to a determination that the set of pre-computed actions include the action corresponding to the particular action. The server may include a processing element, a pre-computing element and a server side communication element.

Abstract: Apparatuses and methods for distributing and/or receiving buffer content advertisements continuously to and/or from a plurality of neighboring peer apparatuses joined in a network are described. The buffer content advertisements identify the stored packets of data in a packet buffer. The continuously distributed and/or received buffer content advertisements may include incremental updates of content of the packet buffer piggybacked to every outgoing and/or incoming packet of data. The apparatus may determine packets of data advertised by a plurality of neighboring peers that the apparatus does not have in its packet buffer, and may request packets of data, of the advertised packets, from at least one of the plurality of neighboring peers. The apparatus may include a communication module to communicate buffer content advertisements continuously to the plurality of neighboring peers.

Abstract: A system for providing step-ahead computing may include a client and a server. The client may include a communication element, a user interface element and a processor. The communication element may be configured to receive a set of pre-computed actions. The set of pre-computed actions may be based on at least one possible future state of the client. The user interface element may be configured to receive a user input corresponding to a particular action. The processor may be in communication with the communication element and the user interface element. The processor may be configured to determine whether the set of pre-computed actions include an action corresponding to the particular action and to execute the action in response to a determination that the set of pre-computed actions include the action corresponding to the particular action. The server may include a processing element, a pre-computing element and a server side communication element.

Abstract: This invention relates to routing in a communication network. The invention offers a method to make a protected routing through all the layers of a communication network. The bottom layer is the foundation for all protected routes. The routing order is from bottom to top. First, the first layer above the bottom layer is routed into the bottom layer. The links which do not need protection can be routed via the shortest path. The links which need protection are routed in a way that there exist two, as short as possible, separate paths. The other links are routed in a similar way. Finally the top layer is routed into the layer below the top layer.

Abstract: This invention relates to routing in a communication network. In particular, the invention concerns routing in telecommunication and cellular networks. The idea of the invention is to preprocess the network in order to accelerate the routing process. The preprocessing comprises finding the difficult network portions, and removing trivial network portions from the network topology. As a result of these phases the network is divided into small subnetworks. After the preprocessing predetermined endpoints of a single route are added into the subnetworks for finding the route through the network. After that, traffic in each subnetwork is routed separately. Traffic in the network parts between the subnetworks, or between the endpoints and the subnetworks, may need additional routing.

Abstract: This invention concerns the forming of a communication network. The invention offers an arrangement and a method to form a communication network. The inventive arrangement is divided into several modules, such as a logical or physical topology of the network concerning a specific technology, where each one of them represents one layer of the network. Depending on the network that is going to be formed, the necessary modules are used, i.e. the set of modules is chosen to form the network. Certain network parts are formed in a relevant module. Each module uses resources (capacities and routes for connections) from the module below, i.e. a module that represents the layer below, and provides recourses to the module above, i.e. a module that represents the layer above. Hence the resource flow is from a module to an adjacent module only, intermediate modules are not bypassed.

Abstract: This invention relates to routing in a communication network. The invention offers a method to make a protected routing through all the layers of a communication network. The bottom layer is the foundation for all protected routes. The routing order is from bottom to top. First, the first layer above the bottom layer is routed into the bottom layer. The links which do not need protection can be routed via the shortest path. The links which need protection are routed in a way that there exist two, as short as possible, separate paths. The other links are routed in a similar way. Finally the top layer is routed into the layer below the top layer.

Abstract: This invention relates to routing in a communication network. In particular, the invention concerns routing in telecommunication and cellular networks. The idea of the invention is to preprocess the network in order to accelerate the routing process. The preprocessing comprises finding the difficult network portions, and removing trivial network portions from the network topology. As a result of these phases the network is divided into small subnetworks. After the preprocessing predetermined endpoints of a single route are added into the subnetworks for finding the route through the network. After that, traffic in each subnetwork is routed separately. Traffic in the network parts between the subnetworks, or between the endpoints and the subnetworks, may need additional routing.