Electrical computers and digital processing systems: multicomput – Computer conferencing
Reexamination Certificate
2000-07-06
2004-07-13
Geckil, Mehmet B. (Department: 2142)
Electrical computers and digital processing systems: multicomput
Computer conferencing
C718S105000
Reexamination Certificate
active
06763372
ABSTRACT:
TECHNICAL FIELD
The present invention relates to the field of computer network servers. More particularly, the present invention relates to a method for determining and balancing loads among a plurality of servers.
BACKGROUND OF THE INVENTION
In a conventional cluster of chat servers, the load presented by users connecting to new and existing channels is unpredictable. Consequently, some of the chat servers of the cluster may become overloaded, while other chat servers may be significantly underutilized.
What is needed is a technique for predicting the load presented by new users connecting to new and existing channels of a server cluster and using the predicted load for balancing and distributing users among the servers of the server cluster.
SUMMARY OF THE INVENTION
The present invention provides a technique for predicting the load presented by new users connecting to new and existing channels of a server cluster and using the predicted load for balancing and distributing users among the servers of the server cluster. The present invention uses a measure of past and current load patterns to assign channels in a balanced manner among the servers of a chat server cluster.
The advantages of the present invention are provided by a method for determining a load distribution for a plurality of servers. A total user count at periodic time-slices is received from each server of a plurality of servers. A load gradient is then calculated for a predetermined interval of time for each server of the plurality of servers. A present load distribution is determined for the predetermined interval of time for each respective server of the plurality of servers based on the total user count received from each server. A future load distribution is determined for each respective channel resource for each respective server based on the total user count for each server and the respective load gradient. Lastly, new channel resources are distributed among the plurality of servers based on the determined future load distribution for each server. According to the invention, the predetermined interval of time is a sliding window of time having a predetermined number of timeslots each having a predetermined timeslot interval. Preferably, the sliding window of time spans about 60 seconds and the predetermined timeslot interval is about 5 seconds. Additionally, a load gradient for a server is based on a difference between the total number of users connected to the server at the end of the predetermined interval of time and the total number of users connected to the server at the beginning of the predetermined interval of time. When a new channel resource is created, the new channel is assigned to a selected server of the plurality of servers based on the load distribution associated with each respective server of the plurality of servers. The channel resource is assigned an initial estimated weight that is credited to the current server at the current timeslot.
REFERENCES:
patent: 6259705 (2001-07-01), Takahashi et al.
patent: 6314465 (2001-11-01), Paul et al.
patent: 6560717 (2003-05-01), Scott et al.
patent: 6578077 (2003-06-01), Rakoshitz et al.
patent: 6675199 (2004-01-01), Mohammed et al.
patent: 6675217 (2004-01-01), Dani et al.
Dani Nishant V.
Mohammed Farookh P.
LandOfFree
Load balancing of chat servers based on gradients does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Load balancing of chat servers based on gradients, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Load balancing of chat servers based on gradients will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3197556