Abstract: The invention relates to a method for reducing the power consumption of a mobile station (2) connected to a packet-switched network (4), in which packet-switched network information is sent in the form of data frames. In the method, a paging period is specified for the mobile station for sending paging messages (UD1) essentially at the intervals of said paging period to the mobile station, the mobile station (2) is set to the standby mode at least for the time of the reception of the paging messages (UD1), and the mobile station, which is in the standby mode, is set to the idle mode after the reception of the paging message (UD1). In the idle mode, some of the functions of the mobile station (2) are set to the power saving mode or switched off.

Abstract: Data packets are selected for simultaneous transmission to multiple users using a transmitter with limited transmission power by first establishing transmission power requirements for each user, receiving in a queue a plurality of data packets for transmission to one or more users, and selecting one or more data packets for transmission in a composite burst with cumulative power for the selective packets not exceeding the limited transmission power. Data packets are selected for sequential composite bursts until all data packets in the queue have been transmitted, at which time transmission ceases until more incoming packets arrive at the queue. In selecting data packets for transmission, data packets which have previously been delayed in transmission can be given priority as well as priority based on quality of service subscribed by each user. Additionally a predetermined priority weight can be assigned to data packets and used for selection.

Abstract: A method and apparatus for adaptively obtaining bandwidth requests in a broadband wireless communication system. The method and apparatus includes dynamically varying technique combinations enabling a plurality of users to efficiently request bandwidth from a shared base station. A user may “piggyback” a new bandwidth request upon, or set a “poll-me bit” within, presently allocated bandwidth. A base station may poll users, individually or in groups, by allocating unrequested bandwidth for new requests. Polling may respond to a “poll-me bit,” and/or it may be adaptively periodic at a rate based on communication status parameters, such as recent communication activity and connection QoS levels. Group polling permits a possibility of collisions. Polling policies may be established for dynamically varying user groups, or may be determined for each user. Dynamic selection of appropriate polling techniques makes use of efficiency benefits associated with each technique.

Abstract: The scheduling of data transmissions for a CDMA system downlink or other type of communication network is implemented on a dynamic basis using a revenue-based policy. For a given transmission slot or other transmission interval, a maximum-rate user is identified from among a set of users requesting data transmissions, and a data transmission of the maximum-rate user is scheduled for the given interval. The maximum-rate user is identified based on application of coefficients of a revenue vector to corresponding feasible rates of the requesting users. The revenue vector is determined in an iterative manner using an adaptive algorithm which updates the revenue vector periodically to compensate for observed deviations between actual and target throughput, such that the deviations are reduced over time and the revenue vector converges to an optimal revenue vector.

Abstract: A Pipelined-based Maximal-sized Matching (PMM) scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration may operate in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic.

Abstract: The communication system comprising a dedicated processing system, a call processing system, and an interworking system. The dedicated processing system is configured to generate and transfer a first call setup message. The call processing system is configured to receive and process the first call setup message to select a first identifier, generate and transfer a first instruction indicating the first identifier and a dedicated communication, receive and process a second call setup message to select a second identifier, and generate and transfer a second instruction indicating the second identifier and a switched communication. The interworking system is configured to receive the first instruction, the second instruction, and a bundled communication including the dedicated communication and the switched communication.

Abstract: A system controlling use of a communication channel in a communication network. The system comprising a network including service nodes. The service nodes comprising one or more sets having one or more nodes adapted to provide service functions in response to messages in the network. At least one of the sets comprising a member node having an interface for communication with a remote terminal, and a user interface process coupled with the interface to include a user of the remote terminal in the network. At least one of the sets comprising a member node having an interface to the communication network, and a process coupled to the interface to control establishment of the communication channel for the user.

Abstract: A TCP Offload Engine (TOE) device includes a state machine that performs TCP/IP protocol processing operations in parallel. In a first aspect, the state machine includes a first memory, a second memory, and combinatorial logic. The first memory stores and simultaneously outputs multiple TCP state variables. The second memory stores and simultaneously outputs multiple header values. In contrast to a sequential processor technique, the combinatorial logic generates a flush detect signal from the TCP state variables and header values without performing sequential processor instructions or sequential memory accesses. In a second aspect, a TOE includes a state machine that performs an update of multiple TCP state variables in a TCB buffer all simultaneously, thereby avoiding multiple sequential writes to the TCB buffer memory. In a third aspect, a TOE involves a state machine that sets up a DMA move in a single state machine clock cycle.

Abstract: Methods for acquiring service for a wireless terminal can include the steps of camping on a control channel and receiving a request for an operation to be performed by the wireless terminal that is performed by the wireless terminal mutually exclusive of camping on the control channel. Control channel information associated with the control channel on which the wireless terminal was camped is stored and the requested operation is performed. The stored control channel information is used to acquire service for the wireless terminal. Related wireless terminals and systems are disclosed.

Abstract: Uplinked and downlinked transmissions in an interference-limited system, such as a cellular network, are prioritized and authorized by channel quality/data rate to minimize interference.

Abstract: In a technique for priority forwarding, an upper layer protocol that requires priority forwarding includes a priority function that is invoked by a lower layer protocol in order to obtain the priority for a message. The upper layer protocol provides the priority function to the lower layer protocol when the upper layer protocol is installed in the protocol stack. The lower layer protocol invokes the priority function before passing a message to the upper layer protocol in order to determine a priority for the message. The lower layer protocol places the message in the appropriate queue based upon the priority indicator obtained from the upper layer protocol's priority function.

Abstract: Label switched paths are installed in a label switched communications packet network. Paths are selected by defining and installing partial routes each having two or more paths such that an end-to-end route across the network can be defined as the concatenation of two partial routes. Signalling to select a path is effected by sending a path message from an end point to a first virtual router, determining a path from the end point to the virtual router, and forwarding an identity of the path to a second virtual router. The second virtual router determines a routing vector across the network, and returns information identifying the routing vector to the first virtual router.

Abstract: A communications bus (300) includes a number of alternate transmission paths (311, 312) between a given source node (301) and respective destination node (305) on a common substrate. The source node (301) receives a signal from a first circuit (309) serviced by the bus (300) while the respective destination node (305) transfers that signal to a second circuit (310) serviced by the bus. The communications bus (300) includes two switching arrangements for switching between the alternate transmission paths (311, 312). A source switching arrangement (318) is interposed between the source node (301) and the respective alternate transmission path (311, 312). This source switching arrangement (318) selectively connects the respective source node (301) to a selected one of the alternate transmission paths (311, 312) and disconnects the source node (301) from each other alternate transmission path.

Abstract: The synchronization signal generating section generates a packet synchronization signal PSYNC such that it is synchronized with the cycle of packets received from the master device. The interface control section generates a transfer clock PCMCLK used in transferring the data in the packets, from the internal clock. The interface control section measures the cycle of the packet synchronization signal PSYNC, and if the actual cycle of PSYNC is longer than the designated value, it makes the cycle of the transfer clock corresponding to the last data element in the packet longer than the cycle of the transfer clock corresponding to the other data elements, whereas if the actual cycle of PSYNC is shorter than the designated value, it makes the cycle of the transfer clock corresponding to the last data element in the packet shorter than the cycle of the transfer clock corresponding to the other data elements.

Abstract: A spot beam hopping packet scheduler system performs efficient switching over links such as hopped spot beams which compete with each other for physical properties and resources. The spot beam hopping packet scheduler system provides statistical weighting and prioritization capabilities while accommodating resource competing links such as wireless hopped spot beams. The spot beam hopping packet scheduler system receives downlink cell ID and packet burst memory pointers from a burst assembly/congestion controller and provides packet burst information to antenna controller and modulators. The spot beam hopping packet scheduler system includes a downlink queue that is coupled to the burst assembly/congestion controller and receives the downlink cell ID and packet burst memory pointers. A cache is coupled to the downlink queue and receives and stores data from the downlink queue.

Abstract: A packet communication charge pre-notification system includes a mobile station, a packet communication network containing a mobile communication network connected to the mobile station by radio, and a terminal connected to the mobile station via the packet communication network. The mobile station has a control unit, counting unit, and display unit. The control unit forms packet data from digital data and transmits the packet data to the terminal via the packet communication network in accordance with transmission permission from the user. The counting unit counts the formed packet data before transmission. The display unit displays a communication charge calculated on the basis of the counting result of the counting unit before the packet data is transmitted.

Abstract: A scheme is described for distributing data operations on an irregular data stream over multiple stages of a data aligner to generate a regular data stream having continuous filled byte positions. In one particular embodiment, data alignment may involve the prediction of a rotation amount for unaligned data bytes. The rotation amount is predicted one clock cycle before actual rotation of data bytes based on the current contents of a buffer. The one cycle look ahead enables a large portion of calculations to be performed in a previous clock cycle and, thereby, may facilitate a high frequency design for a data aligner.

Abstract: A network switch, configured for performing layer 2 and layer 3 switching in an Ethernet (IEEE 802.3) network without blocking of incoming data packets, includes a network switch port having a filter (i.e., a packet classifier module) configured for evaluating an incoming data packet on an instantaneous basis, immediately upon receipt at the network switch port. The filter performs simultaneous comparisons between the incoming data stream of the data packet and multiple templates configured for identifying respective data protocols. Each template is composed of a plurality of min terms, wherein each min term specifies a prescribed comparison operation within a selected data byte of the incoming data packet. The templates may be programmed by a user and stored in an internal min term memory. Moreover, the multiple simultaneous comparisons enable the network switch to perform layer 3 switching for 100 Mbps and gigabit networks without blocking in the network switch.

Abstract: A demultiplexer for separating different format packets from a multiplexed data stream. Each packet format has a different type of header which is analyzed based on micro-codes read out in sequence from a command memory. By using micro-codes, the demultiplexer minimizes the circuitry required to process multiple formats (e.g. digital video broadcasting (DVB), digital satellite system (DSS), and digital versatile disc (DVD)). The packets are separated and sent to their respective destinations based on the packet ID read from each header.

Abstract: The present invention discloses a data transmission apparatus and method for transmitting data between physical layer side device and network layer device, which encapsulating a novel LAPS framing-de-framing into SPE/VC of a HDLC-like frame using a variable SAPI value. The LAPS encapsulation consists of the start Flag Sequence, address field (SAPI, Service Access Point Identifier), control field (0x03), Information field (Ipv4, Ipv6, or PPP protocol data unit), FCS (Frame check sequence) and the ending Flag Sequence, or consists of the start Flag, Address field, Control field, SAPI field (two octets), Information field, FCS field and the ending Flag Sequence. The Flag Sequence (0x7E) identifies the beginning/end of a LAPS frame. The present invention can be used to adapt Internet/Intranet to telecommunication infrastructure, and can be applied to network devices such as core and edge routers, switch devices, IP based network accessing equipment, line cards, and interfacing units used in high speed, e.g.