Alcatel Lucent

Lucent Technologies Inc.

Alcatel-lucent USA Inc.

Nokia Technologies Oy

Yihao Lisa Zhang

Daniel Matthew Andrews

Gordon Thomas Wilfong

Lawrence M Drabeck

Michael Scharf

Spyridon Antonakopoulos

Chandra S Chekuri

Karl Georg Hampel

Paul Anthony Polakos

Yigal Bejerano

Jin Cao

Hubert Rae McLellan, Jr

Girija J Narlikar

Steven J Fortune

Manuel Stein

Rakesh Kumar Sinha

Thomas Voith

Antonio Ramos Fernandez

Avinash Vyas

Seungjoon Lee

Hadas Shachnai

Ayse Funda Ergun

Jingyuan Yang

Ran He

A computer system may use machine learning to determine functional zones within a geographical region. The computer system may determine position data and functional data for locations within a geographical region. The computer system may use machine learning to determine functional zones with a two-stage clustering approach. During the first stage, the computer system may determine geoclusters by clustering locations based on the position data. During the second stage, the computer system may determine functional zones by clustering the geoclusters based on the functional data.

Identifying functional zones within a geographic region

Techniques are provided for anonymizing data in a data stream. In various embodiments, data in a data stream is anonymized by obtaining a partitioning of a space into a plurality of regions based on previously obtained data elements associated with the space; receiving a data stream comprising a plurality of newly obtained data elements associated with the space, each comprising an identifying portion and an associated sensitive portion; assigning each of the plurality of newly obtained data elements to one of the plurality of regions based on the identifying portion; determining if a full buffer criterion is satisfied for a buffer that stores at least a portion of the plurality of newly obtained data elements; and selecting one of the plurality of regions having a largest number of the newly obtained data elements and recording the associated sensitive portions of the newly obtained data elements in the selected one of the plurality of regions to a non-volatile storage medium on the condition that the full buffer criterion is satisfied.

Anonymization of identifying portions of streaming data

A capability for sparsifying a representation of pairwise cost information is presented herein. The capability for sparsifying a representation of pairwise cost information may be used to sparsify a representation of pairwise cost information for a set of nodes. The sparsification of a representation of pairwise cost information for a set of nodes may provide thereby a sparsified representation of the pairwise cost information for the set of nodes. The sparsification of the representation of pairwise cost information for the set of nodes may be based on clustering of the nodes of the set of nodes into clusters. The sparsification of the representation of pairwise cost information for the set of nodes may be based on calculation of intra-cluster costs and inter-cluster costs, where the intra-cluster costs and inter-cluster costs are calculated based on the pairwise cost information of the representation of the pairwise cost information for the set of nodes.

Sparsification of pairwise cost information

A capability for providing policy enforcement in a topology abstraction system is presented. The capability for providing policy enforcement in a topology abstraction system may support use of topology abstraction policies to control abstraction of topology information of a topology (e.g., a network topology of a communication network or any other suitable type of topology). The capability for providing policy enforcement in a topology abstraction system providing an abstract representation of a topology may support use of topology abstraction policies to control selection (or acceptance) of topology elements for inclusion within the abstract representation of a topology and filtering (or rejection) of topology elements from being included within the abstract representation of a topology. The capability for providing policy enforcement in a topology abstraction system providing an abstract representation of a topology may support use of topology abstraction policies to control clustering of topology elements selected for inclusion within the abstract representation of the topology.

Policy enforcement in a topology abstraction system

A network device of a communication network is configured to implement coordinated scheduling and processor rate control. In one aspect, packets are received in the network device and scheduled for processing from one or more queues of that device. An operating rate of a processor of the network device is controlled based at least in part on at least one of an arrival rate of the packets and a number of the packets stored in the one or more queues. As one example of processor rate control based on packet arrival rate, the operating rate of the processor may be controlled by accumulating a designated number of the received packets, determining an average arrival rate of the accumulated packets, and setting the operating rate of the processor based on the average arrival rate.

Energy-efficient network device with coordinated scheduling and processor rate control

A network device of a communication network is configured to implement a switch fabric that includes collector-based cell reordering functionality. In one embodiment, the switch fabric comprises a plurality of distributors, a plurality of routing elements each having inputs coupled to respective outputs of multiple ones of the distributors, and a plurality of collectors each having inputs coupled to respective outputs of multiple ones of the routing elements. At least a given one of the collectors comprises a sorting circuit configured to reorder streams of cells received from respective ones of the routing elements into a single reordered stream of cells utilizing a merge sort.

Switch fabric with collector-based cell reordering

In one embodiment, the method includes determining feasibility for a potential transmission based on a current schedule of active transmissions. The current schedule of active transmissions includes active transmissions over multiple carriers and at multiple transmission rates. The potential transmission is at a start time on a radio frequency carrier at a data transmission rate by a user terminal. A transmission duration is determined if the potential transmission is determined to be feasible. A message is sent to the user terminal. if the potential transmission is determined to be feasible. The message may direct the user terminal to receive the potential transmission on the radio frequency carrier at the data transmission rate at the start time. The current schedule is updated according to the feasibility determination.

Resource allocation in heterogeneous LTE networks via CSMA-based algorithms

A network device of a communication network is configured to implement coordinated scheduling and processor rate control. In one aspect, packets are received in the network device and scheduled for processing from one or more queues of that device. An operating rate of a processor of the network device is controlled based at least in part on an optimal operating rate of the processor that is determined using a non-zero base power of the processor. For example, the operating rate of the processor may be controlled such that the processor either operates at or above the optimal operating rate, or is substantially turned off. The optimal operating rate of the processor may be selected so as to fall on a tangent line of a power-rate curve of the processor that also passes through an origin point of a coordinate system of the power-rate curve.

Energy-efficient network device with coordinated scheduling and rate control using non-zero base power

A network comprising a plurality of network devices is configured to implement scheduling for energy efficiency. In one aspect, a set of network devices interconnected in a line within a network is identified, and a common frame size is established. For each of the network devices of the line, active and inactive periods for that network device are scheduled in a corresponding frame having the common frame size, with the frames in the respective network devices of the line being time shifted relative to one another by designated offsets. For each of one or more of the active periods of each of the network devices of the line, received packets are scheduled for processing in that network device.

Network scheduling for energy efficiency

Real-time broadcast and multicast based packet transmissions/services over a wireless, local area networks (WLAN) may be improved by reducing the interference across neighboring access points (APs) while minimally impacting the performance of unicast transmissions/services. Minimal impact is assured by scheduling the transmission of multicast packet flows such that the duration of the time period required to transmit such flows is also minimized. One type of method provides a constant approximation of an optimal time period/schedule while another provides a logarithmic approximation of an optimal time period/schedule.

Methods and devices for scheduling the transmission of multicast messages in wireless local area networks

A method and apparatus for scheduling the transmission of data packets over a multihop wireless backhaul network in which delay guarantees through the network may be advantageously ensured. Illustratively, a novel packet scheduling scheme is provided which is advantageously based on an existing scheduling policy for wireline networks and for which a delay guarantee (based on the delay characteristics of the existing scheduling policy) can be advantageously ensured. In one embodiment, an even-odd link activation framework is defined for a given multihop wireless backhaul network, and an associated scheduling policy based on an arbitrary existing scheduling policy for wireline networks is derived and adopted. In such a case, the derived scheduling policy, when applied to the given multihop wireless backhaul network, advantageously ensures a worst-case delay guarantee of approximately twice that of the existing scheduling policy for wireline networks.

Method and apparatus for scheduling data packet transmission over a multihop wireless backhaul network

A method for determining a master ring for an optical communications network having nodes arranged in a plurality of interconnected ring structures. (A master ring is a ring structure which contains every node in the network exactly once, and which also respects the node ordering of every individual ring.) An efficient solution to the master ring problem is provided by advantageously limiting the enumeration process based on the consistency of the enumeration of individual rings with each other. Illustratively, an intersection graph of the network is generated; one or more of the rings is chosen and possible openings of each of these rings are enumerated; and a limited number of possible openings of one or more other (i.e., non-chosen) rings are enumerated such that the enumeration of the possible openings of the other (i.e., non-chosen) rings are consistent therewith.

Method for determining a master ring for an optical communications network

Techniques for use in designing, adjusting or operating a wireless network so as to provide a desired level of performance for the network. An optimization process is applied to a set of information characterizing the network. The optimization process includes at least a pre-frequency-assignment optimization stage, which is applied prior to assignment of frequencies to one or more communication channels of the wireless network. An output of the optimization process is utilized to determine one or more operating parameters of the wireless network, such as a base station transmit power or antenna orientation.

Methods and apparatus for design, adjustment or operation of wireless networks using pre-frequency-assignment optimization

Techniques for use in designing, adjusting or operating a wireless network so as to provide a desired level of performance for the network. An optimization process is applied to a set of information characterizing the network. The optimization process is implemented as a multi-stage process which includes at least a frequency assignment stage and a post-frequency-assignment optimization stage, wherein the frequency assignment stage and the post-frequency-assignment stage are subject to iteration. For example, after an initial assignment of the frequencies in the frequency assignment stage, the post-frequency-assignment optimization stage may be performed, and based on the result of the optimization, at least one of the frequency assignment stage and the post-frequency-assignment optimization stage may be repeated. An output of the optimization process is utilized to determine one or more operating parameters of the wireless network, such as a base station transmit power or antenna orientation. The optimization process in an illustrative embodiment may be implemented as a three-stage process which includes a pre-frequency-assignment optimization stage, the frequency assignment stage and the post-frequency-assignment optimization stage, with one or more subsets of these stages being implemented in an iterative manner.

Methods and apparatus for design, adjustment or operation of wireless networks using multi-stage optimization

A method of determining an optimal path from a source node to a destination node over a number of links in an information network having n nodes. Each link has an associated cost-delay function, the optimal path is constrained to an overall delay of D, and a total cost of all links along the path is to be minimized at a value OPT. The method includes maintaining a range &lsqb;L, U&rsqb; for OPT, wherein L is a lower bound and U is an upper bound, and setting initial values for L and U. A cost value V is set corresponding to {square root over (U&middot;L)}, and a scaled cost c&prime; is derived for each link wherein c&prime; corresponds to cn/V&egr;, c is an actual cost for each link, and &egr;>0. If a feasible path having a delay of at most D and a total cost of at most V is found not to exist, then the value of L is increased to V, a new cost value V is set and the link costs c&prime; are further scaled. The values of L and U are reset until U/L<2 and a feasible path continues to exist. The links of the feasible path are then identified as the optimal path using the last-scaled link costs.

Growing community of inventors

New Providence, NJ, United States of America

Yihao Lisa Zhang