mirror of
https://github.com/livekit/livekit.git
synced 2026-03-30 22:05:39 +00:00
a8d4df66f4
* Added optional "Power of Two Random Choices" algorithm for the node selector sort_by feature. The current, default behavior of picking the lowest-valued node remains.
56 lines
1.5 KiB
Go
56 lines
1.5 KiB
Go
// Copyright 2023 LiveKit, Inc.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package selector
|
|
|
|
import (
|
|
"github.com/livekit/protocol/livekit"
|
|
)
|
|
|
|
// CPULoadSelector eliminates nodes that have CPU usage higher than CPULoadLimit
|
|
// then selects a node from nodes that are not overloaded
|
|
type CPULoadSelector struct {
|
|
CPULoadLimit float32
|
|
SortBy string
|
|
Algorithm string
|
|
}
|
|
|
|
func (s *CPULoadSelector) filterNodes(nodes []*livekit.Node) ([]*livekit.Node, error) {
|
|
nodes = GetAvailableNodes(nodes)
|
|
if len(nodes) == 0 {
|
|
return nil, ErrNoAvailableNodes
|
|
}
|
|
|
|
nodesLowLoad := make([]*livekit.Node, 0)
|
|
for _, node := range nodes {
|
|
stats := node.Stats
|
|
if stats.CpuLoad < s.CPULoadLimit {
|
|
nodesLowLoad = append(nodesLowLoad, node)
|
|
}
|
|
}
|
|
if len(nodesLowLoad) > 0 {
|
|
nodes = nodesLowLoad
|
|
}
|
|
return nodes, nil
|
|
}
|
|
|
|
func (s *CPULoadSelector) SelectNode(nodes []*livekit.Node) (*livekit.Node, error) {
|
|
nodes, err := s.filterNodes(nodes)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
return SelectSortedNode(nodes, s.SortBy, s.Algorithm)
|
|
}
|