Showing papers on "Paging published in 1997"

Application-controlled demand paging for out-of-core visualization

Abstract: In the area of scientific visualization, input data sets are often very large. In visualization of computational fluid dynamics (CFD) in particular, input data sets today can surpass 100 Gbytes, and are expected to scale with the ability of supercomputers to generate them. Some visualization tools already partition large data sets into segments, and load appropriate segments as they are needed. However, this does not remove the problem for two reasons: 1) there are data sets for which even the individual segments are too large for the largest graphics workstations, 2) many practitioners do not have access to workstations with the memory capacity required to load even a segment, especially since the state-of-the-art visualization tools tend to be developed by researchers with much more powerful machines. When the size of the data that must be accessed is larger than the size of memory, some form of virtual memory is simply required. This may be by segmentation, paging, or by paged segments. The authors demonstrate that complete reliance on operating system virtual memory for out-of-core visualization leads to egregious performance. They then describe a paged segment system that they have implemented, and explore the principles of memory management that can be employed by the application for out-of-core visualization. They show that application control over some of these can significantly improve performance. They show that sparse traversal can be exploited by loading only those data actually required.

Filtering computer network messages directed to a user's e-mail box based on user defined filters, and forwarding a filtered message to the user's receiver

Abstract: A message processing and forwarding system for processing electronic messages in a digital format received over a computer communication path or network, and forwarded over a telephone circuit switched network to a user's receiver, such as a pager. A content processor in a message server processes the received digital message in accordance with knowledge of the receiver's capabilities and user-configured message filtering information to create a customized second message suitable for handling by the user's receiver at a remote physical location. Also, the system defines a distributed architecture for global paging, including multiple redundancy, to yield a robust system. In a preferred embodiment, the original digital message is part of an e-mail message received and forwarded through a conventional computer communication network such as the Internet.

Flexible object notification

Abstract: Alternative notification methods for a portable wireless receiver that is able to receive paging objects (i.e., data objects) in addition to conventional alphanumeric page messages. When a paging object is received, the user may be notified of the receipt of the paging object using a visual alert or an audible alert. The user can selectively determine whether the sender of the page object will be allowed to determine the type of audible and/or visual notification provided the user. Various parameters associated with each type of directory in which page objects are stored and with the page objects indicate the preferences of the user and the sender for notifying the user of the receipt of the page object. The invention is also applicable to other types of portable wireless data receivers, such as a cell phone.

Method for obtaining at least one item of user authentication data

Abstract: A method for obtaining at least one item of user specific data, wherein the user specific data is obtained at least partly by using paging or a short message service.

Power management system for a mobile station

Abstract: A power management system for a mobile station reduces standby mode processing by receiving and processing single time slots of a short paging channel. Each single time slot of a short paging channel includes a mobile station identifier which alerts a receiving mobile station that a pending telephone call or paging message may be directed to the mobile station. Once so alerted, the mobile station receives and processes full paging channels comprising four time slots to determine whether the mobile station is the intended recipient of the telephone call or paging message. If the mobile station determines that it is not the intended recipient, then the mobile station resumes receiving and processing single time slots of the short page channel. Processing fewer time slots of data for purposes of call detection conserves mobile station battery power.

Broadcast short message service architecture

Abstract: In certain wireless communication systems, including at least some CDMA cellular systems, short messages can be delivered to mobile stations in a broadcast fashion using a common forward (downlink) channel sometimes referred to as the Paging Channel. Economy in the use of the Paging Channel can be achieved by using so-called slotted mode reception. In accordance with this mode, the infrastructure directs messages to a given mobile station only during time slots allocated to the particular group of mobile stations to which the given station belongs. These time slots recur according to a paging slot cycle having a specified length (expressed as a number of slots), or slot cycle index. Disclosed here is a further cycle, referred to as the Broadcast Paging Cycle, for use in implementing a service for broadcasting short messages (to many mobile stations). The Broadcast Paging Cycle has an index that is larger than, and incommensurable with, the paging slot cycle index. Any given broadcast message is transmitted only once during each Broadcast Paging Cycle, in a predetermined slot thereof. This predetermined slot will eventually coincide, in a non-preferential manner, with each slot of the paging slot cycle. Consequently, the load on the Paging Channel due to the broadcast service will be averaged uniformly over all paging slots.

Methods and apparatus for communicating data via a cellular mobile radiotelephone system

Abstract: A system for communicating data via a cellular network control channel of a cellular mobile radiotelephone system (CMR). A data message system for communicating data collected from remote data sources includes sets of reporting devices, at least one mobile switching center (MSC) of a CMR system, and a data collection system connected to said MSC via a first communications link. Each recording device monitors a remote data source to obtain selected data and thereafter transmits a data message containing the selected data. The data collection system stores the data messages and processes the selected data. The data message system is equipped to process data messages of varying lengths, through the use of an expandable data message structure. A paging acknowledgment system is also provided for communicating both (1) paging messages and (2) acknowledgment messages to confirm reception of the paging messages. A communications system transmits data messages corresponding to the paging message via a communications link. The data message contains the type of data that is normally supplied with a conventional paging message and an acknowledgment code that uniquely identifies said data message. The communications system confirms reception of the data message by comparing the acknowledgment code of the acknowledgment message to the acknowledgment codes associated with the paging messages. The communications system is equipped to process acknowledgment messages of varying lengths, through the use of an expandable data message structure.

Page replacement with multi-size pages and applications to Web caching

Abstract: . We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We consider two models for the cost of an algorithm on a request sequence. In the first (the FAULT model) the goal is to minimize the number of page faults. In the second (the BIT model) the goal is to minimize the total number of bits that have to be read into the cache. We show offline algorithms for both cost models that obtain approximation factors of O(log k) , where k is the ratio of the size of the cache to the size of the smallest page. We show randomized online algorithms for both cost models that are O(log 2 k) -competitive. In addition, if the input sequence is generated by a known distribution, we show an algorithm for the FAULT model whose expected cost is within a factor of O(log k) of any other online algorithm.

Out-of-core streamline visualization on large unstructured meshes

Abstract: This paper presents an out-of-core approach for interactive streamline construction on large unstructured tetrahedral meshes containing millions of elements. The out-of-core algorithm uses an octree to partition and restructure the raw data into subsets stored into disk files for fast data retrieval. A memory management policy tailored to the streamline calculations is used such that, during the streamline construction, only a very small amount of data are brought into the main memory on demand. By carefully scheduling computation and data fetching, the overhead of reading data from the disk is significantly reduced and good memory performance results. This out-of-core algorithm makes possible interactive streamline visualization of large unstructured-grid data sets on a single mid-range workstation with relatively low main-memory capacity: 5-15 megabytes. We also demonstrate that this approach is much more efficient than relying on virtual memory and operating system's paging algorithms.

Treasure hunt game using pager and paging system

Abstract: A game can be played using pagers and a paging system Game participants receive information and clues from the paging system directing them to a particular landmark or location Once there, the participants signal the system with a response which is dependent on their being at the correct location The paging system then additionally determines that the participant is transmitting from roughly the correct location When the participant is thus verified as being at the correct location, the next clue is transmitted to the participant This continues until a participant correctly deciphers all the clues and arrives at the end of the game

Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code

Abstract: An elementary, machine-independent, recursive algorithm for matrix multiplication C+=A*B provides implicit blocking at every level of the memory hierarchy and tests out faster than classically optimrd code, tracking hand-coded BLAS3 routines. Proof of concept is demonstrated by racing the in-place algorithm against manufacturer's hand-tuned BLAS3 routines; it can win.The recursive code bifurcates naturally at the top level into independent block-oriented processes, that each writes to a disjoint and contiguous region of memory. Experience has shown that the indexing vastly improves the patterns of memory access at all levels of the memory hierarchy, independently of the sizes of caches or pages and without ad hoc programming. It also exposed a weakness in SGI's C compilers that merrily unroll loops for the super-scalar R8000 processor, but do not analogously unfold the base cases of the most elementary recursions. Such deficiencies might deter future programmers from using this rich class of recursive algorithms.

Paging strategy optimization in personal communication systems

Abstract: Mobility tracking is concerned with finding a mobile subscriber (MS) within the area serviced by the wireless network. The two basic operations for tracking an MS, location updating and paging, constitute additional load on the wireless network. The total cost of updating and paging can be minimized by optimally dividing the cellular area into location registration (LR) areas. In current systems broadcast paging messages are sent within the LR area to alert the MS of an incoming call. In this paper we propose a selective paging strategy which uses the MS mobility and call patterns to minimize the cost of locating an MS within an LR area subject to a constraint on the delay in locating the MS.

Mobility management for personal communications systems

Abstract: Using a combination of empirical data and theoretical models, this paper develops a model of user behavior for a personal communications system environment. This model is used to analyze a mobility management strategy that combines automatic updates by the users-either when they make significant moves or when they go extended periods without network interaction; multiple hysteresis in the form of dynamic registration areas and delayed updates; and a focused paging strategy that minimizes the number of pages given a constraint on the time allowed to a page. Over a range of system and user parameters, the total paging and update traffic can be kept below 1 per 2000 user seconds. The impact on the user's handset is less than ten brief updates per day. The total traffic is only a factor of three more than the minimum, immobile users case.

Automated data transmission link to law enforcement and security personnel

Abstract: An automated data transmission system for communicating warning signals and other information directly to law enforcement or security personnel in order to reduce response times. In the disclosed embodiment of the invention, sensing circuitry is added to a standard security system installed at an industrial or residential site. The sensing circuitry detects activation of the security system by sensing an outgoing warning call. Following activation of the security system, an automatic dialer or other automated transmitter circuitry is used to initiate a call to a processing computer at a predetermined phone number. The processing computer utilizes Caller ID™ information to determine the phone number assigned to the automatic dialer. The processing computer also maintains a database that associates assorted pieces of information with each phone number in the list, including the key map code location of the business, address of the protected business, name, date and time, and the phone number of a company contact. This information is communicated, through a paging service provider, to a dedicated group of one or more alphanumeric paging devices. The group of dedicated paging devices is provided to the law enforcement personnel assigned to protect the geographic region in which the secured industrial or residential site is located. Time-consuming human involvement in the notification process is thereby eliminated.

On the Influence of Lookahead in Competitive Paging Algorithms

Abstract: We introduce a new model of lookahead for on-line paging algorithms and study several algorithms using this model. A paging algorithm is n-line with strong lookahead l if it sees the present request and a sequence of future requests that contains l pairwise distinct pages. We show that strong lookahead has practical as well as theoretical importance and improves the competitive factors of on-line paging algorithms. This is the first model of lookahead having such properties. In addition to lower bounds we present a number of deterministic and randomized on-line paging algorithms with strong lookahead which are optimal or nearly optimal.

Adaptive threshold scheme for tracking and paging mobile users

Abstract: A method of allocating access to a shared media network, with specific application to tracking and paging mobile users of a cellular telephone network. Each cell of the network broadcasts a load factor α, representative of the load on the cell's control channel. Each user in a cell determines a registration priority for itself, and also a registration threshold based on α. In the preferred embodiment of the present invention, each user is assigned a base threshold time T, and each user in a cell computes a registration threshold time T', based on T and α, and registers its location with the network if the last such registration was longer ago than T'. Users are paged only in cells to which they could have traveled since their most recent location updates.

A dynamic paging scheme for wireless communication systems

Abstract: This paper introduces a dynamic paging scheme based on the semi-realtime movement information of an individual user, which allows a more accurate predication of the user location at the time of paging. In general, a realtime location tracking scheme may require complex control schemes and incur unacceptably high computation and messaging cost. Our proposed approach, namely velocity paging scheme, relaxes the realtime constraints to semirealtime to provide a good combination of cost reduction and esse of implementation. The proposed velocity paging scheme utilizes semi-realtime velocity information, namely velocity classes, of individual mobile terminal and dynamically generates a paging zone (a list of cells to be paged) for it. Therefore, the total paging cost can be reduced due to the paging area reduction. Much consideration also has been given to reduce the complexity for the proposed scheme. As a result, it only requires minimal extra overhead and is feasible to implement in current cellular/PCS networks. The velocity paging can be combined with movement-based registration or other registration schemes. Analytical results of velocity paging and movement-based registration combination are provided to demonstrate the cost effectiveness of the scheme under various parameters in comparison with location area scheme.

System for locking data in a shared cache

Abstract: In a multi-threaded computing system, a locking system is utilized to cooperatively manage a shared cache between a plurality of user threads and a paging manager thread. To manage the locks, the paging manager maintains pointers between a process memory space assigned to each user thread, a global system data structure assigned to each user thread, and a page control block for each locked page in memory. These pointers and additional flags identify locked pages and their owners, and facilitates cleanup of stale locks.

Access technique of channel hopping communications system

Abstract: Establishing a connection between a paging unit and a standby unit in a channel hopping communications system includes activating the standby unit for an activation time period out of every standby time period. During each activation time period, the standby unit monitors a selected channel for receipt of a paging message. The selected channel is selected from a plurality of channels, and, for each subsequent activation time period, the selected channel is a subsequent one of the plurality of channels as specified by a hopping sequence and an internal clock. A page train is repeatedly transmitted from the paging unit to the standby unit, until a response is received from the standby unit. Each page train includes a plurality of paging messages, each paging message being transmitted on a different one of a subset of the plurality of channels. Selection of a page train for transmission by the paging unit may be based on an estimate of the standby unit's internal clock.

Apparatus, and associated method, for adaptively selecting a paging area in which to page a mobile terminal

Abstract: Apparatus (52), and an associated method, for adaptively selecting (92) a paging area throughout which to page a mobile terminal. A record (72) is maintained, indicative of the position where a mobile terminal was located when last-accessing the network infrastructure of a communication system in which the mobile terminal is operable. When a page is to be broadcast to the mobile terminal, the record (72) is accessed, and the paging area throughout which the page is broadcast is adaptively selected responsive thereto.

Two-way wireless cellular messaging system

Abstract: A two-way wireless messaging system has a cellular network with a mobile switching center for routing messages to base stations, a home location register for storing profiles and a home location register for storing profiles and location information, and a messaging center for receiving, storing and forwarding messages. In the present invention, a set of modular servers is added to add network based message expansion, transaction tracking, directed paging, and user defined services in an incremental fashion.

CDMA multiple carrier paging channel optimization

Abstract: A method of reducing paging channel usage in a CDMA communication system. Each mobile switching centre maintains in its visitor location registry information regarding a paging channel or carrier frequency that each mobile station registered is monitoring. Then, when it comes time to send a page to a mobile station, the mobile switching centre looks up the information and appends it to the page which is sent to all basestation transceivers. The basestation transceivers extract the information and identify the paging channel the mobile station to which the page is addressed is monitoring. The transceivers then broadcast the page message over their air interfaces on the identified paging channel.

Experimental studies of access graph based heuristics: beating the LRU standard?

Abstract: In this paper we devise new paging heuristics motivated by the access graph model of paging. Unlike the access graph model and the related Markov paging model our heuristics are truly on-line in that we do not assume any prior knowledge of the program just about to be executed. The Least Recently Used heuristic for paging is remarkably good, and is known experimentally to be superior to many of the suggested alternatives on real program traces. Experiments we`ve performed suggest that our heuristics beat LRU fairly consistently, over a wide range of cache sizes and programs. The number of page faults can be as low as {1/2} the number of page faults for LRU and is on average 7 to 9 percent less than the number of faults for LRU. (Depending on how this average is computed.) We have built a program tracer that gives the page access sequence for real program executions of 200 - 3,300 thousand page access requests, and our simulations are based on 25 of these program traces. Overall, we have performed several thousand such simulations. While we have no real evidence to suggest that the programs we`ve traced are typical in any sense, we havemore » made use of an experimental {open_quotes}protocol{close_quotes} designed to avoid experimenter bias. We strongly emphasize that our results are only preliminary and that much further work needs to be done.« less

Ensemble polling strategies for increased paging capacity in mobile communication networks

Abstract: The process of finding a unit in a mobile communications system is called paging and requires the use of limited network resources. Although it is understood how to minimize the use of network resources and satisfy delay constraints when paging a single unit, optimal policies for paging multiple units are difficult to derive. Here we adapt single unit polling methods to obtain simple ensemble polling schemes for use with multiple units which can greatly increase the rate at which page requests can be processed while maintaining acceptable average delay.

Optimization of paging cost in mobile switching system using a genetic optimization method

Abstract: The invention overcomes the inefficient conventional mobile paging methods that cause a bottleneck in the FOCC due to constraints of both the bandwidth and the limited number of radio frequency channels in mobile telecommunication systems. This is accomplished by first determining the mobility pattern of each mobile station during a given sampling period. Then the probability that the mobile station will be located within each cell in the network is determined. From the cells having non-zero probabilities, at least two paging zones are defined using a genetic optimization method which converges on paging zones which produce a minimum paging cost which correspondingly results in minimum utilization of the FOCC.

Parallel, out-of-core methods for N-body simulation

Abstract: Hierarchical treecodes have, to a large extent, converted the compute-bound N-body problem into a memory-bound problem. The large ratio of DRAM to disk pricing suggests use of out-of-core techniques to overcome memory capacity limitations. The authors describe a parallel, out-of-core treecode library, targeted at machines with independent secondary storage associated with each processor. Borrowing the space-filling curve techniques from the in-core library, and manually paging, resulting in excellent spatial and temporal locality and very good performance.

Method and apparatus for scanning other frequency pilot signals in a code division multiple access communication system

Abstract: A method and apparatus for detecting a pilot signal on a second frequency while monitoring a first frequency having an assigned paging slot and a plurality of non-assigned paging slots. The method comprises the steps of monitoring the assigned paging slot of the first frequency and scanning for the pilot signal on the second frequency during at least one of the non-assigned paging slots of the first frequency. If the pilot signal is detected while scanning the second frequency, the pilot signal is processed normally. The method also includes entering a sleep mode for a remainder of the non-assigned paging slots. In a preferred embodiment, scanning for the pilot signal on the second frequency occurs in a non-assigned paging slot immediately following the assigned paging slot. In an alternate embodiment, scanning for the pilot signal occurs in a non-assigned paging slot immediately preceding the assigned paging slot.

Pager transceiver and methods for performing action on information at desired times

Abstract: A pager transceiver and method for selectively paging provides a page to a paging transceiver but does not automatically provide associated information. The paging transceiver receives the page and alerts the user that information is waiting and preferably provides a short description of the information. The user can then download or otherwise act on the information at a time and at a place convenient to the user. The user can therefore place the paging transceiver in a location where it can easily receive and reply to the message. The paging system conserves air time and the paging transceiver conserves memory by not automatically receiving the associated messages. The messages stored by the systems and delivered to the paging transceiver may be of different types, such as voice, text, audio, or even video. In addition to messages, the paging system can store other information for the user, such as songs or video clips that the user can sample or updates on weather or stock rates. The paging transceiver includes a timer so that the desired action taken on the information may be performed at a desired time. The timer may be set so that the action may occur at a certain time, for instance at an off-peak hour to lower costs to the user. The timer may be programmed by the user so that messages are delivered after a certain time delay or at any other desired time.

Dual channel slotted paging

Abstract: A novel and improved method and system for paging a cellular telephone or other wireless terminal using two paging channels that reduces standby mode power consumption described. In one embodiment of the invention, a minimally encoded quick paging channel is established over which short, quick page messages are transmitted during one of a set of quick paging slots. The quick page message indicates that a communications request has been received, and that the receiving communication terminals should process a highly encoded full paging channel over which more detailed, full page messages are transmitted during the next full paging slot. A terminal monitors full paging channel only after a quick page message has been received on the quick paging channel.

Method and apparatus for paging alternate users

Abstract: A method and apparatus for a paging service to automatically respond to a paging acknowledgment. The pager server receives an initial pager request from an originating user. The initial paging request is sent to a target user by the paging server. An acknowledgment to the initial pager request is received at the paging server from the target user. If the acknowledgment is not positive, alternate users are paged until a positive acknowledgment is received.