[转]Nginx hash Module

导读:

  本模块由第三方提供,不包含在 Nginx 的源码发布版中。安装介绍等请看 这里.

  The upstream_hash module provides simple upstream load distribution by hashing a configurable variable (e.g., the request URI, incoming HTTP headers, or some combination). Example usage:

  1

  2

  3

  4

  5

  upstream backend {

server server1;

server server2;

hash $request_uri;

}



  Here, Nginx will choose server1 or server2 by hashing the request URI ($request_uri).

  指令

  hash

  hash_method

  hash_again

  hash

  语法: hash $variable

  作用域: upstream

  Enables upstream hashing of $variable.

  When present, the "server" directives cannot take any arguments ("weight", "max_fails", etc.).

  hash_method

  语法: hash_method [ crc32 | simple ]

  默认值: simple

  作用域: upstream

  The hash algorithm to use. "crc32" takes the last 15 bits of the crc32 value and modulo's by the number of servers. (This behavior is compatible with libmemcache.) "simple" is described below.

  hash_again

  语法: hash_again number

  默认值: 0

  作用域: upstream

  Number of times to rehash the value and choose a different server if the backend connection fails. Increase this number to provide high availability.

  Installation

  This module is not distributed with the Nginx source. You can download the request_hash module here: nginx_upstream_hash-0.2.tar.gz

  After extracting, you will need to patch the latest Nginx source (0.5.21 as of this writing). Run patch like this:

  1

  2

  cd nginx-0.5.21

patch -p0


  Then add the following option to your Nginx ./configure command:

  1 --add-module=path/to/upstream/hash/directory



  Then "make" and "make install" as usual.

  The "simple" hash algorithm

  The "simple" hash algorithm is the same as that used for Nginx's internal hash tables. The function is:

  1

  2

  3

  4

  5

  6

  7

  8

  9

  10

  11

  12

  13

  14

  15

  #define ngx_hash(key, c) ((u_int) key * 31 + c)



u_int ngx_hash_key(u_char *data, size_t len)

{

u_int i, key;



key = 0;



for(i = 0; i
key *= 31;

key += data[i];

}



returnkey;

}



  The hash value is then modulo'd by the number of servers, and thus a server is picked. A server's index is determined by the order in which it appears in the upstream block.



本文转自

http://anotherbug.blog.chinajavaworld.com/entry/4298/0/
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值