<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T07:25:15Z</responseDate><request verb="GetRecord" identifier="oai:digital.library.adelaide.edu.au:2440/37738" metadataPrefix="dim">https://digital.library.adelaide.edu.au/server/oai/request</request><GetRecord><record><header><identifier>oai:digital.library.adelaide.edu.au:2440/37738</identifier><datestamp>2016-04-14T05:16:17Z</datestamp><setSpec>com_2440_14759</setSpec><setSpec>col_2440_14760</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en">Taylor, Peter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en">Bean, Nigel Geoffrey</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en">Costa, Andre</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="school" lang="en">School of Applied Mathematics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2002</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/2440/37738</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Interest in adaptive and distributed systems for routing control in networks has led to the development of a new class of algorithms, which is inspired by the shortest path finding behaviours observed in biological ant colonies. This class utilizes ant-like agents, which autonomously traverse the network and collectively construct a distributed routing policy. Agent-based routing algorithms belonging to this class do not require a complete model of the network, and are able to adapt autonomously to network changes in dynamic and unpredictable environments. Previous studies of these algorithms have been carried out exclusively via the use of simulation-based models. In this thesis, we apply analytic modelling techniques to the study of agent-based routing algorithms. Our aim is to broaden the research in this field, as well as to gain a greater theoretical understanding of some fundamental properties of this class of algorithms.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="dissertation" lang="en">Thesis (Ph.D.)--School of Applied Mathematics, 2002.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en">3216458 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en">131777 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">mathematical optimization, computer algorithms, data structures (computer science)</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Analytic modelling of agent-based network routing algorithms.</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Thesis</dim:field>
   <dim:field mdschema="dc" element="provenance">This electronic version is made publicly available by the University of Adelaide in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. This thesis may incorporate third party material which has been used by the author pursuant to Fair Dealing exception.  If you are the author of this thesis and do not wish it to be made publicly available or If you are the owner of any included third party copyright material you wish to be removed from this electronic version, please complete the take down form located at: http://www.adelaide.edu.au/legals</dim:field>open.access</dim:dim></metadata></record></GetRecord></OAI-PMH>