-
公开(公告)号:US12200051B2
公开(公告)日:2025-01-14
申请号:US18275967
申请日:2022-01-19
Applicant: SHANGHAI BILIBILI TECHNOLOGY CO., LTD.
Inventor: Jun Jiang , Junwei Zhu , Yongfang Qin
IPC: H04L67/1074 , H04L67/104
Abstract: Embodiments of this application provides a peer-to-peer network scheduling method. The method includes: obtaining a fragment file list, where the fragment file list includes information about a plurality of fragment files, each fragment file includes one or more segments, and each segment corresponds to one segment number; downloading one or more target segments corresponding to one or more target segment numbers from a CDN server based on the fragment file list and the one or more target segment numbers, where the one or more target segment numbers are located in a target segment list; adjusting the target segment list based on information about data obtained from and/or sent to another client device, to obtain an adjusted target segment list; and downloading one or more target segments corresponding to one or more target segment numbers in the adjusted target segment list from the CDN server.
-
公开(公告)号:US12200040B2
公开(公告)日:2025-01-14
申请号:US17681474
申请日:2022-02-25
Applicant: TurbineOne, Inc.
Inventor: Matthew Warren Amacker , Ian Jay Kalin
IPC: G06F15/16 , G06F9/48 , G06F9/50 , H04L67/04 , H04L67/10 , H04L67/1004 , H04L67/104 , H04L67/1074 , H04L67/1095 , H04L67/14 , H04L67/60
Abstract: The nodes of a squad of nodes include a coordinating node and a set of worker nodes for sharing computational resources to perform resource intensive tasks. A requesting worker node may send work requests to the coordinating node of a squad of nodes. In response to a work request, the requesting worker node receives from the coordinating node a list of worker nodes to assign one or more tasks associated with the work request. The list of worker nodes is selected based on a report of resources and current utilization of each node within the squad. Upon receiving the list of workers, the requesting worker node divides the tasks associated with the work request into multiple buckets, assigns each bucket to a worker node form the list of worker nodes, and sends a request to process tasks from each of the buckets to the corresponding worker node.
-
公开(公告)号:US20250007996A1
公开(公告)日:2025-01-02
申请号:US18883184
申请日:2024-09-12
Applicant: ONEPATONT SOFTWARE LTD
Inventor: Yogesh Chunilal Rathod
IPC: H04L67/55 , G06F3/0482 , G06F8/61 , G06F8/65 , G06F16/182 , G06F16/242 , G06F16/27 , G06F16/28 , G06F16/33 , G06F16/40 , G06F16/48 , G06F16/951 , G06F16/9535 , G06F16/9536 , G06F16/9538 , G06Q10/00 , G06Q10/10 , G06Q20/10 , G06Q20/12 , G06Q20/14 , G06Q20/32 , G06Q30/02 , G06Q30/0241 , G06Q30/0242 , G06Q30/0251 , G06Q30/0282 , G06Q50/00 , G06Q50/18 , H04L9/40 , H04L12/18 , H04L51/046 , H04L51/066 , H04L51/214 , H04L51/216 , H04L51/48 , H04L51/52 , H04L67/00 , H04L67/02 , H04L67/10 , H04L67/104 , H04L67/1074 , H04L67/306 , H04L67/50 , H04W4/60
Abstract: In a method, system, and computer readable medium for distributing messages in a network environment, a message distribution system receives, from a device of a first user who is a follower of the second use, a selection of a plurality of communications endpoints for receiving messages from the second user. The system stores the selection in a storage. The system later receives, from a device of the second user, a message for distribution to one or more unspecified recipients. The system identifies the followers of the second user (including the first user) as recipients of the message, and identifies the plurality of communications endpoints selected by the first user. The system then sends the message to the followers of the second user, including the first user, sending including sending the message to each of the plurality of communications endpoints selected by the first user.
-
公开(公告)号:US20240413972A1
公开(公告)日:2024-12-12
申请号:US18595850
申请日:2024-03-05
Applicant: Experian Information Solutions, Inc.
Inventor: Vijay Mehta , Alexander Phan
IPC: H04L9/06 , H04L9/08 , H04L9/16 , H04L67/1074
Abstract: Features for providing a secure method of symmetric encryption for private smart contacts among multiple parties in a private peer-to-peer network. The features include a master key representing a unique blockchain ledger. The master key may be shared among multiple participants in a private peer-to-peer network. Sharing of the master key may include communicating the master key in an encrypted message (e.g., email) using public key infrastructure (PKI). In some implementations, more complex distribution features may be includes such as quantum entanglement. The features support instantiation of a smart contract using a specific master key. The request may be submitted as an entry to the ledger with appropriate metadata and/or payload information for identifying and processing the request.
-
公开(公告)号:US12099522B2
公开(公告)日:2024-09-24
申请号:US18151233
申请日:2023-01-06
Applicant: Shanghai Tree-Graph Blockchain Institute
Inventor: Guang Yang , Chenxing Li , Fengyu Zhang , Ming Wu , Fan Long , Peilun Li
IPC: G06F16/27 , G06F16/28 , H04L67/1042 , H04L67/1074
CPC classification number: G06F16/27 , G06F16/282 , H04L67/1042 , H04L67/1074
Abstract: The method includes: performing blockchain storage area allocation for transaction broadcast data; establishing a peer-to-peer transmission mechanism and a trust mechanism between nodes by the blockchain; acquiring network transaction broadcast data that needs to be subjected to blockchain storage; and recording, storing and managing the network transaction broadcast data; where the network transaction broadcast data is managed by dividing blockchain data into hot data and cold data; the hot data is stored in each of the blockchain nodes; and the cold data is divided into N parts to be correspondingly stored in N nodes of the blockchain nodes; and the hot data is data that needs to be frequently accessed by computing nodes, and the cold data is data that is infrequently accessed.
-
公开(公告)号:US12069128B2
公开(公告)日:2024-08-20
申请号:US17352065
申请日:2021-06-18
Applicant: Amazon Technologies, Inc.
Inventor: Jonathan Daly Einkauf , Luca Natali , Bhargava Ram Kalathuru , Saurabh Dileep Baji , Abhishek Rajnikant Sinha
IPC: H04L41/0893 , G06F9/50 , H04L41/0894 , H04L41/0897 , H04L41/22 , H04L41/5041 , H04L43/0876 , H04L67/10 , H04L67/1031 , H04L67/1074
CPC classification number: H04L67/1076 , G06F9/5077 , G06F9/5083 , H04L41/0893 , H04L41/0894 , H04L41/0897 , H04L41/22 , H04L41/5045 , H04L43/0876 , H04L67/10 , H04L67/1031
Abstract: A service provider may apply customer-selected or customer-defined auto-scaling policies to a cluster of resources (e.g., virtualized computing resource instances or storage resource instances in a MapReduce cluster). Different policies may be applied to different subsets of cluster resources (e.g., different instance groups containing nodes of different types or having different roles). Each policy may define an expression to be evaluated during execution of a distributed application, a scaling action to take if the expression evaluates true, and an amount by which capacity should be increased or decreased. The expression may be dependent on metrics emitted by the application, cluster, or resource instances by default, metrics defined by the client and emitted by the application, or metrics created through aggregation. Metric collection, aggregation and rules evaluation may be performed by a separate service or by cluster components. An API may support auto-scaling policy definition.
-
公开(公告)号:US20240267426A1
公开(公告)日:2024-08-08
申请号:US18615899
申请日:2024-03-25
Applicant: Clostra, Inc.
Inventor: Stanislav SHALUNOV , Gregory HAZEL
IPC: H04L67/1074 , H04L9/32 , H04L67/1087 , H04L67/568 , H04W4/70 , H04W4/80
CPC classification number: H04L67/1074 , H04L9/3247 , H04L67/1091 , H04L67/568 , H04W4/70 , H04W4/80
Abstract: A method and apparatus of a device that downloads content to a local device using a decentralized content distribution network is described. In an exemplary embodiment, the device receives a request from an application to download content using the decentralized content distribution network. In addition, the device determines a plurality of nodes in the decentralized content distribution network to download the content. For each of the plurality of nodes, the device attempts to establish communications between the device and that node. In addition, the device downloads a portion of the content from that node if communication is established between the local device and that node, wherein the size of the portion is based on at least a characteristic of that node. Furthermore, the device downloads a portion of the content from a proxy if communication cannot be established between the local device and that node, wherein the size of the portion is based on at least a characteristic of that proxy.
-
公开(公告)号:US12003568B2
公开(公告)日:2024-06-04
申请号:US18138093
申请日:2023-04-23
Applicant: BRIGHT DATA LTD.
Inventor: Derry Shribman , Ofer Vilenski
IPC: H04L67/01 , H04L41/046 , H04L67/02 , H04L67/1001 , H04L67/1023 , H04L67/1061 , H04L67/1074 , H04L67/142 , H04L67/50 , H04L67/563 , H04L67/564
CPC classification number: H04L67/01 , H04L41/046 , H04L67/1001 , H04L67/1023 , H04L67/1063 , H04L67/108 , H04L67/142 , H04L67/535 , H04L67/563 , H04L67/564 , H04L67/02
Abstract: A system designed for increasing network communication speed for users, while lowering network congestion for content owners and ISPs. The system employs network elements including an acceleration server, clients, agents, and peers, where communication requests generated by applications are intercepted by the client on the same machine. The IP address of the server in the communication request is transmitted to the acceleration server, which provides a list of agents to use for this IP address. The communication request is sent to the agents. One or more of the agents respond with a list of peers that have previously seen some or all of the content which is the response to this request (after checking whether this data is still valid). The client then downloads the data from these peers in parts and in parallel, thereby speeding up the Web transfer, releasing congestion from the Web by fetching the information from multiple sources, and relieving traffic from Web servers by offloading the data transfers from them to nearby peers.
-
公开(公告)号:US12003567B2
公开(公告)日:2024-06-04
申请号:US18112578
申请日:2023-02-22
Applicant: BRIGHT DATA LTD.
Inventor: Derry Shribman , Ofer Vilenski
IPC: H04L67/01 , H04L41/046 , H04L67/02 , H04L67/1001 , H04L67/1023 , H04L67/1061 , H04L67/1074 , H04L67/142 , H04L67/50 , H04L67/563 , H04L67/564
CPC classification number: H04L67/01 , H04L41/046 , H04L67/1001 , H04L67/1023 , H04L67/1063 , H04L67/108 , H04L67/142 , H04L67/535 , H04L67/563 , H04L67/564 , H04L67/02
Abstract: A system designed for increasing network communication speed for users, while lowering network congestion for content owners and ISPs. The system employs network elements including an acceleration server, clients, agents, and peers, where communication requests generated by applications are intercepted by the client on the same machine. The IP address of the server in the communication request is transmitted to the acceleration server, which provides a list of agents to use for this IP address. The communication request is sent to the agents. One or more of the agents respond with a list of peers that have previously seen some or all of the content which is the response to this request (after checking whether this data is still valid). The client then downloads the data from these peers in parts and in parallel, thereby speeding up the Web transfer, releasing congestion from the Web by fetching the information from multiple sources, and relieving traffic from Web servers by offloading the data transfers from them to nearby peers.
-
公开(公告)号:US12003566B2
公开(公告)日:2024-06-04
申请号:US18112572
申请日:2023-02-22
Applicant: BRIGHT DATA LTD.
Inventor: Derry Shribman , Ofer Vilenski
IPC: H04L67/01 , H04L41/046 , H04L67/02 , H04L67/1001 , H04L67/1023 , H04L67/1061 , H04L67/1074 , H04L67/142 , H04L67/50 , H04L67/563 , H04L67/564
CPC classification number: H04L67/01 , H04L41/046 , H04L67/1001 , H04L67/1023 , H04L67/1063 , H04L67/108 , H04L67/142 , H04L67/535 , H04L67/563 , H04L67/564 , H04L67/02
Abstract: A system designed for increasing network communication speed for users, while lowering network congestion for content owners and ISPs. The system employs network elements including an acceleration server, clients, agents, and peers, where communication requests generated by applications are intercepted by the client on the same machine. The IP address of the server in the communication request is transmitted to the acceleration server, which provides a list of agents to use for this IP address. The communication request is sent to the agents. One or more of the agents respond with a list of peers that have previously seen some or all of the content which is the response to this request (after checking whether this data is still valid). The client then downloads the data from these peers in parts and in parallel, thereby speeding up the Web transfer, releasing congestion from the Web by fetching the information from multiple sources, and relieving traffic from Web servers by offloading the data transfers from them to nearby peers.
-
-
-
-
-
-
-
-
-