Abstract: Load balancing among fast reroute backup tunnels in a label switched network is achieved. M backup tunnels may be used to protect N parallel paths. A single backup tunnel may protect multiple parallel paths, saving on utilization of network resources such as router state and signaling information. A single path may be protected by multiple backup tunnels, assuring that bandwidth guarantees are met under failure conditions even when no one backup tunnel with sufficient bandwidth may be found. A packing algorithm is used to associate individual label switched paths (LSPs) with individual backup tunnels. If an LSP cannot be assigned to a backup tunnel, it may be either rejected, or additional bandwidth is allocated to existing backup tunnels, or a new backup tunnel is established.

Abstract: A frame synchronizing apparatus using a memory in which a frame synchronizing algorithm is embodied in an ASIC(application specific integrated circuit) so as to be used in a circuit for synchronizing a frame in framing/deframing method for improving a performance of ATM(asynchronous transfer mode) cell extraction in high-error wireless environment of WATM(wireless asynchronous transfer mode), and such an algorithm can be employed in a circuit for synchronizing the frame in a received data stream.

Abstract: A method and an apparatus are described for increasing the flexibility of uplink resource allocation for a mobile station (MS) (100), that is backwards compatible with earlier standards that provide only a single data flow per MS. The method includes steps of (A) associating an allocated uplink resource (an Uplink State Flag (USF)) with one or more Temporary Block Flows (TBFs) for a Packet Data Channel (PDCH), and not with a MS per se (although a given USF is associated with only a single MS); and (B) using a Temporary Flow Identity (TFI) for identifying a TBF, where a TFI may be unique to a PDCH and, if not, is unique with respect to the MS on a PDCH (and hence with respect to the USF). The result is that the MS is enabled to send any of its TBFs on allocated resources of the same PDCH. An uplink resource may be allocated to the MS dynamically using the Uplink State Flag (USF) or by using a fixed allocation. A total of n Radio Bearers are associated with a single TBF, where n≧1.

Abstract: A system and method to optimize the number of uplink and downlink slots, given the maximum number of crossed slots between any two cells is disclosed. The present invention effectively assigns a direction (i.e. uplink or downlink) to every slot in every cell of the system, taking into account the trade-off between: a) avoiding base-to-base or mobile-to-mobile interference; and b) matching the slot assignment of every cell as closely as possible to the local traffic conditions. The present invention assigns users to slots according to their transmission power requirements in order to allow conflicting slot-to-cell assignments between two cells in the same geographic region.

Abstract: A switching apparatus includes an input packet processing circuit, a switch, and an output packet processing circuit. The input packet processing circuit includes an included packet filling arrangement in which, at the time of mapping processing for mapping respective included packets associated with switching including packets for switching processing, a number of included packets corresponding to the length of the switching including packets and the length of the associated included packets is mapped in one switching including packet as long as the header information thereof can be shared in common. The switching apparatus has increased switching capacity.

Abstract: A process (111,101) of sending packets of real-time information at a sender (311) includes steps of initially generating at the sender the packets of real-time information with a source rate (s11) greater than zero kilobits per second, and a time or path or combined time/path diversity rate (d11), the amount of diversity (d11) initially being at least zero kilobits per second. The process sends the packets, thereby resulting in a quality of service QoS, and optionally obtains at the sender (311) a measure of the QoS. Rate/diversity adaptation decision may be performed at receiver (361′) instead. Another step compares the QoS with a threshold of acceptability (Th1), and when the QoS is on an unacceptable side of said threshold (Th1) increases the diversity rate (d11 to d22) and sends not only additional ones of the packets of real-time information but also sends diversity packets at the diversity rate as increased (d22).

Abstract: The system has a demodulator for duplex data transmission with quadrature amplitude modulation via two conductors with two oppositely transporting channels. The channels include an “upper” channel with a higher frequency band fo±Bo/2 and a “lower” channel with a lower frequency band fu±Bu/2. The two frequency bands do not overlap each other. Each of the channels transmits two digital signals at a respective symbol frequency fT, and the received modulated carrier signal is so sampled at a sampling frequency fAo in the case of the upper channel and fAu in the case of the lower channel, respectively. The frequencies are chosen in such a way that fo/fu is a rational number K and fAo=2fo.

Abstract: A telecommunications system and method is disclosed for improving the quality of data calls within a cellular network by dynamically changing the air interface data rate for transparent and non-transparent data services. As the quality of a higher data rate radio link deteriorates below a specified upper quality threshold due to interference, a change of channel coding to a lower data rate is ordered by the network. If the radio link quality measurements after a specified period of time indicate that the quality level has exceeded a specified lower quality threshold, the data rate is changed back to the higher data rate.

Abstract: A method is disclosed for operating a channel coder, as is a channel coder that operates in accordance with the method. The method includes steps of (a) maintaining a first count (N_Number) of transmitted packets and a second count (K_Number) of packets that are erroneously decoded at a receiver; (b) periodically performing a plurality of statistical tests using current values of the first and second counts; and (c) based on a result of the statistical tests, controlling the channel coder to either maintain a current channel coding technique or to switch to another channel coding technique. The step of controlling includes a further step of resetting the first count and the second count.

Abstract: A method and apparatus for long code generation in synchronous, multi-chip rate systems, wherein a first code sequence having a first bit rate, and a second code sequence having the first bit rate, the second code sequence being a time delay of the first code sequence, are multiplexed together, producing a desired long code.

Abstract: The pilot patterns of the preferred embodiment are used in a communication system. The pilot patterns of 15 slots are especially suitable for Third Generation communication systems, and allow a simpler construction of a correlation circuit for a receiver.

Abstract: Data is to be detected in a wireless communication system. A plurality of communication signals are received. A solution for estimating data of the received communication signals is modeled using a linear system requiring a matrix inversion. Columns or rows of an approximate Cholesky factor are determined. A difference between the determined columns or rows is determined. If the determined difference is less than a threshold, subsequent columns or rows are determined by previously determined columns or rows. The data of the received communication signals is estimated using the approximate Cholesky factor.

Abstract: A termination device for connection to a group of TDM (time division multiplexed) trunks is capable of sending cells over one or more links either individually or as part of an inverse multiplexed group. The device includes a Utopia interface for receiving an incoming cell stream, a buffer for storing incoming cells at specific memory locations identified by pointers obtained from a queue of available pointers, a round robin scheduler for sequentially assigning cells to links forming an IMA group or individually in the UNI mode, and a pointer queue for each channel address, the pointer queue indicating the location of the next cell to be transmitted for each virtual channel. An adaptive shaper determines when a stuff cell is inserted and a per link output circuit places cells on the links, which can operate in CTC or ITC mode. The device can operate in mixed mode where up to four IMA and/or up to eight UNI channels can be supported concurrently. The links assigned to the IMA or UNI channels is programmable.

Abstract: In a system where a plurality of terminal units are connected to a network unit via an optical transmission line and packets are transmitted in units of cells according to polling information, polling request information including the number of variable-length packets stored in the buffer of each of the terminal unit, the number of cells composing each variable-length packet and the number of remaining cells of a packet being read is created, polling information corresponding to a time slot allocated according to the polling request information is transmitted from the shared band control unit of the network unit, and bands are allocated to the plurality of terminal units.

Abstract: A forwarding node decapsulates and encapsulates data. The decapsulation may be performed using pattern matching techniques and the encapsulation may be performed using pattern insertion techniques. The decapsulation and encapsulation are preferably performed by hardware devices such as application specific integrated circuits (ASICs) to enhance the speed of such operations. The decapsulation and encapsulation may be independent of each other and performed on a per virtual circuit basis.

Abstract: Systems and methods for maintaining cell transmissions at or above the minimum cell transfer rate for ABR-category VCs. An ABR schedule table (AST) in a memory stores ABR VCs scheduled for transmissions. A pointer to the AST indicates that the ABR VC currently addresses is ready to transmit a cell. The schedule pointer is incremented every cell transmission time. When a cell of a particular VC is sent, the VC is rescheduled in another time slot in the AST such that the next cell for that VC is transmitted at close to or equal to that VC's allowed cell transfer rate (ACR) while maintaining its minimum cell transfer rate (MCR). To determine the next time slot in which to reschedule the VC, the system uses an ACR bitmap that compresses the AST and which identifies entries that are not occupied by a VC scheduled for a transmission. The system determines the time slot in the AST that would allow the VC to be transmitted at its ACR.

Abstract: Data are transmitted between communications subscribers over a communications network, in particular a packet-oriented network such as the Internet. On recognizing that the bandwidth of the connection is not sufficient for a given transmission, a user may temporarily use an alternate path while using a network access. In addition, a flexible method of charging for the alternate path is possible, which method is controlled independently of the charging procedure for the first data path.

Abstract: An improved data access arrangement device for use in full-duplex two-wire communication systems having a transmission impedance characteristic. The DAA includes a transmit amplifier and a receive amplifier adapted for connection to a two-wire line, a codec connected to the transmit amplifier for generating a transmit signal, a summation device connected to the receive amplifier, an echo cancellation path including a variable gain amplifier, where the path extends between the codec and the summation device, and wherein the variable gain amplifier is adjusted in accordance with the transmission impedance characteristic. The variable gain amplifier may include a gain register that is programmed by a microprocessor, or may have the gain set by user-configurable switches. The summation device is preferably an operational amplifier.

Abstract: An apparatus and method for encapsulating and forwarding packets on a network are disclosed. The network can include a first subnetwork such as a virtual private network connected to a larger public network such as the Internet. An encapsulating header is attached to a packet to be transferred across the public network from a source node on the private network to a destination node on the private network, such that the packet can be transferred across the public network. The encapsulating header includes a value which is derived from the private header on the packet used to transfer the packet along the private network. The value is therefore associated with a source/destination pair within the private network. The value can be derived by performing a hash operation on the private network header. After the public network header containing the value derived from the private network header is attached to the packet, it can be forwarded across the public network.

Abstract: A method and a system for managing a TCAM table are disclosed. A new route is inserted into the TCAM table at an available location using an index. The new route is added into a Patricia tree organized by a mask length associated with the new route. Routes having common prefixes with the new route are searched for in Patricia trees organized by longer mask lengths and in Patricia trees organized by shorter mask lengths to locate a chain for the new route. The chain for the new route groups routes having common prefixes. The routes in the chain are sequenced in an order of longer prefix first such that a route at a top of the chain has a longest prefix. A swap of routes in the chain is performed to accommodate the new route and to maintain the longer prefix first order.