Abstract: The present invention relates to a method and a system for controlling a processing load in a packet data network, wherein a load control information is set in a predetermined field of a message. The load control information is then checked on the routing path of the message and a processing resource of the packet data network is selected in response to the result of checking step. Thereby, load balancing information can be provided at the network to thereby provide an efficient balancing and load sharing function without heavy string comparisons and data base queries.

Abstract: The invention relates to a method wherein a transport layer association is established. Thereafter, a handover condition is detected in the first mobile node, which obtains a second address. The second address is updated to a first name server node. A query message is sent to a second name server node for an address of the second mobile node. The second address is indicated to the second mobile node. The first mobile node waits for a response from the second name server node or the second mobile node. Upon receiving a new address for the second mobile node from the second name server node, the first mobile node repeats the indication of the second address of the first mobile node to the second mobile node using the new address as a destination address for the second mobile node.

Abstract: The present invention concerns load balancing for control plane traffic of a network element comprising multiple CPU nodes assigned to a common external IP address in a packet data enabled telecommunication network. IP messages addressed to the network element are received, and received IP messages comprising GTP-C messages are identified. A TEID-C value of a GTP-C message is identified and the GTP-C message is forwarded to a CPU node based on its identified TEID-C value, if its identified TEID-C value does not equal zero.

Abstract: The present invention describes a method, system and mirror driver for discarding data frames in mirrored data communication networks. In the method, at least one data structure comprising one or more entries is created and maintained, an entry comprising at least a current sender data frame sequence number. When a data frame is received, a hash code is computed using then sender address and the receiver address of the received data frame, the hash code being an index to the table. The current sender data frame sequence number is checked in the entry indexed by the computed hash code, and if the sequence number of the received frame is smaller than the current sender data frame sequence number in the entry, the data frame is discarded as being a duplicate frame.

Abstract: The invention relates to a method for the performing of handover in a communication system. In the method a transport connection establishment request is sent from a first network node to a second network node. A node name is obtained for the second network node. A handover condition is detected by the first network node. A new address is obtained for the first network node. The new address for the first network node is updated to a name service node. A transport connection migration request is sent from the first node to the second network node. The transport connection migration request comprises a token, which identifies the connection.

Abstract: The invention relates to a method wherein a transport layer association is established. Thereafter, a handover condition is detected in the first mobile node, which obtains a second address. The second address is updated to a first name server node. A query message is sent to a second name server node for an address of the second mobile node. The second address is indicated to the second mobile node. The first mobile node waits for a response from the second name server node or the second mobile node. Upon receiving a new address for the second mobile node from the second name server node, the first mobile node repeats the indication of the second address of the first mobile node to the second mobile node using the new address as a destination address for the second mobile node.

Abstract: A system for combining networks of different addressing schemes comprises the incorporation of at least one interstitial function between at least one address realm of the one network and at least one address realm of another network for mapping an address between the different addressing schemes. Preferably, the interstitial function uses a public address realm as root address realm wherein the address realms are organized in a hierarchical manner and the address realm without any parents is the root address realm. The location of each node within the combined networks may be expressed as a list of individual realm specific addresses from the different address realms given in a specified order, wherein said listed addresses together form a common universal address of said node.

Abstract: The present invention concerns load balancing for control plane traffic of a network element comprising multiple CPU nodes assigned to a common external IP address in a packet data enabled telecommunication network. IP messages addressed to the network element are received, and received IP messages comprising GTP-C messages are identified. A TEID-C value of a GTP-C message is identified and the GTP-C message is forwarded to a CPU node based on its identified TEID-C value, if its identified TEID-C value does not equal zero.

Abstract: The present invention concerns a method and a system for remotely and transparently managing security associations of Internet Protocol Security. The system comprises one or more application devices, each of which comprises at least one management client for issuing security association management requests. The system further comprises a service device comprising an Internet Protocol Security service means for providing one or more Internet Protocol Security services, and a management server for receiving the issued requests and for responding, in connection with the Internet Protocol Security service means, to the received requests. The system further comprises a communication network for securely connecting the application devices to the service device.

Abstract: The present invention concerns a method and a system for stateless load sharing for a server cluster in an IP based telecommunications network, comprising an IP based telecommunications network, a server cluster comprising server nodes for running an application process, and a load balancer for receiving packets and forwarding them to various server nodes. According to the invention the load balancer further comprises a distribution key obtainer for identifying and extracting at least one predetermined field from each dispatched packet or PDU contained within to be used as a distribution key, a hasher for hashing each distribution key to obtain an offset value for each packet, and a resolver for resolving a packet specific destination address for each packet using the obtained offset values.

Abstract: The present invention relates to a method and a system for controlling a processing load in a packet data network, wherein a load control information is set in a predetermined field of a message. The load control information is then checked on the routing path of the message and a processing resource of the packet data network is selected in response to the result of checking step. Thereby, load balancing information can be provided at the network to thereby provide an efficient balancing and load sharing function without heavy string comparisons and data base queries.

Abstract: The present invention describes a method, system and mirror driver for discarding data frames in mirrored data communication networks. In the method, at least one data structure comprising one or more entries is created and maintained, an entry comprising at least a current sender data frame sequence number. When a data frame is received, a hash code is computed using the sender address and the receiver address of the received data frame, the hash code being an index to the table. The current sender data frame sequence number is checked in the entry indexed by the computed hash code, and if the sequence number of the received frame is smaller than the current sender data frame sequence number in the entry, the data frame is discarded as being a duplicate frame.