Economic Scheduling for Efficient Management of Clusters and their Cooperative Federation. Clusters of commodity computers have emerged as mainstream parallel and distributed platforms for high-performance computing. They are presented together as a single, unified resource to the end users by middleware technologies such as resource management and scheduling (RMS) systems. However, existing cluster RMS systems continue to use system centric models rather than utility models for the management a ....Economic Scheduling for Efficient Management of Clusters and their Cooperative Federation. Clusters of commodity computers have emerged as mainstream parallel and distributed platforms for high-performance computing. They are presented together as a single, unified resource to the end users by middleware technologies such as resource management and scheduling (RMS) systems. However, existing cluster RMS systems continue to use system centric models rather than utility models for the management and allocation of resources. There is also little emphasis on the construction of a cooperative federation of clusters to facilitate transparent sharing of resources. To enhance the value delivered by shared clusters, we propose the use of computational economy metaphor in resource management. This project aims to develop (A) computational economy based scheduling policies for allocation of resources and (B) a software infrastructure for creation of cooperative federation of distributed clusters.Read moreRead less
Efficient Computational Methods for Constrained Path Problems. We consider a class of path design problems which arise when an object needs to traverse between two points through a specified region. The region may be a continuous space or the path may be restricted to the edges of a network. The path must optimise a prescribed criterion such
as risk, reliability or cost and satisfy a number of constraints.
Problems of this type readily arise in the defence, transport and
communication i ....Efficient Computational Methods for Constrained Path Problems. We consider a class of path design problems which arise when an object needs to traverse between two points through a specified region. The region may be a continuous space or the path may be restricted to the edges of a network. The path must optimise a prescribed criterion such
as risk, reliability or cost and satisfy a number of constraints.
Problems of this type readily arise in the defence, transport and
communication industries. In addition to efficient solution methods
for these problems the project will produce computational tools for
a wide range of related network routing problems.Read moreRead less
Efficient and Fair Traffic Control for a Multi-Service Internet. Australia relies very heavily on its
telecommunications infrastructure due to its
geographic dispersion. For the same reason,
it cannot afford to invest in inefficient infrastructure.
Our novel and practical Internet congestion control scheme will overcome current weaknesses in the Internet, and will enable the Australian telecommunication service industry to provide a better quality of service to the customers (including Aust ....Efficient and Fair Traffic Control for a Multi-Service Internet. Australia relies very heavily on its
telecommunications infrastructure due to its
geographic dispersion. For the same reason,
it cannot afford to invest in inefficient infrastructure.
Our novel and practical Internet congestion control scheme will overcome current weaknesses in the Internet, and will enable the Australian telecommunication service industry to provide a better quality of service to the customers (including Australian industries and rural communities) and at lower cost. This project will put Australia on the international stage as a leading contributor to Internet technology. We will provide training for PhD students and postdoctoral fellows in the important area of Internet traffic engineering and control.Read moreRead less
Resilience Oriented Multicast for Real-time Multimedia. The current communication infrastructure market is one of the largest market segments in the world. However, it is evident that the current Internet provides limited support for a multitude of current, emerging and future services that require multicasting support (worldwide, enhanced IP service revenues are forecast to grow to $104.4 billion in 2005). The introduction of enhanced multicasting services will result in lowered input costs to ....Resilience Oriented Multicast for Real-time Multimedia. The current communication infrastructure market is one of the largest market segments in the world. However, it is evident that the current Internet provides limited support for a multitude of current, emerging and future services that require multicasting support (worldwide, enhanced IP service revenues are forecast to grow to $104.4 billion in 2005). The introduction of enhanced multicasting services will result in lowered input costs to industries and consumers with a wider choice of enhanced services. The mechanisms developed in this project will allow service providers to raise additional revenue and differentiate themselves by offering a wide range of enhanced services.Read moreRead less
Efficient Distribution of Content in Multi-Rate Multi-channel Wireless Mesh Networks. The current wireless broadband access is one of the fastest growing markets in communications area. A study by market research firms such as BWCS (England) and SFC (US) estimates the US market itself to be over $3.7 billion by year 2009.
The current Wireless Mesh Network has limited capability to support for a multitude of current, emerging and future services . The mechanisms developed in this project will ....Efficient Distribution of Content in Multi-Rate Multi-channel Wireless Mesh Networks. The current wireless broadband access is one of the fastest growing markets in communications area. A study by market research firms such as BWCS (England) and SFC (US) estimates the US market itself to be over $3.7 billion by year 2009.
The current Wireless Mesh Network has limited capability to support for a multitude of current, emerging and future services . The mechanisms developed in this project will allow service providers to raise additional revenue and differentiate themselves by offering a wide range of enhanced services. Our research will help efficient sharing of network resources (such as bandwidth) between multiple users of multimedia communications using broadcasting and multicasting protocols. Read moreRead less
Unifying Modern Approaches in Machine Learning. The proposed research will lead to better algorithms for some important machine learning problems that could lead to better tools for extracting useful knowledge from data such as in bioinformatics and sensor networks; it will strengthen an international collaboration with one of the world's top centres of machine learning research; it will contribute to an open source toolkit of machine learning algorithms which will put Australia on the map as a ....Unifying Modern Approaches in Machine Learning. The proposed research will lead to better algorithms for some important machine learning problems that could lead to better tools for extracting useful knowledge from data such as in bioinformatics and sensor networks; it will strengthen an international collaboration with one of the world's top centres of machine learning research; it will contribute to an open source toolkit of machine learning algorithms which will put Australia on the map as a provider of sophisticated machine learning software; it will provide training opportunities for several PhD students and a postdoc to work with some of the best machine learning researchers in the world.Read moreRead less
Effective computational methods for nonlinear cone optimisation with industrial applications. This project brings together a number of national and international researchers whose combined expertise will focus on solving optimisation problems arising in a range of industries. The work will result in new cutting edge optimisation technology that can benefit industry and the community.
Realising the promise of neural networks for practical optimisation: improving their efficiency and effectivess through chaotic dynamics and hardware implementation. Combinatorial optimisation problems such as transportation routing and assembly-line scheduling are critical to the efficiency of many industries, but their combinatorial explosion makes rapid solution difficult. Neural networks (NNs) hold much potential for rapid solution though hardware implementation, but we need to improve the q ....Realising the promise of neural networks for practical optimisation: improving their efficiency and effectivess through chaotic dynamics and hardware implementation. Combinatorial optimisation problems such as transportation routing and assembly-line scheduling are critical to the efficiency of many industries, but their combinatorial explosion makes rapid solution difficult. Neural networks (NNs) hold much potential for rapid solution though hardware implementation, but we need to improve the quality of their solutions before developing hardware. We have previously shown that the rich dynamics of chaos can improve the efficiency and effectiveness of NNs. We aim to develop new chaotic NN models, rigorously evaluate them on industrially significant problems such as those arising in manufacturing, logistics and telecommunications, and demonstrate their speed through hardware acceleration.Read moreRead less
Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unit ....Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unites geometric techniques with powerful methods from operations research, such as linear and discrete optimisation, to build fast, powerful tools that can for the first time systematically solve large topological problems. Theoretically, this project has significant impact on the famous open problem of detecting knottedness in fast polynomial time.Read moreRead less
New Analytical Perspectives on the Algorithmic Complexity of the Hamiltonian Cycle Problem. Hamiltonian Cycle Problem (HCP), known - in the complexity theory of
algorithms -to be NP-hard is proposed for study, from three innovative,
separate (yet related) analytical perspectives: singularly perturbed
(controlled) Markov chains, that links the HCP with systems and control
theories; parametric nonconvex optimization, that links HCP with fast
interior point methods of modern optimization an ....New Analytical Perspectives on the Algorithmic Complexity of the Hamiltonian Cycle Problem. Hamiltonian Cycle Problem (HCP), known - in the complexity theory of
algorithms -to be NP-hard is proposed for study, from three innovative,
separate (yet related) analytical perspectives: singularly perturbed
(controlled) Markov chains, that links the HCP with systems and control
theories; parametric nonconvex optimization, that links HCP with fast
interior point methods of modern optimization and the spectral approach
based on a novel adaptation of Ihara-Selberg trace formula for regular
graphs. Our mathematical approach to this archetypal complex problem of graph
theory and discrete optimization promises to enhance the fundamental
understanding - and ultimate "managibility" - of the underlying
difficulty of HCP.
Read moreRead less