Telcordia Technologies

About: Telcordia Technologies is a based out in . It is known for research contribution in the topics: Network packet & Node (networking). The organization has 3097 authors who have published 4737 publications receiving 237882 citations.

Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP

Abstract: Under a computational assumption, and assuming that both Prover and Verifier are computationally bounded, we show a one-round (i.e., Verifier speaks and then Prover answers) witness-indistinguishable interactive proof for NP with poly-logarithmic communication complexity. A major application of our main result is that we show how to check in an efficient manner and without any additional interaction the correctness of the output of any remote procedure call.

Packet parallel interconnection network

Abstract: A packet parallel interconnection network for routing packets in parallel form comprises a three-dimensional space domain switch which interconnects a plurality of time domain switches in the form of multiple two level bus systems with separate data and control paths. The space domain switch comprises one control plane and a plurality of data switching planes such that the i th data switching plane routes the i th data slice of a packet. The control plane and the data switching planes comprise output buffered crosspoint switches. The control plane processes address information in the packets to be routed and broadcasts routing information to the data switching planes to control the routing of data slices by the data switching planes. It is a significant advantage of the time and space domain switches that decoupled control and data paths provide for overlapped control processing and data routing. The inventive interconnection network is especially useful for implementing a parallel processing system for processing database queries.

Method and apparatus for integrating telephone and broadband networks

Abstract: An integrated broadband/telephone service control point connected to both a broadband network and a telephone network, comprising a first database having a plurality of broadband processing records, a second database having a plurality of call processing records, a system responsive to a first set of triggers from the broadband network for executing one or more of the broadband procession records and returning processing instructions to the broadband network, and a system responsive to a second set of triggers from the telephone network for executing one or more of the call processing records and returning processing instructions to the telephone network.

An architecture for a wavelength-interchanging cross-connect utilizing parametric wavelength converters

Abstract: This paper proposes an architecture for a wavelength-interchanging cross-connect (WIXC) that can be used as a switching node of strictly transparent and scalable networks with all-optical routing and all-optical wavelength conversion capabilities. This architecture utilizes all-optical parametric wavelength converters based on difference-frequency-generation (DFG) or four-wave mixing (FWM), although this work focuses only on the implementation using difference-frequency-generation wavelength converters. The proposed WIXC architecture exploits the unique wavelength mapping properties of parametric wavelength converters: mirror image mapping and simultaneous multichannel wavelength conversion. The derivation of this architecture involves application of a space/wavelength transformation to the classical Benes switch fabric. The connection setup for the resulting architecture follows the well established looping algorithm, and the architecture is scalable in both the ports and the wavelengths. The scaling occurs in an orderly fashion, which allows modular upgrades of WIXC's for cost-effective evolution of the networks. The unique properties of the parametric wavelength converter including transparent and multichannel conversion capabilities result in a WIXC architecture that requires fewer wavelength converters while maintaining scalability and transparency.

On the complexity of embedding planar graphs to minimize certain distance measures

Abstract: We present polynomial-time algorithms for computing an embedding of a planar graph that minimizes the outerplanarity, or the width, or the radius, or some other measures of distance to the outer face. On the other hand, we show it is NP-hard to compute an embedding that minimizes the diameter of the dual graph.