Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method comprising: receiving, at a server computing device of a peer and from a computing device of a client over an electronic communications network, a message comprising an instruction to increment or decrement a level activity of counters; updating, via the server computing device and by the peer, a number of the local level of activity counter that corresponds to the client; receiving, by the server computing device, a request from the client for a service; determining, by the server computing device, based on the updated number of the local level of activity counter, whether the request corresponds to suspicious network activity, the determination comprising determining whether the updated number of the local level of activity counter satisfies a threshold; determining, via the server computing device, a number of other peers of the peer from a plurality of peers sharing level of activity information, the plurality of peers comprising the peer and the number of other peers excluding the peer; performing a second update, by the server computing device, of the number of the local level of activity counter when the threshold determination does not satisfy the threshold; and communicating, by the peer via the server computing device of the peer and responsive to the request of the client for service, a message to each other peer of the number of other peers, without sending the peer's local level activity counter value, the communicated message instructing each other peer to update its local level of activity counter corresponding to the client to reflect the service request received by the peer.
This invention relates to network security systems that detect suspicious activity by monitoring client requests and sharing activity data among distributed peers. The system involves a server computing device acting as a peer within a network of peers, each maintaining local counters tracking client activity levels. When a client sends a service request, the peer increments or decrements its local counter based on the request type. The peer then checks if the counter exceeds a predefined threshold, indicating potential suspicious activity. If the threshold is not met, the peer updates its counter and broadcasts a message to other peers, instructing them to update their own counters for the same client without sharing the peer's specific counter value. This distributed approach allows peers to collaboratively assess client behavior while preserving privacy. The system helps detect anomalies by aggregating activity data across multiple peers, improving detection accuracy without centralized data exposure. The method ensures efficient communication by only sharing update instructions rather than raw counter values, reducing network overhead and enhancing scalability.
2. The method of claim 1 , further comprising: making, via the server computing device and by the peer, a determination whether or not to perform the service requested by the client, the determination comprising using a number of the peer's local level of activity counters, including the level of activity counter, corresponding to the client and a throttling threshold.
A system and method for managing service requests in a peer-to-peer network involves a server computing device that facilitates communication between a client and a peer. The peer receives a service request from the client and evaluates whether to fulfill the request based on the peer's local activity levels. Specifically, the peer assesses a set of activity counters, including a counter associated with the requesting client, against a predefined throttling threshold. This evaluation helps the peer decide whether to accept or reject the request, ensuring balanced resource utilization and preventing overloading. The system may also include mechanisms for tracking and updating these activity counters to reflect recent interactions. The method ensures efficient service distribution by dynamically adjusting request handling based on real-time activity metrics, improving network stability and fairness.
3. The method of claim 1 , further comprising: receiving, at the server computing device of the peer and over the electronic communications network from another peer of the plurality of peers, a message comprising an update instruction to update its local level of activity counter corresponding to the client; and updating, via the server computing device, the local level of activity counter in accordance with the received update instruction.
This invention relates to a distributed system for managing and tracking activity levels of clients across multiple peer computing devices. The system addresses the challenge of maintaining consistent and up-to-date activity metrics in a decentralized environment where peers communicate over an electronic network. Each peer device hosts a server component that monitors and updates a local activity counter for each client. The system ensures synchronization by allowing peers to exchange update instructions, enabling one peer to notify another to adjust its local activity counter based on observed client activity. This mechanism supports real-time coordination without relying on a central authority, improving scalability and fault tolerance. The invention further includes a method for peers to receive and process these update instructions, ensuring that activity levels remain consistent across the network. This approach is particularly useful in applications requiring distributed tracking, such as peer-to-peer networks, collaborative systems, or decentralized monitoring frameworks. The system enhances efficiency by reducing redundant updates and minimizing communication overhead while maintaining data integrity.
4. The method of claim 3 , the message instructing each other peer to update its local level of activity counter comprising an instruction to update its local level of activity counter using one of a gain and a decay function.
This invention relates to peer-to-peer network systems where nodes monitor and update their activity levels to manage network efficiency. The problem addressed is ensuring accurate and dynamic tracking of peer activity to optimize resource allocation and reduce unnecessary communication overhead. The invention provides a method for updating a local level of activity counter in each peer node based on received messages from other peers. These messages contain instructions to adjust the counter using either a gain function or a decay function. The gain function increases the counter when a peer is actively participating in the network, while the decay function decreases it when the peer is inactive. This dynamic adjustment helps maintain up-to-date activity metrics, allowing the network to prioritize communication with active peers and reduce interactions with inactive ones. The method ensures that activity levels are continuously refined, improving overall network performance by adapting to real-time changes in peer behavior. The system avoids static thresholds, instead using mathematical functions to model activity trends, leading to more efficient resource utilization and reduced latency.
5. The method of claim 1 , wherein each other peer of the plurality of peers has associated information stored in a peers table, the peers table comprising a network address of each other peer of the plurality of peers.
A decentralized peer-to-peer (P2P) network system enables secure and efficient communication between multiple peers without relying on a central server. The system addresses challenges in traditional P2P networks, such as peer discovery, scalability, and maintaining up-to-date peer information. Each peer in the network stores a peers table containing the network addresses of other peers, allowing direct communication and data exchange. The peers table is dynamically updated as peers join or leave the network, ensuring real-time connectivity. This decentralized approach enhances resilience, reduces dependency on centralized infrastructure, and improves fault tolerance. The system may also include mechanisms for peer authentication, data encryption, and load balancing to further secure and optimize network operations. By maintaining a distributed directory of peer addresses, the system facilitates seamless peer discovery and communication, making it suitable for applications like file sharing, distributed computing, and real-time collaboration.
6. The method of claim 1 , updating the local level of activity counter further comprising storing a last update timestamp in a store comprising an entry for each local level of activity counter, including the updated local level of activity counter, maintained by the peer, each entry comprising client identification information comprising a client key, and the received service request having an associated client key.
A system and method for managing activity counters in a distributed computing environment involves tracking and updating local activity levels for peer nodes. The system addresses the challenge of efficiently monitoring and synchronizing activity levels across multiple peers in a network, ensuring accurate and up-to-date tracking of service requests and client interactions. The method includes updating a local activity counter for a peer node, where the counter reflects the level of activity associated with a received service request. The update process involves storing a timestamp indicating when the counter was last modified. This timestamp is maintained in a dedicated storage system that includes an entry for each local activity counter managed by the peer. Each entry contains client identification information, specifically a client key, which uniquely identifies the client associated with the service request. The received service request also includes an associated client key, allowing the system to correlate the request with the appropriate activity counter entry. By maintaining these timestamps and client keys, the system ensures that activity levels are accurately tracked and can be efficiently synchronized across the network. This approach enhances performance and reliability in distributed environments where multiple peers must coordinate their activity tracking.
7. The method of claim 6 , updating the local level of activity counter further comprising: retrieving, via the server computing device, the local level of activity counter's count value from the store using the client's associated client key; updating, via the server computing device, the retrieved count value of the local activity counter; and storing, via the server computing device and in the store's entry corresponding to the local level of activity counter, the updated count value of the local activity counter and an updated last update timestamp.
This invention relates to a system for tracking and updating activity levels of clients in a distributed computing environment. The problem addressed is the need for an efficient and secure way to monitor and update client activity levels while ensuring data consistency across multiple computing devices. The system includes a server computing device and a store for maintaining activity counters associated with clients. Each client is identified by a unique client key, which is used to retrieve and update the corresponding activity counter in the store. The activity counter tracks the level of activity for a client, and each entry in the store includes a count value and a last update timestamp. When updating the local level of activity counter, the server retrieves the current count value from the store using the client's associated client key. The server then updates the retrieved count value of the activity counter based on the client's activity. The updated count value and a new last update timestamp are then stored back in the store's entry corresponding to the activity counter. This ensures that the activity level is accurately reflected and that the timestamp is updated to reflect the most recent modification. The system ensures that activity tracking is synchronized and up-to-date, providing a reliable way to monitor client interactions in a distributed environment. The use of client keys and timestamps further enhances data integrity and consistency.
8. The method of claim 6 , the last update timestamp and a current time associated with the request being used in one of an exponential gain function, an exponential decay function, a linear gain function and a linear decay function to update the local level of activity counter's count value.
This invention relates to systems for tracking and updating activity levels in a distributed network, particularly for managing counters that reflect recent activity. The problem addressed is efficiently updating activity counters to reflect current usage patterns while minimizing computational overhead and network traffic. Traditional methods often rely on periodic updates or simple increment/decrement operations, which can either be too slow to reflect real-time changes or too resource-intensive. The invention describes a method for updating a local activity counter based on the time elapsed since the last update. The counter's value is adjusted using a mathematical function that considers both the last update timestamp and the current time of the request. The function can be an exponential gain function, exponential decay function, linear gain function, or linear decay function. These functions dynamically adjust the counter value to reflect recent activity more accurately. For example, an exponential decay function could reduce the counter value over time if no new activity occurs, while an exponential gain function could increase it more rapidly for recent activity. The choice of function depends on the specific requirements of the system, such as the desired responsiveness to new activity versus stability over time. This approach ensures that the counter remains relevant without requiring constant updates, improving efficiency and accuracy in distributed systems.
9. The method of claim 8 , the number of other peers are selected randomly.
A system and method for peer selection in a distributed network involves selecting a subset of peers from a larger group of available peers to participate in a network operation, such as data sharing or consensus. The selection process ensures that the chosen peers are diverse and representative of the network, improving reliability and security. In one implementation, the selection is performed by a coordinator node that identifies a pool of eligible peers based on predefined criteria, such as connectivity, computational capacity, or trustworthiness. The coordinator then randomly selects a subset of peers from this pool to participate in the operation. Random selection helps prevent bias and ensures fairness in peer participation. The method may also include verifying the selected peers' availability and performance before proceeding with the operation. This approach is particularly useful in decentralized systems where trust and fairness are critical, such as blockchain networks or peer-to-peer file-sharing systems. The random selection mechanism enhances security by making it difficult for malicious actors to predict or manipulate peer selection. The system may further include mechanisms to adjust the selection criteria dynamically based on network conditions or performance metrics.
10. The method of the claim 1 , the determining the number of other peers further comprising: determining, via the server computing device, a maximum number of packets; determining, via the server computing device, a peer count of the plurality of peers, including the peer, sharing level of activity information; determining, via the server computing device, an update amount using the determined peer count and the determined maximum number of packets; and selecting, via the server computing device, the number of other peers equal to the maximum number of packets.
This invention relates to a method for managing peer-to-peer (P2P) network communication, specifically optimizing the distribution of activity information among peers. In P2P networks, peers share activity information to coordinate tasks, but excessive sharing can lead to inefficiencies such as network congestion or unnecessary processing. The invention addresses this by dynamically determining the optimal number of peers to share activity information with, based on network constraints. The method involves a server computing device that first determines a maximum number of packets allowed for transmitting activity information. It then calculates the peer count, representing the number of peers currently sharing activity information. Using these values, the server computes an update amount, which balances the need for information distribution against network capacity. Finally, the server selects the number of other peers to share information with, ensuring it does not exceed the maximum packet limit. This approach prevents network overload while maintaining efficient peer coordination. The solution is particularly useful in large-scale P2P systems where managing communication overhead is critical.
11. The method of claim 10 , the message communicated to the number of other peers comprising the update amount.
A system and method for peer-to-peer network synchronization involves distributing updates among multiple peers to maintain consistency across the network. The problem addressed is ensuring efficient and reliable synchronization of data or state information in a decentralized environment where peers may have varying levels of connectivity or computational resources. The method includes determining an update amount, which represents the quantity or significance of changes to be synchronized, and communicating this update amount to a number of other peers in the network. The update amount may include metadata, partial data, or a full update, depending on the network conditions and peer capabilities. The communication process is optimized to minimize bandwidth usage and latency while ensuring that all relevant peers receive the necessary updates to maintain synchronization. The system may also prioritize updates based on their importance or urgency, further improving efficiency. This approach is particularly useful in distributed applications such as blockchain networks, collaborative editing systems, or real-time multiplayer gaming, where maintaining consistent state information across all participants is critical. The method ensures that peers can efficiently exchange updates without overwhelming the network or individual devices.
12. The method of claim 1 , the message is communicated using UDP (User Datagram Protocol).
A system and method for efficient data communication in networked environments addresses the problem of latency and overhead in traditional connection-oriented protocols. The invention provides a lightweight communication mechanism that minimizes setup time and resource consumption by using a connectionless protocol. Specifically, the method involves transmitting messages between networked devices without establishing a persistent connection, reducing delays and computational overhead. The system is particularly useful in applications requiring low-latency communication, such as real-time data streaming, IoT device coordination, and distributed computing. The method ensures reliable message delivery through error-checking mechanisms while maintaining the speed benefits of a connectionless approach. The invention also includes features for message prioritization, allowing critical data to be transmitted with higher urgency. Additionally, the system supports dynamic routing adjustments to optimize path selection based on network conditions. The use of a connectionless protocol, such as UDP, further enhances efficiency by eliminating the need for handshake procedures and persistent session management. This approach is particularly advantageous in environments with high device density or fluctuating network conditions, where traditional protocols may introduce unnecessary delays. The invention also includes mechanisms for handling message fragmentation and reassembly, ensuring data integrity even when messages are split into smaller packets for transmission. Overall, the system provides a scalable and efficient solution for low-latency communication in diverse networked applications.
13. A non-transitory computer-readable storage medium tangibly encoded with computer-executable instructions that when executed by a processor associated with a server computing device perform a method comprising: receiving, by a peer and from a computing device of a client over an electronic communications network, a message comprising an instruction to increment or decrement a level activity of counters; updating a message comprising an instruction to increment or decrement a level activity of counters; receiving a request from the client for a service; determining, based on the updated number of the local level of activity counter, whether the request corresponds to suspicious network activity, the determination comprising determining whether the updated number of the local level of activity counter satisfies a threshold; determining a number of other peers of a plurality of peers sharing level of activity information, the plurality of peers comprising the peer and the number of other peers excluding the peer; performing a second update of the number of the local level of activity counter when the threshold determination does not satisfy the threshold; and communicating, by the peer responsive to the request of the client for service, a message to each other peer of the number of other peers, without sending the peer's local level activity counter value, the communicated message instructing each other peer to update its local level of activity counter corresponding to the client to reflect the service request received by the peer.
This invention relates to network security, specifically detecting and mitigating suspicious client activity in a distributed system. The system uses a peer-to-peer architecture where multiple peers monitor and share activity levels of clients to identify potential threats. Each peer maintains a local counter tracking the activity level of a client, which is incremented or decremented based on received instructions. When a peer receives a service request from a client, it checks if the client's activity level exceeds a predefined threshold. If the threshold is not met, the peer updates its local counter and communicates with other peers, instructing them to update their own counters for the same client without sharing the actual counter value. This collaborative approach allows peers to collectively assess client behavior across the network, improving threat detection while preserving privacy. The system helps prevent malicious activities like brute-force attacks or excessive resource consumption by dynamically adjusting activity levels based on distributed observations. The method ensures efficient communication between peers, minimizing data exposure while maintaining coordinated monitoring.
14. The non-transitory computer-readable storage medium of claim 13 , further comprising: making, by the peer, a determination whether or not to perform the service requested by the client, the determination comprising using a number of the peer's local level of activity counters, including the level of activity counter, corresponding to the client and a throttling threshold.
This invention relates to peer-to-peer (P2P) network systems where peers provide services to clients, such as file sharing, computing tasks, or data storage. A common problem in such networks is ensuring fair resource allocation while preventing abuse, such as excessive requests from a single client that could degrade performance for other peers. The invention addresses this by implementing a throttling mechanism at the peer level. Each peer maintains local activity counters for each client, tracking the frequency or volume of service requests. When a client requests a service, the peer evaluates these counters against a predefined throttling threshold. If the client's activity exceeds the threshold, the peer may deny the request to prevent overuse. This ensures that no single client monopolizes the peer's resources, maintaining balanced network performance. The system dynamically adjusts service availability based on real-time activity data, allowing peers to self-regulate without centralized control. This approach improves fairness, reduces resource contention, and enhances overall network efficiency. The invention is particularly useful in decentralized systems where peers operate independently but must collaborate effectively.
15. The non-transitory computer-readable storage medium of claim 13 , further comprising: receiving, by the peer and over the electronic communications network from another peer of the plurality of peers, a message comprising an update instruction to update its local level of activity counter corresponding to the client; and updating, by the peer, the local level of activity counter in accordance with the received update instruction.
This invention relates to a distributed system for tracking client activity across multiple peers in a peer-to-peer network. The problem addressed is ensuring consistent and synchronized activity tracking for clients across decentralized nodes without relying on a central authority. The system involves peers maintaining local counters for client activity levels and synchronizing these counters through message exchanges. A peer receives a message from another peer in the network, where the message contains an update instruction for a local activity counter associated with a specific client. Upon receiving this instruction, the peer updates its local counter accordingly. This mechanism allows peers to dynamically adjust their records of client activity based on updates propagated through the network, ensuring consistency across the distributed system. The invention is part of a broader system where peers periodically exchange activity data to maintain synchronization, and the update instructions may include increments, decrements, or other modifications to the counter values. This approach enables efficient and scalable activity tracking in decentralized environments.
16. The non-transitory computer-readable storage medium of claim 13 , the local level of activity counter update further comprising storing a last update timestamp in a store comprising an entry for each local level of activity counter, including the updated local level of activity counter, maintained by the peer, each entry comprising client identification information comprising a client key, and the received service request having an associated client key.
A system for managing activity counters in a distributed computing environment tracks and updates local activity levels for peer nodes. The system addresses the challenge of efficiently monitoring and synchronizing activity levels across distributed peers to ensure accurate load balancing and resource allocation. Each peer maintains a local activity counter that is updated based on received service requests. When a service request is received, the peer updates its local activity counter and records a timestamp of the last update. The system stores this information in a data structure that includes an entry for each local activity counter, where each entry contains client identification information, such as a client key, and the updated counter value. The received service request also includes an associated client key, which is used to match and update the corresponding entry in the store. This ensures that activity levels are tracked per client, allowing for fine-grained monitoring and management of peer activity. The timestamp helps in maintaining the recency of updates, enabling the system to prioritize or adjust resource allocation based on the most recent activity. The system improves efficiency by reducing redundant updates and ensuring that activity data remains current and accurate.
17. The non-transitory computer-readable storage medium of claim 16 , the local level of activity counter update further comprising: retrieving the local level of activity counter's count value from the store using the client's associated client key; updating the retrieved count value of the local activity counter; and storing, in the store's entry corresponding to the local level of activity counter, the updated count value of the local activity counter and an updated last update timestamp.
A system for managing activity counters in a distributed computing environment tracks and updates activity levels for clients. The system addresses the challenge of maintaining accurate and synchronized activity counters across multiple clients and servers, ensuring consistency and reliability in distributed systems. The system includes a store that holds entries for local activity counters, each associated with a client key. When updating a local activity counter, the system retrieves the current count value and last update timestamp from the store using the client's key. The count value is then updated based on the client's activity, and the modified count value along with a new timestamp is stored back in the corresponding entry. This process ensures that the activity counter reflects the latest activity level while maintaining a record of when the last update occurred. The system supports efficient and consistent tracking of client activities in distributed environments, enabling accurate monitoring and management of resource usage or user interactions.
18. The non-transitory computer-readable storage medium of claim 16 , the last update timestamp and a current time associated with the request being used in one of an exponential gain function, an exponential decay function, a linear gain function and a linear decay function to update the local level of activity counter's count value.
This invention relates to systems for tracking and updating activity levels in a distributed computing environment. The problem addressed is efficiently managing and updating activity counters in a way that reflects recent activity while accounting for time-based decay or growth. The system involves a non-transitory computer-readable storage medium storing instructions that, when executed, perform operations to update a local level of activity counter. The counter is associated with a specific entity, such as a node or resource, and its count value is adjusted based on the last update timestamp and the current time of a request. The adjustment uses one of four mathematical functions: exponential gain, exponential decay, linear gain, or linear decay. These functions determine how the count value changes over time, allowing the system to prioritize recent activity or gradually reduce the influence of older activity. The choice of function depends on the desired behavior, such as emphasizing recent interactions or gradually diminishing past activity. This approach ensures that the activity counter accurately reflects the current relevance or usage of the associated entity, improving resource management and decision-making in distributed systems.
19. The non-transitory computer-readable storage medium of claim 13 , determination of the number of other peers further comprising: determining a maximum number of packets; determining a peer count of the plurality of peers, including the peer, sharing level of activity information; determining an update amount using the determined peer count and the determined maximum number of packets; and selecting the number of other peers equal to the maximum number of packets.
This invention relates to peer-to-peer (P2P) network communication systems, specifically optimizing the distribution of level of activity information among peers. In P2P networks, peers share activity data to coordinate tasks, but excessive communication can cause inefficiency. The invention addresses this by dynamically determining the optimal number of peers to share activity information with, balancing network load and data accuracy. The system determines a maximum number of packets that can be transmitted without overloading the network. It then counts the peers currently sharing activity information, including the local peer. Using these values, it calculates an update amount that represents how frequently activity information should be shared. The number of other peers to share with is set to the maximum number of packets, ensuring efficient distribution without excessive communication. This method prevents network congestion while maintaining sufficient data exchange for coordination. The invention also includes a non-transitory computer-readable storage medium storing instructions for performing these steps, ensuring the solution is implementable in software. By dynamically adjusting peer selection based on network capacity and current peer count, the system optimizes P2P communication efficiency.
20. A computing device comprising: a processor; a non-transitory storage medium for tangibly storing thereon program logic for execution by the processor, the program logic comprising: logic executed by the processor for receiving, by a peer and from a computing device of a client over an electronic communications network, a message comprising an instruction to increment or decrement a level activity of counters; logic executed by the processor for updating a number of the local level of activity counter that corresponds to the client; logic executed by the processor for receiving a request from the client for a service; logic executed by the processor for determining, based on the updated number of the local level of activity counter, whether the request corresponds to suspicious network activity, the determination comprising determining whether the updated number of the local level of activity counter satisfies a threshold; logic executed by the processor for determined a number of other peers of the peer from a plurality of peers sharing level of activity information, the plurality of peers comprising the peer and the number of other peers excluding the peer; logic executed by the processor for performing a second update of the number of the local level of activity counter when the threshold determination does not satisfy the threshold; and logic executed by the processor for communicating, by the peer and responsive to the request of the client for service, a message to each other peer of the number of other peers, without sending the peer's local level activity counter value, the communicated message instructing each other peer to update its local level of activity counter corresponding to the client to reflect the service request received by the peer.
A computing device monitors and detects suspicious network activity by tracking client interactions through distributed counters. The device includes a processor and a storage medium storing program logic for managing activity counters. When a peer device receives a message from a client over a network, it updates a local counter corresponding to that client. If the client requests a service, the peer evaluates the updated counter value against a threshold to determine if the activity is suspicious. If the threshold is not met, the peer updates the counter again and communicates with other peers in a network to propagate the service request without sharing its own counter value. Each peer updates its local counter for the client based on the received request, enabling collaborative monitoring of client behavior across multiple devices. This distributed approach allows for decentralized detection of suspicious activity while maintaining privacy of individual counter values. The system helps identify potential threats by analyzing aggregated activity patterns without centralized data collection.
Unknown
September 15, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.