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

network-map

v0.0.1

Published

Network map built with vivaldi algorithm, stored in a hyperbee database system

Downloads

5

Readme

network-map

Network Coordinate System based on latency

Network coordinate systems assign each node a position in the chosen space. The distance in the space is then equal to the latency. The aim is to find such coordinates in the space that predict the latency with the lowest error. There are various algorithms used for assigning the coordinates to the nodes. These algorithms typically work with the n-dimensional Euclidian or non-Euclidian spaces.

API

make_db()

Create a hyperbee db instance

update(db, rtt, local_node, remote_node)

Update position of the local node

store_pos(db, nodes) // const node = [{ id, pos, opts }]

Store positions of selected nodes in the db

get_pos

Get position for the selected key from the db

get_map

Create a read stream from the db

get_val

Get value for selected key from the db

const network_map = require('network-map')()

// create a hypercore db instance

const db = network_map.make_db.then(db => {
  // measure RTT and update syntetic network coordinates accordingly  
  const updated = await network_map.update_coordinates({ db, rtt, local_node, remote_node })
  // => bool
})

Vivaldi algorithm

  • synthetic coordinates (used to predict the RTT between 2 nodes)
  • error (estimated difference between rtt and calculated distance; squared-error function)
  • distance function - predicts the latency (RTT)
  • i moves a small distance in the direction of the force (force to minimize error) to coordinates that predict error well - each node computes and continuously adjusts its coordinates based only on measured RTTs from the node to a handful of other nodes and the current coordinates of those nodes.

Source: http://conferences.sigcomm.org/sigcomm/2004/papers/p426-dabek111111.pdf

How vivaldi works

Node i has measured node j to be rtt ms away, and node j says it has coordinates xj

simple vivaldi(rtt, xj)

Compute error of this sample. (1) e = rtt − kxi − xjk

Find the direction of the force the error is causing. (2) dir = u(xi − xj)

The force vector is proportional to the error (3) f = dir × e

Move a a small step in the direction of the force. (4) xi = xi + δ × dir