Abstract:
The present invention provides a method, apparatus, gateway and a computer program product for reducing overhead on voice traffic within a packet based communication system. The present invention discloses collecting a plurality of packets to be multiplexed in an aggregated frame, measuring a number of received packets within a predetermined time period, and, if the number of received packets reaches a predetermined value, sending the aggregated frame including the collected packets.
Abstract:
The present invention provides a method, apparatus and a computer program product for improving TCP performance in mobile networks. The present invention discloses obtaining, at an intermediate network node, a quality measure of a connection between a content server and a user equipment, detecting, at the intermediate network node, whether the quality measure fulfils a predetermined condition, and, if the quality measure does not fulfill the predetermined condition, sending, by the intermediate network node, an acknowledgement message triggering a freeze mode of the connection between the content server and the user equipment.
Abstract:
The present invention provides a method, apparatus and a computer program product for improving TCP performance in mobile networks. The present invention discloses obtaining, at an intermediate network node, a quality measure of a connection between a content server and a user equipment, detecting, at the intermediate network node, whether the quality measure fulfils a predetermined condition, and, if the quality measure does not fulfill the predetermined condition, sending, by the intermediate network node, an acknowledgement message triggering a freeze mode of the connection between the content server and the user equipment.
Abstract:
A method of managing neighbour relations between cells in a cellular communication system comprising the steps of: receiving requests (350) for admission of a neighbour relation by an admission policy block (310) having a leaky bucket maintained in respect of that neighbour relation; adding tokens in respect of each request to the leaky bucket; removing tokens from the leaky bucket as time passes; and admitting the neighbour relation (320) if the number of tokens passes a threshold.
Abstract:
The present invention provides a method, apparatus, gateway and a computer program product for reducing overhead on voice traffic within a packet based communication system. The present invention discloses collecting a plurality of packets to be multiplexed in an aggregated frame, measuring a number of received packets within a predetermined time period, and, if the number of received packets reaches a predetermined value, sending the aggregated frame including the collected packets.
Abstract:
Flow statistics for a buffer that receives data from a plurality of other entities are collected, and an available bandwidth for an interface coupled to an output side of the buffer is determined. From those is determined an arrival rate such that the buffer would not be overloaded. A flow control message is sent to each of the entities that limits aggregate flow from the entities so as not to exceed the arrival rate. One embodiment uses a scaling factor in the flow control messages, the same scaling factor for each entity on any given scheduling interval. An entity receives the flow control message and from it determines an allowed amount CRallowed of packet data units PDUs for that scheduling interval. The lower of CRallowed and an allocation of granted credits CR is used to compute a send rate, which the entity uses as its maximum rate for the interval.
Abstract:
A method of managing neighbour relations between cells in a cellular communication system comprising the steps of: receiving requests (350) for admission of a neighbour relation by an admission policy block (310) having a leaky bucket maintained in respect of that neighbour relation; adding tokens in respect of each request to the leaky bucket; removing tokens from the leaky bucket as time passes; and admitting the neighbour relation (320) if the number of tokens passes a threshold.