Lucent Technologies Inc.

Alcatel Lucent

Alcatel-lucent USA Inc.

The Chinese University of Hong Kong

Wing Cheong Lau

Muralidharan Sampath Kodialam

Lotfi Benmohamed

Tirunell V Lakshman

Mooi Choo Chuah

Subrahmanyam Dravida

Yung-Terng Wang

Paramasiviah Harshavardhana

Ajay Kumar Mittal

Krishna Balachandran

Hung-Hsiang Jonathan Chao

Joseph H Kang

Thyagarajan Nandagopal

On-Ching Yue

Murali Kodialam

Enrique Hernandez-Valencia

Anlu Yan

Chen Change Loy

Thyaga Nandagopal

Oded Hauser

Yinglu Zhang

Zhibo Yang

Zhiyi Cheng

Chak Man Li

Yoohwan Kim

Lofti Benmohamed

The present invention discloses a system and a method for decoding QR codes in complex scenes, a system and a method for generating multi-layer color QR codes and applications enabled by the systems and methods. The method for decoding a QR code may include detecting rough locations of the QR code by a learning-based QR code detector which is pre-trained off-line; localizing finder patterns and alignment patterns within each detected location; correcting geometric distortion of each QR code, based on the localized finder patterns and alignment patterns; restoring a color of each data module within each corrected QR code by a learning-based classifier; and decoding the QR code from each restored QR code. The application also discloses a system and a method to determine the optimal setting parameters for creating a multi-layer QR code to fulfill the user's requirements. Some applications enabled by these systems and methods are also disclosed.

Method and apparatus for decoding or generating multi-layer color QR code, method for recommending setting parameters in generation of multi-layer QR code, and product comprising multi-layer color QR code

The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single '1.' When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit.

Identifying RFID categories

In one embodiment, a method for estimating the number of tags in a set of tags in a system of tags and readers. The method includes, during each of a plurality of time intervals: (i) transmitting a command requesting that each tag that receives the command determine whether to transmit a reply; and (ii) receiving, in one or more timeslots of a frame corresponding to the time interval, replies from one or more tags. The method further includes providing an estimate of the number of tags in the set of one or more tags based on (i) timeslots in each of the plurality of time intervals that are zero timeslots, i.e., timeslots having no received reply, and (ii) the total number of timeslots in each frame.

Anonymous tracking using a set of wireless devices

The present invention provides systems and methods for providing distributed, adaptive IP filtering techniques used in detecting and blocking IP packets involved in DDOS attacks through the use of Bloom Filters and leaky-bucket concepts to identify 'attack' flows. In an exemplary embodiment of the present invention, a device tracks certain criteria of all IP packets traveling from IP sources outside a security perimeter to network devices within the security perimeter. The present invention examines the criteria and places them in different classifications in a uniformly random manner, estimates the amount of criteria normally received and then determines when a group of stored classifications is too excessive to be considered normal for a given period of time. After the device determines the criteria that excessive IP packets have in common, the device then determines rules to identify the packets that meet such criteria and filters or blocks so identified packets.

Methods and devices for providing distributed, adaptive IP filtering against distributed denial of service attacks

In one embodiment, a node-implemented method for performing analysis of traffic within a packet communications network. First, the node measures a traffic aggregate at specified nodes within the network with regard to a packet set of interest. Each traffic aggregate (i) is a set of packets, observed at one of the specified nodes, having a common characteristic and (ii) is measured at one of the specified nodes by creating a digest for the packets having the common characteristic. The digest characterizes the traffic aggregate without containing the actual packets themselves. Next, the node formulates an intersection set cardinality determination for a network traffic-characterizing parameter to be measured in the network utilizing the digests characterizing the traffic aggregates. Next, the node solves the set cardinality determination for the network traffic-characterizing parameter to be measured.

High-speed traffic measurement and analysis methodologies and protocols

In a network including a centralized controller and a plurality of routers forming a security perimeter, a method for selectively discarding packets during a distributed denial-of-service (DDoS) attack over the network. The method includes aggregating victim destination prefix lists and attack statistics associated with incoming packets received from the plurality of routers to confirm a DDoS attack victim, and aggregating packet attribute distribution frequencies for incoming victim related packets received from the plurality of security perimeter routers. Common scorebooks are generated from the aggregated packet attribute distribution frequencies and nominal traffic profiles, and local cumulative distribution function (CDF) of the local scores derived from the plurality of security perimeter routers are aggregated. A common discarding threshold is derived from the CDF and sent to each of the plurality of security perimeter routers, where the discarding threshold defines a condition in which an incoming packet may be discarded at the security perimeter.

Distributed architecture for statistical overload control against distributed denial of service attacks

A network-wide traffic measurement/analysis problem is formulated as a series of set-cardinality-determination (SCD) problems, using probabilistic distinct sample counting techniques to compute network-wide traffic measurements of interest in a distributed manner via the exchange of light-weight traffic digests (TD's) amongst network nodes/routers. A TD for N packets uses only requires O(loglog N) bits of memory storage, making it possible to distribute nodal TD's to all routers within a domain by piggybacking them as opaque data objects inside existing control messages, such as OSPF link-state packets (LSPs) or I-BGP control messages. A router receiving the TD's can estimate the traffic measurements of interest for each of its local links by solving a series of set-cardinality-determination problems. The traffic measurements of interest are typically per-link, per-traffic-aggregate packet (or flow) counts, where an aggregate is defined by the group of packets sharing the same originating and/or destination nodes (or links) and/or some intermediate nodes (or links).

In a multiple node network, the method includes waking up at least one node from a sleep mode during at least one associated slot of a time-slotted frame, the sleep mode being a low power consumption mode. Also, in at least one node of a multiple node network, the period of time a node sleeps is based on the residual energy of the node, the residual energy of the nodes in the neighborhood, neighborhood node density, and combinations thereof.

Adaptive sleeping and awakening protocol for an energy-efficient adhoc network

The present invention is a methodology to prioritize packets based on the conditional probability that given the values of attributes carried by packet, the packet is a legitimate one. We will call this the conditional legitimate probability of a packet from here onward. The conditional probability of each packet is evaluated based on Bayesian estimation technique. This is accomplished by comparing the attributes carried by an incoming packet against the 'nominal' distribution of attributes of legitimate packet stream. Since an exact prioritization of packets based on their conditional legitimate probability would require offline, multiple-pass operations, e.g. sorting, we take the following alternative approach to realize an online, one-pass selectively dropping scheme. In particular, we maintain the cumulative distribution function (CDF) of the conditional legitimate probability of all incoming packets and apply a threshold-based selective dropping mechanism according to the conditional probability value computed for each incoming packet. To speed-up the computation of the conditional legitimate probability for each incoming packet, we may, as an alternative, use the logarithmic version of the equation to implement the Bayesian estimation process. Other features of the invention include: providing means to guarantee minimum throughput of particular (pre-configured) type(s) of packets; providing a. Filtering Mechanism to suppress the noise during estimation/maintenance of nominal attributes distribution; applying state-of-the-art efficient algorithm/data-structures for quantile and histogram building/updates; using the proven, industrial-strength load-shedding algorithms as a submodule in the overload control algorithm; and being amenable to practical implementation to support online, one-pass processing on high-speed communication links.

Apparatus and method for an overload control procedure against denial of service attack

The present invention sets forth a methodology for providing improved downlink backhaul services from a radio network controller (RNC) to a plurality of base stations via a backhaul network that provides Ethernet services. The Ethernet services are provided by a group of provider edge (PE) switches and regular label switch routers (referred to as P switches). Base stations within the network are assigned into clusters, each of the clusters having a cluster ID. The RNC transmits packets to a given switch or switches out on the network based on a cluster ID included within the transmitted packet. The communications traffic is then multicast from at least one last hop switch in the network to candidate base stations on the basis of the cluster ID and an active set within the cluster. Advantageously, the clusters act as subgroups for more easily directing the transmission of the backhaul multicast traffic. Significant advantages are realized through use of the present invention, including the ability to allow faster and smoother handoffs, as well as backhaul bandwidth savings since intelligence regarding cell switching is extended out at a point farther along the network than was previously enabled.

Backhaul multicasting using Ethernet-based radio access networks

A network element maintains failure information for a packet-based network and usage information for a backup path. Upon receipt of a new demand, with an associated bandwidth, d, the network element determines if the backup path can be shared as a function of the failure information and the usage information associated with the backup path.

Maintaining information to optimize restorable dynamic routing with shared backup

Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.

Network topology optimization methods and apparatus for designing IP networks with performance guarantees

Link capacity computation methods and apparatus for designing IP networks with performance guarantees

A flow control method for available bit rate service in an asynchronous transfer mode network for detecting congestion in a switch and conveying congestion status information using resource management cells to the source which adjusts its flow rate accordingly. During detection of congestion in the switch the explicit rate field of the resource management cell is updated using a dynamic major reduction factor to improve transient queue-length performance.

Flow control method using a dynamic major reduction factor

A method for consolidating backward resource management (BRM) cells in an available bit rate point-to-multipoint tree including a root, a plurality of leaves and a branch point interconnected between the root and the leaves. Initially, congestion information memory devices are reset. Then for each incoming return BRM cell to the branch point a determination is made whether the branch point has received a return BRM cell from a predetermined number of candidates in a candidate set of candidate-branches. If the branch point has not received a return BRM cell from the predetermined number of candidates in the candidate set then the congestion information from the incoming return BRM cell and the congestion information in the congestion information memory devices are consolidated in the congestion information memory devices. After the congestion information memory devices have been updated with the consolidated congestion information then the incoming return BRM cell is discarded and the determination is repeated for the next incoming return BRM cell. If the branch point has received a return BRM cell from the predetermined number of candidates in the candidate set then the congestion information from the incoming return BRM cell and the congestion information in the congestion information memory devices are consolidated in the incoming return BRM cell before being passed back to the root. The congestion information memory devices are then reset and the process is repeated for the next incoming return BRM cell. In addition, various methods may be used to control the rate of pass back of incoming return backward resource management cells at a branch point to a source.

Growing community of inventors

Middletown, NJ, United States of America

Wing Cheong Lau