blob: 213eb22b443ec87426ea14c9f3cca0b0617b44da (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
// -*- C++ -*-
// $Id$
// ============================================================================
//
// = LIBRARY
// orbsvcs
//
// = FILENAME
// Minimum_Dispersion_Strategy.h
//
// = AUTHOR
// Ossama Othman <ossama@uci.edu>
//
// ============================================================================
#ifndef MINIMUM_DISPERSION_H
#define MINIMUM_DISPERSION_H
#include "LoadBalancing_Strategy.h"
#include "orbsvcs/LoadBalancingS.h"
#include "ace/Containers.h"
// @@ Ossama: my class names suck too, any idea on what would be a
// good name for this strategy? It basically tries to keep all the
// loads "close to the average", if one server is much higher than
// the load it is deemed too loaded and the advisory is sent.
// Forward declarations
class ReplicaProxy_Impl;
typedef ACE_Unbounded_Set<ReplicaProxy_Impl *> ReplicaProxySet;
typedef ACE_Unbounded_Set_Iterator<ReplicaProxy_Impl *> ReplicaProxySetIterator;
class TAO_LoadBalancing_Export Minimum_Dispersion_Strategy : public Load_Balancing_Strategy
{
// = TITLE
// Round Robin load balancing strategy
// = DESCRIPTION
// Simple load balancing strategy that causes requests to be
// forwarded to next Replica in the set, i.e. in a "round robin"
// fashion.
public:
Minimum_Dispersion_Strategy (void);
// Constructor.
~Minimum_Dispersion_Strategy (void);
// Destructor
// = The Load_Balancing_Strategy methods
virtual CORBA::Object_ptr replica (CORBA_Environment &ACE_TRY_ENV);
virtual int insert (ReplicaProxy_Impl *);
virtual int remove (ReplicaProxy_Impl *);
virtual void load_changed (ReplicaProxy_Impl *,
CORBA::Environment &ACE_TRY_ENV);
private:
ReplicaProxySet proxies_;
// Set containing the ReplicaProxy servants.
};
#endif /* MINIMUM_DISPERSION_H */
|
