Abstract: In a coherent optical receiver, a frequency domain engine digitally processes at least two multi-bit sample streams of a received optical signal. The frequency domain engine includes a Fast Fourier Transform (FFT) filter for computing a complex vector representative of a frequency-domain spectrum of the received optical signal. A transpose and add block computes a vector sum of the complex vector and a transposed version of the complex vector, and an Inverse Fast Fourier Transform (IFFT) filter computes a complex output vector from the addition result. With this arrangement, parallel real filter operations are efficiently performed on each of the multi-bit sample streams, using a single back-to-back FFT-IFFT filter structure.

Abstract: Originating endpoints may obtain reachability information from a directory service, which collects contact and related information from available users. When initiating a peer-to-peer communication session to an endpoint of a destination user, the originating endpoint will access the directory service to obtain reachability information for the destination user. The reachability information may contain one or more addresses, one of which will be a peer-to-peer communication session address. From the reachability information, the originating terminal will determine an appropriate address to initiate communications with the destination user. The reachability information may identify multiple addresses, where only certain of the addresses may be peer-to-peer communication addresses and other addresses may be used to establish other types of sessions through disparate types of networks.

Abstract: To schedule uplink transmission time slots for a collection of mobile communication devices, a set of base station target interference patterns is associated with base stations. A time slot target interference pattern is assigned for each time slot and it repeats after several time slots. The time slot target interference pattern in a given time slot specifies the interference allowed by each time slot to a given base station by any single mobile. A priority index may be determined for each time slot for each mobile associated with the particular base station. The priority index may be based, in part, on a determined correlation between the time-slot target interference patterns and a potential interference profile of a mobile to which a time slot is to be allocated. A mobile's throughput requirement, the throughput already received over a specified past duration, the system fairness requirement, as well as the amount of data available for transmission are also used for evaluating the priority index.

Abstract: An apparatus, method, and computer program manage communication sessions that include a plurality of portions. Different processors handle each portion of a communication session. The apparatus, method, and computer program transfer the communication session from one of the processors to another of the processors during the different portions of the communication session.

Abstract: The present invention advantageously provides a method, system and apparatus for allocating addresses to secure unique local networks by providing a brokered federated policy and identity management system, the brokered federated policy and identity management system having an address domain manager that allocates network addresses, the address domain manager arranged to interoperate with a network identity management module, the network identity management module providing management of identity at an application level, receiving an authorization from the brokered federated policy and identity management system, and assigning a network address to a unique local network based on the authorization from the brokered federated policy and identity management system. The method, system and apparatus may further include authenticating a user, wherein authenticating a user includes passing an assertion token to a device of the user.

Abstract: A system and method include receiving an external reference signal and generating first temperature control commands to maintain a constant ambient temperature for a crystal oscillator using a first temperature control system. The method further includes generating second temperature control commands for a second temperature control system to establish a desired ambient temperature for the crystal oscillator according to a temperature training profile. While at least one of the first and second temperature control systems operates to change an ambient temperature, the method includes extracting a clock from the external reference signal, generating a correction signal to further generate a corrected oscillation based on a difference between the extracted clock and the crystal oscillator and training an adaptive control algorithm based on the correction signal in relation to a determined crystal oscillator response to temperature variations caused by the second temperature control system.

Abstract: A method, apparatus and system for improving block error rate performance of a receiver having an iterative decoder in a communication system, the method, apparatus and system includes receiving an encoded frame of data, the encoded frame of data includes a quantity of code blocks where each code block has a corresponding code block size, determining a first maximum number of iterations for each of the code blocks of the encoded frame of data iteratively performing a decoding operation on a first code block until the occurrence of one of (a) the first maximum number of iterations has been reached and (b) the first code block has converged, and determining a second maximum number of iterations for the remaining code blocks of the encoded frame of data based on the number of actual iterations used to decode the first code block.

Abstract: A network includes an edge node configured to define per hop behaviors using a set of bits in an Ethernet header of a frame and a core node configured to receive the frame and to forward the frame according to the per-hop-behaviors. The network can also include a defined set of differentiated service classes, each differentiated service class associated with the set of per hop behaviors, indicated in the set of priority bits. The network classifies the Ethernet frame based on at least one of a set of priority bits or information in at least one protocol layer in the frame header of the Ethernet frame and determines a per hop behavior based on the classification.

Abstract: The present disclosure provides a parallelizable integrity-aware encryption technique. In at least one embodiment of the present disclosure, a parallelizable integrity-aware encryption method comprises whitening at least one message block with a first mask value, encrypting the whitened at least one message block using a block cipher and a first key, and whitening the encrypted at least one message block with a second mask value to generate at least one corresponding output ciphertext block. In another embodiment of the present disclosure, a parallelizable integrity-aware encryption method comprises applying a XOR function to all blocks of a message to compute a XOR-sum, applying a first mask value to the XOR-sum; encrypting the masked XOR-sum using a block cipher and a first key, and applying a second mask value to the encrypted XOR-sum to generate an integrity tag.

Abstract: A network intelligence provides stateless elemental device control to a plurality of network connected components. Selected ones of the network connected components may be associated with one another as an aggregate device and the state of each associated component may be maintained at the network intelligence in a logical model of the aggregate device. Service adapters in the network intelligence may represent this association of components to data network services as a single, multi-function device.

Abstract: Apparatus for distributing a quantum key between nodes Alice and Allie, comprising a coupler that splits generated photon pulses into first and second pulses P1 and P2; and an interface that transmits the P1's and P2's into a network. The P1's are received after modulation by Alice with respective phases selected from two encoding bases and further selected from within the selected encoding basis as a function of a bit value of a respective bit in a key bit string maintained by Alice. The P2's are received after similar modulation by Allie. A detector processes the P1's and P2's upon receipt to produce a sequence of detection outcomes indicative of phase mismatch between the P1's and corresponding P2's.

Abstract: A computer network processes data packets in the event of a network link failure. The network includes a plurality of routers that deliver data packets to the network via a plurality of links. At least one router includes a protection cycle manager. The protection cycle manager has a protection cycle packet identifier and a protection cycle packet processor. The protection cycle packet identifier identifies, as protection cycle packets, data packets having a specific protection cycle format. The protection cycle packet processor processes protection cycle packets to determine whether the packet destination corresponds to the routing node, and if the packet destination corresponds to the routing node, the protection cycle packet is treated by the routing node as a data packet received from the packet source via the failed link. Otherwise, if the packet destination does not correspond to the routing node, the protection cycle packet is sent to a protection cycle node for the routing node.

Abstract: A method and apparatus are provided for selecting an optimum base station for communicating with a terminal in a wireless communication system. A base station controller stores two candidate sets for each terminal within communication range of the base stations controlled by the base station controller. One candidate set lists base stations for which the channel quality of the uplink channel between the base station and the terminal is acceptable for communication. The other candidate set lists base stations for which the channel quality of the downlink channel between is acceptable for communication. This allows the base station controller to take into account the predominant direction of traffic when assigning base stations for communication with the terminal.

Abstract: Described are a method and system for providing enhanced caller information to a communications recipient. Enhanced caller information is determined from a caller information storage device associated with a caller attempting to establish a communications session with the communications recipient. The enhanced caller information is transmitted to the communications recipient and presented prior to the establishment of the communications session. The presentation can include the display of text, graphical information and audible information to the communications recipient. Optionally, the enhanced caller information includes data used to establish a communications link between the caller and the communications recipient.

Abstract: An operating network comprising a large number of nodes interconnected by links determines potential link-capacity enhancement with the help of a companion phantom network. In one embodiment, the operating network and the phantom network are topologically coincident and each node participates in seeking an actual-connection setup through the operating network and a phantom connection through the phantom network for each connection request. Each node associates with each of its output links an operating capacity, a phantom capacity, an operating vacancy, and a phantom vacancy. The phantom vacancy data is used for link provisioning. In another embodiment, nodes may be added to or deleted from the operating network and the phantom network may not topologically coincide with the operating network.

Abstract: In a first mode of burst communication in a telecommunication network comprising electronic edge nodes interconnected by bufferless core nodes, data bursts are formulated at the edge nodes, respective burst descriptors are communicated to a controller of a core node, and burst-transfer schedules are sent from the core node to respective edge nodes. In a second mode, each burst-stream is allocated a flow rate and a core node determines burst sizes and schedules burst-transfer permits. In a bimodal burst-switching network comprising edge nodes interconnected by core nodes, an edge node selects to send to a core node burst-transfer requests according to the first mode, or flow-rate-allocation requests according to the second mode, depending on proximity, storage capacity at the edge node, and delay-tolerance specifications.

Abstract: A method is provided of planning routes and allocating route identifiers in a managed frame-forwarding network. The network comprises a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of an identifier and a network address carried by a received data frame and forwarding instructions stored at the node. A first step of the method identifies a sub-set of nodes which are core nodes of the network. The remaining nodes are termed outlying nodes. A spanning tree is then built off each of the identified core nodes, with the spanning tree stopping one link short of any other core node. Each spanning tree defines a loop-free path between a core node at the root of the spanning tree and a set of outlying nodes. Connections are planned between roots of the spanning trees and a different identifier is allocated to each planned connection between a pair of spanning trees.

Abstract: A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network. The DHT may be implemented to store MAC addresses, IP addresses, MPLS labels, or other information of interest to enable routes to be stored and learned by network elements on the network.

Abstract: Low density parity check code (LDPC) base parity check matrices and the method for use thereof in communication systems. The method of expanding the base check parity matrix is described. Examples of expanded LDPC codes with different code lengths and expansion factors are also shown.

Abstract: A method of transmitting OSI layer 2 datacoms data by direct incorporation into a plurality of synchronous digital hierarchy virtual containers is disclosed, in which a higher bit rate OSI layer 2 data frame is multiplexed into a plurality of lower bit rate SDH (or SONET) virtual containers, which are transmitted simultaneously and in parallel over a synchronous communications network. The plurality of virtual containers are virtually concatenated by association of the payloads of the plurality of virtual containers. Re-assembly of the OSI layer 2 data frames from a plurality of virtually concatenated VCs is achieved by storing each received VC payload corresponding to an OSI layer 2 data frame in a corresponding respective memory location, and alternately reading interleaved bytes from the plurality of payloads under control of a plurality of read pointers.