Showing papers on "Paging published in 1999"

Authorized location reporting paging system

Abstract: A location reporting paging communication system comprising space satellites, ground stations and a remote receiving unit adapted to resolve a global position from signals transmitted from a communication transmitter. The subscriber in possession of the remote receiving unit updates the paging network with global positioning information. A caller paging a subscriber in possession of the remote receiving unit may request the global location of the remote receiving unit. The paging network could divulge or block such information from a caller depending on the requirements of the subscriber.

Digital rights management operating system

Abstract: A digital rights management operating system protects rights-managed data, such as downloaded content, from access by untrusted programs while the data is loaded into memory or on a page file as a result of the execution of a trusted application that accesses the memory. To protect the rights-managed data resident in memory, the digital rights management operating system refuses to load an untrusted program into memory while the trusted application is executing or removes the data from memory before loading the untrusted program. If the untrusted program executes at the operating system level, such as a debugger, the digital rights management operating system renounces a trusted identity created for it by the computer processor when the computer was booted. To protect the rights-managed data on the page file, the digital rights management operating system prohibits raw access to the page file, or erases the data from the page file before allowing such access. Alternatively, the digital rights management operating system can encrypt the rights-managed data prior to writing it to the page file. The digital rights management operating system also limits the functions the user can perform on the rights-managed data and the trusted application, and can provide a trusted clock used in place of the standard computer clock.

LeZi-update: an information-theoretic approach to track mobile users in PCS networks

Abstract: The complexity of the mobility tracking problem in a cellular environment has been characterized under an informationtheoretic framework. Shannon’s entropy measure is identified as a basis for comparing user mobility models. By building and maintaining a dictionary of individual user’s path updates (as opposed to the widely used location updates), the proposed adaptive on-line algorithm can learn subscribers’ profiles. This technique evolves out of the concepts of lossless compression. The compressibility of the variable-to-fixed length encoding of the acclaimed LempelZiv family of algorithms reduces the update cost, whereas their built-in predictive power can be effectively used to reduce paging cost.

The case for compressed caching in virtual memory systems

Abstract: Compressed caching uses part of the available RAM to hold pages in compressed form, effectively adding a new level to the virtual memory hierarchy. This level attempts to bridge the huge performance gap between normal (uncompressed) RAM and disk. Unfortunately, previous studies did not show a consistent benefit from the use of compressed virtual memory. In this study, we show that technology trends favor compressed virtual memory--it is attractive now, offering reduction of paging costs of several tens of percent, and it will be increasingly attractive as CPU speeds increase faster than disk speeds. Two of the elements of our approach are innovative. First, we introduce novel compression algorithms suited to compressing in-memory data representations. These algorithms are competitive with more mature Ziv-Lempel compressors, and complement them. Second, we adaptively determine how much memory (if at all) should be compressed by keeping track of recent program behavior. This solves the problem of different programs, or phases within the same program, performing best for different amounts of compressed memory.

EELRU: simple and effective adaptive page replacement

Abstract: Despite the many replacement algorithms proposed throughout the years, approximations of Least Recently Used (LRU) replacement are predominant in actual virtual memory management systems because of their simplicity and efficiency. LRU, however, exhibits well-known performance problems for regular access patterns of size larger than the main memory. In this paper we present Early Eviction LRU (EELRU): an adaptive replacement algorithm based on the principle of detecting when the LRU algorithm underperforms (i.e., when the fetched memory pages are often the ones evicted lately). In simulations, EELRU proves to be quite effective for many memory sizes and several applications, often decreasing paging by over 30% for programs with large-scale reference patterns and by over lOSo for programs with small-scale patterns. Additionally, the algorithm is very robust, rarely underperforming LRU. Our experiments are mostly with traces from the recent research literature to allow for easy comparison with previous results.

Self-paging in the Nemesis operating system

Abstract: In contemporary operating systems, continuous media (CM) applications are sensitive to the behaviour of other tasks in the system. This is due to contention in the kernel (or in servers) between these applications. To properly support CM tasks, we require Quality of Service Firewalling between different applications. This paper presents a memory management system supporting Quality of Service (QoS) within the Nemesis operating system. It combines application-level paging techniques with isolation, exposure and responsibility in a manner we call self-paging. This enables rich virtual memory usage alongside (or even within) continuous media applications.

An optimality proof of the LRU-K page replacement algorithm

Abstract: This paper analyzes a recently published algorithm for page replacement in hierarchical paged memory systems [O'Neil et al. 1993]. The algorithm is called the LRU-K method, and reduces to the well-known LRU (Least Recently Used) method for K = 1. Previous work [O'Neil et al. 1993; Weikum et al. 1994; Johnson and Shasha 1994] has shown the effectiveness for K > 1 by simulation, especially in the most common case of K = 2. The basic idea in LRU-K is to keep track of the times of the last K references to memory pages, and to use this statistical information to rank-order the pages as to their expected future behavior. Based on this the page replacement policy decision is made: which memory-resident page to replace when a newly accessed page must be read into memory. In the current paper, we prove, under the assumptions of the independent reference model, that LRU-K is optimal. Specifically we show: given the times of the (up to) K most recent references to each disk page, no other algorithm A making decisions to keep pages in a memory buffer holding n - 1 pages based on this infomation can improve on the expected number of I/Os to access pages over the LRU-K algorithm using a memory buffer holding n pages. The proof uses the Bayesian formula to relate the space of actual page probabilities of the model to the space of observable page numbers on which the replacement decision is acutally made.

Integrating segmentation and paging protection for safe, efficient and transparent software extensions

Abstract: The trend towards extensible software architectures and component-based software development demands safe, efficient, and easy-to-use extension mechanisms to enforce protection boundaries among software modules residing in the same address space. This paper describes the design, implementation, and evaluation of a novel intra-address space protection mechanism called Palladium, which exploits the segmentation and paging hardware in the Intel X86 architecture and efficiently supports safe kernel-level and user-level extensions in a way that is largely transparent to programmers and existing programming tools. Based on the considerations on ease of extension programming and systems implementation complexity, Palladium uses different approaches to support user-level and kernel-level extension mechanisms. To demonstrate the effectiveness of the Palladium architecture, we built a Web server that exploits the user-level extension mechanism to invoke CGI scripts as local function calls in a safe way, and we constructed a compiled network packet filter that exploits the kernel-level extension mechanism to run packet-filtering binaries safely inside the kernel at native speed. The current Palladium prototype implementation demonstrates that a protected procedure call and return costs 142 CPU cycles on a Pentium 200MHz machine running Linux.

A method and apparatus for maximizing standby time using a quick paging channel

Abstract: A quick paging system having a base station (12), a plurality of terminals (10), and a full paging channel having a plurality of slots (32) for transmitting paging information to the terminals (10). A quick paging channel having a plurality of quick paging channel slots (30) each corresponding to a full paging channel slot (32) is provided wherein at least one indicator (102, 104) is positioned within a selected quick paging channel slot (30) that instructs at least one selected terminal (10) corresponding to the at least one indicator (102, 104) in the quick paging slot (30) to monitor the corresponding full paging channel slot (32).

Method for transmitting a quick paging channel at different power levels

Abstract: The present invention provides a method for transmitting a quick paging channel at different power levels at a base station. The quick paging channel includes paging indicators and configuration change indicators. The method includes transmitting the paging indicators at a first power level and transmitting the configuration change indicators at a second power level different than the first power level. Preferably, the second power level is higher than the first power level.

Mobile communication system

Abstract: A mobile communication system employs narrow paging areas for calling mobile stations without increasing location registration requests to a location management center. This system reduces useless calls and improves the efficiency of use of radio resources. Each local area ( 1 - 3 ) of the system is divided into narrow paging areas ( 1 - 4 ). A storage unit ( 2 - 1 ) is installed in each base station ( 1 - 5 ) or exchange station ( 1 - 2 ), to register mobile stations ( 1 - 6 ). When a base station receives a location registration request from a mobile station, the base station registers the mobile station in the storage unit, and if necessary, transmits a location registration request to the location management center. Upon receiving an incoming call to a mobile station, the exchange station sends an inquiry about the mobile station to the storage units, receives an answer from the storage units, finds a paging area where the mobile station is present from the answer, and issues a call request to base stations that belong to the found paging area.

Wireless communications methods and apparatus employing paging attribute descriptors

Abstract: A paging attribute descriptor (PAD) the indicates content of a page message is transmitted in a first time slot and/or a succeeding second time slot of a physical channel, and the page message is transmitted in the second time slot. The second slot may be, for example, a Digital Control Channel (DCCH) slot mapped on a physical channel (DTCH) of an IS-136 system. The transmitted PAD is recovered at wireless station, which then determines whether to recover the page message based on the recovered PAD, e.g., if the PAD indicates that the page message is an empty page message, a page message addressed to another wireless station or a page message that includes control information that has changed. For example, in an IS-136 compliant system, the PAD may be transmitted in the coded superframe phase (CSFP) field of a Paging Channel (PCH) message transmitted in a Digital Control Channel (DCCH) slot, or in reserved bits of a slot preceding a PCH message.

State-based paging/registration: a greedy technique

Abstract: For a mobile unit moving according to some ergodic stochastic process, we show how to minimize the expected average cost of paging and registration based on system state information. Specifically, we assume that both the system and mobile unit (user) have access to or can derive the following: the user location probability distribution as a function of time given the last location known to the system, and the time elapsed since this last known location. We then derive methods by which the user decides whether to register based on the following: current location (x), the time elapsed since last contact with the system (t), the paging cost F(x/sub t/,x/sub 0/,t) to be incurred by the system at time t given the current location x/sub t/ and the last known location x/sub 0/, i.e., the user knows the paging strategy to be used by the system for each time t. If x and t define the system state, the method can be called "state based". Since the optimization is based only on the current expected cost rate and not that of all registration intervals, the method is "greedy". The greedy method was compared to a timer-based method using a simple diffusive motion process. Reductions in the average paging registration cost of approximately 10% were observed. The more striking improvement was a reduction in the variability of paging/registration costs by a factor of three. Thus, taking both cost and variability reduction as a performance measure, even suboptimal inclusion of location information in the registration decision affords substantial improvement.

Multicell area paging for cellular telecommunications system

Abstract: A radio access network portion of a telecommunications network (18) which serves a mobile station (MS) is connecting to a core network. The radio access network portion has plural base stations (BS) serving respective plural cells (C), as well as plural control nodes (RNCs). The control nodes include a first control node (RNC1) for controlling a first group of the plural base stations and a second control node (RNC2) for controlling a second group of the plural base stations. A multicell area (MCA) includes cells served by at least some of the first group of base stations and cells served by at least some of the second group of base stations. The radio access network portion of a telecommunications network further has a paging control node which stores information regarding the multicell area. To page the mobile station in the multicell area, the paging control node (1) sends paging messages to each of the base stations serving the multicell area controlled by the paging control node; and (2) sends a paging message to any other control nodes which control base stations serving cells in the multicell area. The paging control node determines to which base stations and other control node(s) it should send paging messages by consulting a paging table (100). Perferably the paging control node is one of the control nodes of radio access notwork. The paging control node is connected to the other control node(s) by an intercontrol node link (32) over which the paging message is sent.

Method for transmitting and receiving address information within a communication system

Abstract: The first frame of a paging slot (405) contains a portion of every page's (401-404) address. Likewise, the second, third, and fourth frames of the slot (405) contain a second, third, and fourth portion from each of the paging addresses. Address information is organized in the atomic frames of the slot (405) in such a way that the information in the earliest frame gives the mobile a high probability that it can determine that no messages directed to it are present in the slot. After receiving a first frame, a mobile station uses known partial address comparison techniques to determine if the mobile station has a page pending.

Method and system for providing formatted information via a two-way communications system

Abstract: A method and system for providing formatted information via a wireless communications system that includes a plurality of cell sites. The method includes the steps of storing a plurality of page templates each having a page identifier and at least one information field. The method also includes the step of receiving a request from a first two-way wireless communications device, wherein the request specifies the first device and a first page identifier selected by a user of the first device. In response to receiving the request a first page template, of the plurality of page templates, is determined. The first page template corresponds to the first page identifier. The method also includes determining information relating to an information field of the first page template and sending a response message to the first device, wherein the response message includes the determined information. The method can includes the step of displaying the information on a display of the first paging device.

Method and system for broadcasting large short messages

Abstract: A relatively large short message (BC-SMS) (31) is broadcast to a selected group of mobile subscriber stations (10a) within a cellular radio system (8). Each BC-SMS message (31) greater in size than a predetermined number of octets is divided into segments (31a-31c), formatted into a separate modified paging message (PBC) (32a-32c) which is unrecognizable to existing mobiles but recognizable to new mobiles. The BC-SMS message segments (31a-31c) are broadcast in sequence as modified paging messages (32a-32c) to the mobiles within the region of the system where the selected group (10a) is believed to be operating. Each paging message (32a-32c) includes the essential elements of a paging message, a message ID number (25), a sequence number (26) and the message segment payload (27).

Cost reduction in location management using semi-realtime movement information

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 the velocity paging scheme, relaxes the realtime constraints to semi-realtime to provide a good combination of cost reduction and ease of implementation. The proposed velocity paging scheme utilizes semi-realtime velocity information, namely velocity classes, of individual mobile terminals and dynamically calculates a paging zone (a list of cells to be paged) for an incoming call. Therefore, the total paging cost can be reduced due to the paging area reduction. Much consideration also has been given to reduce the complexity of 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 the movement-based registration or other registration schemes. Analytical and simulation results of the velocity paging and movement-based registration combination are provided to demonstrate the cost effectiveness of the scheme under various parameters in comparison with the location area scheme.

Systems and methods for two-way messaging using a pager

Abstract: A system facilitates two-way messaging in a network that includes at least one paging device. The system includes a paging service provider and a server. The paging device generates a message intended for a called party and transmits the message to the paging service provider. The paging service provider forwards the message to the server. The server translates the message to a form used by the called party and sends the translated message to the called party.

Method and apparatus for reducing power consumption of a communication device

Abstract: A method of reducing power consumption in a communication device includes a step of acquiring a signal on a common pilot channel of a radio communication system. A next step includes detecting predetermined bits in the signal on the common pilot channel indicating activity on paging channels of the radio communication system. When no paging channel activity is indicated in the second step, a last step includes powering down portions of the electrical circuitry of the communication device so as to reduce power consumption, and when paging channel activity is indicated in the second step, a next step includes powering up portions of the electrical circuitry of the communication device such that those paging channels indicating activity are monitored by the communication device.

Method and apparatus for detecting forward and reverse link imbalance in digital cellular communication systems

Abstract: A method and apparatus for detecting forward and reverse link imbalances in a digital cellular communication system. The method preferably uses an indication of 'maximum access probes' (104) to determine whether a link imbalance caused a reverse link failure to occur. The maximum access probes condition indicates that a wireless unit has attempted to access a base station a pre-defined maximum number of times. The method preferably uses an indication of a lost paging channel (132) and a traffic channel initialization (TCI) time out (160) to determine whether a link imbalance caused a forward link failure to occur. If the wireless unit did not lose the paging channel (132), the method determines whether a TCI time out occurred (160). If the wireless unit lost the paging channel, or it did not lose the paging channel but a TCI time out occurred, the method determines the cause for the forward link failure. There are two potential causes in this scenario: (1) either the wireless unit is a significant distance from the base station; or (2) the paging channel suffers from significant interference. The method determines the cause and either instructs the wireless unit to perform an idle handoff to a neighboring base station or to exit the digital system.

Controlling communications terminal response to group call page based on group call characteristics

Abstract: A communications terminal, such as a wireless mobile terminal, is supplied with an indication of group call characteristics for incoming group calls so as to distinguish such calls from other types of incoming calls. A Group Call Server in charge of the group call may selectively augment the calling party number field of the paging message with one or more indicator “flag characters,” indicating one or more characteristics of the group call, such as call type, call subtype, or priority level. The communications terminal receives the group call paging message and selects the appropriate response to the paging message based on the flag characters. The communications terminal preferably examines the calling party field of the paging message and notes the presence of the flag characters. When the flag characters are present, the communications terminal parses out the flag characters and calling party ID. Based on the flag characters, the communications terminal determines the proper response to the paging message. This response may include, for instance, controlling the man-machine interface of the communications terminal and determining whether or not to automatically answer the call. For instance, the communications terminal may automatically answer group calls of certain kind(s) and require manual intervention of the user prior to answering the paging call for other kind(s). Thus, the communications terminals receiving the augmented paging message will base their response, such as whether to auto-answer or not, on the group call characteristics indicated in the paging message.

Paging channel configuration for efficient wake-up period utilization

Abstract: Methods and systems for optimizing standby mode power performance in radiocommunication systems are described. Techniques are provided which permit a mobile station to read synchronization symbols, e.g., long code masked symbols, transmitted in differently numbered timeslots while minimizing wake-up time in idle mode.

Paging of mobile station in a cellular radio system

Abstract: In cellular radio systems re-paging of a mobile station (MS) loads the mobile communications network very much, especially the limited radio path resources of the network. The present invention concerns a paging method in a cellular radio system including several cells (C 1 -C 10 ). In the method a first paging of the mobile station (MS) is performed in all cells (C 1 -C 10 ) of the area according to the stored location information. According to the invention, the paging method is characterized in that in the method the area according to the location information is divided according to the cell division into at least two sub-areas, each one of which is formed of at least one cell, limitation values for the number of pagings are defined for the cells on a sub-area basis and re-paging of the mobile station is limited in each cell of the area based on the said limitation values for the number of pagings.

System, apparatus and method for paging optimization using sub-location areas

Abstract: A telecommunications system, apparatus and method is disclosed for optimizing the use of paging channels within the network by dividing location areas (LAs) into sub-location areas (sub-LAs) and providing a more efficient and flexible method of paging mobile subscribers. The amount of usage of the paging channels and the number of location updates performed by a mobile subscriber can be monitored by the network to determine either statistical data or a subscriber category, e.g., heavy-user or light-user, which can be stored within the Subscriber Identity Module (SIM) card within the mobile station (MS). The sub-LA information along with the LA information for the cell that the mobile terminal is in is broadcast and monitored by the SIM card within the MS, which can then perform location updates based upon the category or data. The Mobile Switching Center/Visitor Location Register can also use the data or category for paging purposes, e.g., either page within the entire LA or within only the sub-LA, for more focused paging.

Real-time visualization of scalably large collections of heterogeneous objects

Abstract: This paper presents results for real-time visualization of out-of-core collections of 3D objects. This is a significant extension of previous methods and shows the generality of hierarchical paging procedures applied both to global terrain and any objects that reside on it. Applied to buildings, the procedure shows the effectiveness of using a screen-based paging and display criterion within a hierarchical framework. The results demonstrate that the method is scalable since it is able to handle multiple collections of buildings (e.g., cities) placed around the earth with full interactivity and without extensive memory load. Further the method shows efficient handling of culling and is applicable to larger, extended collections of buildings. Finally, the method shows that levels of detail can be incorporated to provide improved detail management.

CDMA power control for paging and initial traffic channel power

Abstract: A code-division multiple access power control for paging channel power and initial traffic channel power dynamically determines optimum initial channel power in accordance with pilot signal strength of a pilot signal as received at a mobile station and current forward link loading of the desired sector. The optimum initial paging channel power and initial traffic channel power may be determined either at a base station or a mobile switching center of the mobile communication system. A paging signal or call is transmitted from the base station to the mobile station over a paging channel and a traffic channel at the optimum paging channel and initial traffic channel power.

Method and apparatus for providing intelligent emergency paging

Abstract: A method and apparatus for providing intelligent paging services is disclosed. A server receives a paging request from a customer. The page request may be, for example, a telephone call initiated by the customer from a telephone. The server then determines the identity of the customer who initiated the page request and (if necessary) the condition which prompted the identified customer to initiate the page request. The identity and condition information is then used to identify a predetermined list of one or more parties who should be contacted on behalf of the customer and how they should be contacted. Examples of the contact methods the server may execute include making a telephone call to a designated number via a public switched telephone network (PSTN), sending a page to a designated pager via the PSTN, and/or sending an electronic mail (e-mail) message to an Internet protocol (IP) addressable device via an IP network.

Identifying a mobile station in a packet radio network

Abstract: In conventional cellular systems, the identifier of network elements (SGSN) allocating a temporary identity (TLLI) to a mobile station (MS) can be derived from the identities of the cells they serve. In the future, this assumption may no longer be valid. One paging area could be handled by several network elements, such as SGSN nodes, or one network element could serve many paging areas. When the mobile station changes its paging area, the new supporting network element may have trouble in determining the old supporting network element on the basis of the paging area identifier. It is also possible for two supporting network elements to allocate the same TLLI to two different mobile stations. Therefore the network element (SGSN, BSC, RNC) allocating a temporary identity (TLLI) to a mobile station (MS) should incorporate at least part of its own identifier (NEI) into the temporary identity (TLLI).

A cost effective distributed location management strategy for wireless networks

Abstract: The mobility feature of mobile stations (MSs) imposes a large burden on network traffic control as a result of location management. Design issues of location management include MS registration (updating) and call set-up (paging). Previous approaches introduced several network topologies for updating and paging procedures, but most of them focused on a single problem: either updating optimization or paging optimization. In this paper, we design and integrate two mechanisms, distributed temporary location caches (TLCs) and distributed home location registers (HLRs), to reduce database access delay and to decrease network signaling traffic in both updating and paging for low power, low tier micro cellular systems. By using TLCs, our approach can improve the performance of updating and paging in comparison with previous approaches. Experimental results based on our analytic model show that our location management procedures have lower HLR access rate, lower registration cost, and lower call set-up cost than other approaches.