Abstract: In a 3G CDMA2000 network, permanent virtual pipes of different data rates (153.6 kbps, 76.8 kbps, 38.4 kbps and 19.2 kbps, for example) are provisioned at a base station on the Forward Supplemental Channel (F-SCH) for the transmission of data bursts to requesting mobile terminals by allocating and grouping together a set of resources (i.e., contiguous Walsh codes, contiguous ASIC real estate, etc.). Data bursts arriving from the network are scheduled onto timeslots on all the pipes in a manner such that at least one burst segment of each active burst is scheduled into a timeslot on the highest data rate pipe. The other burst segments of a burst are scheduled onto all the pipes so they migrate through the various rate pipes in order to give all bursts opportunities on the higher rate pipes.

Abstract: A wireless communication system (20) includes a base station (22) that is capable of communicating with a plurality of intermediate cells (24, 60). Each intermediate cell (24, 60) directly communicates with a plurality of end users (26, 64). Communications from an end user (26, 64) may be routed through the intermediate cell to a wireless network (30) associated with the base station (22) or directly to another intermediate cell in a disclosed example. The intermediate cells communicate with the base station on behalf of the end users such that the wireless network recognizes the intermediate cell as a single user and, in one example, assigns temporary listed directory numbers to each of the end users associated with each intermediate cell so that communications from each end user may be handled individually.

Abstract: Techniques are described herein for synchronizing cluster time. According to one technique, a master node is appointed in a cluster. Other “slave” nodes periodically synchronize their clocks with the master node. To synchronize its clock with the master node, a slave node sends a timestamped message to the master node, which also timestamps the message and sends the message back to the slave node, which then timestamps the message again. Based on the timestamps, the slave node is able to determine the difference between the master node's clock's time and slave node's clock's time, compensating for the message travel time between master node and slave node. Depending on various circumstances, and based on the determined difference, the slave node adjusts its clock so that the time indicated by the slave node's clock at least begins to approach more closely the time indicated by the master node's clock.

Abstract: Synchronizing cluster time is described. Times of one or more nodes in the cluster to a master node of the cluster are synchronized. It is discovered that a node of a cluster has a clock time that is ahead of a master clock time of the master node. In response to discovering the node with the clock time ahead of the master clock time, the master node is replaced with the node ahead thereof in time, which thus becomes a new master node. The clock times of the cluster nodes are synchronized with the clock time of the new master node.

Abstract: Techniques are described herein for synchronizing cluster time. According to one technique, a master node is appointed in a cluster. Other “slave” nodes periodically synchronize their clocks with the master node. To synchronize its clock with the master node, a slave node sends a timestamped message to the master node, which also timestamps the message and sends the message back to the slave node, which then timestamps the message again. Based on the timestamps, the slave node is able to determine the difference between the master node's clock's time and slave node's clock's time, compensating for the message travel time between master node and slave node. Depending on various circumstances, and based on the determined difference, the slave node adjusts its clock so that the time indicated by the slave node's clock at least begins to approach more closely the time indicated by the master node's clock.

Abstract: A computer implemented CPU utilization prediction technique is provided. CPU utilization prediction is implemented described in continuous time as an auto-regressive process of the first order. The technique used the inherent autocorrelation between successive CPU measurements. A specific auto-regression equation for predicting CPU utilization is provided. CPU utilization prediction is used in a computer cluster environment. In an implementation, CPU utilization percentage values are used by a scheduler service to manage workload or the distribution of requests over a vast number of CPUs.

Abstract: Selecting a master node in a multi-node computer system is described. Each node of the multi-node computer system selects a timeout value (e.g., randomly). Each node starts a timer, which is set to expire at the selected timeout value of its corresponding node. The node with the timer that expires earliest broadcasts an election message to the other nodes of the multi-node computer system, which informs the other nodes that the broadcasting node is a candidate for mastership over the multi-node computer system. The other nodes respond to the election message upon receiving it. In the absence of a refusal message from one or more of the other nodes, the candidate is established as master node in the multi-node computer system and wherein the other nodes function as slave nodes therein.

Abstract: Synchronizing cluster time is described. Times of one or more nodes in the cluster to a master node of the cluster are synchronized. It is discovered that a node of a cluster has a clock time that is ahead of a master clock time of the master node. In response to discovering the node with the clock time ahead of the master clock time, the master node is replaced with the node ahead thereof in time, which thus becomes a new master node. The clock times of the cluster nodes are synchronized with the clock time of the new master node.

Abstract: A method for delivering certain types of user information over a communication system is provided. Users identify certain user signals that can be transmitted in non-real time, and transmit such signals over signaling channels of the communication system. The system receives and stores these non-real time signals and transmits them over available traffic channels to their destinations at some later time. The user or the communication system defines when such non real time signals are to be transmitted over the traffic channels to their destinations. In this manner, the probability of real time signals and user identified non real time signals competing for traffic channels or other resources of the system is greatly reduced thus allowing the communication system to maintain or even increase its capacity.

Abstract: A wireless communication system (20) includes a base station (22) that is capable of communicating with a plurality of intermediate cells (24, 60). Each intermediate cell (24, 60) directly communicates with a plurality of end users (26, 64). Communications from an end user (26, 64) may be routed through the intermediate cell to a wireless network (30) associated with the base station (22) or directly to another intermediate cell in a disclosed example. The intermediate cells communicate with the base station on behalf of the end users such that the wireless network recognizes the intermediate cell as a single user and, in one example, assigns temporary listed directory numbers to each of the end users associated with each intermediate cell so that communications from each end user may be handled individually.

Abstract: In response to the triggering of a user's mobile terminal, such as through pushing a dedicated button, by inputting a predetermined sequence of digits, through a menu selection, or automatically in response to an external input, a digital record containing user-specific information that is stored in the mobile terminal is packetized and transmitted over a signaling channel through the public wireless network, where the one or more packets are marked as being emergency 911 (E911) packets. From the header information in these packets, a Mobile Switching Center (MSC) in the wireless network, recognizes these E911 packets as being destined to that MSC's nearest Public Safety Answering Point (PSAP), and transmits the information contained in those packets to that PSAP.

Abstract: In a 3G CDMA2000 network, permanent virtual pipes of different data rates (153.6 kbps, 76.8 kbps, 38.4 kbps and 19.2 kbps, for example) are provisioned at a base station on the Forward Supplemental Channel (F-SCH) for the transmission of data bursts to requesting mobile terminals by allocating and grouping together a set of resources (i.e., contiguous Walsh codes, contiguous ASIC real estate, etc.). Data bursts arriving from the network are scheduled onto timeslots on all the pipes in a manner such that at least one burst segment of each active burst is scheduled into a timeslot on the highest data rate pipe. The other burst segments of a burst are scheduled onto all the pipes so they migrate through the various rate pipes in order to give all bursts opportunities on the higher rate pipes.

Abstract: In response to the triggering of a user's mobile terminal, such as through pushing a dedicated button, by inputting a predetermined sequence of digits, through a menu selection, or automatically in response to an external input, a digital record containing user-specific information that is stored in the mobile terminal is packetized and transmitted over a signaling channel through the public wireless network, where the one or more packets are marked as being emergency 911 (E911) packets. From the header information in these packets, a Mobile Switching Center (MSC) in the wireless network, recognizes these E911 packets as being destined to that MSC's nearest Public Safety Answering Point (PSAP), and transmits the information contained in those packets to that PSAP.

Abstract: A method for delivering certain types of user information over a communication system is provided. Users identify certain user signals that can be transmitted in non-real time, and transmit such signals over signaling channels of the communication system. The system receives and stores these non-real time signals and transmits them over available traffic channels to their destinations at some later time. The user or the communication system defines when such non real time signals are to be transmitted over the traffic channels to their destinations. In this manner, the probability of real time signals and user identified non real time signals competing for traffic channels or other resources of the system is greatly reduced thus allowing the communication system to maintain or even increase its capacity.

Abstract: The present invention provides a bi-directional vehicle communication network which has the ability for record management and collection, including updating registration, insurance, inspection and/or maintenance records, as well as for collecting for the transaction fee or cost thereof. Additionally, the present vehicle communication network readily affords the ability of ticketing drivers for traffic violations. Importantly, vehicles are equipped with an electronic tag containing records associated therewith. In response to radio frequency signals from a portable interrogator, vehicular records may be selectively retrieved from the electronic tag. Updated records are then transmitted to the electronic tag for storage. Similarly, those updated records may be also transmitted to a centralized control center for archival purposes, as well as for effecting collection.