Abstract: The present invention relates to a method of blocking undesired traffic in data communication systems that uses packet switching. Blocking is effected by determining the sender address of incoming data packets, and then comparing this address with a list of reliable addresses. The data packet is erased immediately, if the sender addresss is not included in the list. The list of accepted addresses can be created in several wayoi among others by including in the list addresses to which the user has himself sent data, these addresses therefore being considered reliable addresses. Addresses of friends and acquaintances can also be inserted in the list manually. The invetion thus enables undesired data from unreliable senders to be avoided. Such data loading limited resources, such as wireless internet connections for example. Neither is there any risk of the receiver being required to pay for information that he himself has not requested.

Abstract: A channel-type switching control approach permits a variety of communication services to be provided in an efficient manner. A parameter affecting the decision whether to switch a user connection from a first type of communications channel to a second type of communications channel is detected. A channel-type switching decision is then made so as to reduce undesirable channel-type switching. Undesirable channel-type switching may include inefficient, excessive, or rapid cyclic switching of the user connection between the first and second channel-types. An undesirable channel-type switch may also be one where the “cost” of making the channel-type switch to the second type of channel is “more expensive” than the cost of maintaining the user connection on the first type of channel. In an example embodiment, the channel switching decision takes into account a current throughput over the second type of channel.

Abstract: A telecommunications network (110) has a unit (100) and technique to alleviate congestion on a congested link as can occur, e.g., when a new connection seeks admission to the network. The congestion avoidance technique/unit ascertains, from a set of candidate connections (C0, C1, C2, C3), a best candidate to route in order to avoid the congestion. Further, the congestion avoidance technique/unit determines a best candidate path to which the best candidate connection is to be routed. The best candidate connection and the best candidate path are determined so that, after routing the best candidate connection to the best candidate path, a load of the weakest link in the network is as low as possible.

Abstract: A telecommunications system (10) has a radio access network comprising plural control nodes (26) and inter-control node links (Iur) for connecting the plural control nodes. A handover selection function (200) makes a selection regarding which of plural connections handled by the radio access network should have control thereof moved from a first control node (e.g., current SRNC) to another of the plural control nodes (e.g., target SRNC) to alleviate congestion on an overloaded one of the inter-control node links. The selection includes a determination of a cost for each of the connections carried by the overloaded link. The cost of each of the connections carried by the overloaded link is a product of a number of inter-control links involved in the connection and an inter-control link bandwidth required by the connection.

Abstract: The invention concerns the bit error resilience of an IP protocol stack based on a secure link layer, in which packet flows are header compressed according to a suitable header compression standard. According to the invention, by analyzing each packet at the link layer it can be determined whether the packet is a full header packet, in which case the link layer checksum evaluation is used as normal for discarding faulty full header packets, or a header compressed packet in which case the link layer checksum evaluation is ignored and the packet is propagated upwards in the protocol stack. This solution not only opens up for more intelligent higher-level handling of faulty header compressed packets, but also solves the problem of properly protecting full header packets at the link layer. In order to compensate for ignoring the link layer checksum evaluation for header compressed packets, header protection is introduced at the header compression level of the link layer by using one or more local checksums.