C. Dabrowski and F. Hunt, Using Markov Chain Analysis to Study Dynamic Behavior in Large-Scale Grid Systems, to appear in 7th Australasian Symposium on Grid Computing and e-Research, Wellington, New Zealand, 2009, 20 - 23 January
B. Cloteaux "Approximating the number of bases for almost all matroids", submitted to Information Processing Letters.
F. Hunt and V. Marbukh, Dynamic Routing and Congestion Control Through Random Assignment of Routes, to appear in Proceedings of the 5th International Conference on Cybernetics and Information Technologies, Systems and Applications: CITSA 2008, Orlando FL, July 2008.
A. Fillinger, I. Hamchi, S. Degré, L. Diduch, T. Rose, J. Fiscus and V. Stanford. Engineering the Pervasive Future: Common Middleware, Research Corpora, and Metrology. IEEE Pervasive Computing Mobile and Ubiquitous Systems. Accepted for Publication 2008.
V. Marbukh, Fair bandwidth sharing under flow arrivals/departures:effect of retransmissions on stability and performance, in ACM SIGMETRICS Performance Evaluation Review, Volume 35 Issue 2, September 2007.
V. Stanford, Time Series Prediction Forecasting the Future and Understanding the past (PPT). Santa Fe Institute Proceedings on the Studies in the Sciences of Complexity Edited by Andreas Weingend and Neil Gershenfeld. NIST Complex System Program, Perspectives on Standard Benchmark Data, In Quantifying Complex Systems, internal presentation to CxS? Study Group, Complex Systems Test Bed project. August 31, 2007.
Flexi-Cluster: A Simulator for a Single Compute Cluster, V. Marbukh and K. Mills.
MesoNet: A Mesoscopic Simulation Model of a Router-Level Internet-like Network,
MesoNetHS adds six congestion-control algorithms for networks with high bandwidth-delay products; algorithms include: binary-increase control (BIC), compound TCP (CTCP), fast AQM scalable (FAST) TCP, H-TCP, high-speed TCP (HS TCP) and Scalable TCP (STCP), K. Mills, E. Schwartz and J. Yuan.
EconoGrid: A detailed Simulation Model of a Standards-based Grid Compute Economy, C. Dabrowski and K. Mills.
MesoGrid?: a mesoscopic scale simulation model of a computational grid economy, C. Dabrowski and K. Mills.
NGraph++: a simplified graph library for the analysis of complex networks based on ANSI/ISO C++. Includes basic graph operations (construction, intersections, subgraphs) and algorithms for computing degree distribution and clustering coefficients. R. Pozo
DiVisa?: a multi-dimensional visualization tool. Can read any kind of data (simulation, statistics, text or numeric, etc.), and converters have been implemented to read several data formats without need for reformatting.
Distributed processing for multiple instances of Octave or Matlab computational engines for parallel matrix algebra needed in complex system simulations. Provided with the NDFS-II.
Distributed simulation architectures for the study of emergent behaviors in large populations of simple agents that form complex systems. The distributed processing was shown to support very large agent population capable of solving large combinatorial optimization problems. Provided with the NDFS-II.
The ant colony Engine that simulates the behavior that biological ant colonies show in nature when foraging for food and finding efficient paths from the nest to the food sources. Provided with the NDFS-II.
B. Cloteaux , A C++ implementation of a sequential importance sampling algorithm, created by us, for estimating the number of spanning trees in a graph, Sept. 2007.
B. Cloteaux , A C++ implementation of various network metrics including minimum vertex cover (MC). Uses several of the kernelization techniques of Langston et al. The kernelization method involves taking a graph G and producing a smaller graph G', the kernel, with a value k such that MC(G) = MC(G')+k. For the smaller G' we solve for minimum vertex cover exactly, Feb. 2008.
B. Cloteaux , A program for generating random graphs with a given degree sequence. Took code written in R by Joseph Blitzstein at Harvard, converting it to C++, and then optimizing it with the use of novel datastructures. These datastructures allowed the C++ program to run much larger cases than the original program. In particular, it could then handle the Autonomous Systems data from the UCLA database. Software has been released to J. Blitzstein (Harvard), C. Priebe (Johns Hopkins), J. Devinney (IDA Center for Computing Sciences), March 2008.
B. Cloteaux , Software to generate graphs with specified s values. These used the Monte Carlo technique of threshold acceptance, May 2008.
B. Cloteaux , Software to calculate the maximum s value for a set of graphs. This includes a new approximation technique we developed, namely a deterministic version of Blitzstein's algorithm to produce the upper bound, May 2008.
B. Cloteaux , Software to enumerate all graphs with a given degree sequence.Done for illustration purposes for small graphs, May 2008.
B. Cloteaux , C++ implementations of Wilson's algorithm to uniformly sample spanning trees in graphs and Welsh's Monte Carlo algorithm for counting bases of a frequent matroid, Aug. 2008.
B. Cloteaux , Software implementing our algorithm, based on sequential importance sampling, to approximate the coefficients of the reliability polynomial of a graph, Sept 2008.
B. Cloteaux , A C++ implementation of Colbourn's algorithm to estimate the coefficients of the reliability polynomial, Sept 2008.
B. Cloteaux , Software to estimate specific values of the reliability polynomial. Uses Chernoff bounds to determine convergence. It produces a graph of connected probability vs edge probability, Sept 2008.