Destination Hashing Scheduling - Revision history

Wensong at 15:30, 17 June 2007

2007-06-17T15:30:31Z

Wensong: add pseudo code

2007-06-17T15:29:17Z

add pseudo code

Wensong at 10:47, 20 July 2005

2005-07-20T10:47:21Z

New page

The destination hashing scheduling algorithm assigns network connections to the servers through looking up a statically assigned hash table by their destination IP addresses.

[[Category:Job Scheduling Algorithms]]

@@ Line 9: / Line 9: @@
         return n;
   Notes that servernode is a 256-bucket hash table that maps the hash
   index derived from packet destination IP address to the current server

← Older revision		Revision as of 15:29, 17 June 2007
Line 1:		Line 1:
	The destination hashing scheduling algorithm assigns network connections to the servers through looking up a statically assigned hash table by their destination IP addresses.		The destination hashing scheduling algorithm assigns network connections to the servers through looking up a statically assigned hash table by their destination IP addresses.
		+
		+	The DH scheduling algorithm is to select server by the hash key of destination IP address. The pseudo code is as follows:
		+
		+	n <- servernode[dest_ip];
		+	if (n is dead) OR
		+	(n is overloaded, such as n.conns>2*n.weight) then
		+	return NULL;
		+
		+	return n;
		+	Notes that servernode is a 256-bucket hash table that maps the hash
		+	index derived from packet destination IP address to the current server
		+	array.
		+
		+	If the dh scheduler is used in cache cluster, it is good to
		+	combine it with cache_bypass feature. When the statically assigned
		+	server is dead or overloaded, the load balancer can bypass the cache
		+	server and send requests to the original server directly.

	[[Category:Job Scheduling Algorithms]]		[[Category:Job Scheduling Algorithms]]