Abstract: A call processing record for execution in a telephone service execution environment of a telecommunication network. The call processing record includes a record header which associates the call processing record with one or more corresponding telephone service subscribers. The call processing record further includes one or more call processing logic sections, one or more local data sections, one or more entry points, and a global data section. The local data sections are associated with an entry point in a corresponding logic section and store data executable only by the associated call processing logic. The entry point identifies the associated call processing logic section. The global data section includes data executable by each of the call processing logic sections.

Abstract: A system and method for operating a Broadband ISDN to support a viable virtual private network (VPN) service are attained by establishing a plurality of virtual path links connecting customer locations and broadband switching systems, by cross-connecting virtual channel links at the broadband switching systems to establish end-to-end virtual channel connections, and by policing both the input and output traffic only on the virtual path links. An egress policing processor is included at each output port on broadband switches to police the traffic on each virtual path link which contains one customer's multiplexed virtual channel connection traffic.

Abstract: A system and method for operating a Broadband ISDN to support a viable virtual private network (VPN) service are attained by establishing a plurality of virtual path links connecting customer locations and broadband switching systems, by cross-connecting virtual channel links at the broadband switching systems to establish end-to-end virtual channel connections, and by policing both the input and output traffic only on the virtual path links. The egress policing function is attained through the use of the ingress policing processors by looping back one customer's traffic from an outgoing trunk into an input port on the broadband switching system.

Abstract: Method and system are provided for efficient, multiplication-free arithmetic coding wherein data which represents an alphabet of source symbols is compressed and decompressed in a data transmission system. Multiplications are replaced with single shift-and-add operation using a suitable shift register wherein a multiplier has at most two bits. The shift-and-add operation approximates the width of a new subinterval within a predetermined interval. This approximation is a function of both the width of a current subinterval and a total count of source symbols in a statistical source model. In this way, an adaptive model can be accommodated as well as a fixed model for the statistics of the source symbols. In one embodiment, the multiplier is preferably determined by a table look-up having a small number of entries and which can be easily implemented by hardware or software.

Abstract: A method for conducting radio transmission systems interference studies based on the prior art two-step process of conducting a simple analysis on all potentially interfering systems to eliminate those clearly not causing interference into radio receiver under study, and then conducting a detailed analysis on the remaining systems. The new method replaces the first step in the prior art system with a method using pre-calculated average terrain elevations over a geographic block for determining whether the loss should be calculated using a smooth terrain calculation method with a simulated single knife edge diffraction obstacle in the path, or a rough terrain calculation method that substitutes a pre-calculated block roughness factor in place of the path roughness factor, and then also substitutes a new effective antenna height for the actual antenna height in the propagation loss calculations.

Abstract: An operating system is provided for an analog switching machine having switch fabric formed by multiple line and trunk link networks having interconnected switch stages with each switch stage having multiple grid connections and makes post-connection continuity checks. Error messages are generated for connection faults and sent to a monitor and analyzer computer. The error messages are automatically processed to identify the root causes of connection faults, i.e. to detect open and stuck crosspoints, faulty interstage links and faulty pulse path devices. The analyzer computer further generates command signals that provide for removal of faulty crosspoints and other failed elements from analog switching machine operation.

Abstract: A Broadband Intelligent Network employs an ATM fast-packet switch to route signaling cells from a calling party to a switch port directly connected to a Service Control Point (SCP). The signaling cells carry a service request that requires the support of a network resource, and, in the specific case described herein, the support of the Line Information Data Base (LIDB) to facilitate the establishment of a switched virtual connection to a called party. The SCP acts on the information in the signaling cells and selects the required resource, i.e., the LIDB, and then sends a query cell(s) to the LIDB through a permanent virtual connection in the ATM switch. The LIDB, in turn, acts on the information in the query cell(s) to assemble a response cell(s) with the requested information. The response cell(s) is sent to the SCP through the permanent virtual connection in the ATM switch, thereby enabling the SCP to complete call processing, establish the requested connection, and generate a billing record.

Abstract: A method and system are provided for controlling user traffic to a fast packet switching system using the leaky bucket scheme. Each of the packets (53 byte length cell) originates at a source of packets and has a virtual channel identifier (VCI). The method includes the step of receiving the packets, each of the packets having associated therewith an arrival time. The packets are stored at an addressable location in a first memory. The first memory having a plurality of addressable locations. In a second memory, there are stored addresses corresponding to the addressable locations in the first memory in which a packet is not yet stored. The addresses stored in the second memory are utilized in the step of storing the received packets. A credit manager circuit determines whether a stored packet complies with predetermined traffic parameters such as average arrival rate and maximum burst rate. This determination is based on a packet's arrival time and its VCI to obtain a validated packet.

Abstract: An expert system methodology for operating a computer system is disclosed to facilitate tuning, that is, resource balancing of the various resources comprising a large-scale software system. The computer system is adapted to store a knowledge base derived from experts who manually tune the large-scale system. The system also stores site-specific information and specifications on components configuring the large-scale system. Performance measurements collected from the large-scale system on a time consistent basis are merged, utilizing the knowledge base, with reference data derived from the site-specific information and the specifications. As a result of the merger, the status of the large-scale system is classified as to its operability. If the status is in a predefined class requiring tuning, the computer system is arranged to generate programming code which will effectuate the required changes in the resources to thereby reconfigure the large-scale system.

Abstract: A dialed number recorder, a data monitor, and a personal computer are connected in combination to monitor the data traffic on a suspect "hacker's" telephone line. At the beginning of a call, the dialed number recorder receives and interprets the DTMF signals detected on the line and translates the DTMF signals into the corresponding telephone number dialed. The data monitor receives all signals on the line and converts them into their corresponding characters and transmits these characters, to the personal computer where the characters are stored in a buffer in dynamic memory. The personal computer compares the received data stream against a set of known characters strings looking for a match. If an on-hook signal (indicating the end of the call) is received without a match, the data stored in dynamic memory thus far is erased. If any series of sequential characters matches one of the known strings, the buffered data is written to the computer's disk.

Abstract: A method and system are provided for connecting and billing a first user on an Integrated Services Digital Network to a second user on a voice-band network for packet data and circuit switched data connections. A network access device is used to extract the first user's billing information and the called party's phone number from the data packets received in the case of data packet transmission and call set-up messages received on an ISDN interface in the case of circuit switched digital connections. A voice-band call to the second user is transmitted over the voice-band network. The billing identification sent by the first user is used to bill the first user for the voice-band call established from the network access device over the public switched telephone network to the second user.

Abstract: A method and apparatus for creating and implementing customer service procedures for individual customers of a telecommunication network. The method and apparatus provides for the creation and execution of customized records to provide the desired service. The records are created by an operator at a display terminal to provide a visual representation of the desired service. The displayed representation of the service is translated into a binary representation and executed in accordance with the customer's desires. Thus, each individual customer can design and have implemented unique telecommunication services.

Abstract: Our invention is a differential transimpedance amplifier circuit with shunt-shunt local feedback gain stages. These shunt-shunt feedback gain stages comprise an additional resistor and two transistors in a shunt-shunt feedback configuration to provide a low output impedance while maintaining the transimpedance gain. Cascading circuits of this structure results in a high bandwidth receiver with sufficient gain to drive conventional data regeneration circuits.

Abstract: A system and method for creating and modifying intelligent telephone network call processing logic trees which can be customized for individual customers and created in a user-friendly visual environment (10, 15, FIG. 3-5). Service primitives are defined as logical graph nodes (20, FIG. 2, FIG. 3) which can be visually assembled into logic trees (FIG. 5) which represent the service logic flow and which provide default values for all service options. Higher level nodes, assembled from a plurality of service primitives, can likewise be defined and stored (12, 13, 19) for later use as entities in defining yet further call processing logic trees. These call processing logic trees are interpreted to allow the service control point computers (17) to implement the services in the switched telephone network (18) by sequentially executing the specified call processing primitives.

Abstract: A method and apparatus for creating customized call processing information (CCPI) records to permit customized telephone services for individual subscribers to a telephone network. The records are provided in a binary representation, an internal data structure representation and a displayed representation. The displayed representation for a CCPI record may be provided in a plurality of formats. For example, a "graph" format or a "form" format. The binary and internal data structure representations of a CCPI record are less machine dependent than the displayed representation and can, therefore, be implemented in a variety of processing devices. The displayed representation can be developed by an operator to correspond to any desired operating environment which, when interfaced with the internal data structure representation, permits the creation of CCPI records on a wide variety of processing devices.

Abstract: 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.

Abstract: A methodology for retrieving textual data objects in a multiplicity of languages is disclosed. The data objects are treated in the statistical domain by presuming that there is an underlying, latent semantic structure in the usage of words in each language under consideration. Estimates to this latent structure are utilized to represent and retrieve objects. A user query is recouched in the new statistical domain and then processed in the computer system to extract the underlying meaning to respond to the query.

Abstract: Method and system for multicast routing in an ATM network including a multicast tree having a plurality of nodes interconnected by links wherein a weight representative of traffic congestion level is assigned to each link and at least one algorithm is utilized to find routes from a source node of the tree to multiple end nodes of the tree which minimize the sum-total of link weights. The method and system are disclosed with a 3-stage Clos switching network. One optimal and two heuristic algorithms are disclosed. The heuristic algorithms can find multicast routes that are close to optimal within a response time that is significantly lower than that of the optimal algorithm. A hybrid implementation in which the optimal and heuristic algorithms are run in parallel with a set time limit is also disclosed. Although the method and system are disclosed with the Clos switching network, the algorithms also apply to communications networks with a two-hop structure.

Abstract: A fast converging adaptive equalizer and method for for improving the convergence speed of an LMS adaptive equalizer by whitening both the received and conditioning signals using pilot filters.

Abstract: Our invention guarantees global serializability by preventing multidatabase transactions from being serialized in different ways at the participating local database systems (LDBS). In one embodiment tickets are used to inform the MDBS of the relative serialization order of the subtransactions of each global transactions at each LDBS. A ticket is a (logical) timestamp whose value is stored as a regular data item in each LDBS. Each substransaction of a global transaction is required to issue the take-a-ticket operations which consists of reading the value of the ticket (i.e., read ticket) and incrementing it (i.e., write (ticket+1)) through regular data manipulation operations. Only the subtransactions of global transactions take tickets. When different global transactions issue subtransactions at a local database, each subtransaction will include the take-a-ticket operations. Therefore, the ticket values associated with each global subtransaction at the MDBS reflect the local serialization order at each LDBS.