Level Z, L.l.c.

Network Machines, Inc.

Bell Communications Research, Inc.

Bell Telephone Laboratories

Rutgers, the State University of New Jersey

Network Programs, Inc.

At&t Bell Laboratories

Telephone and Telegraph Company, At&t Bell Labs

Bhaskarpillai Gopinath

Dinesh Kashinath Anvekar

Rajiv Mangla

David Kurshan

Sridhar Sundaram

Robert Paul Kurshan

Christopher Flores

Shuo-Yen R Li

Zoran Miljanic

John Ormond Limb

John R Vollaro

David M Cohen

Rajendra Gupta

David Glenn Summerfelt

Phani Kumar Velide

Abhinav Mathur

Peter Zenon Onufryk

In a short message service (SMS) wireline/wireless message system, a separate SMS exchange subsystem implements value-added service capability. The value addition service may range, for example, from simple data insertion in the SMS message to the more complex initiation of a teleconference call using inter-exchanged SMS messages.

Method and system for short message service exchange and teleconferencing

In a short message service (SMS) wireline/wireless message system, a separate SMS exchange server linked to a multi-party concurrence server implements a value-added service capability to achieve multi-party concurrence. The basic function of the multi-party concurrence operation is that of changing the contents of a data structure in the server based on the responses received from two or more members. The concurrence operation has many applications, such as, the transfer of money to an account only if two or more persons agree to the transaction.

Multi-party concurrence through short message service exchanges

A stored value commerce system and method enabling the anonymous creation and usage of stored value accounts for purchase of goods and/or services, including the anonymous redemption of a value up to a maximum of the balance value associated with a stored value account.

Anonymous redemption and stored value system and method

A global prepaid roaming services method and apparatus is described in which a roaming phone located in a first region places an outgoing call to a destination party in a second region, and responsive to placing the call, a service processing node (SPN) establishes a first call connection between the roaming phone and the SPN, a second call connection between the SPN and the destination party is established and the SPN bridges the first and second call connections to establish a call connection between the roaming phone and the destination party. Incoming calls originating in a first region made to a wireless phone roaming in a second region are established by signaling from the first region to a home region associated with the wireless phone in order to determine that the wireless phone is roaming in the second region; signaling a cellular-switching center (CSC) in the second region, responsive to the determination that the wireless phone is roaming in the second region, to inform the CSC in the second region of a call connection request to the wireless phone; routing the call, responsive to the call connection request, from the CSC in the second region to a service processing node (SPN) in the second region and establishing a first call connection from the originating first region to the SPN in the second region; launching a message from the SPN in the second region to the wireless phone, the message instructing the wireless phone to establish a second call connection with the SPN in the second region; and bridging the first call connection with the second call connection, responsive to establishing the second call connection with the SPN.

Global wireless prepaid roaming

A technique to register a roaming cell-phone in a visiting location as a local phone. The technique involves identifying roaming-related information from the roaming cell-phone in the visiting location, and then dynamically configuring the roaming cell-phone to operate as a local cell-phone in the visiting location.

Roaming in wireless networks with dynamic modification of subscriber identification

An arrangement to provide personalized services to customers, such as hotel guests or hospital patients, wherein the personalized services are based upon a personal preference profile collected for each individual. The services are displayed to the guest or patient via an in-room monitor. Moreover, the personal preferences are modified during the guest's or patient's present stay, and saved after the stay for later visits. In addition, a personal presence of host personnel, such as personnel at a front desk or an admission desk, may be integrated into the display on the in-room monitor.

Personalized services, including a personal presence, for customers

A canonical programming method for integrating intelligence into a communications service at a switching node. The communications service is implemented with a program stored in a processing unit which receives and transmits messages from and to ports, respectively. Each incoming message, which includes a control part and a payload part, is parsed to determine if a modification is required. If no modification is required, a message corresponding to the incoming message is transmitted to one or more of the ports. If modification is required, then the message is further processed with the stored program to produce program-generated events and subsequent actions which thereby engender the intelligent communications service.

Integration of intelligence with communications in a switching node

A distribution element composed of a crossbar-type switch with four independent ports and direct multicast transfer capability which effects a direct interface to applications with an instruction sets for the distribution element, the sets providing for global memory sharing, synchronization, and lossless flow control.

Directly programmable distribution element

The states of a distributed finite state machine composed of a plurality of devices are coordinated by a sequence of operations to effect a self-timed cycle. Each device is arranged to apply a voltage over one or more leads and measure the current on the corresponding leads. With the methodology, while engendering self-timed cycles, the number of leads interconnecting the devices is also minimized.

Coordinating the states of a distributed finite state machine

A methodology for developing scalable systems based on a technique for the composition of objects to form a larger, composite object using Interface Cycles, which are canonical programs, hardware, or abstractions which interlock protection, distribution, and coordination of data and control from the objects. The methodology thus allows the interconnected objects to form the new composite object which is subject to the same principles as the underlying objects and which may then used in any stage of the life cycle of a system. An Interface Cycle transitions through discrete phases only by agreement of all object interfaces connected by the Interface Cycle. Protection and data distribution of composite data collected from all the objects are effected under control of the Interface Cycle.

Composition of systems of objects by interlocking coordination,

Circuitry, and associated methodology in a parallel processing system for sharing the address space among a plurality of autonomous processors (110, 210, 310) communicating over a common bus (60) provides an efficient, non-destructive data transfer and storage environment. This is effected by augmenting each processor with a global clock (31), state alignment circuit (41, 42, 43) to synchronize the processors with the global clock buffers (140, 240, 340) for storing data received off the bus, and circuitry (130, 230, 330) for selectively enabling the buffer to accept those segments of data having addresses allocated to the given processor. To ensure that processing states are aligned, each state alignment circuit inhibits incrementing of the global clock until each corresponding processor transceives necessary data over the bus. To avoid overwriting of data during bus conflicts, the buffers are arranged to store data on a first-in, first-out basis and to control the processing states and data transfer in correspondence to respective bus and processor states.

Selective receiver for each processor in a multiple processor system

A methodology is disclosed for effecting contention-free communication over a plurality of Collision-type lines interconnecting numerous synchronized stations. In broad terms, each station having a message to transmit executes a prescribed encoding/algorithm. Each station also monitors the states of the lines and depending upon the dynamic states of the lines, the lines are associated with prescribed ones of the lines during each bit interval. At any stage of the detection process, if it is determined that a line broadcasts of unique message, then this line is assigned to the station generating the unique message for the remainder of the frame. The remaining lines are then available for reassignment in subsequent bit intervals. The pattern of bits detected at the end of the frame by each of the lines determines successfully transmitted messages.

High capacity communication system over collision-type channels

Methodology and associated circuitry (131,141-143, 151,152,161,162,171-174,181) are disclosed for achieving contention-free broadcasting over one or more buses interconnecting a plurality of synchronized stations. In broad terms for the multiple bus case, each station that intends to utilize the buses prepares candidate message frames equalling the number of buses. The first candidate message of each station (301), after a first perturbation, is propagated over the first bus (311); also, the second candidate message of each station (302), after a second perturbation, is propagated over the second bus (312); this process occurs for all buses. Then, any station detecting a mismatch between its most recently propagated bit on a particular bus and the state of that bus deactivates further propagation of the candidate message on that bus. To arrive at the correct candidate message revealed by each bus, the inverse of the original perturbation must be applied to the revealed message. Examples of perturbations include an EXCLUSIVE-OR operation with randomly generated numbers, cyclic shift operation, cyclic inversion operation and linear transformation.

High capacity communication utilizing static, OR-type channels

A digital transmission system includes a plurality of stations sharing a common transmission line. Variable length messages, set off by flags, are exchanged between pairs of stations. While a message is being received, the downstream portion of the transmission line is segmented to permit simultaneous use by another station pair. If a message is received from an upstream station while a message is being transmitted downstream, an abort message flag terminates the transmitted message abruptly to permit flowthrough of the received message. When any station is not in use or out of order, it is bypassed to permit use of the transmission line by the rest of the stations.

Growing community of inventors

Watchung, NJ, United States of America

Bhaskarpillai Gopinath