Alcatel-lucent USA Inc.

Alcatel Lucent

Lucent Technologies Inc.

Other

Bhawna Gupta

Swarup Acharya

Anurag Srivastava

Pankaj Risbood

Randeep Singh Bhatia

Elisha Yehuda Rosensweig

T V Lakshman

Jairo Orlando Esteban

Steven A Benno

Network-based, unsupervised classifiers are provided. The classifiers identify both known and unknown attacks aimed at industrial networks without the need to have a priori knowledge of known malicious attack patterns.

Systems and methods for securing industrial networks

Various embodiments provide a method and apparatus for allocating resources to applications (e.g., application processes) using pre-provisioned resource configurations (e.g., VMs or containers) that are based on clustered historical resource usage data. In particular, the set of pre-provisioned resources required to support elasticity in a set of applications is reduced by determining a subset of pre-provisioned resource configurations that are able to be reused across multiple applications. A pre-provisioned resource configuration being based on a determined dominant center for the resource cluster associated with the pre-provisioned resource configuration.

Method and apparatus for provisioning resources using clustering

A method and apparatus for substantially minimizing overhead over-provisioning costs in machine configurations is disclosed. The method involves the steps of: clustering a plurality of given machine configurations into a quantity of clusters less than or equal to a pre-specified amount; determining a respective dominant provisioning machine configuration for each cluster of the quantity of clusters; and determining an overall over-provisioning resource cost associated with the respective quantity of clusters and associated respective dominant provisioning machine configurations; and assigning to a mapping function the respective associated dominant provisioning machine configuration of each respective cluster of the quantity of clusters as the target for the given machine configurations of each respective cluster of the quantity of clusters. The method for substantially minimizing overhead over-provisioning costs in machine configurations provides advantages over systems known in the art by allowing minimization of average overhead due to over-provisioning costs as well as minimizing the maximum overhead due to over-provisioning costs.

Minimizing overhead over-provisioning costs in machine configurations

In one embodiment, a method comprises monitoring network data associated with a cell of a communication network for one or more channel conditions, estimating total cell capacities for respective channel conditions based on the monitored network data, and estimating an available cell capacity based at least in part on the total cell capacity estimates and a portion of the monitored network data. The method may also include sending information derived from at least a portion of the network data to a server and receiving from the server total cell capacities for respective channel conditions, where the total cell capacities received from the server are used to estimate the available cell capacity. The method may further include sending the available cell capacity estimate to the server and receiving from the server an available cell capacity.

Estimating available cell capacity based on monitored network data

Methods and apparatus for recording programming content in a signal distribution system are disclosed. In one aspect of the invention, an interrupt is received, which may be associated with an incoming telephone call, email message, alarm or other type of message, and a corresponding interrupt indicator is presented on a user interface screen of a device such as television, laptop computer, mobile telephone, etc. Also presented on the user interface screen of the device is an activatable pause control that if activated initiates recording of a portion of the programming content that would otherwise be presented via the device absent activation of the pause control. Various trick play functions, such as pause, play, forward and rewind, may be provided utilizing the recorded portion of the programming content.

Signal distribution system with interrupt processing and trick play functionality

Advertisements or other types of targeted information are delivered to a set-top box or other user interface device of signal distribution system. In one aspect of the invention, a detection server of the system detects at least one cue associated with a first media stream, and generates timing information from the detected cue. The timing information is signaled to the interface device. An advertisement server of the system generates a second media stream containing targeted information for delivery to the user interface device. The user interface device switches from the first stream to the second stream based on the timing information. The timing information may also be signaled by the detection server to the advertisement server, for use in controlling generation of the second stream.

Targeted advertisement insertion with interface device assisted switching

A subscriber or other user is provided with access to a subscription service of a signal distribution system at a location remote from a home location of the user. The subscription service comprises a plurality of selectable channels available to the user at the home location. The user is assigned one of a plurality of program streams utilizable for delivery of content from the head end equipment servicing the remote location to an interface device at the remote location. By way of example, the program streams may be part of existing unicast infrastructure in the head end equipment. The head end equipment obtains content for a first channel of the subscription service available to the user at the home location, and inserts the content for the first channel into the assigned program stream to thereby make that content accessible to the user at the remote location via the interface device. User selection via the remote location interface device of a different channel of the subscription service available to the user at the home location causes the content for the different channel to be obtained by the head end equipment and inserted into the assigned program stream in place of the content for the first channel.

Delivery of subscription services to roaming users through head end equipment

Link delay is determined in a network comprising a plurality of nodes by identifying pairs of nodes associated with a given link, and, for each of the identified pairs, setting up a virtually-concatenated group (VCG) between the nodes of that pair. The VCGs are utilized to make delay measurements, and the delay measurements are processed to determine delay of the given link. In an illustrative embodiment, the VCGs comprise two-member VCGs with the members being routed on opposite sides of a logical ring. For a given one of these two-member VCGs, a differential delay measurement is made at a particular one of the associated nodes by comparing frame indicator fields for concurrently arriving frames. A system of equations is generated based on the differential delay measurements made utilizing the VCGs, and the system of equations is solved to obtain information utilizable to determine delay of the given link.

Link delay determination using virtual concatenation

Techniques are disclosed for generation of spanning trees that support provision of performance-guaranteed services over a circuit-switched network such as, for example, an optical-based network. For example, a technique for generating a spanning tree for use in forwarding Ethernet-based data in a circuit-switched network comprises the following steps/operations. Input information is obtained. The input information comprises a representation of the network, a set of Ethernet-enabled nodes in the network, and a set of demands. A spanning tree is computed based on at least a portion of the input information such that the spanning tree substantially satisfies one or more performance requirements (e.g., one or more bandwidth requirements) associated with the set of demands. Advantageously, in one embodiment, such techniques may provide for generation of spanning trees for use in supporting bandwidth-guaranteed Ethernet services such as E-LAN over a SONET (and SDH) network.

Spanning tree generation for supporting performance-guaranteed services over circuit-switched network

A system for and method of multi-protocol label switching (MPLS) network tuning. In one embodiment, the system includes a hot zone clearing subsystem that recursively identifies label switched paths (LSPs) to be rerouted from a defined hot zone subject to edges to be avoided. In that embodiment, the system further includes an LSP ordering subsystem, which is coupled to the hot zone clearing subsystem, that orders the LSPs to be rerouted to yield a migration sequence. The migration sequence is employable to reduce a load of the hot zone.

System and method for multi-protocol label switching network tuning

A system and method for rerouting circuits on a SONET, SDH or similar ring without disrupting service. In one embodiment, the system includes: (1) a route design subsystem adapted to identify, for the circuits, alternative routes that are subject to an alignment constraint and increase an objective value associated with the ring and (2) a path migration subsystem, associated with the route design subsystem, adapted to determine a hitless migration sequence that allows the alternative routes to be employed.

System and method for rerouting circuits on SONET and SDH rings without disrupting service

A maximum-flow based route precomputation algorithm includes at least a route generation phase and a route selection phase, and determines one or more routes between at least a given pair of nodes in a network. In the route generation phase, a maximum-flow algorithm is applied to a first set of information characterizing links between the given pair of nodes in the network. The output of the maximum-flow algorithm is utilizable to generate a second set of information characterizing corresponding admissible flows. In the route selection phase, one or more routes are determined based on the second set of information using, for example, a shortest widest path (SWP) algorithm. The route generation and route selection phases may be repeated for each of a plurality of node pairs of the network.

Route precomputation method and apparatus for bandwidth guaranteed traffic

Packet-aware transport architecture and techniques for implementing same that enhance data volume by scaling effectively to rapid data growth are disclosed. For example, a technique for determining a route for a demand in a circuit-switched network comprises the following steps/operations. The demand to be routed in the circuit-switched network is obtained. The circuit-switched networks implements a packet ring (PR) model such that one or more demands are routable on one or more virtual data rings in the circuit-switched network. An Ethernet-Over-SONET (EOS) communication channel in the circuit-switched network suitable for accommodating the demand is specified. The EOS communication channel or one of the one or more virtual data rings is then identified as the new route for the demand.

Packet-aware transport architecture for enhanced data volume

Virtually-concatenated data traffic is routed in a network comprising at least first and second nodes. The first and second nodes may comprise a source-sink node pair, an ingress-egress node pair, or any other pair of network nodes. For a given traffic demand, a plurality of routes for routing the traffic demand through the network are determined. Each of the routes corresponds to a member of a virtually-concatenated group, such that different portions of the traffic demand are assigned to different members of the virtually-concatenated group.

Route determination method and apparatus for virtually-concatenated data traffic

A method for data path provisioning in a reconfigurable data network is disclosed. A data path between a source IP router and a destination IP router is determined taking into account the IP-subnets of the network interfaces of the IP routers included in the path. In one embodiment, the requirement that two IP routers can send packets via their connected interface if and only if the two interfaces are on the same subnet (i.e., the subnet constraint) is completely honored during the data path determination. In another embodiment, the data path is determined while allowing some number of violations of the subnet constraint. A transform network graph is computed and is used to determine the data path taking into account the IP-subnets.

Growing community of inventors

Edison, NJ, United States of America

Bhawna Gupta