Ns-2.33 (and nam) on Ubuntu 8.04 (Hardy Heron)
Thesis Defense a Success!
May 19th, 2009 by Jason Ernst
Last Friday I successfully defended my thesis at Guelph. The room was full with lots of friends, students and faculty and everything went fairly smoothly. It definitely feels great to be done after almost two years building up to this. Today I finished the final revisions and submitted all of the copies with an insane amount of paperwork to Grad Program Services. Two to three weeks from now I should get my final bound copy of my thesis and it should soon be available online and in libraries 
. For anyone interested in reading it, email me and I can send you a pdf copy.
COCOA 2008 Paper
August 15th, 2008 by Jason Ernst
Just a small update, my first conference paper “Algorithms and Implementation for Interconnection Graph Problem” by Hongbing Fan, Christian Hundt, Yu-Liang Wu and myself, will be presented at COCOA 2008 in St. John’s Newfoundland on Friday, August 22nd at 9:40am by Dr. Fan. I am unable to attend since I am quite busy working on my thesis and other work. You can view the program for the rest of the conference at the COCOA website
Posted in Computer Science, News, Research by Jason Ernst
Tags: 2008, COCOA, Conference, Ernst, Fan, Hongbing, Jason, Laurier, Publication, Wilfrid
Customized Reconfigurable Interconnection Network Paper Accepted to COCOA ‘08
May 1st, 2008 by Jason Ernst
Yesterday I found out that a paper I helped out with got accepted to COCOA 2008 Conference in St. John’s Newfoundland. This is the first academic paper I have worked on, and also the first one that has been accepted to a conference so I am extremely excited.
Posted in Computer Science, Research, Simulation by Jason Ernst
Tags: 2008, COCOA, Conference, Ernst, Fan, Hongbing, Jason, Paper, Progress
Customized Reconfigureable Interconnection Network (CRIN) Paper
March 8th, 2008 by Jason Ernst
Recently, I have begun working on a new research project dealing with some graph theory with Dr. Hongbing Fan at Wilfrid Laurier University. As the title suggests the problem works with customized reconfigurable interconnection networks (CRINs). Dr. Fan has proposed an algorithm which attempts to minimize the connections within a network based on a set of routing requirements.
An example Interconnection Graph Problem, Click to Enlarge
Since December of 2007 I have been working at implementing, testing and experimenting the algorithm as well as providing feedback and new ideas for improvements. The paper is almost ready to be submitted for publication this so hopefully I will be able to provide a link to it in the future.
In relation with my thesis, I am planning on making use of the CRIN algorithm to attempt to optimize wireless network protocols. There still needs to be some experimentation and research to determine if in fact the algorithm can be used in this way however I feel optimistic that this is the case.
There is also the potential that the source code for the CRIN implementation may be made open source and released for use by anyone. If this is the case it will be uploaded to this site in the future.
Posted in Computer Science, Research, Simulation by Jason Ernst
Tags: CRIN, Customized, Ernst, Fan, Hongbing, Interconnection, Jason, Networks, Paper, Progress, Reconfigurable, Simulation
