Entangled Links, Transactions And Trees For Distributed Computing Systems

  • Published: Sep 26, 2017
  • Earliest Priority: Jul 15 2013
  • Family: 2
  • Cited Works: 1
  • Cited by: 11
  • Cites: 3
  • Additional Info: Full text

An entangled links mechanism to establish and maintain bipartite temporal intimacy between pairs of computers, using an idempotent, reversible token method which presents no observable external “change” until a communication of information needs to occur between the computers, and which maintains the potential for “bounded (or unbounded) reversibility” in case the intended information dispatched by a source computational entity is not captured or properly accepted by a destination computational entity. The mechanism enables distributed computers in a network to remain continuously aware of each other's presence; to communicate on a logically nearest neighbor basis in a secure and reliable manner in which packets passed over these links do not conflict with normal traffic or cause the available resources of the link to be exceeded; and that atomicity, consistency, isolation, and “reversible durability” may be maintained for transactions when perturbations occur.

Download PDF
Document Preview
Document History
  • Publication: Sep 26, 2017
  • Application: Jul 14, 2014
    US US 201414331225 A
  • Priority: Jul 14, 2014
    US US 201414331225 A
  • Priority: Dec 8, 2013
    US US 201361913302 P
  • Priority: Oct 21, 2013
    US US 201361893285 P
  • Priority: Jul 15, 2013
    US US 201361846602 P

Download Citation

Sign in to the Lens