Abstract: A method in a communication node for handling a packet to a destination node in a communications network, and associated nodes. The communication node associates the packet with a remaining value, with the remaining value being a packet value reduced by a threshold value of an outgoing link from the communication node towards the destination node. The threshold value corresponds to a congestion level of the outgoing link. The communication node further handles the packet based on the remaining value, the handling including determining whether to drop or to transmit the packet along the outgoing link based on the remaining value.

Abstract: A method and a transmitting node for redirecting of a flow of data packets to a path of alternative paths, and a method and a receiving node for enabling redirection of a flow of data packets to a path of alternative paths, where data packets are marked with a value indicating the importance of the data packets. The method for directing directs one or more flows of data packets for the alternative paths, wherein data packets marked with a higher value are prioritized over data packets marked with a lower value. Based on feedback information, the transmitting node redirects a flow of data packets to a second path of the alternative paths, if the metric of congestion indicates a higher congestion on the first path than on the second path.

Abstract: A technique for cable interface-based load balancing between first and second cells is described. Each cell comprises cable and air interfaces defining a parameter set comprising load statuses of the cable and air interfaces. A method aspect being performed in a control entity comprises the steps of determining, in the first cell, the parameter set of the first cell, obtaining the parameter set of the second cell, determining whether the load statues of the cable and air interfaces of the first cell are low, whether the air interface load status of the second cell is low, and whether the cable interface load status of the second cell is high, and reconfiguring, if a result of the determination is affirmative, at least one air interface configuration parameter of the first cell so as to off-load at least a part of mobile-originated traffic from the second cell to the first cell.

Abstract: A method is disclosed for controlling, according to an additive increase multiplicative decrease (AIMD) principle, the bandwidth sharing among contending traffic flows over a transport network between a radio network controller and a radio base station. According to the method, a relative bit-rate (RBR) is determined (210) for each traffic flow; and the bit-rates of said traffic flows are controlled (220) such that additive increase operations of said AIMD principle depend on the respective RBR of each traffic flow. Embodiments of the invention strive at supporting Gold, Silver and Bronze HSDPA and/or EUL bit-rate subscriptions over a single TN QoS class.

Abstract: For implementing handling of congestions in a mobile network, a base station (100), e.g., an evolved Node B, is provided with at least one congestion controller (400, 400?). The congestion controller (400, 400?) operates in relation to data packets which are received from a transport network. The base station (100) then transmits the data packets on at least one radio link, which may be accomplished by using one or more scheduling queues (402) and a radio interface scheduler (410). A bitrate detector (404) measures a bitrate of the received data packets, and a bitrate limit calculator (408) calculates, on the basis of the measured bitrate, a maximum bitrate for transmission of the data packets on the radio link. A congestion detector (406) is used to detect a congestion in the transport network. In response to the detected congestion, the radio interface scheduler (410) schedules transmissions on the at least one radio link to meet the calculated maximum bitrate.

Abstract: A method for detecting congestion in a transport network is provided. The congestion detection utilizes flow control including relative bitrate. The method comprises counting the number of detected frame loss events for a flow. The method further comprises determining if the number of detected frame losses is greater than or equal to a corresponding threshold, wherein the threshold used is an individual threshold for the flow set taking into account relative bitrate weights of the flow, and detecting transport network congestion for the flow when the number of detected frame losses is greater than or equal to the corresponding threshold.

Abstract: A technique for routing data frames in a telecommunications backhaul network (100) is provided. The telecommunication backhaul network (100) includes a plurality of points and links between the points so that at least two different routes for communicating data frames between a pair of end points is provided. A first end point (102) routes data frames that belong to a communication tunnel between the first end point and second end point (104) on a first route (106), which includes one or more intermediate points (100). At least some of the data frames include a continuity check message. The first end point reroutes data frames belonging to the communication tunnel to a second route that is different from the first route (106), if certain data frames including the continuity check message are lost in the network (100). As to a method aspect of the technique, at least one of the links of the first route are switched to a reduced link capacity.

Abstract: A technique for controlling network routing in a network (100) is provided. The network (100) includes a first end node (102) and a second end note (104). The end nodes are connectable along a first routing path (106) by at least one link (113). The network (100) further provides a second routing path (108) including the first end node (102) and the second end nodes (104). As to a method aspect of the technique, one or more queues (402) are provided. Each of the queues (402) serves at least one tunnel (Tunnel—1; Tunnel—2) along the first routing path (106). A switching of the tunnel (Tunnel—1) to the second routing path (108) is triggered based on a combination of two pieces of information. A piece of information includes information as to a queue build-up at the queue (504) serving the tunnel (Tunnel—1). Another piece of information includes information as to a capacity of the link (113) of the first routing path (106).

Abstract: A method is presented of transporting data packets over a telecommunications transport network. The data packets are carried by a plurality of bearers. For each of the bearers, independently of the other bearers, bandwidth profiling is applied to the data packets of the bearer to designate as ‘green’ data packets that are conformant with a predetermined maximum Information Rate for the bearer. One or more data packets is buffered for up to a predetermined maximum ‘green’ buffer time, during which if transporting the data packet would not cause the maximum information rate of the bearer to be exceeded, the data packet is designated as a ‘green’ data packet. The data packets are forwarded for transporting over the transport network. If there is insufficient bandwidth available in the transport network to transport all data packets, data packets that are not designated as ‘green’ data packets are discarded, so as not to be transported through the transport network.

Abstract: A method of prioritising packets for delivery over a transport network interconnecting nodes of a mobile network, where a guaranteed minimum information rate over the transport network is specified for the mobile network. The method comprises, for each bearer to be injected into the transport network from the mobile network, specifying a bearer information rate and marking packets up to that rate as conformant with the bearer information rate and marking packets exceeding that rate as non-conformant with the bearer information rate. A plurality of traffic type streams from the mobile network are converged, each traffic type stream comprising a plurality of bearers. Packets of the converged traffic type streams are inspected to identify packets marked as conformant and non-conformant, and re-marking non-conformant packets, or at least a fraction of non-conformant packets, as conformant if the converged rate of conformant packets is less than said minimum information rate.

Abstract: A method and a network node for increased utilization of a transport network link over a transport network of a HSPA system. The method comprises detecting a data packet loss in receiving a data packet flow, and detecting data delay information of data packets as received. The method also comprises determining if the detected data packet loss comprise non-congestive data packet loss, based on the detected data packet loss and the detected data delay information. In addition, the method comprises, when the detected data packet loss comprises non-congestive data packet loss, for a pre-determined time period, omitting to perform a congestion action affecting the data packet flow. By determining whether a data packet loss is non-congestive or not, an unnecessary reduction of the bitrate over the transport network can be omitted.

Abstract: A method is provided of transporting data packets over a telecommunications transport network. The data packets are carried by a plurality of bearers, each carrying data packets that relate to different ones of a plurality of services. In the method bandwidth profiling is applied to the data packets of each bearer, independently of the other bearers, to identify and mark the data packets of each of the bearers that are conformant with a predetermined maximum information rate for the bearer. The data packets are forwarded for transport through the transport network, wherein, if there is insufficient bandwidth available in the transport network to transport all data packets, data packets not identified by the profiling as being conformant are discarded, so as not to be transported through the transport network.

Abstract: For implementing handling of congestions in a mobile network, a base station (100), e.g., an evolved Node B, is provided with at least one congestion controller (400, 400?). The congestion controller (400, 400?) operates in relation to data packets which are received from a transport network. The base station (100) then transmits the data packets on at least one radio link, which may be accomplished by using one or more scheduling queues (402) and a radio interface scheduler (410). A bitrate detector (404) measures a bitrate of the received data packets, and a bitrate limit calculator (408) calculates, on the basis of the measured bitrate, a maximum bitrate for transmission of the data packets on the radio link. A congestion detector (406) is used to detect a congestion in the transport network. In response to the detected congestion, the radio interface scheduler (410) schedules transmissions on the at least one radio link to meet the calculated maximum bitrate.

Abstract: According to an example method performed in a High Speed Downlink Packet Access (HSDPA) environment, a first device generates a High Speed Downlink Shared Channel (HS-DSCH) data frame that includes a plurality of blocks of packet data units. A first block of the plurality of blocks includes packet data units of a first length, and a second block of the plurality of blocks includes packet data units of a different, second length. The first device transfers the HS-DSCH data frame to a second device. The HS-DSCH data frame further includes, for each block of the plurality of blocks, a first information element that indicates a length of the one or more packet data units in the each block, and a second information element that indicates a quantity of packet data units in the each block.

Abstract: The invention relates to a method 20 in a base station 2 of a communication system 1 comprising a transport network 7 interconnecting the base station 2 with at least a gateway node 8. The communication system 1 further comprises one or more user equipment 3, 4. The method 20 comprises: obtaining 21 transport network congestion information, and adjusting 22, based on the transport network congestion information, a radio resource utilization parameter for at least one of the one or more user equipment 3, 4, wherein the radio resource utilization parameter comprises a ratio of used radio resources in a predefined block of radio resources and the number of network congestion radio resources of the predefined block.

Abstract: A first device (124) in a High Speed Downlink Packet Access environment (100) may generate a High Speed Downlink Shared Channel data frame (700, 730, 735, 750) that includes a group of packet data units, where a first packet data unit of the group of packet data units is of a different length than a second packet data unit of the group of packet data units. The first device (124) may further transfer the High Speed Downlink Shared Channel data frame (700, 730, 735, 750) to a second device (122).

Abstract: A mechanism is provided to resolve the Iub transport network congestion efficiently for HSDPA by dynamic adjustment of the transmit window of the RLC. The RLC protocol is extended with congestion control functionality. The Iub TN and Uu congestion detection method in the Node-B signals the congestion to the RNC, and this congestion indication is used by RLC to react on the congestion situation. In the RNC, the transmission window of the RLC is adjusted to control the flow rate. When congestion is detected, the RLC transmission window size is decreased. When there is no congestion, then the RLC transmission window size is increased automatically. Different types of congestion are distinguished and are handled in different ways. Alternatively, congestion control is achieved without any modification in the RLC layer from the existing standard. Here, RLC STATUS PDUs are used to change the RLC transmission window size.

Abstract: A method for congestion control in a transport network of a radio access network is disclosed. The method comprises receiving, by the control node, a first uplink flow through a first communication link in the transport network from a first radio access node and receiving, by the control node, a second uplink flow through a second communication link in the transport network from a second radio access node. If congestion is detected in the transport network for either uplink flow, the control node selectively triggers either Active Queue Management (AQM)-based congestion control at the control node, or local congestion control at the for the uplink flow. Triggering is carried out such that AQM-based congestion control is carried out for only one of the first uplink flow or the second uplink flow if congestion is detected for both the first uplink flow and the second uplink flow.

Abstract: The present invention is related to a method, base station (RBS) and computer program for quickly recovering from a detected congestion over the air interface. First the current bitrate at the which the air interface congestion has been detected is stored as a new reference bitrate. Thereafter, the base station (RBS) requests a reduction of the bitrate associated with the air interface. When the congestion condition has subsided the base station (RBS) requests a boost of the bitrate associated with the air interface up to the stored new reference bitrate. When finally the new reference bitrate has been reached, the base station (RBS) requests a linear increase of the bitrate associated with the air interface.

Abstract: Embodiments herein relate to a method in a radio network node (500,12,13,13) for informing a network control node (700,14) about a state of a connection between the radio network node (500,12,13,13) and a user equipment (10) served by the radio network node (500,12,13,13). The radio network node transmits to the network control node (700,14), an indication indicating a congestion or not a congestion of MAC-hs or MAC-ehs packets towards the user equipment (10).