| Patent application number | Description | Published |
|---|
| 20080298362 | SESSION BORDER CONTROL USING MULTIPLE PROCESSORS - In one embodiment, a router receives a call request for establishing a multimedia exchange between two remote endpoints. The router selects a processing entity to manage a subset of connections with the remote endpoints according to an endpoint identification such as a remote address included in the call request. A different processing entity manages the remaining connections with the remote endpoints. Accordingly, the load of managing signaling for establishing the multimedia exchange is balanced between a plurality of processing elements that appear externally as a single entity such that modification of remote endpoint behavior is not required. | 12-04-2008 |
| 20090034533 | SYSTEM AND METHOD FOR PROVIDING LINK, NODE AND PG POLICY BASED ROUTING IN PNNI BASED ATM NETWORKS - A system and method for providing link, node, and PG policy based routing in PNNI based ATM networks is disclosed. A computer implemented method signals and routes a call in the network. Upon detecting the call's arrival, its service request is accessed. Upon determining that the service request relates to an attribute of a link, a routing path is sought that conforms to the service request, as by accessing information relating to the routing path and comparing the information to the service request. A conforming routing path is selected, and the call is routed via that path. A computer implemented method advertises an attribute of links, nodes, policies, etc. Data relating to the route's attribute can be provided to a node as a GAT IE component of a PNNI signaling setup message for multi-peer group networks, and advertised using PTSEs within a peer group. | 02-05-2009 |
| 20090310614 | System and Method for Establishment of a Multiprotocol Label Switching (MPLS) Tunnel - In one embodiment, a method for receiving a request from a first interface to establish a session with at least a second interface in a communication network is provided. The request is transmitted to an application layer signaling device via an application layer signaling protocol dialog, wherein the application layer signaling protocol dialog is configured to facilitate communication between the first interface and the application layer signaling device. The method further includes communicating parameters for establishing a session tunnel to a first edge router via the application layer signaling protocol dialog, wherein the first edge router is configured to dynamically establish the session tunnel between the first edge router and at least a second edge router, wherein the second edge router is positioned proximate to the at least second interface in the communication network. | 12-17-2009 |
| Patent application number | Description | Published |
|---|
| 20100082928 | Secure Manufacturing of Programmable Devices - According to an embodiment, a programmable logic device includes a plurality of logic blocks and a logic unit. The logic blocks are grouped into one or more partitions. The logic unit controls external access to the one or more partitions, controls programming of the one or more partitions and controls interconnection and operation of the one or more partitions during operation of the programmable logic device. | 04-01-2010 |
| 20100083367 | Secure Partitioning of Programmable Devices - According to an embodiment, a programmable logic device includes a plurality of logic blocks, memory and a logic unit. The logic blocks are grouped into one or more partitions. The memory stores authentication and partition information uploaded to the programmable logic device prior to partition programming. The logic unit authenticates programming access to the one or more partitions based on the authentication information and controls programming of the one or more partitions based on the partition information. | 04-01-2010 |
| 20100083384 | Secure Operation of Programmable Devices - According to an embodiment, a programmable logic device includes a plurality of logic blocks, memory, a plurality of connection control elements and a logic unit. The logic blocks are grouped into one or more programmed partitions. The memory stores authentication information and partition information. The connection control elements controllably interconnect different ones of the logic blocks. The logic unit controls external access to the one or more partitions based on the authentication information, controls reprogramming of the one or more partitions based on at least some of the partition information and configures the connection control elements based on at least some of the partition information. | 04-01-2010 |
| 20110019551 | FLOW STATE AWARE MANAGEMENT OF QoS WITH A DISTRIBUTED CLASSIFIER - Packet network node and method of operating packet network node. Conventional packet network nodes react to congestion in packet network by dropping packets in a manner which is perceived by users to be indiscriminate. In the described system, indiscriminate packet discards are prevented by causing packets to be discarded on lower priority flows and flow aggregates. Further action is taken to reduce the likelihood of packet discards through: (1) classification of flows that are not observable at the point in the network where flow-based packet discards are deployed, but are consuming bandwidth and signaling classification information to flow-based packet discard function or a flow-based monitoring function or network management function; (2) classification of flows making use of extended monitoring functions that are not co-located with a flow-based packet discard function, where extended monitoring functions may perform monitoring of a flow or a group of flows over a period of time. | 01-27-2011 |
| Patent application number | Description | Published |
|---|
| 20110299527 | SUPPORTING MULTIPLE MULTICAST TREES IN TRILL NETWORKS - Systems and techniques for supporting multiple multicast trees are described. Some embodiments provide a system that determines an internal multicast group identifier based on a source address, a multicast address, and a multicast tree identifier field associated with a multicast packet. The system can then forward the multicast packet based on the internal multicast group identifier. Specifically, the system can determine a first set of bits based on the source address and the multicast address of the multicast packet. The system can determine a second set of bits based on the multicast tree identifier field of the multicast packet. Next, the system can combine the first set of bits and the second set of bits to obtain the internal multicast group identifier. In some embodiments, the scope of an internal virtual network identifier does not extend beyond a switch or a forwarding module within a switch. | 12-08-2011 |
| 20110299528 | NETWORK LAYER MULTICASTING IN TRILL NETWORKS - Systems and techniques for performing network layer multicasting in a TRILL network are described. Some embodiments provide a system that receives multicast packet that includes a network-layer multicast-address. The multicast packet can be received on a first multicast tree associated with a first virtual network. Next, the system can determine, based on the network-layer multicast-address, a second multicast tree associated with a second virtual network over which the multicast packet is to be forwarded. The system can then forward the multicast packet on the first multicast tree associated with the first virtual network, and forward a copy of the multicast packet on the second multicast tree associated with the second virtual network. | 12-08-2011 |
| 20110299533 | INTERNAL VIRTUAL NETWORK IDENTIFIER AND INTERNAL POLICY IDENTIFIER - Systems and techniques for processing and forwarding packets are described. Some embodiments provide a system (e.g., a switch) which determines an internal virtual network identifier and/or an internal policy identifier for a packet based on a port on which the packet was received and/or one or more fields in the packet. The system can then process and forward the packet based on the internal virtual network identifier and/or internal policy identifier. In some embodiments, the system encapsulates the packet in a TRILL (Transparent Interconnection of Lots of Links) packet by adding a TRILL header to the packet. In some embodiments, the scope of an internal virtual network identifier and/or an internal policy identifier may not extend beyond a switch or a module within a switch. | 12-08-2011 |
| Patent application number | Description | Published |
|---|
| 20080215580 | SYSTEM AND METHOD FOR ADAPTIVE DATABASE CACHING - A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan. | 09-04-2008 |
| 20110302164 | Order-Independent Stream Query Processing - In a system and method for order-independent stream query processing, one or more input streams of data are received, and the one or more input streams are analyzed to determine data which is older than an already emitted progress indicator. The data which is older than the already emitted progress indicator is partitioned into one or more partitions, and each of the one or more partitions are independently processed using out-of-order processing techniques. A query is received, rewritten and decomposed into one or more sub-queries that produce partial results for each of the one or more partitions, where each of the one or more sub-queries correspond to a partition. A view is also produced that consolidates the partial results for each partition. The partial results are consolidated at a consolidation time specified by the query to produce final results, and the final results are provided. | 12-08-2011 |
| 20120124031 | ADDITION AND PROCESSING OF CONTINUOUS SQL QUERIES IN A STREAMING RELATIONAL DATABASE MANAGEMENT SYSTEM - Systems, methods, and media are disclosed herein that can be embodied in a traditional Relational Database Management System (RDBMS) in order to transform it into a Streaming Relational Database Management System (SRDBMS). An SRDBMS may provide functionality such as to manage and populate streams, tables, and archived stream histories and support the evaluation of continuous queries on streams and tables. Both continuous and snapshot queries support the full spectrum of the industry standard, widely used, Structured Query Language. The present technology can support a high number of concurrent continuous queries using a scalable and efficient shared query evaluation scheme, support on-the-fly addition of continuous queries into a mechanism that implements the shared evaluation scheme, reuse RDBMS modules such as relational operators and expression evaluators, and visualize results of continuous queries in real time | 05-17-2012 |
| 20120124096 | ADDITION AND PROCESSING OF CONTINUOUS SQL QUERIES IN A STREAMING RELATIONAL DATABASE MANAGEMENT SYSTEM - Systems, methods, and media are disclosed herein that can be embodied in a traditional Relational Database Management System (RDBMS) in order to transform it into a Streaming Relational Database Management System (SRDBMS). An SRDBMS may provide functionality such as to manage and populate streams, tables, and archived stream histories and support the evaluation of continuous queries on streams and tables. Both continuous and snapshot queries support the full spectrum of the industry standard, widely used, Structured Query Language. The present technology can support a high number of concurrent continuous queries using a scalable and efficient shared query evaluation scheme, support on-the-fly addition of continuous queries into a mechanism that implements the shared evaluation scheme, reuse RDBMS modules such as relational operators and expression evaluators, and visualize results of continuous queries in real time | 05-17-2012 |
| Patent application number | Description | Published |
|---|
| 20120113844 | INTERFERENCE MEASUREMENTS IN ENHANCED INTER-CELL INTERFERENCE COORDINATION CAPABLE WIRELESS TERMINALS - A wireless communication terminal is disclose. The terminal includes a transceiver coupled to a processor configured to determine that a subset of a plurality of REs must be excluded from demodulation, the plurality of resource elements (REs) received in a signal from a first base station, to estimate a hypothetical block error rate (BLER) based on the signal received from the first base station by excluding the subset of the plurality of Res, and to estimate channel state information based on the hypothetical block error rate (BLER). | 05-10-2012 |
| 20120113846 | Idle State Interference Mitigation in Wireless Communication Network - A mobile station is disclosed wherein the mobile station determines interference by assessing one or more frames in a first periodic sequence of frames relative to a reference and, in response to the assessment, monitors transmissions from a base station for paging signals during a second periodic sequence of frames, wherein the second periodic sequence of frames is offset from the first periodic sequence of frames by a predetermined amount. | 05-10-2012 |
| 20120113847 | Configuring Unscheduled Periods to Enable Interference Reduction in Heterogeneous Networks - A mobile station in a wireless communication network is disclosed. The mobile station includes a transceiver coupled to a processor configured to perform measurements of signals of one or more cells of a wireless communication system during a first set of subframes, to cause the transceiver to transmit a measurement report including at least the measurements of signals of the one or more cells, and to indicate that the measurements of the one or more cells were performed during the first set of subframes. | 05-10-2012 |
| 20120113961 | Interference Measurements in Enhanced Inter-Cell Interference Coordination Capable Wireless Terminals - A wireless communication terminal is disclosed. The terminal includes a transceiver coupled to a processor configured to estimate a signal power associated with a second transmission from a second base station, wherein the second transmission is part of a signal received at the terminal wherein the signal includes a first transmission from a first base station and the second transmission from the second base station. The processor is also configured to estimate a Receive Signal Strength Indicator (RSSI) of the received signal, and to subtract the signal power associated with the second transmission from the estimated RSSI to obtain a modified RSSI. | 05-10-2012 |
| 20120115485 | Idle State Interference Mitigation in Wireless Communication Network - A method in a mobile station for ranking cells in order to perform reselection from a serving cell to a second cell is disclosed. The method includes detecting a second cell that the mobile station is not allowed to access, determining resources used for transmission of a signal of the second cell, and applying a reselection bias if the resources used for transmission of the signal of the second cell do not substantially overlap resources used for transmission of a signal of the serving cell. | 05-10-2012 |
| 20120115527 | Configuring Unscheduled Periods to Enable Interference Reduction in Heterogeneous Networks - A mobile station in a wireless communication network is disclosed. The mobile station includes a transceiver coupled to a processor configured to rank a plurality of detected cells according to a signal level metric of the plurality of cells, to determine a first pattern of time periods during which a highest ranked cell is configured to transmit only a restricted set of information, and to perform measurements of cells other than the highest ranked cell, of the plurality of cells, only during the first pattern of time periods. | 05-10-2012 |
| Patent application number | Description | Published |
|---|
| 20080201296 | Partitioning of nested tables - Techniques for partitioning nested tables are provided. A parent table includes a column for collection items. A nested table is created for storing items that belong to the collection items. The nested table is partitioned to create a plurality of nested table partitions. Each nested table partition is a distinct, separately stored structure within a database. How the nested table is partitioned may, or may not, be based on how the parent table is partitioned. For example, a nested table may be partitioned based on the same criteria in which the parent table is partitioned. As another example, a nested table may be partitioned, whereas the parent table is not partitioned. | 08-21-2008 |
| 20090024570 | USER DEFINED QUERY REWRITE MECHANISM - A database statement contains a table function. The database statement is compiled by a database statement compiler. The database statement is rewritten by replacing the table function with a replacement database statement. | 01-22-2009 |
| 20090030883 | Techniques for Extending User-Defined Indexes with Auxiliary Properties - In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The one or more functions are operable to generate index entries of the user-defined index for the one or more auxiliary properties. The one or more auxiliary properties are different than, and in addition to, a primary property of the user-defined index that provides for evaluating a query operator. The database server receives a first statement that defines the user-defined index, where the first statement includes one or more parameters that define the one or more auxiliary properties. The database server invokes the one or more functions in response to the first statement, where the one or more functions when invoked generate and store the index entries of the user-defined index according to the one or more parameters that define the one or more auxiliary properties. | 01-29-2009 |
| Patent application number | Description | Published |
|---|
| 20100082556 | SYSTEM AND METHOD FOR META-DATA DRIVEN, SEMI-AUTOMATED GENERATION OF WEB SERVICES BASED ON EXISTING APPLICATIONS - Techniques for reusing logic implemented in an existing software application such that the logic can be exposed as a Web service or in any other service-oriented context. In one set of embodiments, a design-time technique is provided that comprises, inter alia, receiving program code for an existing software application, generating metadata based on the program code, and customizing the metadata to align with an intended Web service. Artifacts for the Web service are then generated based on the customized metadata. In another set of embodiments, a run-time technique is provided that comprises, inter alia, receiving a payload representing an invocation of a Web service operation of the generated Web service, processing the payload, and, based on the processing, causing the existing software application to execute an operation in response to the invocation of the Web service operation. | 04-01-2010 |
| 20100185643 | TECHNIQUES FOR AUTOMATED GENERATION OF QUERIES FOR QUERYING ONTOLOGIES - Techniques for simplifying querying of ontologies. In one embodiment, one or more queries for querying an ontology are automatically generated in a language suitable for querying the ontology. A user may enter a query in a simple language such as a natural language query. In response, one or more queries capable of querying the ontology are automatically generated in a second language. The automatically generated queries may, for example, be in SPARQL or PL/SQL. The one or more automatically generated queries may then be used to query one or more ontologies. | 07-22-2010 |
| 20100228782 | TECHNIQUES FOR AUTOMATED GENERATION OF ONTOLOGIES FOR ENTERPRISE APPLICATIONS - Embodiments of the present invention provide techniques for generating ontologies. In one embodiment, techniques are provided for automatically generating an ontology based upon input information. The input information may, for example, be in the form of XSD, XML, WSDL, or WSRP, etc. The automatically generated ontology may be encoded in OWL or other RDF-compliant language. A set of inference rules may also be automatically generated using the input information. The automatically generated ontology and the set of inference rules may be stored in a database for further processing. | 09-09-2010 |
| Patent application number | Description | Published |
|---|
| 20110066654 | OPERATIONALLY COMPLETE HIERARCHICAL REPOSITORY IN A RELATIONAL DATABASE - A modular repository is described, where operational features may be implemented without the need to scan every resource included in the modular repository. A modular repository includes a dedicated set of database objects containing all information needed to access the resources in the repository. For example, the database objects of a modular repository may include those user identifier mappings and ACL mappings, etc., to which metadata in the modular repository refers. A database system may also include a mechanism through which a modular repository may be mounted under a subdirectory of a common directory in the database system. The resources of a modular repository that are mounted under the common directory may be accessed through the common directory. Further, a client may query the resources of any modular repository mounted under the common directory by making the federated repository, represented by the common directory, the context of the query. | 03-17-2011 |
| 20120066271 | Operationally Complete Hierarchical Repository In A Relational Database - A modular repository is described, where operational features may be implemented without the need to scan every resource included in the modular repository. A modular repository includes a dedicated set of database objects containing all information needed to access the resources in the repository. For example, the database objects of a modular repository may include those user identifier mappings and ACL mappings, etc., to which metadata in the modular repository refers. A database system may also include a mechanism through which a modular repository may be mounted under a subdirectory of a common directory in the database system. The resources of a modular repository that are mounted under the common directory may be accessed through the common directory. Further, a client may query the resources of any modular repository mounted under the common directory by making the federated repository, represented by the common directory, the context of the query. | 03-15-2012 |
