Patent application number | Description | Published |
20080301504 | Method and Apparatus to Anticipate Memory Exhaustion in an Open Services Gateway Initiative Environment - A computer implemented method, computer program product, and data processing system for predicting a future status of a memory leak. A first set of data including memory consumption data is received at a software bundle. The software bundle is operating in an open services gateway initiative environment. Responsive to a determination that a memory leak exists, the first set of data is analyzed to predict a future status of the memory leak. The future status is stored, as stored data, in a storage device. | 12-04-2008 |
20120180045 | DETERMINING AN OPTIMAL COMPUTING ENVIRONMENT FOR RUNNING AN IMAGE - Aspects of the present invention provide an approach that evaluates a locally running image (e.g., such as that for a virtual machine (VM)) and determines if that image could run more efficiently and/or more effectively in an alternate computing environment (e.g., a cloud computing environment). Specifically, embodiments of the present invention evaluate the local (existing/target) image's actual and perceived performance, as well as the anticipated/potential performance if the image were to be migrated to an alternate environment. The anticipated/potential performance can be measured based on another image that is similar to the existing/target image but where that image is running in a different computing environment. Regardless, the system would display a recommendation to the end user if it were determined that the image could perform better in the alternate environment (or vice versa). It is understood that performance is just one illustrative metric for which the system would perform a comparison. Other metrics such as cost, reliability, availability, etc. could also be used. | 07-12-2012 |
20120185500 | DATA STORAGE AND MANAGEMENT SYSTEM | 07-19-2012 |
20120278344 | PROXIMITY GRIDS FOR AN IN-MEMORY DATA GRID - Techniques are described for scaling an in-memory data grid to satisfy the needs of client applications requesting data from the in-memory data grid. The in-memory data grid may monitor a variety of factors, such as data traffic or number of received queries from a particular geographical region, to determine whether to create a proximity grid. A proximity grid is an extension of the in-memory data grid that services queries originating from a defined geographic region. Each proximity grid stores data objects relevant to the proximity grid's assigned geographic region. Queries originating from the client applications within the geographic regions are then routed to the corresponding proximity grid for execution. The proximity grid may be terminated when the need of the client applications within the geographic region has subsided. | 11-01-2012 |
20120303634 | In-Memory Data Grid Hash Scheme Optimization - Systems and methods of managing an in-memory data grid (IMDG) may involve conducting a data distribution analysis of the IMDG on a periodic basis, and selecting a hash scheme from a plurality of hash schemes based on the data distribution analysis. In one example, the selected hash scheme is used to conduct a repopulation of the IMDG, wherein the repopulation increases the distribution evenness of database records across the IMDG. | 11-29-2012 |
20120303675 | In-Memory Data Grid Hash Scheme Optimization - Systems and methods of managing an in-memory data grid (IMDG) may involve conducting a data distribution analysis of the IMDG on a periodic basis, and selecting a hash scheme from a plurality of hash schemes based on the data distribution analysis. In one example, the selected hash scheme is used to conduct a repopulation of the IMDG, wherein the repopulation increases the distribution evenness of database records across the IMDG. | 11-29-2012 |
20120311295 | SYSTEM AND METHOD OF OPTIMIZATION OF IN-MEMORY DATA GRID PLACEMENT - A method, system, and program product for optimizing distribution and availability of data partitions is disclosed. Placement logic is run for data partition distribution which optimizes a configuration of a memory data grid. A performance impact of adding new members to the memory data grid is provided. Replication of data partitions in the memory data grid is minimized. Optimum data partition distribution in the memory data grid is determined. | 12-06-2012 |
20130036267 | PLACEMENT OF DATA IN SHARDS ON A STORAGE DEVICE - A method, system and computer program product for placing data in shards on a storage device may include determining placement of a data set in one of a plurality of shards on the storage device. Each one of the shards may include a different at least one performance feature. Each different at least one performance feature may correspond to a different at least one predetermined characteristic associated with a particular set of data. The data set is cached in the one of the plurality of shards on the storage device that includes the at least one performance feature corresponding to the at least one predetermined characteristic associated with the data set being cached. | 02-07-2013 |
20130036269 | PLACEMENT OF DATA IN SHARDS ON A STORAGE DEVICE - A method, system and computer program product for placing data in shards on a storage device may include determining placement of a data set in one of a plurality of shards on the storage device. Each one of the shards may include a different at least one performance feature. Each different at least one performance feature may correspond to a different at least one predetermined characteristic associated with a particular set of data. The data set is cached in the one of the plurality of shards on the storage device that includes the at least one performance feature corresponding to the at least one predetermined characteristic associated with the data set being cached. | 02-07-2013 |
20130041971 | TECHNIQUE FOR IMPROVING REPLICATION PERSISTANCE IN A CACHING APPLICANCE STRUCTURE - A method for improving replication persistence in a caching appliance structure can begin when a primary catalog service receives a command to instantiate a data partition. The primary catalog service can manage a collective of caching appliances in a networked computing environment. The data partition can include a primary shard and at least one replica shard. The primary shard of the data partition can be stored within a memory space of a first caching appliance. The at least one replica shard of the data partition can be stored within a non-volatile storage space of a second caching appliance. The first and the second caching appliances can be separate physical devices. The memory space of the second caching appliance that could have been used to store the at least one replica shard can be available for storing primary shards for other data partitions, increasing the capacity of the collective. | 02-14-2013 |
20130073809 | DYNAMICALLY ALTERING TIME TO LIVE VALUES IN A DATA CACHE - A TTL value for a data object stored in-memory in a data grid is dynamically adjusted. A stale data tolerance policy is set. Low toleration for staleness would mean that eviction is certain, no matter the cost, and high toleration would mean that the TTL value would be set based on total cost. Metrics to report a cost to re-create and re-store the data object are calculated, and the TTL value is adjusted based on calculated metrics. Further factors, such as, cleanup time to evict data from a storage site, may be considered in the total cost. | 03-21-2013 |
20130198400 | Cognitive Dynamic Allocation in Caching Appliances - An approach is provided in which a caching appliance receives a data packet over a network connection utilizing a network protocol. The caching appliance selects a storage area based upon the network protocol and stores the data packet in the selected storage area. In one embodiment, the caching appliance identifies a service level that corresponds to the network protocol and selects the storage area based upon the identified service level. | 08-01-2013 |
20130212340 | PARTITION AWARE QUALITY OF SERVICE FEATURE - A method for providing a partition aware quality of service feature may include receiving an indication of data to be stored in a distributed memory grid, determining a quality of service policy rule to be applied in relation to storage of the data in the memory grid based on the indication, and initiating storage of data blocks of the data in the memory grid. The data blocks may be provided with corresponding partition identifiers that facilitate retrieval of the data by indicating a location of storage of respective ones of the data blocks within the memory grid. The method may further include providing a quality of service token in association with the partition identifier based on the quality of service policy rule. | 08-15-2013 |
20130227232 | PARTITION AWARE QUALITY OF SERVICE FEATURE - A method for providing a partition aware quality of service feature may include receiving an indication of data to be stored in a distributed memory grid, determining a quality of service policy rule to be applied in relation to storage of the data in the memory grid based on the indication, and initiating storage of data blocks of the data in the memory grid. The data blocks may be provided with corresponding partition identifiers that facilitate retrieval of the data by indicating a location of storage of respective ones of the data blocks within the memory grid. The method may further include providing a quality of service token in association with the partition identifier based on the quality of service policy rule. | 08-29-2013 |
20130246462 | AUTONOMIC CACHING FOR IN MEMORY DATA GRID QUERY PROCESSING - A method, system and computer program product for autonomic caching in an IMDG has been provided. A method for autonomic caching in an IMDG includes receiving from a client of the IMDG a request for a primary query in the IMDG. The method also includes associating the primary query with a previously requested sub-query related to the primary query. Finally, the method includes directing the sub-query concurrently with a directing of the primary query without waiting to receive a request for the sub-query from the client. In this way, the method can proactively predict a receipt of the request for a sub-query following a request for a primary query prior the actual receipt of the request for the sub-query. | 09-19-2013 |
20130339392 | DYNAMIC MAP TEMPLATE DISCOVERY AND MAP CREATION - A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template. | 12-19-2013 |
20130339393 | DYNAMIC MAP TEMPLATE DISCOVERY AND MAP CREATION - A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template. | 12-19-2013 |
20140007052 | DYNAMICALLY CONFIGURING AN INTEGRATED DEVELOPMENT ENVIRONMENT | 01-02-2014 |
20140007053 | DYNAMICALLY CONFIGURING AN INTEGRATED DEVELOPMENT ENVIRONMENT | 01-02-2014 |
20140007130 | DETERMINING AN OPTIMAL COMPUTING ENVIRONMENT FOR RUNNING AN IMAGE | 01-02-2014 |
20140074966 | INTELLIGENT MAPPING FOR AN ENTERPRISE GRID - A computer receives a request from a client application for data within an enterprise grid. The computer sends the data along with a program to monitor the application's use of the data. The computer subsequently receives from the program a subset of the data being utilized by the client application. Responsive to a subsequent request for the data, the computer sends to the client application only the data corresponding to the identified subset of data being utilized. | 03-13-2014 |
20140089260 | WORKLOAD TRANSITIONING IN AN IN-MEMORY DATA GRID - Embodiments of the present invention disclose a method, system, and computer program product for transitioning a workload of a grid client from a first grid server to a second grid server. A replication process is commenced transferring application state from the first grid server to the second grid server. Prior to completion of the replication process: the grid client is rerouted to communicate with the second grid server. The second grid server receives a request from the grid client. The second grid server determines whether one or more resources necessary to handle the request have been received from the first grid server. Responsive to determining that the one or more resources have not been received from the first grid server, the second grid server queries the first grid server for the one or more resources. The second grid server responds to the request from the grid client. | 03-27-2014 |
20140244953 | IDENTIFYING AND ACCESSING REFERENCE DATA IN AN IN-MEMORY DATA GRID - Embodiments relate to providing normalization techniques for reference data in an in-memory data grid. An aspect includes monitoring object creation and access in an in-memory data grid and identifying reference data in an object field of a plurality of object instances. A reference map for the object field is created and the reference map is replicated across all partitions of the in-memory data grid. The reference data of an embodiment is stored in the reference map and the object field is updated to identify the reference map. Accordingly, the reference data may be accessed using the created reference map. | 08-28-2014 |
20140244954 | IDENTIFYING AND ACCESSING REFERENCE DATA IN AN IN-MEMORY DATA GRID - Embodiments relate to providing normalization techniques for reference data in an in-memory data grid. An aspect includes monitoring object creation and access in an in-memory data grid and identifying reference data in an object field of a plurality of object instances. A reference map for the object field is created and the reference map is replicated across all partitions of the in-memory data grid. The reference data of an embodiment is stored in the reference map and the object field is updated to identify the reference map. Accordingly, the reference data may be accessed using the created reference map. | 08-28-2014 |
20150019584 | SELF-LEARNING JAVA DATABASE CONNECTIVITY (JDBC) DRIVER - Various embodiments include solutions for querying desired data from a database without pulling supererogatory data. In one embodiment, a method includes: obtaining an initial database access query between an application and the database at a self-learning JDBC driver; monitoring subsequent database access queries between the application and the database over a period; and generating a modified database access query for querying the database from the self-learning JDBC driver, the modified database access query based upon the subsequent database access queries between the application and the database over the period. | 01-15-2015 |
20150080027 | METHOD FOR GROUP SOCIAL SUGGESTIONS BASED ON SPATIAL DATA AND SHARED PREFERENCES - A method and system for managing a group activity using electronic communications includes joining a plurality of users to form a proximity based network. Data is received and accessed from the plurality of users each using a mobile device configured to communicate with the proximity based network on the communications network. The data includes location information and personal information. A multiplicity of social connections are defined between the users based on the data. A set of the plurality of users are identified wherein at least two of the mobile devices are within the predetermined proximity, and the corresponding users have a shared social connection, A proposed activity is defined for the set of the users based on the shared social connection. The set of users of the proposed activity are notified. | 03-19-2015 |
20150189474 | USING LOCATION AND PROPENSITY BASED PREDICTIVE ANALYTICS TO PROVIDE MOBILE MESSAGE QOS - In the sending messages, a notification system determines locations of mobile devices and user profiles for users of the mobile devices, identifies a target message for a target device, determines a number of users with overlapping target message candidacy based on the locations and the user profiles, and determines whether the number of users exceed a predetermined threshold. If the number of users exceeds the predetermined threshold, the notification system determines a target message trigger time based on when the number of users exceed a predetermined threshold, determines a target message assembly time and a target message delivery time, and determines whether a sum of the target message assembly time and the target message delivery time is less than a difference between a current time and the trigger time. If so, then a sending of the target message to the target device for displaying at the target device is triggered. | 07-02-2015 |
20150193351 | ANALYTICS DRIVEN IN-MEMORY DATA GRID (IMDG) HYDRATION - Embodiments of the present invention provide a method, system and computer program product for analytics driven IMDG cache hydration. In an embodiment of the invention, a method of analytics driven IMDG cache hydration includes retrieving from an analytics engine data utilization metrics for data in a database of a DBMS, selecting a subset of the data according to the data utilization metrics, and hydrating an IMDG cache of the DBMS with the selected subset. In one aspect of the embodiment, the data utilization metrics indicate one of a frequency and a recency of retrieval of the data in the database. In another aspect of the embodiment, the method additionally includes adding subsequent data to the IMDG cache when the subsequent data has been requested for retrieval a threshold number of times. | 07-09-2015 |
20150193439 | SCHEMALESS DATA ACCESS MANAGEMENT - Techniques are described for managing data between an in-memory data grid and a schemaless data store. In one example, a method includes generating hash codes for one or more keys. Each key is associated with one data item from a plurality of data items in the schemaless data store. The method further includes storing the hash codes in a persistent data structure. The method further includes receiving a request via the in-memory data grid to access a selected data item, wherein the selected data item has an associated key. The method further includes deriving a hash code for the key associated with the selected data item. The method further includes determining whether the derived hash code is present in the persistent data structure. The method further includes performing an operation based on the determination of whether the derived hash code is present in the persistent data structure. | 07-09-2015 |
20150193526 | SCHEMALESS DATA ACCESS MANAGEMENT - Techniques are described for managing data between an in-memory data grid and a schemaless data store. In one example, a method includes generating hash codes for one or more keys. Each key is associated with one data item from a plurality of data items in the schemaless data store. The method further includes storing the hash codes in a persistent data structure. The method further includes receiving a request via the in-memory data grid to access a selected data item, wherein the selected data item has an associated key. The method further includes deriving a hash code for the key associated with the selected data item. The method further includes determining whether the derived hash code is present in the persistent data structure. The method further includes performing an operation based on the determination of whether the derived hash code is present in the persistent data structure. | 07-09-2015 |
20150220310 | OBJECT FIELD OPTIMIZATION - Embodiments of the present invention disclose a method, computer program product, and system for optimizing objects in object oriented programming. A computer receives application code having a plurality of application object fields. The computer receives information detailing a set of user-defined classes, wherein the user-defined classes include at least one object field. The computer analyzes the plurality of application object fields and the information detailing the set of user-defined classes to identify at least one object field in the set of user-defined classes that does not appear in the plurality of application object fields. The computer generates an instance of at least one user-defined class of the set of user-defined classes, wherein the instance does not include the at least one object field that does not appear in the plurality of application object fields. | 08-06-2015 |
20150220579 | OPTIMIZATION OF AN IN MEMORY DATA GRID (IMDG) SCHEMA BASED UPON A NO-SQL DOCUMENT MODEL - Embodiments of the present invention provide a method, system and computer program product for IMDG No-SQL schema optimization. In an embodiment of the invention, an IMDG No-SQL schema optimization method is provided. The method includes parsing documents of a No-SQL database, such as a document-oriented database, to select an object model mapping the documents of the No-SQL database to different portions of the IMDG, and selecting a partitioning schema for the IMDG according to the documents. Thereafter, a change in the documents of the No-SQL database can be detected, for example a change in data density of the documents of the No-SQL database, and in response to detecting the change, the documents of the No-SQL database are parsed to select a new object model of the No-SQL database mapping the documents to different portions of the IMDG, and to select a new partitioning schema for the IMDG according to the documents. | 08-06-2015 |
20150254266 | DATA DUPLICATION DETECTION IN AN IN MEMORY DATA GRID (IMDG) - Embodiments of the invention provide a method, system and computer program product for data duplication detection in an in memory data grid (IMDG). A method for data duplication detection in an IMDG includes computing a hash value for each binary data value in a key value pair of a partition in an IMDG. The method also includes generating a map including an entry for each unique computed hash value and one or more keys corresponding to binary data values of respective key value pairs from which the hash value had been uniquely computed. Thereafter, only those hash values in the map with multiple keys associated therewith are identified and binary data corresponding to the multiple keys of the identified hash values are reported as potential duplicate data in the IMDG. | 09-10-2015 |
20150254267 | DATA DUPLICATION DETECTION IN AN IN MEMORY DATA GRID (IMDG) - Embodiments of the invention provide a method, system and computer program product for data duplication detection in an in memory data grid (IMDG). A method for data duplication detection in an IMDG includes computing a hash value for each binary data value in a key value pair of a partition in an IMDG. The method also includes generating a map including an entry for each unique computed hash value and one or more keys corresponding to binary data values of respective key value pairs from which the hash value had been uniquely computed. Thereafter, only those hash values in the map with multiple keys associated therewith are identified and binary data corresponding to the multiple keys of the identified hash values are reported as potential duplicate data in the IMDG. | 09-10-2015 |
20150277783 | OPTIMIZED TRANSFER AND STORAGE OF HIGHLY DENORMALIZED DATA IN AN IN-MEMORY DATA GRID - A method for transferring and storing a data set associated with an in-memory data grid (IMDG) is provided. The method may include identifying at least two data object instances associated with the data set based on a determined relationship between the at least two data object instances. The method may also include performing a field relation analysis on the identified at least two data object instances and recording the field relation analysis. The method may include receiving a request for a data object associated with the data set. The method may include determining if an optimization can be performed on the data object. The method may include omitting a field value associated with the data object based on the determined optimization. The method may include inflating the omitted field value into the data set associated with the data object request and returning the data set with the inflated field value. | 10-01-2015 |
20150278302 | OPTIMIZED TRANSFER AND STORAGE OF HIGHLY DENORMALIZED DATA IN AN IN-MEMORY DATA GRID - A method for transferring and storing a data set associated with an in-memory data grid (IMDG) is provided. The method may include identifying at least two data object instances associated with the data set based on a determined relationship between the at least two data object instances. The method may also include performing a field relation analysis on the identified at least two data object instances and recording the field relation analysis. The method may include receiving a request for a data object associated with the data set. The method may include determining if an optimization can be performed on the data object. The method may include omitting a field value associated with the data object based on the determined optimization. The method may include inflating the omitted field value into the data set associated with the data object request and returning the data set with the inflated field value. | 10-01-2015 |
20150293945 | AUTONOMIC DATA PARTITION PLACEMENT IN AN IN-MEMORY DATA GRID - A method for autonomic data partition placement in an in-memory data grid (IMDG) based on usage sampling is provided. The method may include sampling access pattern data, during a configurable window, of a client accessing one or more data objects in the IMDG. Analytics are applied to the sampled access pattern data to determine a replacement partition schema, based on the analyzed sampled access pattern data exceeding at least one performance threshold. The deployed partition schema is altered, based on the replacement partition schema. | 10-15-2015 |
20150296041 | CONSTRAINT BASED SIGNAL FOR INTELLEGENT AND OPTIMIZED END USER MOBILE EXPERIENCE ENHANCEMENT - Provided are techniques for collecting data associated with a mobile communication device, wherein the mobile communication device is executing a session associated with a mobile application over a wireless connection; assigning a corresponding weight value to each datum of the constraint data; generating a score for the communication session based upon the data wherein each datum is modified based upon the corresponding weight; and, in response to a determination that the score fails within a first range, store a context corresponding to the session in a persistent data storage and extend the session; in response to a determination that the score fails within a second range, distinct from the first range, store the context in the persistent data storage and maintain the session as a transient session; and, in response to a determination that the score does not fall within wither the first or second ranges, terminate the session. | 10-15-2015 |
Patent application number | Description | Published |
20120243631 | SYSTEMS AND METHODS FOR CREATING A DOWNLINK PRECODE FOR COMMUNICATION SYSTEM WITH PER-ANTENNA POWER CONSTRAINTS - Systems and methods for a downlink precode filter directed towards both wired and wireless MIMO communication systems. Systems and methods of the invention can provide close to optimal capacity (similar to the water-filling solution) while requiring power amplifiers associated with transmit antennas to operate at a fixed power level. In particular, systems and methods of this invention can improve the performance of MIMO wireless devices such as 802.11n, WiMax, LTE, LTE-Advanced etc. | 09-27-2012 |
20130089034 | SEPARATE ASSOCIATIONS OF A MOBILE TO DIFFERENT BASE STATIONS IN UPLINK AND DOWNLINK - In a cellular system a user equipment (UE) can associate with different base stations (BS) for its uplink (UL) and downlink (DL) communications. To achieve this, the two BS have to communicate with each other. Systems and methods described herein provide a signaling methodology within a cellular standards framework (such as LTE), by which a UE can associate with different BS for UL and DL communications and further facilitate communication between a BS handling UL and a BS handling DL. | 04-11-2013 |
20130107798 | ABS-based Method for Inter Cell Interference Coordination in LTE-Advanced Networks | 05-02-2013 |
20130201864 | ALLOCATION OF SUBFRAMES FOR UPLINK AND DOWNLINK TRANSMISSION IN TDD-LTE - Systems and methods are directed to deciding the number of subframes in a frame to use for uplink transmission, with the remaining frames used for downlink transmission for a Base Station (BS) in a Time Division Duplexing Long Term Evolution (TDD-LTE). Systems and methods are based on the number of User Equipment (UEs) that the BS has to serve in the uplink and in the downlink, as well as the uplink (UL) and downlink (DL) traffic loads per user. Systems and methods are directed to allowing a TDD LTE BS to partition the subframes in a frame for its UL and DL traffic. | 08-08-2013 |
20130303219 | CONFIGURATION OF CSI-RS RESOURCES BY NETWORK FOR ENABLING COMP - Example embodiments described herein are directed to systems and methods by which a group of base stations (BS) can configure pilot signals in time and time-frequency, called channel state information reference signal (CSI-RS) resources, so that the user equipment (UE) such as mobiles and laptops can measure certain possible channel quality indicators (CQI) that correspond to specific channel and interference conditions that can arise during actual data submission. Using these values, example embodiments utilize an interpolation algorithm by which the group of base stations can estimate other possible CQI corresponding to a different set of channel and interference conditions. | 11-14-2013 |
20130303220 | CONFIGURATION OF PILOT SIGNALS BY NETWORK FOR ENABLING COMP - Example embodiments described herein are directed to systems and methods by which a group of base stations (BS) can configure pilot signals in time and time-frequency, using interference management resources (IMR) and/or channel state information reference signal (CSI-RS) resources, so that the user equipment (UE) such as mobiles and laptops can measure certain possible channel quality indicators (CQI) that correspond to specific channel and interference conditions that can arise during actual data submission. Using these values, example embodiments utilize an interpolation algorithm by which the group of base stations can estimate other possible CQI corresponding to a different set of channel and interference conditions. | 11-14-2013 |
20130322350 | METHOD AND APPARATUS FOR BIT-LEVEL PDSCH MUTING AND/OR RECEIVER PUNCTURING IN LTE-ADVANCED HETEROGENEOUS NETWORKS - A base station (BS) comprises: an interface to receive radio resource management (RRM) measurement from user equipment on received reference signal (RS) strength for each BS of one or more other BSs in a surrounding area of the user equipment; an X2 interface to receive transmission information of almost blank subframes and corresponding cell-specific reference signal (CRS) resource element (RE) locations from the one or more other BSs; and a controller to manage bit-level PDSCH (Physical Downlink Shared Channel) muting information, which includes identifying PDSCH resource elements (REs) that suffer the most from CRS interference arising from other BSs and that are to be subjected to bit-level muting, and allocating to the identified REs a number of bits less than the number of bits allocated to normal REs, and to transfer data with the two levels of bit allocations to various PDSCH REs to the user equipment. | 12-05-2013 |
20130343291 | POWER CONTROL IN LTE-ADVANCED HETEROGENEOUS NETWORKS - Embodiments described herein are directed to a power control scheme for Long Term Evolution Advanced (LTE-A) heterogeneous networks to reduce the interference from macro base stations (BS) to pico user equipment (UE). The embodiments described herein may be used to develop LTE-A heterogeneous networks to balance the achievable throughput between macro and pico UEs and may thereby improve the overall system performance. | 12-26-2013 |
20140146689 | METHOD AND APPARATUS FOR HANDLING DOWNLINK REFERENCE SIGNAL INTERFERENCE TO PDSCH IN LONG TERM EVOLUTION COORDINATED MULTIPOINT TRANSMISSION - A communications system employing CoMP transmission to suppress interference comprises: a CoMP user equipment; and a plurality of base stations, one of the base stations being an associated base station of the CoMP user equipment to transmit data to the CoMP user equipment, the plurality of base stations including multiple CoMP base stations for the CoMP user equipment. The CoMP base stations for the CoMP user equipment transmit CoMP downlink data, including subframes which comprise physical resource blocks having a plurality of resource elements (REs) and cell-specific reference signal (CRS) resource element (RE) locations. PDSCH bit-level muting or puncturing information is determined, based on radio resource management measurement and the subframes sent from the multiple CoMP base stations, to identify PDSCH REs that suffer strong CRS interference transmission from within the multiple CoMP base stations and are to be subjected to one of bit-level muting or bit-level puncturing. | 05-29-2014 |
20140200006 | METHOD AND APPARATUS FOR CELL SELECTION AND HANDOVER IN LTE-ADVANCED HETEROGENEOUS NETWORKS - Example implementations are directed to systems and methods based on physical broadcast channel (PBCH) muting are utilized to avoid frequent cell selection/reselection and handover in a LTE-advanced heterogeneous network. In the example implementations, a pico eNB that is fully covered by a macro eNB or other pico eNBs transmits blank PBCH such that it is inaccessible to the UEs who perform cell selection/reselection. Furthermore, a macro eNB may handover a UE to the inaccessible pico eNB by signalling the necessary information to the UE to detect the inaccessible pico eNB. Frequent cell selection/reselection and handover may therefore be avoided in a dense deployment situation. | 07-17-2014 |