Abstract: A data optimization engine for deoptimizing selected frames of a first stream of data, comprising a receive interface circuit coupled to an optimization processor. The receive interface circuit is configured for receiving the first stream of data. The receive interface circuit includes a traffic controller circuit for separating frames in the first stream of data into a first deoptimizable frame and a first non-deoptimizable frame, and a deoptimization front-end circuit coupled to the traffic controller circuit to receive at least a first portion of the first deoptimizable frame.

Abstract: A resource management system for an intelligent communications network having one or more distributed service nodes, each service node for providing services relating to an event received at a network resource associated with a service node. The system comprising a first processing tier comprising one or more local execution environments located at a node, each execution environment including a mechanism for instantiating one or more service objects capable of performing event services at a first local execution environment, and, for generating status information relating to executing service objects; and, a second processing tier associated with a service node and including a system processor for tracking status and availability of service objects and local execution environments.

Abstract: The method provides power control in transmitting a downlink signal of frame data in a wireless network. Each frame is composed of timeslots, with each timeslot being further composed of quarter symbols. The method includes mapping each quarter symbol to an offset within a frame attenuation buffer, and computing a template for the frame, each step being performed only once. The template is used for filling the attenuation buffer with attenuation values to attenuate the transmit power for the downlink signal. Attenuation values are provided for each quarter symbol in a frame, although a computation is not required for each quarter symbol. The attenuation values are grouped in blocks that are recursively copied into the frame attenuation buffer based on the template. The contents of a filled attenuation buffer are output for use in attenuating the transmit power of the frame.

Abstract: Method and apparatus for a distributed switching system supporting a plurality of services. A service request is initiated by an initiating customer. The service request is then executed using, for example, a user-to-network interface setup. A terminating setup is then performed to either accept or reject the requested service. Multiple service requests are correlated with respective services to enable at least one appropriate policy and logic.

Abstract: The present invention relates to switching in electronic networks. Many data transmission protocols and technologies used in such networks, such as TCP/IP and Ethernet, use variable-length packets for transmission. Often however, the nodes that make up these networks typically contain high-speed cell switches that only support fixed-size data units. To support variable-length packets in such a fixed-size cell switch non-interleaving switching and transmission must be offered. The present invention provides such a solution in essence by segmenting a variable-length frame into a plurality of fixed-length cells including a start-of-frame cell, one or more continuation cell(s), and an end-of-frame cell and routes said fixed-length cells through said switch, thereby providing, at an output of said switch, subsequent and deadlock-free transmission of consecutive cells of a certain frame, and block any cell of a different frame from interleaving.

Abstract: The present invention provides a method for prioritizing packet flows within a switching network. The method includes the steps of receiving packets at an input port, stamping the packets with an arrival time, and classifying the packet into a flow, wherein the flow is determined based upon at least a class of service of the packet, assigning the packet to a queuing ring according to the flow of the packet, and maintaining a flow ratio pending within the switch based upon the classification of the packet.

Abstract: For a network server (35) communicating with a wireless unit (10) via a Session Initiation Protocol, a retransmission method (50) first sets a timer based upon a time likely for a mobile unit to respond (54). Then the network server waits for a response (56). When the timer set for the kind of mobile unit being used expires (64), a retransmit of the original SIP request takes place (68). Optionally, modes for waiting may include a linear mode (72) and an exponential mode (74).

Abstract: A system and method have been provided for hierarchically arbitrating in a broadband information switching network. The method promotes the fair and efficient distribution of information packets across the switch fabric that ultimately permits the switch to maximally match information packets to switch output addresses, at faster rates and higher throughput.

Abstract: A data transmission method in which a transmission request is forwarded from a host apparatus to a terminal apparatus. When receiving the transmission request, the terminal apparatus forwards as communication request to the host apparatus. In this communication request, a timer value of a system timer included in the terminal apparatus is incorporated. Having received the communication request including the timer value, the host apparatus establishes an ID for the terminal apparatus according to the timer value. Then, the host apparatus conducts polling for collecting data from the terminal apparatus using the established ID.

Abstract: There is provided a PTS (Partial Transmit Sequence) OFDM (Orthogonal Frequency Division Multiplexing) scheme for reduction of a PAPR (Peak-to-Average Power Ratio). In an OFDM transmitting apparatus for peak power reduction according to the present invention, an rotational sub-block partitioner partitions an input data block of length N into M, the number of sub-block, and distributes the partitioned data of each data block in M sub-blocks one by one rotationally. M IFFTs (Inverse Fast Fourier Transformers) perform N/M-point IFFT on N/M data assigned to each of the M sub-blocks and M coefficient multipliers multiply the N/M data output from each IFFT by a predetermined coefficient to give orthogonality to the frequency components of the N/M output data. A phase factor optimizer optimizes M phase factors to minimize a PAPR using the N/M output values of each coefficient multiplier. M multipliers multiply the optimized M phase factors by the outputs of the coefficient multipliers.

Abstract: An apparatus and corresponding method for preventing data loss in network devices is disclosed. The present invention monitors an incoming data stream to a network device, or devices, and in the event that an error condition is detected, predetermined error data is inserted into the data stream, wherein the predetermined error data is provided at the same data rate as the recovered data rate internal to the network device. Thus, the network device will not have to adjust to a different data rate and potentially lose data during the adjustment period.

Abstract: A fast on-line data flow allocation method efficiently determines the allocation of data flow among data paths, particularly when a parameter that influences data flow allocation is changed dynamically. In an illustrative embodiment, at least one commodity flow sample point is determined and a continuous boundary is constructed through the sample points. The continuous boundary (characterized as Maximum Flow Frontier) can be constructed off-line and may be used to determine new data flow allocations when a data flow allocation parameter changes. By developing a continuous boundary data flow, allocation parameters can be determined using a limited number of sample points. This can reduce the allocation complexity, and permit efficient data flow allocation.

Abstract: A packet routing/switching system and method are provided by which label switched routing is performed within a hierarchy of LSP/FA-LSPs defined/provisioned in a network of interconnected nodes. Rather than transmitting an entire label stack with an LSP label for each LSP/FA-LSP in the hierarchy, at a given node in the network, a single LSP label is transmitted together with a components label which contains a list of component identifiers which do not inherently identify LSP/FA-LSPs, but from which the full LSP/FA-LSP labels can be determined locally at each node using previously distributed information described in detail below. The list of component identifiers is a shorthand way identifying to adjacent nodes the identity of the LSP/FA-LSP hierarchy without transmitting the entire LSP labels and thus significantly reducing overhead. The single label which is transmitted is the label of the LSP/FA-LSP of which the given node forms a part.