Research : Miscellaneous

SICSA Prize PhD Studentships

Posted on in category misc

Applications for Scottish Informatics and Computer Science Alliance PhD studentships are now open to outstanding PhD candidates who are applying to the University of Glasgow (or other Scottish Universities). I'm interested in receiving applications from students with an interest in next generation routing algorithms, in particular in the application of compact routing to the next generation Internet, or to named data networks, building on prior work in my group. If you have an interest in these areas, please contact me to discuss your application.

SICSA prize studentships are open to citizens and residents of any country. The studentships cover living costs and fees at the UK/EU level, and successful candidates may apply for further fee support. Candidates must have or must expect to be awarded a 1st class Honours Degree, or an MSc with Distinction, or equivalent GPA scores. Your degree must be in a discipline that is relevant to your proposed field of research. Details for how to apply can be found on the SICSA web site. The deadline for applications to SICSA is 31 March 2012, but note that you need to have been accepted onto the PhD programme at the University of Glasgow before that, if I am to support your application. Interested students are encouraged to contact me to discuss their research interests, before they submit their application.

College of Science and Engineering PhD Scholarships

Posted on in category misc

The College of Science and Engineering at the University of Glasgow is pleased to announce the availability of College postgraduate research scholarships for PhD registration in 2012. These prestigious scholarships are highly competitive and we seek candidates who can demonstrate excellence in a single discipline or cross-disciplinary expertise.

I'm especially interested in students with an interest in next generation routing algorithms, in particular in the application of compact routing to the next generation Internet, or to content-centric networks, building on my prior work). If you have an interest in these areas, please contact me to discuss your application.

More details are available on the College of Science and Engineering website. The deadline for applications is 26 January 2012.

Building gnuplot-4.4.2 on MacOS X 10.6.5

Posted on in category misc

Compiling gnuplot 4.4.2 on MacOS X is somewhat tricky. The following set of commands work for me. YMMV. Note that AquaTerm 1.0.1 is a 32-bit binary, hence the -m32 flags below.

# Build jpeg-8b (http://www.ijg.org/)
cd jpeg-8b 
LDFLAGS=-m32 CFLAGS=-m32 ./configure --prefix=$HOME/apps/jpeg-8b 
make 
make install 

# Build gd-2.0.35 (http://www.libgd.org/)
cd gd-2.0.35 
LDFLAGS=-m32 CFLAGS=-m32 ./configure --prefix=$HOME/apps/gd-2.0.35 --with-jpeg=$HOME/apps/jpeg-8b 
make 
make install 

# Build PDFlib-Lite-7.0.5 (http://www.pdflib.com/download/pdflib-family/pdflib-lite-7/)
cd PDFlib-Lite-7.0.5 
LDFLAGS=-m32 CFLAGS=-m32 ./configure --prefix=$HOME/apps/PDFlib-Lite-7.0.5 --disable-shared --disable-cxx 
make 
make install 

# Build gnuplot-4.4.2
cd gnuplot-4.4.2 
LDFLAGS="-m32 -L$HOME/apps/gd-2.0.35/lib" CFLAGS="-m32" ./configure --prefix=$HOME/apps/gnuplot-4.4.2 --with-gd=$HOME/apps/gd-2.0.35 --with-pdf=$HOME/apps/PDFlib-Lite-7.0.5 --disable-wxwidgets --without-lisp-files --without-cairo --without-latex 
make 
make install

Mathematics of Networks

Posted on in category misc

I attended the 9th Mathematics of Networks workshop at the University of St Andrews on 18 June 2010. This suffered from a little too much overlap with the workshop on Modelling and Analysis of Networked and Distributed Systems held the previous day, but still had some talks that were interesting, if not directly relevant to my research.

Modelling and Analysis of Networked and Distributed Systems

Posted on in category misc

I attended the SICSA workshop on Modelling and Analysis of Networked and Distributed Systems at the University of Stirling on 17 June 2010. The aim of the workshop was to bring together researchers in computer networking and formal methods, with the hope of identifying areas of mutual interest, and encouraging joint research.

Most interesting, from my point of view, was Tim Griffin's invited talk on Exploring the Stratified Shortest Paths Problem, describing how we can start to bring some mathematical rigour to our understanding of Internet routing, and begin to analyse systems, such as BGP, that compute locally optimal paths based on policy. Also worthwhile were the talks on stochastic process algebras by Vashti Galpin and Jane Hillston, and Mario Kolberg's discussion of problems simulating large-scale peer-to-peer systems.