Abstract: The present invention provides a gateway unit which comprises a detecting unit for detecting the congestion from an RM cell from the ATM cell, for discriminating a TCP data gram (TCPDG) from a packet received during the congestion and for acquiring a sequence number of the TCPDG, a sending unit for sending an ACK having a window-controlled value to a transmitting terminal so as to limit a data transmission, and a discarding unit for discarding the packet from the transmitting terminal during the congestion after the confirmation of packet. During the congestion in the ATM network, a pseudo acknowledgment is sent from the gateway unit so as to indicate that the receiving terminal cannot receive data. This restrains the transmission of TCPDG from the transmitting terminal.

Abstract: A method of permitting older networks based on E-IISP routing to operate in newer PNNI based networks. The invention combines the PNNI and E-IISP routing schemes and permits their simultaneous execution in the same ATM network. The E-IISP routing scheme is modified so as to operate in unison with the minimal PNNI implementation configured on each node. The Hello protocol and associated Finite State Machine (FSM) are utilized to determine whether a remote node is in the same peer group. If it is determined that both nodes are in the same peer group, the ports on either side of the link are configured as standard PNNI type ports. If it is determined that the two nodes are from different peer groups, the ports on either of the link are configured as E-IISP type ports. Foreign address information is then exchanged between the two nodes thus permitting border nodes to learn about other peer groups from their respective remote nodes.

Abstract: Quality of Service (“QoS”) variables for predetermined protocol Type data units are stored in a cache memory. For data units that are associated with a flow, thirteen bytes selected out of the Internet Protocol (“IP”) header are employed as at least a portion of a key to perform a cache lookup to obtain at least one Quality of Service variable from the cache. Both routing and QoS information may be stored in the cache for retrieval upon a single lookup operation.

Abstract: Distributed precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved.

Abstract: The location of mobile unit cellular radio system is determined by determining the differences in timing of a characteristic feature of the transmission of the control channel of each of a plurality of base stations as measured at the mobile unit. The characteristic feature may, for example, be the training signal already used by the mobile unit in a cellular system to measure signal strength in handover operations. By determining the differences between time of arrival of transmissions from four base stations, location in two dimensions can be derived without prior knowledge of the actual distance to any of the base stations. A fifth base station allows location in three dimensions to be determined.

Abstract: A multi-protocol packet translator is disclosed. The translator may have microcoded control to translate a packet from one protocol to another. The microcoded instructions may be fed through a pipeline to control reading of information from information sources (including the original packet) and selectively connecting those sources to an output memory.

Abstract: In a methodology for route selection for path balancing in a connection-oriented packet switching network, a comparison is made of the measures of utilizations of a network resource by at least two links of a link group in the network, and at least one link is identified as a candidate for carrying traffic path based on the comparison. Network traffic path on the link is then moved to the candidate link to reduce variation in the utilization of the network resource by each of the links.

Abstract: The invention relates to a packet-transmission control method for controlling transmission of packets, the method comprising, a judgment step of forming a judgment as to whether or not the number of queue buffers that can be used for VC merging is smaller than the number of VCs to be merged in processing to merge a plurality of virtual connections into one virtual connection, and a merging step of merging virtual connections by giving a high priority to those virtual connections in a list having a large number of virtual connections to be merged in accordance with an outcome of the judgment formed at the judgment step, and relates to a packet-transmission control apparatus for controlling transmission of packets.

Abstract: Transportation of low bit rate, circuit emulation data over an asynchronous transfer mode (ATM) connection is improved by packetizing the circuit emulation data into short packets in accordance with a packetization clock. The packetization clock is derived as a function of the ATM cell shaping clock. The short packets are then multiplexed together into a single ATM connection and transported to a receiving unit in accordance with an ATM cell shaping clock. The circuit emulation data is then extracted at the receiving unit and forwarded to the corresponding circuit emulation connection at the appropriate service rate, which is recovered based on ATM connection characteristics.

Abstract: A switching fabric has input ports, output ports, buffers and at least one switch processor, which determines the available capacity of links at a switch and communicates this information to other switches in a network on a periodic basis. Based on this knowledge, the switch processor of the present invention determines if the necessary number of contiguous time slots in a time frame are available for the call in question. The routing method of the present method uses the periodically updated bandwidth usage to determine a route from a source switch to a destination switch. By utilizing periodic updates of bandwidth usage and assigning contiguous time slots, time slot availability becomes predictable and cell streams travel jointly along the same route, which in turn eliminates cell loss and jitter.

Abstract: An apparatus for reflecting an f-RM cell as a b-RM cell. The apparatus includes an RM cell processor which is adapted to receive the f-RM cell from an ATM network and modifies ABR information of the f-RM cell to reflect congestion regarding cells on the ATM network. The apparatus includes a transmit scheduler connected to the RM cell processor which forms the b-RM cell from the modified ABR information of the f-RM cell and sends the b-RM cell to the ATM network. The transmit scheduler is decoupled from the RM cell processor. An ATM telecommunications system. A method for reflecting an f-RM cell as a b-RM cell.

Abstract: A receiving method using a CDMA radio receiver with a plurality of receiving fingers each composed of a code generator, a correlator and a detector. In a visited cell search while in the ON-state of the power supply, different long-period spreading codes are set in the code generators, and if none of correlated outputs from the correlators respectively corresponding to the code generators exceed a threshold value, then new different long-period spreading codes are set in the code generators. If any one of the correlator outputs exceeds the threshold value, the mobile station is decided as staying in the cell corresponding to the long-period spreading code set in that correlator, and this long-period spreading code and time points at which peaks of correlator outputs were obtained with the long-period spreading code are set in the receiving fingers in descending order of the magnitude of correlation peaks.

Abstract: A system and method for optimizing and managing Qos (Quality of Service) in a network system including a plurality of open point-to-multipoint virtual circuits (VC)s between various endpoint sites, for example in multicast systems. VC optimization includes determining more appropriate set of VC endpoints to reduce oversent data. If below the VC limit, a set of potential VCs is determined, the set excluding combinations with VC connections already open. An estimation or calculation is performed to determined a reduction in oversent data that would occur if that a possible VC was opened. The possible VC with the greatest reduction in oversent data is then opened. Appropriate traffic is moved over to the newly opened VC, and any VCs which no longer have any traffic are closed. If a VC limit is reached for a node, a different optimization technique is used. A set of possible VCs to endpoint sites is determined.

Abstract: A routing table comprises routing table entries [230], a word line driver [92], prioritizer [100], and memory [106]. Each routing table entry [230] comprises content addressable memory (CAM) cells [220] and an entry masking circuit. The routing table looks up in parallel an entry matching an input network address, and outputs the search result in deterministic time. Only the bits specified by the masking circuit in each entry are compared when searching. If multiple entries match the input, the prioritizer [100] uses mask information from the masking circuits of the matching entries to select the best entry, e.g. the entry having the most matching bits.

Abstract: A server connected to a data network for transmitting files over the data network to one of a plurality of destination servers is adapted to spawn a software agent in response to a file to be transmitted and meeting certain preset criteria, such as file size. The software agent is associated with the file by at least the file's destination, and is transmitted over one or more routes to the destination to collect routing information, and returns to the source server. The associated file is then transmitted using the information collected. In an alternative embodiment the agent also collects validation information at the destination and returns same to the source server. The agent may also, in some embodiments, negotiate reserved bandwidth and security protocols or other validation information for transmission of the associated file at certain intermediate servers.

Abstract: In the CDMA Radio Multiplex Transmission, transfer function of line is inferred by using common pilot signal and synchronous detection is performed accordingly. The transmitting end transmits by periodically inserting pilot symbols into one channel only of multiplexed channels. The receiving end infers line condition (transfer function) from the received pilot symbols and, on the basis of the information thus obtained, performs synchronous detection of each channel multiplexed.

Abstract: The present invention teaches a system and method to reduce the peak-to-average power ratio of systems transmitting parallel channels. Examples of such systems are Orthogonal Frequency Division Multiplex (OFDM) and Orthogonal Code Division Multiplex (OCDM), also known as multi-code CDMA. Both systems have the disadvantage of a large peak-to-average power (PAP) ratio, which degrades the efficiency of the power amplifier of the transmitter. The present invention reduces the PAP problem by canceling the large signal peaks through subtraction of an appropriate reference function. That is, a time shifted and scaled reference function is subtracted from the sampled signal, such that each subtracted reference function reduces the peak power of at least one signal sample. In accordance with the present invention, an appropriate reference function with approximately or exactly the same bandwidth as the transmitted signal is selected.

Abstract: The invention is an ATM system to route DS0 traffic from T1 Extended Superframe (ESF) or Superframne (SF) systems that use robbed bit signaling. The invention is able to route the call selecting the ATM VPI/VCI that routes the call within the ATM system. DS0s with robbed bit signaling are transported transparently by the ATM system.

Abstract: A CDV-reducing algorithm circuit self-monitoring system is operative for detecting a non-data cell contained in a cell flow and arriving at a predictable time, executing a CDV-reducing algorithm operation on the detected non-data cell using self-monitoring parameters, comparing the result of the reduced CDV algorithm operation and an estimated value, and determining, when the two compared data are equal, that the CDV-reducing algorithm is normal, while making, when the two compared data fail to be equal, a determination that the CDV-reducing algorithm is abnormal and also notification of an alarm to a function control system.

Abstract: A method for implementing a time division multiple access protocol for digital communications between a radio transceiver and a repeater or another radio transceiver has the steps of dividing a radio communication into a plurality of frames having a predetermined length of time; dividing each frame into: a plurality of downlink slots, each downlink slot containing a transmission from the repeater to the transceiver; and a plurality of uplink slots, each uplink slot containing a transmission from the transceiver to the repeater.