Alcatel Lucent

Alcatel-lucent USA Inc.

Lucent Technologies Inc.

Nokia of America Corporation

Yigal Bejerano

Katherine Hua Guo

Pramod V Koppol

Thyagarajan Nandagopal

Seung-Jae Han

Rajeev R Rastogi

Mark Anthony Shawn Smith

Daniel Matthew Andrews

Yuri J Breitbart

Amit Kumar

Pramod V N Koppol

Joseph Naor

S Jamaloddin Golestani

Qunfeng Dong

Alexander Sprintson

Li Erran Li

Minos N Garofalakis

Randeep Singh Bhatia

Suresh Goyal

Aleksandr Stolyar

Yihao Lisa Zhang

John Brian Reid

Tomas S Young

Mark Anthony Smith

Spyridon Antonakopoulos

Ariel Orda

Sreedhar Rao

Gabriela M Abramovici

Hugo A Infante

Tuvia Izsak

Sudarshan Vasudevan

Chandrasekharan Raman

Seungjae Han

Chun Nam Yu

Nicole S Immorlica

Chun-Nam Yu

Pramod VN Koppol

Jamaloddin S Golestani

The present disclosure generally discloses dynamic monitoring and management capabilities for use in wireless communication systems. The dynamic monitoring and management capabilities may be configured to support dynamic monitoring and management within various types of contexts and associated environments. The dynamic monitoring and management capabilities may include feedback collection capabilities, service quality evaluation capabilities, parameter tuning capabilities, or the like, as well as various combinations thereof.

Dynamic monitoring and management in wireless systems

In general, various capabilities related to fault-resilient services within communication networks are presented. The services may include broadcast services, multicast services, unicast services, or the like, as well as various combinations thereof. A capability for providing local protection to unicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for providing local protection to multicast traffic at a node associated with a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees is presented herein. A capability for constructing a pair of redundant trees includes partitioning a graph into a pair of partitions based on a link coloring mechanism and constructing the pair of redundant trees based on the pair of partitions.

Fault-resilient broadcast, multicast, and unicast services

At least one example embodiment discloses a paging message controller. The paging message controller includes a processor and an associated memory. The processor is configured to obtain an indication of a paging message for a user equipment (UE), the indication indicating that a paging message is to be forwarded to at least one destination cell of a first set of cells for paging the UE, and forward the paging message for paging the UE to at least one destination cell of a second set of cells in response to the indication.

Networks and methods for paging message control

In one example embodiment, a group server includes a processor configured to receive a data quota usage report corresponding to data quota usage by at least one of a plurality of lines, the plurality of lines forming a group subject to a pre-paid data usage agreement with a data service provider and determine a data quota for the at least one of the plurality of lines based on at least the received data quota usage report and an accuracy threshold.

Data allocation for pre-paid group data plans

An IP fast reroute scheme offering full protection is disclosed for reducing the number of address lookups associated with a message packet. The IP fast reroute scheme offering full protection includes a router configured to forward the arriving packet to a next-hop neighbor node according to one of a first pointer and a second pointer associated to a destination node in a forwarding information table stored in a forwarding information memory storage; the first pointer is directed to a first next-hop neighbor node which is on the shortest path from the network node to the destination node; and the second pointer is directed to a second next-hop neighbor node different from the first next-hop neighbor node, the second next-hop neighbor node on a candidate cycle containing both the network node and the destination node having the greatest overlap with a sink tree rooted at the destination node. The IP fast reroute scheme offering full protection is particularly useful for providing full protection against single link and node failures with a simple method requiring no packet modifications.

IP fast reroute scheme offering full protection

Wireless stations (and their associated operation) making up a static, multi-hop wireless network are simplified because topological modeling and routing/scheduling decisions are shifted from the stations to a controller external to the network. The controller may determine routing paths and schedules for each of the wireless stations in a network based on the topology of a given network along with other network characteristics. Thereafter, the so-determined paths and schedules are sent to the associated wireless stations. By simplifying the operation of a wireless station, the amount of energy required to be used by each station may be reduced thereby maximizing the lifetime of the network.

Methods and devices for configuring simplified, static, multi-hop wireless networks

Methods are provided for metering the usage, on a group of lines subject to a group user agreement, of the data processing capacity of a network. Implementations include steps of receiving usage reports from respective lines of the group at least when usage quotas granted to the lines are exhausted; maintaining a total, over the group, of usage that has been reported by the lines and of outstanding usage quotas that have been granted to the lines; and maintaining a comparison between the total outstanding group quota and a limit that depends on the total reported group usage, so as to detect violation events when said quota violates the limit. Upon occurrence of violation events, instructions for the processors serving respective lines to reallocate quota are sent selectively.

Method and apparatus of group credit control for wireless networks

The number of directional antennas and associated radios needed to ensure a nomadic wireless mesh network (NWMN) remains operational in the event of node or link failures, while minimizing delay and other unwanted effects, may be determined using novel methods and devices. Such a determination may reduce the number of antennas and radios a service or network provider normally uses, thus reducing its costs.

Methods and devices for providing robust nomadic wireless mesh networks using directional antennas

Various methods and devices are provided to address the need for improved multicast operation. In one method, a feedback mobile device receives (), from a multicast sender, a multicast transmission for a plurality of mobile devices, the plurality of mobile devices further including a group of non-feedback mobile devices. The feedback mobile device transmits () an indication of feedback mobile channel quality observed by the feedback mobile device to the multicast sender and to the group of non-feedback mobile devices. The feedback mobile device receives () from at least one non-feedback mobile device, an indication of non-feedback mobile channel quality at the at least one non-feedback mobile device and transmits () an indication of the non-feedback mobile channel quality to the multicast sender and to the group of non-feedback mobile devices.

Method and apparatus for improved multicast service using negotiated feedback

Various methods and devices are provided to address the need for improved neighbor detection. In a first method, a node (e.g., a mobile node or a network transceiver node) transmits () a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur. Then during the neighbor discovery signaling time, the node receives () signaling indicating a signature of at least one neighbor node. In a second method, a neighbor node receives () a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur. Then during the neighbor discovery signaling time, the neighbor node transmits () a signature identifying itself.

Method and apparatus for neighbor discovery

Methods and apparatus are provided for improved coverage verification schemes in a wireless sensor network that do not require information about the location of sensor nodes in the wireless sensor network. Coverage holes are detected by a first node in a wireless sensor network by obtaining an estimate of a distance to each of a plurality of additional nodes in a transmission radius of the first node; determining a relative location of each of the plurality of additional nodes in the coordinate system of the first node; identifying border segments of a sensing border of the first node, where each of the border segments comprises a section of a sensing border of the first node that is covered by a sensing radius of at least one of the additional nodes; and determining if a coverage hole exists for the first node by determining if a plurality of the border segments comprise a cyclic segment sequence. The coordinate system comprises r-map coordinates of the first node and the additional nodes, where r is based on a transmission radius of the first node.

Methods and apparatus for coverage verification in a wireless sensor network

Various methods and devices are provided to address the need for improved multicast operation. In one method, a station transmits () a multicast packet to a plurality of mobile devices and to a group of monitoring stations (MSs). An indication of whether the multicast packet was received by that MS is received () from each monitoring station (MS) of the group of MSs. When this indication indicates that the multicast packet was not received, the multicast packet is retransmitted () to the plurality of mobile devices and to the group of MSs.

Method and apparatus for improved multicast service

A computer-readable medium has tangibly embodied thereon and accessible therefrom a set of instructions interpretable by at least one data processing device. The set of instructions is configured for causing the at least one data processing device to carry out operations for estimating a delay for each one of a plurality of packets of a VOIP traffic flow and for allocating a delay budget for each one of the packets dependent upon the estimated delay thereof. Such estimating is performed at a fixed location between end locations of a path over which the packets traverse and is performed using packet timestamp information acquired from the packets only at the fixed location.

Dynamic delay budget allocation using single-point estimation of end-to-end delay

Various methods and devices are provided to address the need to reduce paging latency. In one method, a wireless network determines () that a page for a mobile needs to be transmitted over a target broadcast area. The wireless network schedules () the transmission of the page in an upcoming paging timeslot based on the target broadcast area and then pages () the mobile in the target broadcast area before transmitting an earlier scheduled page for another mobile with a different target broadcast area.

Method and apparatus for improved paging in wireless communication

Various methods and devices are provided to address the need for improved multicast operation. In one method, a mobile device receives a multicast packet from a station, the mobile device being one of a plurality of mobile devices that includes a group of feedback mobile devices. The mobile device transmits an indication that it is volunteering to become a member of the group of feedback mobile devices and determines whether to begin operating as a member of the group of feedback mobile devices. If the mobile device is to begin operating as a member of the group of feedback mobile devices, the mobile device transmits an indication of channel quality and/or a level of interference observed by the mobile device.

Growing community of inventors

Springfield, NJ, United States of America

Yigal Bejerano