Telefonaktiebolaget Lm Ericsson (publ)

Optis Cellular Technology, LLC

Unwired Planet, LLC

Szilveszter Nádas

Sándor Rácz

Peter Carl Lundh

Attila Mihály

János Harmatos

Balázs Peter Gerö

Balázs Varga

Szabolcs Malomsoky

Norbert Reider

Zoltán Richárd Turányi

András Zahemszky

Zoltan Nagy

Lars Westberg

János Farkas

Martin Skarve

Gergely Pongrácz

Zoltán Turányi

László Hévizi

Sandor Laki

Lars Blomstergren

Illés Antal Horváth

András Mészáros

Miklos Telek

György Miklós

Anna Larmo

Ina Widegren

Csaba Keszei

Zoltan Richard Turanyi

Min Liao

Gergo Gombos

Pál Pályi

Zoltán Nagy

Gergö Gombos

Zoltan Nagy C

Jonas Edstam

Karl-Magnus Möller

Johan Torsner

Robert Bengt Skog

Johan Kölhi

Carola Faronius

Geza Szabo

András Veres

Marcus Ihlar

Aldo Bolle

Zoltan Kiss

Mats Zachrison

Ferenc Fejes

Sándor Laki

Wenbiao Wu

László Hévízi

Zoltán Nagy C

Sandor Rácz

Sándor Racz

Laszlo Rozgonyi

Ulf Rosberg

Jan Söderström

Zoltán Richárd TURÁNYI

Jan SÖDERSTRÖM

László HÉVIZI

Karl Magnus Moeller

Balázs Péter GerÖ

Karl-Magnus MÖLLER

Ina Birgitta Widegren

A boost is provided in an overloaded system by distinguishing nodes with a 'bad' traffic history from nodes with a “good” traffic history. In so doing, a core network node is able to apply additional resources to the node(s) having a “good” history in the form of a boost factor. Based on a system capacity and a working point, e.g., a critical number of active nodes with a “bad” traffic history, the core network node may determine a throughput history limit belonging to the “bad” traffic history. Responsive to expected requirements for a newly active node (i.e., a node having a “good” traffic history), the core network node determines a boost factor for the newly active node, applies the boost factor to the average resources allocated to the nodes with the “bad” traffic history to determine boosted resources, and allocates the boosted resources to the newly active node.

Dimensioning granular multi-timescale fairness

A network node (), such as a packet marking node, efficiently measures the bitrates of incoming packets on a plurality of timescales (TSs). A throughput-value function (TVF) is then graphed to indicate the throughput-packet value relationship for that TVF. Then, starting from the longest TS and moving towards the shortest TS, the packet marking node determines () a distance between the TVFs of different TSs at the measured bitrates. To determine the packet marking, the packet marking node selects a random throughput value between 0 and the bitrate measured on the shortest TS. Depending on how the random value relates to the measured bitrates, a TVF, and the distances to add to the random value, is then selected to determine () a packet value (PV) with which to mark the packet. The packet marking node then marks () the packet according to the determined PV.

Multi-timescale packet marker

Embodiments of the invention include methods for handling packets in a communications network. In one embodiment, a method is implemented in an electronic device. The method includes at a first end of a queue in the electronic device, determining admission of a first packet to the first end of the queue based on a length of the first packet, where when the admission of the first packet would cause the queue to become full, the admission is further based on a packet value of the first packet and a data structure tracking packet value distribution of packets in the queue. The method further includes at a second end of the queue, dropping a second packet from the second end of the queue when the second packet's corresponding packet value is marked as to be dropped in the data structure upon admitting packets to the first end of the queue.

Packet value based packet processing

A node () of a communication network forwards a first data packet () from a server () to a client (). Further, the node detects a congestion affecting the first data packet (). Further, the node () generates at least one second data packet () addressed to the server (). The at least one second data packet () indicates the detected congestion and comprises verification information enabling the server () to verify that the indicated congestion relates to the first data packet ().

Congestion notification by data packet from intermediate node

To support quality of service fairness in a communication network, a network node determines a maximum bucket size, for a token bucket controlling a transmission rate from the network node over a transport line between a radio access network and a core network, based on a drop precedence and a given timescale.

Maximum bucket sizes for multiple timescales

The invention relates to a method for controlling a transmission buffer in a transmission node of a transmission network transmitting data packets of a data packet flow, wherein each data packet includes a delay value indicating a transmission delay requirement of the data packet and a packet value indicating a level of importance of the data packet. The buffer includes different buffer regions and an arriving data packet is put into its respective buffer region based on the delay requirement indicated by a delay value contained in the data packet. The number of bytes waiting before the freshly arrived data packet cannot increase so that the delay requirement is met and possibly other packets in the buffer might be dropped for the newly arriving packet.

Delay-aware resource sharing

At an Edge Node, a method of handling data packets in order to mark the packets with respective packet values indicative of a level of importance. The method comprises implementing a variable rate token bucket to determine an estimated arrival rate of a flow of packets. The method comprises receiving a data packet, updating the estimated arrival rate to an updated arrival rate based on a token level of the token bucket and generating a random or pseudo-random number within a range with a limit determined by the updated arrival rate. The method further comprises identifying an operator policy which determines a level of service associated with the flow of packets, and a Throughput Value Function (TVF) associated with said policy, and then applying the TVF to the random number to calculate a packet value. The packet value is included in a header of the packet.

Probabilistic packet marking with fast adaptation mechanisms

Regulating transmission of data packets between a first network and a second network over a datalink. Embodiments include determining a first plurality of token bucket rate (TBR) parameters, each TBR parameter corresponding to a one of a first plurality of packet drop precedence (DP) levels and one of a first plurality of timescales (TS). The determination of the first plurality of bucket rate parameters is based on a peak rate requirement, the data link capacity, and a nominal speed requirement associated with the data link. Embodiments also include determining a second plurality of TBR parameters based on the first plurality of TBR parameters and a guaranteed rate requirement, the second plurality comprising a further DP level than the first plurality. Embodiments also include regulating data packets sent between the first network and the second network via the data link based on the second plurality of TBR parameters.

Probabilistic service level agreements (SLA)

A node of a data network receives data packets (). For at least one of the received data packets (), the node determines whether the data packet () is a guaranteed data packet which is subject to a guarantee that the data packet is not dropped and not delayed by more than a certain delay limit or a non-guaranteed data packet which is not subject to the guarantee. Based on a worst case calculation of a delay experienced by a data packet forwarded by the node, the node configures a resource contingent with a maximum amount of resources which is more than a minimum amount of resources required to meet the guarantee. Further, the node assigns resources to the resource contingent and identifies resources in excess of the minimum amount as excess resources. In response to determining that the data packet () is a non-guaranteed data packet and determining that sufficient excess resources are present, the node forwards the data packet () based on the excess resources.

Resource efficient forwarding of guaranteed and non-guaranteed data packets

There is a provided herein a proxy at a border between two transport domains, the proxy arranged to deliver packets to a communications device in a first transport domain; the packets received from a server in a second transport domain. The proxy is arranged to: receive a packet from the server, the packet directed to the communications device; and forward the packet to the communications device and reply to the server with a traffic handling offer message, the traffic handling offer message including a plurality of traffic handling options. The proxy is further arranged to receive a selection of a traffic handling option from the server; and apply the selected traffic handling option to packets sent from the server to the communications device via the proxy.

Data transmission in wireless communications networks

A system and method for server relocation in a packet data network. A transport protocol session is established between a clientand server_to transfer content from the server to the client in data packets. As well as transmitting data packets to the client, the server additionally transmits declarative information as signaling packets. The declarative information includes an identifier of the content being transmitted in the ongoing session. This allows other servers_with the same content to identify the existence of the session and gives them the opportunity to volunteer to take over the session, for example if they can see that the client is now closer to them than the server currently serving the content. The two servers can then coordinate transfer of the session, whereafter the session continues with the second server transmitting content to the client.

Transport protocol server relocation

A system, method, node and computer program for transfer of downlink data packets from a server () to a client () across at least one first data packet transport domain () and at least one second data packet transport domain () is disclosed. The two data packet transport domains () have different transport characteristics and are interconnected via at least one proxy (). The server () is located in front of the first data packet transport domain () and the client () is located behind the second data packet transport domain (). The method comprises sending, by the server (), a data packet to the client () and sending, by the proxy (), responsive to the reception of the data packet, an acknowledgement to the server () acknowledging the reception of the data packet or a failure to receive the data packet at the proxy (). The method further comprises forwarding, by the proxy (), the received data packet to the client () and deleting, by the proxy (), after sending of the acknowledgement to the server () and forwarding the received data packet to the client (), the received data packet in the proxy () and determining, by the server (), a delivery status of the data packet or a failure location in either of the two data packet transport domains () based on acknowledgements received from the client () and/or the proxy ().

Handling of data packet transfer via a proxy

A method, in a first node, for handling one or more jobs, wherein said first node receives a job over an incoming link, which job comprises a job value, wherein said method comprises the steps of determining, by said first node, a deviation of a queuing delay of the first communication node from a target queuing delay value, and using, by said first node, said deviation as an error value to determine a dropping probability which is used to determine a threshold value, wherein said threshold value corresponds to or is associated with a congestion level of a queue of the job, comparing, by said first node, the job value with the threshold value and establishing that said job value is below said threshold value, dropping, by said first node, said job based on said comparison.

First communication node, method performed thereby, computer program and computer-readable storage medium for handling packets in a communications network

A technique for Transport Protocol, TP, selection and setup of a connection between a client and a server is disclosed. An exemplary method aspect (in the client), comprises the steps of preparing a session setup message comprising: i) setup information for at least one candidate TP, and ii) a preference order for setup of the at least one TP; transmitting the prepared session setup message towards the server; and receiving, in response to the transmitted session setup message, a setup response message comprising setup information pertaining exclusively to one TP selected for the connection. A further method aspect (in the server) comprises the steps of receiving the session setup message; selecting, depending on availability of the candidate TPs, the most preferred TP on the basis of the preference order; and transmitting, in response to the received session setup message, the setup response message.

Technique for transport protocol selection and setup of a connection between a client and a server

A node classifies data packets into different classes and replicates the data packets according to a number of redundant links configured for transmission of the data packets to obtain, for each of the redundant links, a redundant version of the data packets. For a first one of the classes, the node marks all redundant versions of the data packets with a first indication that the data packet is a guaranteed data packet. For a second one of the classes, the node marks at least one of the redundant versions of the data packets with a second indication that the data packet is a guaranteed data packet and marks at least one other of the redundant versions of the data packets with a third indication that the data packet is a non-guaranteed data packet.

Transmission of guaranteed and non-guaranteed data packets on redundant links

Growing community of inventors

Budapest, Hungary

Szilveszter Nádas