<img src= Waldvogel & Aschwanden
" width="36" />Roman Pletka
" width="36" />Nicola Aschwanden
" width="36" />Lars Waldvogel
" width="48" />Kinderlieder+Spiele
" width="36" />Marcel Waldvogel
" width="48" />Contact
" width="48" />Publications
" width="48" />Research
" width="60" />Memory
" width="60" />Crossbow
" width="60" />Fuzzycast
" width="72" />Contributions
" width="72" />Results
" width="72" />Operation
" width="72" />Topology Data
" width="72" />Software
" width="72" />Publications
" width="72" />Participants
" width="72" />Links
" width="60" />TERP
" width="60" />FPX
" width="60" />Forwarding
" width="60" />P2P
" width="60" />Multicast
" width="60" />VersaKey
" width="60" />Da CaPo++
" width="48" />Tutorials
" width="48" />Classes
" width="48" />Software
" width="48" />Archive
" width="48" />Fun

Topology Traces and Simulation Programs

This page contains the topology traces and simulation programs used for the Fuzzycast papers (Fuzzycast: Efficient Video-on-Demand over Multicast (Infocom 2002) and Efficient Media-on-demand over multiple Multicast groups (Global Internet 2001)).

Graphs

Two graphs are available:

A generated transit-stub graph of approximately 10k nodes.
An Internet trace of approximately 7k nodes, generated by doing a depth-first traversal of this router-level trace (nodes renamed for better compression) obtained from the ISI SCAN project (almost 300k nodes).

Graph Simulator

GraphSim.java is a Java program that builds an overlay multicast tree over a real network. It can understand a couple of formats: the default format for GT-ITM generated graphs and the Inet format (<node>: <node> <node> ...) for Internet traces. It also does a multicast receiver count based on a set of time windows called a filter.

Graph Generation Scripts

smallify.pl renames the node numbers to be contiguous and the neighbors to be sorted; this often will result in a file that can be better compressed. Simple usage:
```
smallify.pl < infile > outfile
```
Keep the node numbers ascending:
```
sed 's/ .*//' < infile; cat infile) | smallify.pl | sed '/:$/d' > outfile
```
tree.pl generates a subgraph of nodes reachable in under k hops from a given node.
rankize.pl canonicalizes names to 1..num_nodes-1.
edgecount.pl does just what you would expect.

All of the above scripts assume input to be in Inet format. Thus

tree.pl < big_graph.dat | rankize.pl > little_graph.dat

will work (mostly!). Afterwards,

wc -l little_graph.dat

and

edgecount.pl < little_graph.dat

will give the number of vertices and edges respectively.

This page has been manually mirrored, reformatted, and extended from the original page.