Alcatel Lucent

Girija Narlikar

Kedar S Namjoshi

Randeep Singh Bhatia

Satish Kanugovi

Arupjyoti Bhuyan

Sourjya Bhaumik

Subhendu Chattopadhyay

Olivier Bernard Henri Clarisse

Dynamic reorganization of cell structures in wireless networks. The present invention relates to wireless communications and, more particularly, to energy usage of wireless equipments in wireless communications. Currently there are mechanisms in use that can selectively turn of carriers in a BTS depending on the traffic load. But due to the fixed costs of operating the base station even when there are no active users, turning off entire BTS will give more energy savings than simply reducing capacity by turning off carriers at low load. Embodiments herein detect a change in demand on the network and re-organize the cellular network by selectively turning off BTSs and appropriately increasing the coverage area of other BTSs, and arrive at a configuration that optimizes the energy consumption of the cellular network as a whole.

Dynamic reorganization of cell structures in wireless networks

A system, method, apparatus and mechanism for estimating worst-case time complexity of a regular expression defining a pattern adapted for identifying malicious packets and comprising one or more back-references (backref-regex) by constructing a non-deterministic finite automaton (NFA) corresponding to the backref-regex (backref-NFA), wherein the backref-NFA comprises a plurality of NFA-states and a respectively labeled edge for each of the one or more back-references of the backref-regex; performing liveness analysis on the backref-NFA to determine for each NFA-state of the backref-NFA a set of back-references alive at the NFA-state; and determining a maximum number of alive back-references over the plurality of NFA-states, wherein the determined maximum number is indicative of the worst-case time complexity of the backref-regex.

Method and apparatus for pattern matching for intrusion detection/prevention systems

Method and apparatus for uploading content from a user terminal in response to a request triggered at the user terminal to upload content is provided. An exemplary method includes initiating a test call at the user terminal to a wireless network in response to an indication to upload content from the user terminal, obtaining user-channel information for the test call and network-level state information for the user terminal during the test call, determining whether a user-channel condition and a network-level condition are satisfied based on the user-channel information and network-level state information respectively, and uploading the content to the wireless network in response to the user-channel condition and the network-level condition being satisfied. The user terminal obtains at the user terminal user-level state information and triggers the indication to upload content from the user terminal if the user-level condition is determined to be satisfied.

Method and apparatus for uploading content over wireless networks

A packet is compared to a pattern defined by a regular expression with back-references (backref-regex) in a single pass of a non-deterministic finite automaton corresponding to the backref-regex (backref-NFA) that includes representations for all backref-regex's back-references. The packet's characters are sequentially selected and analyzed against the backref-NFA until a match or no-match between the packet and pattern is determined. Upon selecting a character, a corresponding configurations-set is updated, where the set includes configurations associated with respective NFA-states of the backref-NFA and indicating whether the selected character is being matched against a back-reference. With the configurations-set being updated the comparison process proceeds along backref-NFA's NFA-states. The updated configurations-set includes configurations associated with NFA-states reachable from the configurations in the pre-updated set. When the configurations-set includes a final state, a match is determined. When the configurations-set becomes empty, or upon selection of all characters lacks the final state, a no-match is determined.

Growing community of inventors

Mumbai, India

Girija Narlikar