Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A system and method for managing a server in a packet data network. A transport protocol session is established between a client (20) and server (14_1) to transfer content from the server to the client in data packets. The transport protocol path is assigned an n-tuple identifier, whereupon the server transmits to the client data packets with the n-tuple identifier. The server additionally transmits declarative information as signaling packets with the n-tuple identifier, wherein the declarative information includes an identifier which is specific to the data being transmitted in the ongoing session. This allows other servers (14_2) to receive the signaling packets and detect the data that is being transmitted. If such another server then determines that it also has the same data and is better placed to serve that data to the client, it can offer to take over the session.

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

Abstract: Method in and a network node (160; 110; 401a, 600) for congestion management of a transport network (130) comprised in a wireless communications network (100). The wireless communications network (100) further comprises a base station (110; 401a) configured to receive data being transported via a data transport path (132; 404a,d) of the transport network (130) and to transmit the received data to one or more wireless devices (120) served by the base station (110; 401a). The network node obtains (302; 409; 501) an indicator indicating at least a risk for occurrence of downlink data congestion in the data transport path (132; 404a,d). To reduce said at least risk, the network node then controls (304; 411; 502) the base station (110; 401a) to reduce and/or limit a throughput rate of data being transmitted to the one or more wireless devices (120). The data is received by the base station (110; 401a) via the data transport path (132, 404a,d).

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Methods and a first node, a second node and a network node for managing traffic characteristics of one or more packets on a connection are disclosed. The first node exchanges, with the network node, traffic characteristic semantics and a common key for encryption of a traffic characteristic value to be applied for the one or more packets on the connection, wherein the traffic characteristic semantics include the traffic characteristic value and an associated characteristic for the one or more packets. Moreover, the first node sends the traffic characteristic value and the common key to the second node. The network node checks and applies the traffic characteristics value according to service policies of the network node. Next, the first node exchanges, with the second node, payload which includes one or more packets over the connection. Information about the traffic characteristic value is included in a transport header of each packet carrying the payload.

Abstract: A system and method for managing a server in a packet data network. A transport protocol session is established between a client (20) and server (14_1) to transfer content from the server to the client in data packets. The transport protocol path is assigned an n-tuple identifier, whereupon the server transmits to the client data packets with the n-tuple identifier. The server additionally transmits declarative information as signaling packets with the n-tuple identifier, wherein the declarative information includes an identifier which is specific to the data being transmitted in the ongoing session. This allows other servers (14_2) to receive the signaling packets and detect the data that is being transmitted. If such another server then determines that it also has the same data and is better placed to serve that data to the client, it can offer to take over the session.

Abstract: A node of a data network receives data packets (200). For at least one of the received data packets (200), the node determines whether the data packet (200) 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 (200) is anon-guaranteed data packet and determining that sufficient excess resources are present, the node forwards the data packet (200) based on the excess resources.

Abstract: A system, method, node and computer program for transfer of downlink data packets from a server (120) to a client (100) across at least one first data packet transport domain (130) and at least one second data packet transport domain (140) is disclosed. The two data packet transport domains (130, 140) have different transport characteristics and are interconnected via at least one proxy (110). The server (120) is located in front of the first data packet transport domain (130) and the client (100) is located behind the second data packet transport domain (140). The method comprises sending, by the server (120), a data packet to the client (100) and sending, by the proxy (110), responsive to the reception of the data packet, an acknowledgement to the server (120) acknowledging the reception of the data packet or a failure to receive the data packet at the proxy (110).

Abstract: A node (120) receives data packets. For each of the received data packets, the node (120) extracts a first value from the data packet. The first value indicates a delay requirement of the data packet. For each of the received data packets, the node (120) also extracts a second value from the data packet. The second value indicates a level of importance assigned to the data packet. Depending on the first values and the second values, the node (120) controls forwarding of the received data packets.

Abstract: It is provided a system comprising a sender entity, a receiver entity, and a network entity interposed between the sender entity and the receiver entity. The receiver entity is configured to send a connection request to the sender entity, and to further send to the sender entity at least one encrypted meta-information for said connection. The sender entity is configured to insert the at least one encrypted meta-information into at least one packet of the connection. The network entity is configured to decrypt the at least one meta-information and to process the at least one packet on the basis of the decrypted at least one meta-information.

Abstract: 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.

Abstract: Methods and apparatus for controlling a communication network (2) to deliver traffic to and/or from an end node (4) are presented. In an example method, a network node (8) receives information indicating a user-controllable selection at the end node (4) to have at least some of the end node (4)'s traffic delivered with a low priority level that is lower than a high priority level. Accordingly, the network node (8) controls the communication network to deliver at least some of the end node (4)'s traffic with said low priority level and awards one or more tokens accordingly. Furthermore, the network node (8) may receive information indicating a user-controllable selection at the end node (4) to have at least some traffic delivered with the high priority level. The network node (8) may accordingly redeem one or more tokens awarded to the end node (4) and controlling the communication network (2) to deliver at least some of the traffic with said high priority level.