Abstract: A method performed by a hypervisor executing a virtual machine for enabling a performance measurement between the virtual machine and a peer node, and a method performed by a physical machine comprising the hypervisor are provided. The method performed by the hypervisor comprises intercepting a packet transmitted from, or destined to, the virtual machine, the packet comprising a destination address to the virtual machine or to the peer node, and determining whether to insert a hypervisor time stamp or not in the packet. The method further comprises, when it is determined to insert the hypervisor time stamp in the packet, inserting a hypervisor time stamp in the packet, and forwarding the packet to its destination according to the destination address.

Abstract: An apparatus (30), method, network server (42, 43, 44, 46, 48) and system (40) for detecting data patterns in a data stream (37) comprising a plurality of data symbols representing characters of an alphabet, said apparatus (30) executing a deterministic finite automata. The apparatus comprises a state transition register (31) comprising a plurality of states (11, 12, 13, 14, 15) including a start state (11) and at least one accepting state (14), and state transitions (16a, 16b, 16c) from an initial state to a destination state triggered by a data symbol of the data stream (37).

Abstract: Computer controlled method, network server (42, 43, 44, 46, 48) and system (40) for detecting data patterns in a data stream (36) received by a computer (30). The data stream (36) comprising a plurality of data symbols. The computer (30) executes a finite automata (10) comprising a plurality of states (11, 12, 13, 14, 15) including a start state (11) and at least one accepting state (15). State transitions (16) are triggered by a data symbol (17a) according to a state transition register (17) and the method comprises the steps of determining (21), by the computer (30), from a data symbol register (18) whether a data symbol of the data stream (36) is comprised in a group of data symbols not resulting in an accepting state (15), and triggering (22), by the computer (30), a transition (16) to the start state (11) for data symbols comprised in the group and a transition (23) to a state (12, 13, 14, 15) according to the state transition register (17) for detecting the data pattern otherwise.

Abstract: A method of address allocation in a network comprises determining, from negotiations between nodes, whether a first node shall assume a server role responsible for distribution and management of network addresses to clients. If this determination is made, the first node is provided with a pool of network addresses. The invention provides a method of dynamic re-allocation of address pools between servers of the network, in accordance with, for example, network requirements or traffic load.

Abstract: A system, computer readable medium and method for managing objects in a cache. The method includes receiving a request for a desired object that is not stored in the cache; determining, based on an admission policy, whether one or more segments of a least popular existing object need to be removed from the cache for admitting one or more segments of the desired object into the cache; removing, when there is no space in the cache for the desired object, the one or more segments of the least popular existing object from the cache based on a replacement policy, wherein the replacement policy includes a caching priority function for determining that the least popular existing object is the least popular object of all objects stored by the cache; and admitting at least one segment of the desired object into the cache.

Abstract: A method performed by a hypervisor executing a virtual machine for enabling a performance measurement between the virtual machine and a peer node, and a method performed by a physical machine comprising the hypervisor are provided. The method performed by the hypervisor comprises intercepting a packet transmitted from, or destined to, the virtual machine, the packet comprising a destination address to the virtual machine or to the peer node, and determining whether to insert a hypervisor time stamp or not in the packet. The method further comprises, when it is determined to insert the hypervisor time stamp in the packet, inserting a hypervisor time stamp in the packet, and forwarding the packet to its destination according to the destination address.

Abstract: An apparatus (30), method, network server (42, 43, 44, 46, 48) and system (40) for detecting data patterns in a data stream (37) comprising a plurality of data symbols representing characters of an alphabet, said apparatus (30) executing a deterministic finite automata. The apparatus comprises a state transition register (31) comprising a plurality of states (11, 12, 13, 14, 15) including a start state (11) and at least one accepting state (14), and state transitions (16a, 16b, 16c) from an initial state to a destination state triggered by a data symbol of the data stream (37).

Abstract: Computer controlled method, network server (42, 43, 44, 46, 48) and system (40) for detecting data patterns in a data stream (36) received by a computer (30). The data stream (36) comprising a plurality of data symbols. The computer (30) executes a finite automata (10) comprising a plurality of states (11, 12, 13, 14, 15) including a start state (11) and at least one accepting state (15). State transitions (16) are triggered by a data symbol (17a) according to a state transition register (17) and the method comprises the steps of determining (21), by the computer (30), from a data symbol register (18) whether a data symbol of the data stream (36) is comprised in a group of data symbols not resulting in an accepting state (15), and triggering (22), by the computer (30), a transition (16) to the start state (11) for data symbols comprised in the group and a transition (23) to a state (12, 13, 14, 15) according to the state transition register (17) for detecting the data pattern otherwise.

Abstract: Method and arrangement for predicting a parameter indicative of an achievable bit rate when using a certain configuration in a digital subscriber line. The method involves obtaining basic configuration parameters of a known configuration; selecting a candidate configuration; and deriving an estimated parameter, indicative of an achievable bit rate, based on the obtained and selected parameters.

Abstract: A system, computer readable medium and method for managing objects in a cache. The method includes receiving a request for a desired object that is not stored in the cache; determining, based on an admission policy, whether one or more segments of a least popular existing object need to be removed from the cache for admitting one or more segments of the desired object into the cache; removing, when there is no space in the cache for the desired object, the one or more segments of the least popular existing object from the cache based on a replacement policy, wherein the replacement policy includes a caching priority function for determining that the least popular existing object is the least popular object of all objects stored by the cache; and admitting at least one segment of the desired object into the cache.

Abstract: A distributed network address allocation method is disclosed. For this purpose, an apparatus is provided for use as or in a node of the network. The apparatus comprises a portion (2, 3, 4) for maintaining a seed value n and a state value s. An address (8) of the node is determined from the seed value n by address setting portion (6). A portion (9) is provided for receiving a request from a new node wishing to join the network and itself adapted to perform the method. A portion (10, 12) is provided for generating a proposed seed value using the formula (n+2s) and a proposed state value using the formula (s+1). A portion (14) is provided for offering the proposed seed and state values to the new node. A portion (18) is provided for updating the node's state value s to be the same as that accepted by the new node, if the proposed seed and state values are accepted by the new node. This provides unique address allocation to nodes in a Mobile Ad-Hoc Network.

Abstract: Multiple packet traffic profiling models are created from known packet traffic flows that are labeled, where a label is an actual value of a factor influencing one or more characteristics of the known packet traffic flow. Features, which are different from the factors, are measured for each flow. Flow clusters are defined from the labeled traffic flows by processing their features and labels. The profiling models are created based on cluster information. When an unknown packet flow is received, the multiple packet traffic profiling models are evaluated according to a confidence and a completeness associated with each of the packet traffic profiling models. The packet traffic profiling model with a predetermined confidence and completeness is selected and applied to profile the unknown packet traffic flow.

Abstract: Method and arrangement for predicting a parameter indicative of an achievable bit rate when using a certain configuration in a digital subscriber line. The method involves obtaining basic configuration parameters of a known configuration; selecting a candidate configuration; and deriving an estimated parameter, indicative of an achievable bit rate, based on the obtained and selected parameters.

Abstract: A decentralised method is disclosed of deciding a common configuration parameter in a network. The network comprises at least one node designated to perform the method. In the method, a designated node makes a local decision relating to the configuration parameter in dependence upon information relating to its local operating environment (M3). The designated node sends its local decision to other designated nodes, if any, and receives corresponding local decisions made by other designated nodes, if any (M4). Following such receipt, the designated node makes a common decision relating to the configuration parameter in dependence upon its local decision and the received local decisions (M5). The common decision is made using a decision algorithm common to the designated nodes.

Abstract: Multiple packet traffic profiling models are created from known packet traffic flows that are labeled, where a label is an actual value of a factor influencing one or more characteristics of the known packet traffic flow. Features, which are different from the factors, are measured for each flow. Flow clusters are defined from the labeled traffic flows by processing their features and labels. The profiling models are created based on cluster information. When an unknown packet flow is received, the multiple packet traffic profiling models are evaluated according to a confidence and a completeness associated with each of the packet traffic profiling models. The packet traffic profiling model with a predetermined confidence and completeness is selected and applied to profile the unknown packet traffic flow.

Abstract: A distributed network address allocation method is disclosed. For this purpose, an apparatus is provided for use as or in a node of the network. The apparatus comprises a portion (2, 3, 4) for maintaining a seed value n and a state value s. An address (8) of the node is determined from the seed value n by address setting portion (6). A portion (9) is provided for receiving a request from a new node wishing to join the network and itself adapted to perform the method. A portion (10, 12) is provided for generating a proposed seed value using the formula (n+2s) and a proposed state value using the formula (s+1). A portion (14) is provided for offering the proposed seed and state values to the new node. A portion (18) is provided for updating the node's state value s to be the same as that accepted by the new node, if the proposed seed and state values are accepted by the new node.

Abstract: In one aspect, a method of executing a composed computer-implemented service having at least one policy integrated therein is provided. The method comprises executing a service portion of said composed computer-implemented service, and executing a policy portion of the composed computer-implemented service at substantially the same time as said step of executing said service portion of said composed computer-implemented service. The policy portion of the composed computer-implemented service affects a behavior of the composed computer-implemented service. The policy portion of the composed computer-implemented service and the service portion of the composed computer-implemented service are integrated into a same service code.

Abstract: A decentralised method is disclosed of deciding a common configuration parameter in a network. The network comprises at least one node designated to perform the method. In the method, a designated node makes a local decision relating to the configuration parameter in dependence upon information relating to its local operating environment (M3). The designated node sends its local decision to other designated nodes, if any, and receives corresponding local decisions made by other designated nodes, if any (M4). Following such receipt, the designated node makes a common decision relating to the configuration parameter in dependence upon its local decision and the received local decisions (M5). The common decision is made using a decision algorithm common to the designated nodes.