Abstract: Apparatuses and methods in a communication system are provided. The solution comprises operating a radio access network, where the radio access network comprises two or more resource tiers, each tier having different latency/timing requirements. The resource allocation for the radio access network is realised (200) with two or more control loops, where each control loop is configured to allocate resources with different latency requirements, and control resources between the tiers. Resources of the inmost tier are controlled (202) by an inmost control loop with lowest latency resource allocation, and resources of the outer tiers are controlled (204) by one or more outer control loops for less latency critical resource allocation, each outer control loop having less critical latency requirement compared to loops closer to the inmost loop.

Abstract: It is provided a method, including monitoring if an information on a first pairing condition is received, wherein the first pairing condition indicates that a first flow is suitable for pairing under the first pairing condition; checking, if the information on the first pairing condition is received, for at least one of one or more stored second pairing conditions, if the respective stored second pairing condition matches the first pairing condition, wherein each of the one or more second pairing conditions indicates that a respective second flow different from the first flow is suitable for the pairing under the respective second pairing condition; pairing the first flow and one of the second flows if the second pairing condition related to the one of the second flows matches the first pairing condition.

Abstract: This document discloses a solution for scheduling resources in a network using split frequency domain scheduling and time domain scheduling. According to an embodiment, a method for a frequency-domain scheduler comprises: receiving, by the frequency-domain scheduler from a first time domain scheduler employing a first scheduling policy to schedule time domain resources, a first scheduling request comprising a first priority indicator; receiving, by the frequency-domain scheduler from a second time domain scheduler employing a second scheduling policy different from the first scheduling policy, a second scheduling request comprising a second priority indicator provided on the same scale as the first priority indicator; and scheduling, by the frequency-domain scheduler, frequency domain resources to the first time domain scheduler and the second time domain scheduler on the basis of the first priority indicator and the second priority indicator.

Abstract: Apparatuses and methods in a communication system are provided. The solution comprises operating a radio access network, where the radio access network comprises two or more resource tiers, each tier having different latency/timing requirements. The resource allocation for the radio access network is realised (200) with two or more control loops, where each control loop is configured to allocate resources with different latency requirements, and control resources between the tiers. Resources of the inmost tier are controlled (202) by an inmost control loop with lowest latency resource allocation, and resources of the outer tiers are controlled (204) by one or more outer control loops for less latency critical resource allocation, each outer control loop having less critical latency requirement compared to loops closer to the inmost loop.

Abstract: Embodiments can provide an apparatus, a method and/or a computer program for routing data packets in a radio access network. The apparatus 10 comprises means for receiving 12 a data packet 804 from a source network node, the data packet comprises a data packet header and a data packet payload. The apparatus 10 further comprises means for inspecting 14 the data packet. The means for inspecting 14 is operative to perform a first packet inspection on the data packet header to determine information on a source or a destination of the data packet from the data packet header, and the means for inspecting 14 is operative to perform a second packet inspection on the data packet payload based on the information on the source or the destination of the data packet to determine information on an identification of the destination of the data packet.

Abstract: The present document describes a system comprising at least two processing nodes (1) that are connected by a network, and an application distribution function, which automatically distributes processing components (3) of an application to be run on the system over the nodes (1). The system is configured, when a sending processing component and a corresponding receiving processing component are arranged on different nodes, to determine, based on information about the processing component (3) which receive the data, in which representation to send the data via the corresponding communication channel (4).

Abstract: The present document describes a system comprising at least two processing nodes (1) that are connected by a network, and an application distribution function, which automatically distributes processing components (3) of an application to be run on the system over the nodes (1). The system is configured, when a sending processing component and a corresponding receiving processing component are arranged on different nodes, to determine, based on information about the processing component (3) which receive the data, in which representation to send the data via the corresponding communication channel (4).

Abstract: The invention concerns a method of processing a plurality of data packets in a packet switched communication network comprising at least one switching device (1) as well as a corresponding switching device. The switching device (1) comprises two or more sub-engines (21, . . . , 29). A control unit (7) of the at least one switching device (1) receives a data packet comprising a header (10) of a communication packet exchanged via the communication network. The control unit (7) applies at least one filter operation (50) to the header (10) and generating thereby filtered information (100). The control unit (7) maps the filtered information (100) on a hash-tag (30) according to a hash-function (300). The control unit (7) provides a tagged-header (11) by means of inserting the hash-tag (30) in the header (10) of the data packet. The control unit (7) sends the data packet to a sub-engine (24) of the two or more sub-engines (21, . . .

Abstract: Embodiments can provide an apparatus, a method and/or a computer program for routing data packets in a radio access network. The apparatus 10 comprises means for receiving 12 a data packet 804 from a source network node, the data packet comprises a data packet header and a data packet payload. The apparatus 10 further comprises means for inspecting 14 the data packet. The means for inspecting 14 is operative to perform a first packet inspection on the data packet header to determine information on a source or a destination of the data packet from the data packet header, and the means for inspecting 14 is operative to perform a second packet inspection on the data packet payload based on the information on the source or the destination of the data packet to determine information on an identification of the destination of the data packet.

Abstract: A zoom method and apparatus utilizing object detection. For example, some embodiments allow a user to zoom in or out from the digital content being displayed by moving their head towards or away from the display screen.

Abstract: The invention concerns a method of processing a plurality of data packets in a packet switched communication network comprising at least one switching device (1) as well as a corresponding switching device. The switching device (1) comprises two or more sub-engines (21, . . . , 29). A control unit (7) of the at least one switching device (1) receives a data packet comprising a header (10) of a communication packet exchanged via the communication network. The control unit (7) applies at least one filter operation (50) to the header (10) and generating thereby filtered information (100). The control unit (7) maps the filtered information (100) on a hash-tag (30) according to a hash-function (300). The control unit (7) provides a tagged-header (11) by means of inserting the hash-tag (30) in the header (10) of the data packet. The control unit (7) sends the data packet to a sub-engine (24) of the two or more sub-engines (21, . . .

Abstract: A method for protecting a network configuration set up by a spanning tree protocol, STP, by selecting one of a plurality of bridges (2 to 11) of a computer network (1) as a root bridge (2) and by selecting one of a plurality of bridge ports (2a to 11a, 3b, 4b, 6b, 7b, 9b, 10b) of each of the plurality of bridges (2 to 11) as a root port (2a to 11a), the method comprising the steps of: setting a sub-state of at least one bridge port (2a to 11a, 3b, 4b, 6b, 7b, 9b, 10b) of at least one of the bridges (2 to 11) to an active sub-state in case that bidirectional traffic passes through the bridge port (2a to 11a, 3b, 4b, 6b, 7b, 9b, 10b), receiving an STP message, in particular a Bridge Protocol Data Unit, BPDU, in one of the bridge ports (2a to 11a, 3b, 4b, 6b, 7b, 9b, 10b) being in the active sub-state, and protecting the network configuration by discarding the STP message and/or by sending an alarm message to a network management unit (27) in case that the STP message indicates a change of the root bridge (2) of

Abstract: There is provided a method of performing a handover of a mobile station. The method in accordance with the invention comprises the step of receiving a dataflow which comprises the downlink data traffic to the mobile station and the step of queuing the dataflow. The method in accordance with the invention comprises further the step of generating a first dataflow during handover of the mobile station from the queued dataflow, wherein the first dataflow has a dataflow rate which is below a given first rate. The first dataflow is sent towards the mobile station during handover. The method in accordance with the invention furthermore comprises the step of generating a second dataflow from the queued dataflow after completion or abortion of the handover, wherein the second dataflow has a dataflow rate which is above a given second rate. The second dataflow is sent towards the mobile station.

Abstract: A Doppler compensation method is used for radio transmission between a mobile body possibly but not exclusively a train and some base station, both mobile body and base station comprise respectively a transceiver connected to an antenna for the radio transmission. The method comprises the step of determining the direction of motion of the mobile body with respect to the active base station i.e. the base station to which a radio transmission link is just built. The method is then followed by the step to apply a constant Doppler compensation corresponding to the cancellation of the Doppler effect for a mobile body moving in the same direction at predefined limiting speed of motion (vlimit) at which a quality threshold is reached with the used radio transmission technology in the case without a Doppler compensation.

Abstract: The invention concerns a method in a peer (201) for authenticating the peer (201) to an authenticator (220), wherein the method comprises the steps of establishing (101) a network link to the authenticator (220), receiving (102) a challenge message from the authenticator (220) over the network link, the challenge message comprising a challenge value, calculating (104) a response value by applying a one-way function to at least the challenge value and a secret value, and sending (105) a response message to the authenticator (220) over the network link, the response message comprising the response value, wherein, in order to validate a computer-readable program (204) stored by the peer (201) for execution by the peer (201), the secret value is calculated (103) from the computer-readable program (204). The invention further concerns a device (201) and computer program product therefore.

Abstract: A traffic control device (50) for a Quality of Service-aware packet-based network (10) comprises detection means (52) for detecting packet flows in a packet stream (46) by preferably repeatedly performing a data packet inspection on the packet stream (46), the data packet inspection being neither based on signaling information nor on application awareness, determining means (54) for determining a flow parameter, in particular a flow rate, of at least one of the detected packet flows, assignment means (56) for generating assignment information assigning a resource of the packet-based network (10) to the at least one detected packet flow in dependence of the detected flow parameter, and sending means (58) for sending the assignment information to a resource control device (44) for causing the resource control device (44) to allocate the assigned resource. In such a way, reliable and cost-efficient quality of service management in a packet-based network (10) is facilitated.

Abstract: A method for protecting a network configuration set up by a spanning tree protocol, STP, by selecting one of a plurality of bridges (2 to 11) of a computer network (1) as a root bridge (2) and by selecting one of a plurality of bridge ports (2a to 11a, 3b, 4b, 6b, 7b, 9b, 10b) of each of the plurality of bridges (2 to 11) as a root port (2a to 11a), the method comprising the steps of: setting a sub-state of at least one bridge port (2a to 11a, 3b, 4b, 6b, 7b, 9b, 10b) of at least one of the bridges (2 to 11) to an active sub-state in case that bidirectional traffic passes through the bridge port (2a to 11a, 3b, 4b, 6b, 7b, 9b, 10b), receiving an STP message, in particular a Bridge Protocol Data Unit, BPDU, in one of the bridge ports (2a to 11a, 3b, 4b, 6b, 7b, 9b, 10b) being in the active sub-state, and protecting the network configuration by discarding the STP message and/or by sending an alarm message to a network management unit (27) in case that the STP message indicates a change of the root bridge (2) of

Abstract: A router which facilitates a simplified load balancing is provided. The router contains at least one buffer memory for the intermediate storage of pointers for information packets in at least two different buffer memory areas, a readout unit for reading out the different buffer memory areas one after the other in predetermined time windows, and at least one RED processing unit. A feedback loop is provided from the readout unit to at least one RED processing unit in order to control the activation and de-activation of the RED processing unit. Indirect information about the occupancy levels of the buffer memory areas is passed via the feedback loop to the at least one RED processing unit. The readout unit operates with the weighted round robin mechanism and transmits information about buffer memory locations processed in the time slots to the at least one RED processing unit.

Abstract: The object of the invention is to create a router which has an enhanced processing speed. According to the invention, before access through a readout unit, the pointers for information packets stored in the buffer memory are arranged as required. If an overflow is imminent in a buffer memory area, for example, then individual pointers are selected and removed from the buffer memory area. The selected pointers are shifted into an additional buffer memory area, for example. This additional buffer memory area is then preferentially read out, so that the selected pointers are read out before the pointers in the buffer memory area. The criterion for the selection of a pointer is, for example, an expired reactivation time or a buffer memory area that is filled above a threshold value.

Abstract: The invention relates to a procedure for the allocation of time slots for a transmission of data in variable time slots between a controller of a packet-oriented data network on the one hand and a terminal of a user of the data network on the other hand. The time slots are assigned to a terminal for a data flow following request made by the terminal and in dependence on the transmission capacity available in the data network, and are temporarily stored in a ring buffer before they are allocated to the terminal at a predefinable allocation instant. In order to simplify and accelerate the allocation of time slots in such a data network, it is proposed that a temporal write range be defined in the ring buffer by a variable first upper time threshold and a variable first lower time threshold.