Alcatel Lucent

Alcatel

Alcatel N.v.

Alcatel Sel Aktiengesellschaft

Stefan Wahl

Bodo Pfeiffer

Klaus Satzke

Karl Schrodi

Bozo Cesar

Dieter Kopp

Ralf Klotsche

Gert Eilenberger

Volker Laible

Markus Bauer

Karsten Oberle

Thomas Strauss

Peter Domschitz

Juergen Sienel

Jürgen Sienel

Thomas Banniza

Klaus-Dieter Menk

Marc Drewniok

Marcus Kessler

Wolfram Seibold

Bernhard Noe

The present document relates to cloud computing. In particular, the present document relates to methods and systems for cloud computing which enable the efficient and flexible placement of application components within a cloud. A computing device () is described. The computing device () is adapted to receive a plurality of component placement requests for one or more components () of a corresponding plurality of applications (); determine a plurality of feature vectors () from the plurality of component placement requests, respectively; wherein each feature vector () comprises vector dimensions which describe different attributes of the respective component placement request: determine a plurality of placement decisions () regarding the plurality of component placement requests, respectively: wherein each placement decision () comprises an indication of one or more executing computing devices () onto which the one or more components () of the respective application () have been placed; cluster the plurality of feature vectors (), thereby yielding one or more clusters (); wherein each cluster () comprises a default feature vector () describing the different attributes of a default component placement request; determine a default placement decision () for each of the one or more clusters; and store the one or more default feature vectors and the respective one or more default placement decisions () in a database () of the computing device ().

Method for mapping media components employing machine learning

The network computing cluster includes one or more network computing stations and one or more power autarkic network computing stations supplied by one or more associated local power generators. The power autarkic network computing stations and the local power generators are connected with a local power network. A control signal is sent to a resource managing unit of the network computing cluster via a communication network. The control signal indicates the ability of the power autarkic network computing stations to process IT-services. The resource managing unit receives the control signal via the communication network. Triggered by the control signal, the resource managing unit sends a signal for transferring an IT-service processed by a network computing station of the network computing stations to the network computing station via the communication network. The processed IT-service is transferred to one of the power autarkic network computing stations via the communication network.

Method of controlling a network computing cluster providing IT-services

The invention relates to a protection unit for protecting a packet-based network from attacks, comprising: a signature analyzer for analyzing a packet stream received in a security border node of the packet-based network and for detecting attacks by comparing signatures of the packet stream with a set of signatures of previously identified attacks, an anomaly detector for detecting anomalies in the packet stream, and a signature interference unit for updating the set of signatures when anomalies in the packet stream are detected, the updated set of signatures being subsequently used for performing the signature analysis. A distribution unit distributes at least one signature of the updated set of signatures to at least one further security border node of the packet-based network. The invention also relates to a security border node comprising such a protection unit, a network comprising at least two such protection units, and a corresponding protection method.

Attack protection for a packet-based network

The invention relates to a security border node () for protecting a packet-based network from attacks, comprising: an anomaly detection unit () for performing an anomaly detection, in particular a statistical analysis, on session control messages (), in particular on SIP messages contained in a packet stream () received in the security border node (). The security border node further comprises a message context provisioning unit () for providing at least one session control message () to the anomaly detection unit () together with message context information () related to a client () and/or to a session () to which the session control message (to) is attributed. The invention also relates to a method for protecting a packet-based network from attacks, to a computer program product, and to a packet-based network.

Method for protecting a packet-based network from attacks, and security border node

A method of evaluating an additional service for a device () of a user of a telecommunication system is described. The device () supports one or more basic services. The kind of basic service/s being provided by the device () is examined. An additional service that could be combined with the basic service/s already supported by the device () is searched.

Method of evaluating an additional service for a device of a user of a telecommunication system

The invention concerns a method of providing a Push-to-Talk (=PTT) service within one or more telecommunication networks () by means of a gateway-server () which sets up a virtual connection per PTT connection. The virtual connection provides information about the participating terminals () of the PTT connection, the service type to reach each terminal (), and the connection status of each terminal (). Thus, the gateway-server () is capable of providing the PTT service within and/or across different telecommunication networks comprising radio access telecommunication networks (), fixed wire-line telecommunication networks (), circuit-switched telecommunication networks (), and packet-switched telecommunication networks ().

Method of push-to-talk service

The invention concerns a method for providing features to the user of a telephone (HSA, . . . HSAn, HSS, . . . HSSm) that is connected to a central unit (CU) whereby, if said telephone (HSA, . . . HSAn, HSS, . . . HSSm) is currently not interconnected via the central unit (CU), said telephone (HSA, . . . HSAn, HSS, . . . HSSm) notifies the central unit (CU) at least about certain kinds of user activities, in case of such notification the central unit (CU) checks whether it is currently interconnected to another telephone assigned to the same subscriber as said notifying telephone (HSA, . . . HSAn, HSS, . . . HSSm) and in case of the existence of such interconnection, the notifying telephone (HSA, . . . HSAn, HSS, . . . HSSm) is interconnected in parallel to this interconnection, and if said notifying telephone (HSA, . . . HSAn, HSS, . . . HSSm) is not a telephone for digital communication, the other telephone is a telephone for digital communication.

Method for providing features to the user of a telephone, a central unit and a telecommunication system therefor

In LMDS systems the downlink bandwidth is continuously varying in time because each downlink burst uses a network termination individual modulation and coding (Physical layer) scheme, the higher layer (IP) functions cannot perform service priority respecting traffic shaping. The invention proposes mainly to combine both framing and IP layer functions within one inter-layer framer. The combination of both information ensures QoS provisioning in case of multi-modulation and multi-coding environment. The QoS queue server gets always informed on the actual amount of available data frame bits from the downlink framer and therefore, the QoS queue server is able to decide on the next IP packet or packet fraction to transport. This decision is always based on service priority aspects. As soon as the downlink frame is filled&#x2014;supposing that the maximum downlink frame rate is always lower than the internal processing in the inter-layer framer&#x2014;the QoS server stops the data delivery.

IP platform for advanced multipoint access systems

In a multiple access system, transmit authorizations are transmitted at a high rate in order to fulfil the requirements relating to the delay jitter. However, the transmit authorizations are transmitted only as long as is necessary. Following the reception of a data packet of a terminal, the transmission of further transmit authorizations for the same terminal is interrupted. Only after a specific time period, i.e. shortly before the expected transmission of a data packet of the same terminal, are transmit authorizations again sent to this terminal at a high data rate. In this way short time periods, in which transmit authorizations are sent to a terminal at a high rate, alternate with long time periods in which no transmit authorizations are sent to this terminal. In the long time periods, for example, transmit authorizations can be sent consecutively, in each case in short time periods, to one, two or more further terminals. In this way the bandwidth utilization is optimised.

Method of transmitting a data packet

A method is disclosed for assigning time slots in a system comprising a plurality of subscriber facilities (NT) connected to a center (HUB) via a common medium, the common medium being divided into a plurality of frequency or wavelength channels which are subdivided into time slots. The center assigns time slots to at least part of the subscriber facilities by specifying one channel and one time-slot number for each assigned time slot. After each time slot used, each subscriber facility involved changes to the next allocated channel. Each subscriber facility involved sends information in the time slot with the next assigned time-slot number. Also disclosed are a system, a center, and a subscriber facility for carrying out this method.

Method of assigning time slots, as well as system, center, and subscriber facility for carrying out this method

A procedure for operating a server (SERV) that supplies subscribers with data streams of different contents (CONT to CONT ), as well as a server and a control unit for executing the procedure. The contents (CONT to CONT ) are each stored in a memory unit or in several memory units of the server, and in order to supply a subscriber (SUB to SUB ) with a data stream of a particular content, the particular content is read out from the memory unit or from one of the memory units in which the content is stored, and sent to the subscriber as a data stream. A Busy list is set up for each of the contents (CONT to CONT ) stored in the memory units (DSD to DSD ) of the server (SERV). Each memory unit (DSD to DSD ) in which a content is stored, is allocated to the Busy list of the content stored in it. Each memory unit (DSD ) that is not at that time needed for supplying a subscriber, is allocated to a Free list. If a further memory unit is needed in order to supply subscriber with a particular content, a memory unit allocated to the Free list is selected for this purpose, and it is first attempted to select a memory unit allocated to the Free list that is also allocated to the Busy list of the particular content.

Management of memory units of data streaming server to avoid changing their contents by employing a busy list of allocated units for each content and a free list of non-allocated units

A communication system (KS) with a hierarchical server structure is indicated for a demand service, which makes possible a suitable compliance with requests for services from users (U1 . . . UN). To that end, the communication system (KS), as viewed by the respective user (U1 . . . UN), is divided into a central (I) and a local (II) distance zone. Movies (A1 . . . A10) frequently requested by the users (U1 . . . UN) are stored in local servers (SL1 . . . SLN) and seldom requested movies (B1 . . . B100) are stored in central servers (SM). According to the invention, in case the local server (SL1) is unable to provide a movie (B2) requested by a user (U11 . . . U13), the central server SM or another local server (SL2 . . . SLN) complies with the request through a switched connection between the requesting user (U11 . . . U13) and the central server (SM), or the other local server (SL2 . . . SLN).

Communication system with hierarchical server structure

A method of operating a switching network, a switching network, and an exchange with such a switching network are described. The switching network consists of several switching modules and an interconnect network between these switching modules. The interconnect network includes a switch unit and interconnects the switching modules in accordance with a logic interconnection structure. The switch unit is simple and can be implemented by all-optical means. By means of the switch unit the logic interconnection structure can be reconfigured. This makes it possible to reconfigure the switching network in the event of a failure of a switching module or according to the load characteristic (video, voice, computer-computer communication). Further, a uniform switch unit can be used to meet different requirements ('flexible hardware').

Method of operating a switching network, as well as switching network

For traffic mixing, an implementation involves generating a random element in a device that detects nondeterministic events already occurring in operation of the device and mapping them to the random element by means of an assignment rule. The traffic mixing in an ATM switching element (SE) is achieved by cyclically writing data packets into a buffer (MEM) and cyclically reading data packets out of a buffer (MEM). The write cycle in this case is clocked by the arrival of a data packet, that is, by a nondeterministic event. The read cycle is clocked by a stable clock signal.

Method of generating a random element as well as a method for traffic

A buffer or other communications resource in, e.g., an ATM switch element receives random data which is then used by different data sinks. After the data has been outputted to the data sinks, the communications resource (e.g., the memory locations of the buffer) are released, i.e., labeled as free again. However, a resource which is not marked as free as a result of an error (whether erroneously the data is not retrieved or whether the release procedure is erroneous) remains blocked. To avoid permanent blockage of those memory locations whose contents have been in the buffer so long that they definitely (or at least very likely) should have been called for, information on the time of entry is stored together with the data. All memory locations are checked at regular intervals for the age of their contents. Upon attainment of a predetermined age, the location is labeled as free.

Growing community of inventors

Schwieberdingen, Germany

Stefan Wahl