Lucent Technologies Inc.

Alcatel Lucent

Alcatel-lucent USA Inc.

At+t Corp.

At&t Bell Laboratories

Gordon Thomas Wilfong

Christopher Richard Doerr

Yihao Lisa Zhang

Ramanujan S Kashi

April Patricia Rasala

Jianying Hu

Pramod V Koppol

Kedar S Namjoshi

Carl Jeremy Nuzman

Vladimir Y Kolesnikov

Frank William Sinden

Peter M Winkler

Michael Scharf

Urs Niesen

Martin Zirngibl

Iraj Saniee

Debasis Mitra

Daniel P Lopresti

Adiseshu Hari

Daniel Matthew Andrews

Benny P Mikkelsen

Laurence W Ruedisueli

Girija J Narlikar

Mohamed Lotfy El-Sayed

Steven J Fortune

Timothy G Griffin

Anindya Basu

Thomas Voith

Winston Lowell Nelson

Manuel Stein

Thanos Stathopoulos

Avinash Vyas

Zhengxue Zhao

Frederick Bruce Sheperd

Athansios Stathopoulos

Athanasios Stathopoulos

William S Kennedy

Penelope E Haxell

Seungjoon Lee

Frederick B Shepherd

Chih-Hao Luke Ong

Pramod Koppol

In general, a capability for forwarding packets based on path encoding is presented. The capability for forwarding a packet based on path encoding may be configured to enable forwarding of a packet along a network path by determining a path encoding label for the network path, associating the path encoding label for the network path with the packet, and forwarding the packet along the network path based on the path encoding label associated with the packet. The network path for a packet may include an ordered sequence of node output interfaces of an ordered sequence of nodes. The path encoding label for the network path includes an ordered sequence of node interface labels corresponding to the ordered sequence of node output interfaces of the nodes of the network path. The nodes of the network path forward the packet along the network path based on the path encoding label.

Packet forwarding based on path encoding

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

The backup-in-the-middle primary-backup configuration is created by placing a backup-in-the-middle forwarder in the routing path between the primary and the environment. The backup-in-the-middle forwarder intercepts output messages along with required state information sent by the primary to the environment. The backup-in-the-middle forwarder backs up the primary by updating its state information and forwards the output packets to the environment.

Method and apparatus for in the middle primary backup replication

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 first circuit representation of a given function is obtained at a first processing device. The given function comprises at least two computer programming switch statement clauses. A second circuit representation is generated at the first processing device from the first circuit representation wherein the at least two computer programming switch statement clauses are respectively represented by at least two tree circuits that are embedded in the second circuit representation such that the second circuit representation is characterized by a given cost (e.g., a minimum cost). The second circuit representation is encrypted at the first processing device, and sent to a second processing device for secure evaluation of the given function by the second processing device.

Secure function evaluation of tree circuits

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

Techniques are provided for anonymizing streamed data. In various embodiments, data are anonymized by receiving a data element of a data stream including a plurality of said data elements (p, s), where pcomprises an identifying portion and scomprises an associated sensitive information portion; obtaining a partitioned space S including t regions; assigning the identifying portion, p, to a selected region; encrypting the associated sensitive information sas e(s); and storing the encrypted associated sensitive information e(s) in a list associated with the selected region but not storing the associated identifying portion, p, in the list. The regions have corresponding center points, and a nearest center to pis optionally determined. The encrypted associated sensitive information e(s) may be stored in a list associated with the nearest center.

Anonymization of streaming data

Methods and apparatus are provided with improved routing techniques for bifurcated flows. Routing methods and apparatus are provided that obtain a fractional flow from a set of nodes to a given destination having a maximum load, L, on any link between a node in the set and the given destination; and generate a bifurcated flow between the set of nodes and the given destination from the fractional flow such that the maximum load on any link in the bifurcated flow does not exceed 2L, wherein the bifurcated flow allows a flow from a given node to be sent on at most two outgoing links. The fractional flow can be, for example, a fractional single-sink multicommodity flow.

Methods and apparatus for routing using bifurcated network flows

Undirected cross connects are provided based on wavelength-selective switches. An undirected Cantor network is disclosed where the switch nodes are wavelength selective switches. An undirected Clos cross connect is also disclosed where one or more undirected switches are undirected Cantor networks having at least one wavelength selective switch.

Undirected cross connects based on wavelength-selective switches

A primary-backup replication capability is disclosed. A primary process and a backup process participate in a synchronization process configured to synchronize state information of the primary and backup processes. The synchronization process operates in periods of time referred to as epochs. During the current epoch, the primary process computes state update information representing changes to the state information of the primary process since a previous epoch, and also buffers output messages generated during the current epoch in an associated output buffer dedicated for use in the current epoch. The primary process initiates a new epoch independent of receiving, from the backup process, a state update acknowledgement for the previous epoch. The output messages buffered for the current epoch are released from the associated output buffer after the primary process receives a state update acknowledgment for the current epoch and all output buffers of all previous epochs are empty.

Method and apparatus for synchronization in primary-backup replication schemes

The method includes determining a timestamp corresponding to a received data packet associated with the virtual machine and releasing the data packet from a buffer based on the timestamp and a time another data packet is released from the buffer.

Time-preserved transmissions in asynchronous virtual machine replication

An optical communications network architecture and associated method which employs time and wavelength-interleaving for homing between nodes/satellites and hubs and for grooming, while employing wavelength-division-multiplexed wavelength circuits between hubs without requiring cross-connects or routers therebetween.

Optical telecommunications network and method

A network design method for Ethernet-type networks exhibiting capacities sufficient for operation during normal periods as well those as periods when a single node or link has failed.

Network design method

Undirected cross connects are provided based on wavelength-selective switches A demand d={i, j} is routed over a path pbetween ports i and j in a multi-layer network based on one or more wavelength selective switches, by determining a middle layer node n in the multi-network for which there is a first path pbetween the port i and the middle layer node n and a second path pbetween the port j and the middle layer node n; identifying a node n', wherein the node n&#x2032; is a first node starting from port i that path pshares with path p; and concatenating the path pcomprised of a subpath p&#x2032;of the first path pfrom the port i to the node n&#x2032; with a subpath of p&#x2032;of the second path pfrom the node n&#x2032; to the port j. An undirected Cantor network is disclosed where the switch nodes are wavelength selective switches. An undirected Clos cross connect is also disclosed where one or more undirected switches are undirected Cantor networks having at least one wavelength selective switch.

A system and method are disclosed for time-domain wavelength interleaved networking that reduce the need for complex time-slot scheduling and reduce the routing complexity. Substantially all communications in the time-domain wavelength interleaved network pass through a hub node. In addition, interior nodes in the time-domain wavelength interleaved network will forward substantially all communications received from the hub node that are destined for another node on all branches outward from the hub node. The central hub node can impose a timing reference. Thus, the transmission and reception of a message can be synchronized such that a message sent in a time-slot k by a node Nwill be received by a node Nin the time-slot k. Further, the hub node can recover from a link failure by shifting transmission times of all nodes that are separated from the hub node by the failed link.

Time-domain wavelength interleaved network with communications via hub node

Growing community of inventors

Bedminster, NJ, United States of America

Gordon Thomas Wilfong