ORCHESTRATED NODE REMOVAL TO REDUCE CLUSTER CAPACITY IN A CLUSTERED FILE SYSTEM

    公开(公告)号:US20240357006A1

    公开(公告)日:2024-10-24

    申请号:US18304051

    申请日:2023-04-20

    摘要: The technology described herein is directed towards automating/orchestrating removal of one or more nodes of a node cluster, including in a cloud computing environment in which nodes in a cluster map to deployed virtual machines. An automated workflow can be started based on user input specifying an amount of capacity to remove, which corresponds to one or more nodes to remove. In a node cluster with associated nodes arranged into pools of nodes, node removal is per node pool. An orchestrated workflow performs pre-validation based on satisfying appropriate removal criteria, followed by data move and node removal jobs, and post-validation to check that removed capacity is generally as specified and that the remaining node layout is appropriate. Data of any removed node is re-protected, such as by restoring data from removed nodes to remaining cluster nodes in a manner that maintains the data with a data protection scheme.

    Server-side prediction of media client steady state

    公开(公告)号:US12088657B2

    公开(公告)日:2024-09-10

    申请号:US17959807

    申请日:2022-10-04

    发明人: William R. Law

    摘要: A method of delivering a media stream in a network having first and second media servers each capable of delivering segmented media content to a requesting media client. The network provides for HTTP-based delivery of segmented media, and the media client is supported on a client-side device. The method begins by associating the media client with the first media server. As the first server receives from the media client request for media content segments, request times for a given number of the most-recent segments requested are used to generate a prediction, by the first server, of when the media client has transitioned from a start-up or buffering state, to a steady state. In response to a new segment request being received, and upon the first server predicting that the media client has completed a transition to steady state, the new segment request is redirected to the second media server.

    SERVICE REQUEST PROCESSING METHOD, RELATED APPARATUS, AND STORAGE MEDIUM

    公开(公告)号:US20240223647A1

    公开(公告)日:2024-07-04

    申请号:US18561706

    申请日:2022-04-20

    发明人: Li Zhang Jia Yu

    IPC分类号: H04L67/1008

    CPC分类号: H04L67/1008

    摘要: A method and an apparatus for processing a service request, and a storage medium are provided. The method includes: determining a target time period based on a time instant when a first server is switched to a second server; acquiring log data in the target time period; acquiring a first service request and a second service request; determining whether the first service request is associated with the second service request; determining, in a case that the first service request is associated with the second service request, whether an operation object of the first service request is same as an operation object of the second service request; and determining, in a case that the operation object of the first service request is different from the operation object of the second service request, that the operation object of the second service request is incorrect.

    System and method for load balancing in a multitenant environment

    公开(公告)号:US12003578B2

    公开(公告)日:2024-06-04

    申请号:US18161695

    申请日:2023-01-30

    IPC分类号: G06F15/16 H04L67/1008

    CPC分类号: H04L67/1008

    摘要: Embodiments provide systems and methods to load balance using tenant affinities. A method includes configuring a load balancer with a set of tenant affinities, the set of tenant affinities including a tenant affinity for each of a plurality of tenants with respect to each of a plurality of computing nodes that provide services to users in a multitenant environment. Load balancing may include receiving a user request, associated with a tenant, for a service provided by the computing nodes, determining a highest tenant affinity computing node for the tenant using the set of tenant affinities and directing the user request to the highest tenant affinity computing node for the tenant.