# peer_ordering

**Repository Path**: mirrors_arvidn/peer_ordering

## Basic Information

- **Project Name**: peer_ordering
- **Description**: This is a simple simulation of peer connections in a bittorrent swarm, illustrating the potential performance issues (peer clustering) of widely used first-come-first-serve logic for accepting incoming connections as well as a solution to that problem.
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-08-08
- **Last Updated**: 2026-04-04

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

peer_ordering
=============

This is a simple simulation of peer connections in a bittorrent swarm, illustrating the potential performance issues (peer clustering) of widely used first-come-first-serve logic for accepting incoming connections as well as a solution to that problem.