Top > Network Applications > Servers > Pen
The load balancing algorithm tracks clients and tries to send them back to the server they visited the last time. The client table has slots (default 2048, settable through command-line arguments). When the table is full, the least recently used one is discarded to make room for the new one. This is superior to a simple round-robin algorithm, which sends a client that connects repeatedly to different servers. This breaks applications including most modern web applications) that maintain state between server connections.
|
|
User tutorial available from http://siag.nu/pen/howto.shtmlSupport contacts
Help List | <pen@siag.nu> <majordomo@siag.nu> body: subcribe |
Developer List | <pen@siag.nu> <majordomo@siag.nu> body: subcribe |
Bug List | <pen@siag.nu> <majordomo@siag.nu> body: subcribe |
Maintainers |
|
Developers |
|
Interfaces | daemon, web |
Programs | mergelogs |
Source languages | C |
Related programs | Balance |
License verified by | Janet Casey <jcasey@gnu.org> on 2002-01-15 |
Entry compiled by | Janet Casey <jcasey@gnu.org> |
Categories
The copyright licensing notice below applies to this text. The software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.
Copyright © 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
Permission is granted to copy, distribute, and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of this license is included in the file COPYING.DOC.
Please report any problems in this page to bug-directory@gnu.org, or find out how you can help fix them.
The FSF provides this directory as a service to the free software community. Please consider donating to the FSF to help support this project.