International Business Machines Corporation

Gari Singh

Gennaro A Cuomo

Meeta Yadav

Jason Karl Yellick

Meeta Vouk

Joseph H Allen

Dinakaran B Joseph

David J Hoeweler

Shikhar Singh

Alessandro Sorniotti

Paul Brian Tippett

An example operation may include one or more of receiving a request for blockchain information from a user device, acquiring blockchain data from a plurality of blockchains which are actively operating and available for joining, determining an amount of trust for each blockchain among the plurality of blockchains based on acquired blockchain data of the respective blockchain, and outputting a list identifying the plurality of blockchains where each blockchain on the list comprises a trust indicator indicating a determined amount of trust for the respective blockchain.

On-chain governance of blockchain

A node in a blockchain network may generate a configuration override for the blockchain network, approve the configuration override by the blockchain network, transmit the approval for the configuration override to peers in the blockchain network, and submit the configuration override to the blockchain network for validation. The validation will be based on the configuration override matching the approval.

Configuration override in a blockchain network

An example operation may include one or more of generating a data block for a hash-linked chain of blocks stored on a distributed ledger and accessible to a plurality of computing nodes of a blockchain network, storing governance policies within the data block, the governance polices governing interaction with the hash-linked chain of blocks, and transmitting the generated data block with the encoded governance policies therein to a plurality of peer nodes of the distributed ledger.

An example operation may include one or more of receiving a request to commit a blockchain request to a hash-linked chain of blocks stored on a distributed ledger, extracting governance policies which are encoded within a data block of the hash-linked chain of blocks on the distributed ledger, determining if the blockchain request satisfies the extracted governance policies of the hash-linked chain of blocks on the distributed ledger, and in response to the blockchain request satisfying the extracted governance policies, executing the blockchain request and storing the executed blockchain request within another data block of the hash-linked chain of data blocks on the distributed ledger.

An example operation may include one or more of receiving a request to modify a governance policy of a blockchain, identifying a principal identity that controls the governance policy, determining an allowable combination of signatures of the principal identity required for modifying the governance policy based on a graph data structure storing signature policies for endorsing modifications to governance policies, and modifying the governance policy of the blockchain based on the request in response to an allowable combination of signatures being received.

An example operation may include one or more of receiving a request to implement a modification to previously established governance policies of a blockchain, identifying one or more requirements for the modification based on the blockchain, determining whether the one or more identified requirements are satisfied based on signature data included within the request, and in response to the signature data satisfying the one or more requirements, transmitting the modification to an ordering node for inclusion within a data block of a hash-linked chain of blocks of the blockchain.

Embodiments relate to method products for publishing messages within a geographic area. Aspects include receiving a location from each of a plurality of user devices and creating a geo-hash tree based on the location of each of a plurality of user devices. Aspects also include receiving a message with the geographic area, computing a geo-hash grid for a region that includes the geographic area and identifying one or more nodes of the geo-hash tree that corresponds to the geo-hash grid. Aspects further include transmitting the message to one or more of the plurality of user devices associated with the one or more identified nodes.

Publishing messages based on geographic area

Embodiments relate to methods, systems and computer program products for publishing messages within a geographic area. Aspects include receiving a location from each of a plurality of user devices and creating a geo-hash tree based on the location of each of a plurality of user devices. Aspects also include receiving a message with the geographic area, computing a geo-hash grid for a region that includes the geographic area and identifying one or more nodes of the geo-hash tree that corresponds to the geo-hash grid. Aspects further include transmitting the message to one or more of the plurality of user devices associated with the one or more identified nodes.

A method, system and computer program product for dynamically routing messages in a publish/subscribe system. A messaging application receives messages from sensors (e.g., road condition sensors). Upon analyzing the messages using data analytics, an event (e.g., icy road condition) may be correlated with the analyzed messages. In such a scenario, a temporal topic based on the triggered event is created. Furthermore, a temporal publication (e.g., 'icy road condition near exit 40') and a temporal subscription are created. Potential subscribers to be associated with the temporal subscription are identified by using either geo-location information or social media information. Once those subscribers are identified, they are associated with the temporal subscription. The temporal publication is then published to the subscribers associated with the temporal subscription. In this manner, messages are dynamically routed to the appropriate subscribers that may have previously been excluded based on dynamically created temporal topics, subscriptions and publications.

Dynamically routing messages in a publish/subscribe system by creating temporal topics for subscriptions and publications

Content of a publish-subscribe topic tree is provided. This includes receiving a path for a requested topic. The path specifies topics leading from a highest to a lowest level topic in the path. Content in the topic tree is retrieved for matching topics that match the lowest level topic in the path independently of whether the matching topics are on the path in the tree.

Technology for providing content of a publish-subscribe topic tree

Embodiments of the invention provide for the optimization of utilization of non-volatile memory in message queuing. In an embodiment of the invention, a method for optimizing utilization of non-volatile memory in message queuing includes receiving a new message in a message queuing system implemented in a host computing system. The method also includes storing the new message as a master message in non-volatile memory of the host computing system. The method yet further includes subsequently receiving different messages that each share redundant information with the master message. The method even yet further includes delta encoding each of the different messages and storing the delta encoded different messages in the non-volatile memory. Finally, the method includes deleting the master message from the non-volatile memory only once each of the different messages and the master message have been acknowledged by at least one consumer subscribing to the message queuing system.

Optimization of non-volatile memory in message queuing

Embodiments of the invention provide for the optimization of utilization of non-volatile memory in message queuing. In an embodiment of the invention, a method for optimizing utilization of non-volatile memory in message queuing includes receiving a new message in a message queueing system implemented in a host computing system. The method also includes storing the new message as a master message in non-volatile memory of the host computing system. The method yet further includes subsequently receiving different messages that each share redundant information with the master message. The method even yet further includes delta encoding each of the different messages and storing the delta encoded different messages in the non-volatile memory. Finally, the method includes deleting the master message from the non-volatile memory only once each of the different messages and the master message have been acknowledged by at least one consumer subscribing to the message queuing system.

Growing community of inventors

Wilmington, MA, United States of America

Gari Singh