H04L67/1093

Battery efficient wireless network connection and registration for a low-power device

A client device is configured to communicate with an access point over a wireless network, exchanging data with the access point over a selected communication channel. The client device stores an identifier of the selected communication channel. After the wireless connection to the access point has ended, the client device initiates a process to reconnect to the access point over the selected communication channel using the stored identifier.

RESILIENT PEER-TO-PEER APPLICATION MESSAGE ROUTING
20180006941 · 2018-01-04 ·

A network routing table includes destination addresses of destination applications hosted on peer nodes of a network. A primary processor registers a first destination application and a second destination application, where the first destination application is the same as the second destination application and both the first destination application and the second destination application have the same destination address. That processor also provides the peer nodes and a secondary processor with a copy of the table. When the first destination application is inactivated, all peer nodes and the secondary processor are provided with a copy of an updated routing table indicating inactivation of the first destination application and routing of the application message to the second destination application. A further application message addressed from any of the peer nodes to the destination address associated with the inactivated first destination application will be routed, via the updated routing table, to the second destination application having the same destination address as the inactivated first destination application. The secondary processor provides the copy of the routing table and the copy of the updated routing table in case of failure of the primary processor in response to a request from the querying peer node.

SYSTEMS AND METHODS FOR SEAMLESS HOST MIGRATION
20180013820 · 2018-01-11 ·

Systems and methods of the present invention for maintaining network data distribution are provided. Network data may be distributed in such as manner as to allow a network session to weather interrupted communications between host and clients without significant loss of data. Embodiments of the present invention provide for one or more clients to serve as backup host(s) for the network session. When the other clients transmit data to the host, they may also transmit the data to one or more backup hosts if there are any indications of interrupted communication.

FAST PROPAGATION OF RECENT TRANSACTIONS OVER A BLOCKCHAIN NETWORK

A specialized network (“merchant”) node to facilitate fast distribution of blockchain transactions over a network of interconnected nodes, as subset of which are merchant nodes interconnected by an overlay network. The merchant node includes a memory storing an assigned portion of a distributed mempool structured as a distributed hash table, the distributed mempool containing pending transactions awaiting confirmation. The merchant node operates by receiving a transaction, including a transaction identifier; hashing the new transaction identifier to obtain a key; determining, using the key, whether the transaction is stored in the distributed mempool or not and, if not, then storing the transaction in the distributed mempool as a pending transaction; and sending the transaction to a set of nodes other than merchant nodes using peer-to-peer connections. The invention may be used in conjunction with the Bitcoin blockchain or an alternative.

Network-assisted consensus protocol

The concepts and technologies disclosed herein are directed to a network-assisted Raft consensus protocol, referred to herein as “NetRaft.” According to one aspect of the concepts and technologies disclosed herein, a system can include a plurality of servers operating in a server cluster, and a plurality of P4 switches corresponding to the plurality of servers. Each server of the plurality of servers can include a back-end that executes a complete Raft algorithm to perform leader election, log replication, and log commitment of a Raft consensus algorithm. Each P4 switch of the plurality of P4 switches can include a front-end that executes a partial Raft algorithm to perform the log replication and the log commitment of the Raft consensus algorithm. The back-end can maintain a complete state for responding to requests that cannot be fulfilled by the front-end. The requests can include read requests and/or write requests.

Blockchain distribution network

A server in a blockchain distribution network includes a processor and a transceiver operatively coupled to the processor. The transceiver is configured to receive bytes of a transaction from a first peer node. The transceiver is also configured to propagate the bytes of the transaction to one or more additional peer nodes and to one or more additional servers in the blockchain distribution network. The transceiver is also configured to receive bytes of a blockchain from a second peer node. The blockchain includes information regarding a plurality of transactions, and the plurality of transactions includes the transaction. The transceiver is further configured to propagate the bytes of the blockchain to the one or more additional peer nodes and to the one or more additional servers in the blockchain distribution network.

Selective access of multi-rate data from a server and/or peer

Aspects of the disclosed subject matter are directed to facilitating peer-to-peer data exchange in a common domain. In accordance with one embodiment, a method is provided for obtaining content from one or more peers that are connected to the domain. The method includes registering a peer with a super-peer when a connection to the domain is established. Then, the connecting peer obtains data that describes various network conditions and identifies chunks of content available from other peers. In downloading content from other peers, heuristics are applied to select between available chunks that are potentially encoded at different bitrates. The heuristics account for the network conditions between peers and balance the potential need to quickly access content with the desire to obtain high quality content.

Enhanced data security system and method thereof
11502817 · 2022-11-15 · ·

The disclosure relates to an enhanced data security system and method thereof. In some embodiments, the method includes receiving the transactional credential dataset from a user application. The transactional credential dataset is provided by a user to the user application. The method further includes storing the transactional credential dataset in nodes of a graphical embedding storage model. The nodes further store historical credential datasets of the user. Further, the method includes determining a correlation among the historical credential datasets using an artificial neural network (ANN) model and detecting a pattern of the transactional credential dataset based on the correlation. The ANN model is trained based on credential datasets provided by users stored in the nodes of the graphical embedding storage model.

Network neighborhoods for establishing communication relationships between communication interfaces in an administrative domain

A method and apparatus form and/or define a network topology in a Layer 3 network with a plurality of nodes, where each node has at least one interface. To that end, the method defines a plurality of neighborhoods, and assigns at least one interface of each node to at least one of the neighborhoods. The method also assigns a communication role to each interface so that each communication role is effective relative to one of the plurality of neighborhoods. The method then enables communication between the interfaces of the plurality of nodes as a function of the neighborhoods and the communication roles.

Active mesh network system and method

According to one embodiment, a network system features a first virtual private cloud (VPC) network and a second VPC network. The first VPC network includes a first plurality of gateways. Each gateway of the first plurality of gateways is in communications with other gateways of the first plurality of gateways in accordance with a first tunnel protocol. Similarly, a second VPC network includes a second plurality of gateways. Each of the second plurality of gateways is communicatively coupled to the each of the first plurality of gateways in accordance with a second security protocol to provide redundant routing.