Abstract: A switch schedules guaranteed-bandwidth, low-jitter-traffic characterized by a guaranteed rate table (GRT) method. A rate matrix generated from collected provisioning information is decomposed into schedule tables by a low jitter (LJ) decomposition method. The LJ decomposition method imposes a set of constraints for the schedule tables: schedule tables are partial permutation matrices, weighted sum of the partial permutation matrices is greater than or equal to the weighted sum of the rate matrix, and each entry in the rate matrix belongs to one element of the LJ decomposition schedule matrices. An integer LJ decomposition programming problem is employed to generate the schedule tables that are scheduled for each time slot of the period of the switch. Schedule tables are selected in turn based upon selecting eligible tables having the earliest finishing time. If necessary, the rate matrix is updated prior to decomposition for a subsequent period.
Type:
Grant
Filed:
January 21, 2003
Date of Patent:
April 15, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Muralidharan S. Kodialam, Tirunell V. Lakshman, Dimitrios Stiliadis
Abstract: A method and apparatus for importing digital switching system data into a spreadsheet program. Via the switch data examiner of the present invention, raw data from a digital switch/switching system such as the 5ESS® is converted by the switch data examiner to a format compatible with a spread sheet such as Microsoft® Excel, and output to worksheets and workbooks of the spreadsheet for easy accessing, and modifying data by users such as customer technical support engineers, testers, and Operation, Administration and Maintenance personnel. In contradistinction to the prior art, the user need not access the switch data one entry at a time, or download all data into a text file or the like, for time-consuming perusal, and need not have extensive knowledge of the commands associated with the particular switching system database.
Abstract: A terrestrial repeater is disclosed for use in a satellite transmission system that may also include a plurality of satellites. The terrestrial repeaters are implemented as OFDM transmitters to minimize the channel impairments caused by multi-path propagation. The OFDM terrestrial repeaters differentially encode the transmitted signal over frequency, as opposed to time, in order to avoid channel phase distortion. The OFDM receiver allocates two unmodulated sub-carriers as pilot bins and thereby provides two sub-carriers as a reference within each OFDM symbol. At the OFDM receiver, the two unmodulated pilot bins contain no phase information and provide a reference for the differential demodulation performed by the OFDM receiver. The OFDM transmitter operates in two modes, namely, a normal mode and a transmitter identifier information (TII) mode.
Abstract: “Reliability-related” values are assigned to received signal samples containing noise and distortion. The samples are then sent to a Viterbi decoder in order to regenerate originally transmitted messages.
Type:
Grant
Filed:
August 13, 2003
Date of Patent:
April 15, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Tongtong Li, Masoud Sajadieh, Mohsen Sarraf, Masood Yousefi, Robert L. Cupo, Thomas W. Goeddel
Abstract: An apparatus comprising a tuning device having at least one control electrode and a ground electrode located over a substrate and an electrically conductive fluid in contact with the control and ground electrodes. The tuning device also has at least one electrical transmission line electrically coupled to the fluid, the transmission line configured to transmit a signal. The fluid is configured to move when a voltage is applied between the ground electrode and the control electrode, the movement of the fluid changing a propagation characteristic of the signal.
Abstract: A device, a Micro-Electrical-Mechanical-Switch (MEMS) safety and arming (S&A) device and a method of manufacturing the MEMS S&A. In one embodiment, the device includes a body and a MEMS shuttle movably coupled to the body. In this embodiment, the shuttle is configured to close a switch in response to being accelerated in two directions that are substantially orthogonal.
Abstract: Techniques for computing a globally consistent set of image feature correspondences across a wide range of viewpoints suitable for interactive walkthroughs and visualizations. The inventive approach takes advantage of the redundancy inherent in a dense set of images captured in a plane (or in higher dimensions, e.g., images captured in a volume, images captured over time, etc). The technique may detect features in a set of source images and track the features to neighboring images. When features track to the same position in the same image, they are flagged as potential correspondences. Among the potential correspondences, the technique selects the maximal set using a greedy graph-labeling algorithm (e.g., best-first order). Only correspondences that produce a globally consistent labeling are selected. After globalization is done, a set of features common to a group of images can be quickly found and used to warp and combine the images to produce an interpolated novel view of the environment.
Type:
Grant
Filed:
May 30, 2003
Date of Patent:
April 8, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Daniel G. Aliaga, Ingrid Birgitta Carlbom, Thomas A. Funkhouser, Dimah V. Yanovsky
Abstract: The bread pudding protocol of the present invention represents a novel use of proofs of work and is based upon the same principle as the dish from which it takes its name, namely, that of reuse to minimize waste. Whereas the traditional bread pudding recipe recycles stale bread, our bread pudding protocol recycles the “stale” computations in a POW to perform a separate and useful task, while also maintaining privacy in the task. In one advantageous embodiment of our bread pudding protocol, we consider the computationally intensive operation of minting coins in the MicroMint scheme of Rivest and Shamir and demonstrate how the minting operation can be partitioned into a collection of POWs, which are then used to shift the burden of the minting operation onto a large group of untrusted computational devices. Thus, the computational effort invested in the POWs is recycled to accomplish the minting operation.
Type:
Grant
Filed:
August 1, 2000
Date of Patent:
April 8, 2008
Assignees:
Lucent Technologies Inc., RSA Security Inc.
Abstract: A MEMS device having a movable plate supported on a substrate by a support structure that is hidden under the plate and yet which can be implemented to enable rotation of the plate with respect to the substrate about a rotation axis lying at the plate surface. As a result, the support structure does not take up any area within the plane of the plate, while enabling rotation of the plate, during which the plate does not substantially move sideways. The latter property reduces potential physical interference between neighboring plates in an arrayed MEMS device and enables implementation of a segmented mirror having relatively narrow gaps between adjacent segments and, thus, a relatively large fill factor, e.g., at least 98%.
Abstract: In a multiple node network, the method includes waking up at least one node from a sleep mode during at least one associated slot of a time-slotted frame, the sleep mode being a low power consumption mode. Also, in at least one node of a multiple node network, the period of time a node sleeps is based on the residual energy of the node, the residual energy of the nodes in the neighborhood, neighborhood node density, and combinations thereof.
Type:
Grant
Filed:
May 1, 2003
Date of Patent:
April 8, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Krishna Balachandran, Joseph H. Kang, Wing Cheong Lau
Abstract: A method of scheduling data communication over an uplink. The method enables two or more users seeking to transmit data over the uplink to be scheduled in response to their path loss. The user having the most attractive determined path loss among the two or more users seeking to transmit data over the uplink us scheduled first. Thereafter, the next user having the next most attractive path loss among the remaining users may be subsequently scheduled if the total noise rise leftover is greater than zero. This process repeats so long as or until the total noise rise leftover is about zero.
Type:
Grant
Filed:
June 28, 2002
Date of Patent:
April 8, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Nandu Gopalakrishnan, Srinivas R. Kadaba, Ashok N. Rudrapatna, Ganapathy Subramanian Sundaram
Abstract: A method for tracing packets in a communications network directed to tracing a stream of anonymous packets received at a given target host, in order to identify their source, in response, for example, to a Denial-of-Service (“DoS”) attack on the target host. Advantageously, the tracing is performed without reliance on knowledge or cooperation from intervening Internet Service Providers (ISPs) along the path. The method is performed by applying a “burst load” (i.e., a brief but heavy load of transmitted packets) to various elements (i.e., links or routers) in the network and measuring the change in the rate with which the stream of packets arrive at the target. If the rate is substantially altered upon introduction of the burst load, then it may be deduced that the given element is most likely on the path from the source host of the DoS attack to the target host.
Abstract: A decision as to whether a mobile terminal has transmitted an ACK, a NACK or a NULL from a received signal at a base station is made by successively eliminating one of the three possible transmitted symbols by sequentially applying decision rules that maximize network throughput by minimizing the sum of the weighted costs of making a decision based on the magnitude of the received signal.
Type:
Grant
Filed:
February 2, 2004
Date of Patent:
April 8, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Francis Dominique, Srinivas R. Kadaba, Hongwei Kong
Abstract: A method and apparatus for tracing of computer documents is disclosed. A computer processor stores a processor identifier that is unique to the particular processor. Documents created by a computer system are tagged with an identification tag that is a value which results from performing a cryptographic function on the hash of the document and the unique processor identifier. Processor associators are stored in a secure database, with each of the processor associators being associated with one of the unique processor identifiers. In a first embodiment, the processor associators are the same as the processor identifiers. In a second embodiment, the processor identifiers are a function of their related processor associator. Documents may be traced by a third party possessing a document (including an attached identification tag) and a database of processor associators and user identification data associated with each of the processor associators.
Type:
Grant
Filed:
January 30, 2002
Date of Patent:
April 8, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Bjorn Markus Jakobsson, Adam Lucas Young
Abstract: A method and apparatus for allowing a reseller to securely access and manage scratch cards at a recharge card management system that is maintained by the service provider. The service provider and reseller users of the recharge card management system can create a scratch card batch that is associated with the reseller account identification. The service provider and reseller users can search, view and modify scratch card data based on security and accessibility. Advantageously, the reseller or distributor can only manage and sell scratch card only to its own account identification, thus protecting such transactions against fraud.
Type:
Grant
Filed:
November 19, 2003
Date of Patent:
April 8, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Yigang Cai, John B. Reid, Jie Su, Sunil Thadani
Abstract: A multi-stage (e.g., two-stage) packet-based lookup process using a Ternary Content Addressable Memory (TCAM) divided into partitions. The result of a first stage lookup is used to selectively search one of a plurality of TCAM partitions during the second stage. A subset of destination address bits may be used in the first stage to hash to a selected partition for the second stage. Alternatively, a partitioning algorithm segments a routing trie into partitions, and then, either a separate, small TCAM or one of the partitions is used in the first stage to map a prefix of the destination address to one of the TCAM partitions for use in the second stage. The “trie-based” algorithms may advantageously partition the trie such that each second stage partition comprises a substantially contiguous sequence of routing prefixes in a post-order traversal of the routing trie, together with one or more covering prefixes thereof.
Type:
Grant
Filed:
November 21, 2002
Date of Patent:
April 8, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Anindya Basu, Girija J. Narlikar, Francis X Zane
Abstract: A failure of a network element is detected automatically. A bootable image of the network element is electronically retrieved upon detection of the failure of the network element. The bootable image is employed to restore the network element.
Type:
Grant
Filed:
June 14, 2004
Date of Patent:
April 8, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Joseph F. Lennert, Bill Retzner, Monica G. Rodgers, Bernard G. Ruel, Srinivasan Sundararajan, Paul D. Wolfson
Abstract: In one embodiment, a control method, according to which a cascade of control messages is propagated between nodes of an optically transparent network, with each message being sent from a node to an adjacent downstream node to inform the latter about a control operation scheduled to be performed at the message-sending node and/or an upstream node that impacts an optical communication signal received at that downstream node. The cascade of control messages effectively creates an ad hoc control domain, in which control operations performed at various nodes of that domain can be coordinated to reduce unfavorable interactions between those control operations. By repeatedly propagating appropriate cascades of control messages through the network, control domains can be changed dynamically and adaptively to reflect any changes to the network topology, equipment, and/or traffic distribution.
Type:
Application
Filed:
September 28, 2006
Publication date:
April 3, 2008
Applicant:
LUCENT TECHNOLOGIES INC.
Inventors:
Robert D. Feldman, Daniel C. Kilper, Thomas A. Skrobala, Christopher A. White, Lili Yu
Abstract: In a communication method, data from a plurality of channels is combined into a composite channel by writing data from the plurality of channels as one-bit symbols to a memory, and reading out the data from memory to form the composite channel. The combining of radio frames from the channels forms a coded composite transport channel for transmitting the data in the downlink. To form the coded composite transport channel, an input process is initiated to write data for each radio frame of a transport channel as one bit symbols to a memory of an interleaver. On an output side of the interleaver, an output process to read out the data stored in the memory is performed to form the coded composite transport channel.
Type:
Grant
Filed:
April 25, 2003
Date of Patent:
April 1, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Mark Barry, Hettiachchi Upul Gunawardana, Yi-Chen Li, Koen van den Beld
Abstract: A method for routing emergency calls is provided for emergency calls placed over a packet-switched network (310) from a Customer Premises Equipment (CPE) (110) at a remote location (100). The method includes: registering the CPE (110) with a home Internet Service Provider (ISP) (260) through a remote ISP (130) that is providing the CPE (110) access to the packet-switched network (310); determining that the CPE is at a remote location (100); obtaining a local Internet Protocol (IP) address that corresponds to a Public Safety Answering Point (PSAP) (170) serving the remote location (100); routing non-emergency calls to the home ISP (260) for call processing; and, handling emergency calls locally at the remote ISP (130) in accordance with the obtained local IP address.
Type:
Grant
Filed:
August 17, 2004
Date of Patent:
April 1, 2008
Assignee:
Lucent Technologies Inc.
Inventors:
Stuart O. Goldman, Douglas H. Rollender