mirror of
				https://github.com/TeaOSLab/EdgeCommon.git
				synced 2025-11-04 13:10:24 +08:00 
			
		
		
		
	
		
			
	
	
		
			81 lines
		
	
	
		
			1.7 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
		
		
			
		
	
	
			81 lines
		
	
	
		
			1.7 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| 
								 | 
							
								package scheduling
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
								import (
							 | 
						||
| 
								 | 
							
									"github.com/TeaOSLab/EdgeCommon/pkg/serverconfigs/shared"
							 | 
						||
| 
								 | 
							
									"github.com/iwind/TeaGo/lists"
							 | 
						||
| 
								 | 
							
									"github.com/iwind/TeaGo/maps"
							 | 
						||
| 
								 | 
							
									"sync"
							 | 
						||
| 
								 | 
							
								)
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
								// 轮询调度算法
							 | 
						||
| 
								 | 
							
								type RoundRobinScheduling struct {
							 | 
						||
| 
								 | 
							
									Scheduling
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
									rawWeights     []uint
							 | 
						||
| 
								 | 
							
									currentWeights []uint
							 | 
						||
| 
								 | 
							
									count          uint
							 | 
						||
| 
								 | 
							
									index          uint
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
									locker sync.Mutex
							 | 
						||
| 
								 | 
							
								}
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
								// 启动
							 | 
						||
| 
								 | 
							
								func (this *RoundRobinScheduling) Start() {
							 | 
						||
| 
								 | 
							
									lists.Sort(this.Candidates, func(i int, j int) bool {
							 | 
						||
| 
								 | 
							
										c1 := this.Candidates[i]
							 | 
						||
| 
								 | 
							
										c2 := this.Candidates[j]
							 | 
						||
| 
								 | 
							
										return c1.CandidateWeight() > c2.CandidateWeight()
							 | 
						||
| 
								 | 
							
									})
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
									for _, c := range this.Candidates {
							 | 
						||
| 
								 | 
							
										weight := c.CandidateWeight()
							 | 
						||
| 
								 | 
							
										if weight == 0 {
							 | 
						||
| 
								 | 
							
											weight = 1
							 | 
						||
| 
								 | 
							
										} else if weight > 10000 {
							 | 
						||
| 
								 | 
							
											weight = 10000
							 | 
						||
| 
								 | 
							
										}
							 | 
						||
| 
								 | 
							
										this.rawWeights = append(this.rawWeights, weight)
							 | 
						||
| 
								 | 
							
									}
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
									this.currentWeights = append([]uint{}, this.rawWeights...)
							 | 
						||
| 
								 | 
							
									this.count = uint(len(this.Candidates))
							 | 
						||
| 
								 | 
							
								}
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
								// 获取下一个候选对象
							 | 
						||
| 
								 | 
							
								func (this *RoundRobinScheduling) Next(call *shared.RequestCall) CandidateInterface {
							 | 
						||
| 
								 | 
							
									if this.count == 0 {
							 | 
						||
| 
								 | 
							
										return nil
							 | 
						||
| 
								 | 
							
									}
							 | 
						||
| 
								 | 
							
									this.locker.Lock()
							 | 
						||
| 
								 | 
							
									defer this.locker.Unlock()
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
									if this.index > this.count-1 {
							 | 
						||
| 
								 | 
							
										this.index = 0
							 | 
						||
| 
								 | 
							
									}
							 | 
						||
| 
								 | 
							
									weight := this.currentWeights[this.index]
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
									// 已经一轮了,则重置状态
							 | 
						||
| 
								 | 
							
									if weight == 0 {
							 | 
						||
| 
								 | 
							
										if this.currentWeights[0] == 0 {
							 | 
						||
| 
								 | 
							
											this.currentWeights = append([]uint{}, this.rawWeights...)
							 | 
						||
| 
								 | 
							
										}
							 | 
						||
| 
								 | 
							
										this.index = 0
							 | 
						||
| 
								 | 
							
										weight = this.currentWeights[this.index]
							 | 
						||
| 
								 | 
							
									}
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
									c := this.Candidates[this.index]
							 | 
						||
| 
								 | 
							
									this.currentWeights[this.index] --
							 | 
						||
| 
								 | 
							
									this.index++
							 | 
						||
| 
								 | 
							
									return c
							 | 
						||
| 
								 | 
							
								}
							 | 
						||
| 
								 | 
							
								
							 | 
						||
| 
								 | 
							
								// 获取简要信息
							 | 
						||
| 
								 | 
							
								func (this *RoundRobinScheduling) Summary() maps.Map {
							 | 
						||
| 
								 | 
							
									return maps.Map{
							 | 
						||
| 
								 | 
							
										"code":        "roundRobin",
							 | 
						||
| 
								 | 
							
										"name":        "RoundRobin轮询算法",
							 | 
						||
| 
								 | 
							
										"description": "根据权重,依次分配后端服务器",
							 | 
						||
| 
								 | 
							
										"networks":    []string{"http", "tcp"},
							 | 
						||
| 
								 | 
							
									}
							 | 
						||
| 
								 | 
							
								}
							 |