The Final Flight of the Harvster

Ben-Hur "Harv" C. Viray. MS Computer Science candidate. Network and Distributed Systems Group. University of the Philippines, Diliman

Thursday, March 04, 2010

The Harvster goes South

Monday, April 14, 2008

PHD Comics Celebrates 1000 Strips

Happy 1000 strips! To Mr. Jorge Cham, thank you for "relieving" us from advisophobia and thesilitis. ^^,

Labels: ,

Tuesday, April 01, 2008

Shelved

Saturday, April 14, 2007

Harvster has landed... finally

We finally did it! Check out this screenshot from CRS:


This one is taken from UIS (CRS2):


Thank you for being a great partner, Lord!

Tuesday, February 27, 2007

NeuroGrid Network Parameters

Here's the complete list:

APPLET
ARCHITECTURE_LOG_FILE
CUMULATIVE_STATS
DOC_KEYWORD_ZIPF_DISTRIBUTION
FUZZY_SEARCHES
GROWTH_LOOP
INTERNAL_LOOP
LOG_DIRECTORY
LOG_FILE
MATLAB_FORMAT
MAX_CONNECTIONS_PER_NODE
MAX_FORWARDING_DEGREE
MAX_KNOWLEDGE_PER_NODE
MIN_CONNECTIONS_PER_NODE
MIN_FORWARDING_DEGREE
NO_BOOLEAN_PARAMS
NO_CONNECTIONS_PER_NODE
NO_DOCUMENTS
NO_DOCUMENTS_PER_NODE
NO_DOUBLE_PARAMS
NO_HONEST_NODES
NO_INT_PARAMS
NO_KEYWORDS
NO_KEYWORDS_PER_DOCUMENT
NO_NODES
NO_PROBES
NO_SEARCH_KEYWORDS
NO_STRING_PARAMS
NODE_DOC_ZIPF_DISTRIBUTION
POWERLAW_CONSTANT_C
POWERLAW_CONSTANT_POWER
POWERLAW_TOPOLOGY
PROBE_LOG_FILE
PROBE_LOOP
RANDOM_FORWARDING
RANDOM_SEARCHES
RANDOM_SEED
RECIPROCAL_CONNECTIONS
RING_TOPOLOGY
SEARCH_LOG_FILE
SIMULATION_TYPE
START_TTL
STATS_LOOP
SUMMARY_LOG_FILE
TTL_PROB_DISTRIBUTION

Thursday, February 22, 2007

Updated Gantt Chart

Almost there! Just a few more weeks of sleepless nights, coffee, Extra Joss and Stresstabs.


Lord, kayo na po ang bahala.

The Meaning of Harvster

My adviser asked me why I chose Harvster for my P2P system's name. At first, I just coined the term from my name and Napster. However, I thought of a suitable meaning and this came out: Handy Algorithm on Restraining flow for a Versatile Scalable Topology with Efficient Replication. Medyo pilit, but this is better than having nothing. ^_^

Wednesday, August 16, 2006

PeerSim vs NeuroGrid: Parameters

Configuration File samples


PeerSim (Event-Driven)

random.seed 1234567891
simulation.endtime 10^6
simulation.logtime 10^3
simulation.experiments 50
network.size 10^6
network.node peersim.core.GeneralNode

MINDELAY 10 # Minimum delay is 10 ms
MAXDELAY 400 # Maximum delay is 400 ms
DROP 0.0 # Drop probability is 0
protocol.urt UniformRandomTransport
{
mindelay MINDELAY
maxdelay MAXDELAY
}
protocol.tr UnreliableTransport
{
# Messages are actually delivered by urt
transport urt
# Here, we drop them with probability DROP
drop DROP
}

# A simple implementation of Linkable that does nothing;
# just stores a set of neighbors
protocol.link IdleProtocol
# The protocol defined in the previous slides
protocol.my GossipProtocol
{
# Use the unreliable trasport defined above
transport tr
# Use the random topology defined above
protocol link
# Use the default value for prob
}

# Initialize link with 20 neighbors at random
init.rndgraph WireKOut
{
k 20
protocol link
}
# Traffic generator
control.traffic TrafficGenerator
{
# Inject traffic on my protocol
protocol my
# Every 1000ms (1s)
step 1000
}




NeuroGrid (Advanced)

SIMULATION_TYPE=com.neurogrid.simulation.NeuroGridNetwork

LOG_FILE=ng_simulation.log
SUMMARY_LOG_FILE=ng_sum_simulation.log
ARCHITECTURE_LOG_FILE=ng_arch_simulation.log
PROBE_LOG_FILE=ng_probe_simulation.log
SEARCH_LOG_FILE=ng_search.log
LOG_DIRECTORY=output/adv_neurogrid

APPLET=false

NO_KEYWORDS=200
NO_DOCUMENTS=1000
NO_KEYWORDS_PER_DOCUMENT=2
NO_NODES=1000
NO_HONEST_NODES=300
NO_DOCUMENTS_PER_NODE=3
MAX_KNOWLEDGE_PER_NODE=100
NO_CONNECTIONS_PER_NODE=3
MAX_CONNECTIONS_PER_NODE=3
NO_SEARCH_KEYWORDS=1

START_TTL=7

MAX_FORWARDING_DEGREE=5
MIN_FORWARDING_DEGREE=1
INTERNAL_LOOP=100
PROBE_LOOP=101
NO_PROBES=10
GROWTH_LOOP=101
STATS_LOOP=50

RECIPROCAL_CONNECTIONS=true
RING_TOPOLOGY=false
DOC_KEYWORD_ZIPF_DISTRIBUTION=false
NODE_DOC_ZIPF_DISTRIBUTION=false
RANDOM_SEARCHES=false
RANDOM_FORWARDING=false
FUZZY_SEARCHES=false

Tuesday, August 15, 2006

PeerSim vs NeuroGrid: Statistics

According to this HOWTO, PeerSim generates the following statistics about query packets:

  • queryID
  • message TTL
  • number of times the packets has been seen
  • number of successful packet hits
  • total number of messages sent for this query

The NeuroGrid advanced simulation produces the following log files containing statistics:
  • MAIN_LOG_FILE - loop, No matches, TTL, message transfers, Nodes reached, possible matches
  • SUMMARY_LOG_FILE - loop, No matches (ave,stdev), TTL (ave,stdev), message transfers (ave,stdev), Nodes reached (ave,stdev), proportion matches (ave,stdev), efficiency (ave,stdev)
  • ARCHITECTURE_LOG_FILE - loop, total nodes, total conns, total knowledge, total knowledge links, message transfers
  • PROBE_LOG_FILE - loop, total nodes, ttl (ave,stdev,max,min)

PeerSim vs NeuroGrid: Protocols

PeerSim has a collection of internally developed protocols for the BISON project which can model P2P networks. They are the following:
  • OverStat is a collection of aggregation protocols. Aggregation is a collective term for a set of functions aimed at providing statistical information over distributed systems, such as the average load of the nodes or the size of the network.
  • SG-1 is a protocol for self-organizing and maintaining a superpeer based topology.
  • The Peer sampling service, that can be used as a source of random peers by participating peers.
  • The T-Man protocol can be used to build a wide range of different topologies using only a ranking function that defines the preference of each node for neighbors.
  • The PdProtocol plays the Prisoner Dilemma between nodes in a network to achieve cooperation. It is based on a socially inspired mechanism (based on "tags") applied to P2P networks.
  • The SLACER protocol generates a cooperative artificial social network (ASN) in a P2P overlay.
On the other hand, the NeuroGrid simulator supports the following protocols according to its FAQs:
  • Gnutella
  • Freenet
  • NeuroGrid
  • Pastry
  • Chord