Abstract: A header conversion device allowing reduced amount of hardware and memory and high-speed line switching is disclosed. In an ATM switching device having redundant incoming line systems, a header conversion table stores a set of header conversion information for one of the redundant incoming line systems. A header converter converts the header of an ATM cell received from each of the redundant incoming line systems by referring the same set of header conversion information.

Abstract: A VPN edge router with the ability of identifying VPNs by using the identifiers of logical channels multiplexed on a single input line.

Abstract: A communication device for interconnection of first and second networks, of which at least the first network is a bidirectional ring network, includes first and second interconnect modules, each such module adapted to receive outgoing data traffic on the first network at a data rate not substantially greater than a predetermined maximum rate for one of the ring directions, and to convey the outgoing data traffic to the second network. When a fault occurs in one of the first and second modules, the other module is reconfigured to receive substantially all of the outgoing data traffic and to convey the outgoing data traffic to the second network regardless of whether the outgoing data traffic is transmitted on the first network in the clockwise or in the counterclockwise direction.

Abstract: A method and system to arbitrate between a plurality of resource requests are disclosed. In each arbitration within a current round of arbitration, a winning request is identified based on a priority associated with each requester participating in the arbitration and a set of values stored in a mask register. In response to identifying the winning request, a mask register value corresponding to a requestor of the winning request is updated to disqualify this requestor from further participation in the current round of arbitration. When the current round of arbitration completes, the set of values in the mask register is reset to allow each requestor to participate in the next round of arbitration. The current round of arbitration begins when each requester is qualified to participate in the current round of arbitration and completes when every participating requestor has been disqualified.

Abstract: A wireless network includes a radio network controller and a plurality of terminals which are provided for transmitting useful data over logic channels which have different priorities, which are mapped onto exactly one transport channel, respectively. The data transmission over a plurality of combined (multiplexed) transport channels is determined by transport format combinations. The respective most favorable transport format combination is selected at the beginning of a radio frame, given the packet data units waiting in the buffers of the logic channels. Further, the logic channels are sorted while their priorities, their buffer occupancy and the transmission time interval of the associated transport channel are taken into account.

Abstract: A telecommunications system includes devices to provide output clock signals that are synchronous to at least one source clock signal. A main clock generator includes a selector to select one of the output clock signals. The main clock generator generates a main clock signal based on a selected one of the output clock signals. Each of the devices includes a quality detector (i) to detect a quality of the at least one source clock signal, and (ii) to interrupt providing an output clock signal in response to a decrease in quality of the at least one source clock signal. The main clock generator includes an interrupt detector to detect an interruption in an output clock signal provided by at least one of the devices. The selector selects a different output clock signal if the interrupt detector detects that the selected one of the output clock signals is interrupted.

Abstract: Novel data transmission method and apparatus in a communication system require novel method and apparatus for power control and rate of data determination, which are disclosed.

Abstract: There is disclosed a masking unit (REQMSK) for use in a data packet switching system. The data switching system being of the type having a memoryless cross-back switch (SM) providing cyclic connections under the control of a switch arbiter (SCARB) between ingress routers (IR0, IR1, IR2 and IR3) and egress routers (ER0, ER1, ER2 and ER3). Each of the ingress routers (IR0–IR3) is provided with incoming packet buffering on a virtual output queue basis (VOQ0.0, VOQ0.1, VOQ0.2, and VOQ0.3 for ingress router IR0). Each virtual output queue also produces a connection request signal REQ0.0 to REQ3.3 when the corresponding queue has a data packet in it. The masking unit REQMSK is arranged to randomly mask out correlated connection requests.

Abstract: In an information transmission method, a radio communications system, a base station and a mobile station, a TBS size, a modulation scheme and the number of codes in a multicode are converted into identification data having a relatively smaller data size before being transmitted to a destination of communication. The TBS size is identified by using, in combination, an identification code identifying a channelization code set, an identification code identifying a modulation scheme, and an identification code obtained by converting a combination of the number of codes in a multicode and a modulation pattern identification (TFRC) into a corresponding code. Accordingly, the data size for TBS size identification is reduced.

Abstract: The disclosure relates to a network router characterized in that it includes at least one generic router able to execute routings between inputs (I1, I2, I3, . . . ) and outputs (O1, O2, O3, . . . ), a configuration file including the parameters of a given set of routings between said inputs and outputs, and a routing table, a subset of routings (R1, R2, . . . ) being loaded from said configuration file into said routing table by said generic router to enable this router to execute the routings between said inputs and outputs according to the configuration defined in said routing table. The invention is notably applicable to the processing air traffic management data.

Abstract: A method and system utilizing a multi-level expedited forwarding per hop behavior (MLEF PHB) which manages buffer space to provide priority to calls based on a predefined priority scheme. The MLEF PHB defines a set of configurable parameters that define how much buffer space is available to each class or level of voice call. The MLEF PHB may optionally be implemented as programming statements in the SIP User Agent, SIP Proxy, and kernel of a LINUX-based PC router. The MLEF PHB applies an algorithm for dropping packets exceeding a caller precedence level-specific buffer capacity, which variable buffer capacity is determined by the particular DSCP (and the particular MLEF PHB to which it relates).

Abstract: Apparatus, and an associated method, for facilitating communications in a radio communication system that utilizes shared, packet channels. One or more common control channels are defined upon a forward link extending between a network part of the radio communication system and the mobile stations thereof. Assignment information sets so generated by an assignment information generator and formatted into data frames for communication to the mobile stations. The mobile stations monitor a single shared packet control channel to receive the assignment information sent thereto upon the common shared channel.

Abstract: Interference mitigation or collision avoidance systems and procedures to allow different wireless local area network (WLAN) communication protocols to co-exist in the same frequency band, such as an unlicensed frequency band used for short-range wireless communications. The procedures ensure substantial throughput of information carried by signals of each WLAN protocol while preventing collisions between signals of different protocols.

Abstract: A technique for reliably multicasting a message within a router network is provided. At least one special router in the network has associated persistent storage for logging a message being routed to one or more clients. When a message is received at this logger node, the logger places the message in persistent storage and sends a logging acknowledgment back to those routers to which the message was originally routed, as well as back towards the source of the message. The logger acknowledgment includes the message id, the logger id, and a logging number. When the logger acknowledgment is received by a router, it looks up the routing information from the original message, and sends the acknowledgment to those neighboring routers to which the original message was sent, excluding the link from which the logger acknowledgment was received. If the original message corresponding to the logger acknowledgment was buffered at this router waiting to be delivered, the message is then delivered to its client nodes.

Abstract: A communication control device includes a determination circuit for determining whether reception of an asynchronous packet from an IEEE 1394 serial bus is allowed or denied by comparing the sum of the size of the asynchronous packet to be received and the size of packets currently stored in a receive FIFO unit with the size of packets which can be stored in the receive FIFO unit. The communication control device further includes an acknowledge generating circuit for generating an acknowledge signal asserting whether reception of the asynchronous packet is allowed or denied based on the determination result of the determination circuit, and the generated acknowledge signal is sent back to the IEEE 1394 serial bus.

Abstract: Traffic information is accumulated and flow control information distributed in a packet switching system. Traffic information is collected in multiple elements, which forward in a coordinated fashion to collecting elements indications of congestion and other types of information. The collecting elements manipulate the received indications and generate flow control messages which are sent to individual sending components of the packet switching system. In one implementation, a switching element maintains for each destination a count of packets within itself which are addressed to the particular destination. An indication of a portion of this collected information is included in a packet header forwarded from each of the elements each packet time. Each of the elements are assigned a different offset, such that they send an indication of a different portion of their collected information, so a view of the traffic conditions and/or buffer occupancies within a packet switching system is efficiently produced.

Abstract: A method for managing an asynchronous transfer mode (ATM) cell includes transmitting an ATM cell from a server system to a broadband modem. The ATM cell is forwarded from the broadband modem to a client system.

Abstract: A method for control of packet data transmissions in a TDMA wireless network to provide for additional choices in the allocation of communication channels. The fixed relationship in the timing of the downlink allocation signalling and subsequent uplink transmission is altered for certain classes of mobile station to avoid physical constraints. Examples of variations in USF signalling in GPRS are given.

Abstract: A system and method of providing distributed election of a shared transmission schedule within an ad hoc network. The invention includes a collision-free access protocol which resolves channel access contentions for time division multiple access (TDMA) of a single channel. Time-slots are organized into part numbers, which are included within sections, a sequence of which define a block. Each node is given a ring number according to its location within the network topology and maintains local neighbor information along with its own part number and message digest. Collision-free channel access is automatically scheduled and repetitious contention phases are resolved by a random permutation algorithm operating in message digests. An empty time-slot utilization method is also described and data packets may also be transmitted subject to a non-zero collision probability within a blind section of the block.

Abstract: Multiuser methods of detecting CDMA-coded signals cannot be used in practice because of their high computational complexity. However, the RAKE receiver, which is simple in computing terms, offers greatly inferior detection results. Through an iterative approximation of multiuser solutions, a reduction in computing complexity is achieved in comparison with traditional multiuser methods. A first estimate of coded data is improved by iteration either until a quality criterion is met or until no more computing time is available. The field of application of this method includes, in particular, situations where CDMA-coded signals transmitted linearly are to be detected, in particular in the mobile wireless field when using CDMA methods.