Alcatel Lucent

Alcatel

Nokia Solutions and Networks Oy

Ralf Klotsche

Bernd Haberland

Stefan Wahl

Michael Tangemann

Markus Bauer

Peter Schefczik

Thomas-Rolf Banniza

Juergen Sienel

Hans Peter Schefczik

Peter Tabery

Klaus Wünstel

Elmar Schmidberger

Markus G Bauer

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.

Scheduling in cloud radio access network

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 () 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 () by an inmost control loop with lowest latency resource allocation, and resources of the outer tiers are controlled () 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.

Resource management in cloud radio access networks

Embodiments can provide an apparatus, a method and/or a computer program for routing data packets in a radio access network. The apparatuscomprises means for receivinga data packetfrom a source network node, the data packet comprises a data packet header and a data packet payload. The apparatusfurther comprises means for inspectingthe data packet. The means for inspectingis 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 inspectingis 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. The apparatusfurther comprises means for determininginformation on a subsequent network node based on the information on the identification of the destination of the data packet.

Apparatus, method and computer program for routing data packets

The present document describes a system comprising at least two processing nodes () that are connected by a network, and an application distribution function, which automatically distributes processing components () of an application to be run on the system over the nodes (). 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 () which receive the data, in which representation to send the data via the corresponding communication channel ().

Automated adaption of a codec

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

Method for processing a plurality of data and switching device for switching communication packets

A method for protecting a network configuration set up by a spanning tree protocol, STP, by selecting one of a plurality of bridges (to) of a computer network () as a root bridge () and by selecting one of a plurality of bridge ports (to,) of each of the plurality of bridges (to) as a root port (to), the method comprising the steps of: setting a sub-state of at least one bridge port (to) of at least one of the bridges (to) to an active sub-state in case that bidirectional traffic passes through the bridge port (to), receiving an STP message, in particular a Bridge Protocol Data Unit, BPDU, in one of the bridge ports (to) 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 () in case that the STP message indicates a change of the root bridge () of the network configuration.

Method for protecting a network configuration set up by a spanning tree protocol

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. In other aspects the invention relates to a communication network, to a communication network component and to a computer program product for performing the method in accordance with the invention.

Method of performing a handover

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 (v) at which a quality threshold is reached with the used radio transmission technology in the case without a Doppler compensation.

Doppler compensation control for radio transmission

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.

Router which facilitates simplified load balancing

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.

Router with overflow management

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.

Procedure and controller for the allocation of variable time slots for a data transmission in a packet-oriented data network

The invention relates to a procedure for the 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, time slots for the data transmission being assigned to a terminal following request made by the terminal and in dependence on the transmission capacity available in the data network. In order to create the possibility of enabling known data networks for the transmission of data in variable time slots to be used also for QoS applications without restriction of the functionality, it is proposed that the data transmission rate be monitored separately for each data flow of a terminal of the data network.

Growing community of inventors

Neuenbürg, Germany

Ralf Klotsche