npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

turdus

v0.0.9

Published

weighted round robin client-side HTTP load balancing

Downloads

16

Readme

Turdus Build Status NPM Version node

Turdus is a client side HTTP Round-robin and Weighted round-robin load balancing library.

It provides following features:

  • Client side Load balancing
  • Fault tolerance
  • Normalized Response on request failure.
  • Mutiple apps supported.

Principle

For simple Round-robin, it is basically array loop.

For weighted round robin algorithm, on each peer selection we increase current_weight of each eligible peer by its weight, select peer with greatest current_weight and reduce its current_weight by total number of weight points distributed among peers.

see also: nginx implementation

[Deprecated] For weighted round robin algorithm (gcd version):

  1. calculate GCD of all endpoints' weight
  2. choose the max weighted endpoint then minus GCD
  3. if largest weight belongs to more than one endpoint, choose the small index one.
  4. set to original weight until no weight bigger than zero.
  5. repeat the procedures above.

Usage

install turdus by npm.

npm install turdus

Provide or fetch your callee apps' IP/domain from written configs

or subscribe event by eureka client and fetchRegistry from Eureka

  1. simple polling each server.
const Turdus = require('turdus');
// initialize multiple app
const trudus = Turdus({ 
  bird: ['127.0.0.1', '127.0.0.2', '127.0.0.3'],
  kitten: ['192.168.0.1', '192.168.0.2', '192.168.0.3'],
});

async function touchServer() {
  await turdus.request('bird', {
    method: 'GET',
    uri: '/cat-books',
  });
}

touchServer();
touchServer();
touchServer();
// ...

// will touch known resources one by one.
//
// curl http://127.0.0.1/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.3/cat-books
// curl http://127.0.0.1/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.3/cat-books
// ...
  1. weighted polling each servers;
const Turdus = require('turdus');
const turdus = Turdus({ bird: [
  { server: '127.0.0.1', weight: 5 },
  { server: '127.0.0.2', weight: 10 },
  { server: '127.0.0.3', weight: 4 },
]});

async function touchServer() {
  await turdus.request('bird', {
    method: 'GET',
    uri: '/cat-books',
  });
}

touchServer();
touchServer();
touchServer();
// ...

// will touch known resources by their weight.
//
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.1/cat-books
// curl http://127.0.0.3/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.1/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.3/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.1/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.3/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.1/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.2/cat-books
// curl http://127.0.0.3/cat-books
// curl http://127.0.0.1/cat-books
// curl http://127.0.0.2/cat-books
// ...
  1. fault tolerance and nomalize error response.
const turdus = Turdus({ bird: [ '127.0.0.1', '127.0.0.2' ] });
turdus.fakePositiveRes('bird', {
  '/cat-birds': 'though some error appeared',
  '/cat-books': [ 'The Fountainhead', 'Poor Charlie's Almanack:The Wit and Wisdom of Charles T. Munger', 'The Little Prince' ],
});

turdus.request('bird', {
  uri: '/cat-birds',
  method: 'POST',
  body: { yy: 6 },
  json: true,
})
.then((result) => {
  // though enpoints is not touchable
  // we can get positive response due to preset method.
  // result.statusCode: 200
  // result.body: 'though some error appeared',
});
  1. update exist applications' endpoints or add new applications.
const endpoints = {
  kitten: [
    { server: '127.0.0.1', weight: 0 },
    { server: '127.0.0.2', weight: 0 },
  ],
  doggy: [
    { server: '192.168.0.1', weight: 0 },
    { server: '192.168.0.2', weight: 0 },
  ],
};
const turdus = Turdus(endpoints);
turdus.upsertEndpoints({
  doggy: [
    { server: '192.168.0.1', weight: 3 },
    { server: '192.168.0.2', weight: 3 },
    { server: '192.168.0.3', weight: 1 },
    { server: '192.168.0.4', weight: 1 },
  ],
});

// the doggy application's endpoints will be changed.
// also it's balance type got changed from raw to weighted.

NOTE: this function may reset related applications' current polling order to original status.

License

MIT