Learn More
Linear programming is one of maths' greatest contributions to industry. There are many places where linear programming could be beneficially applied across more than one company, but there is a roadblock. Companies have secrets. The data needed for joint optimization may need to be kept private either through concerns about leaking competitively sensitive(More)
Consider a network of unreliable links, modelling for example a communication network. Estimating the reliability of the network – expressed as the probability that certain nodes in the network are connected – is a computationally difficult task. In this paper we study how the Cross-Entropy method can be used to obtain more efficient network reliability(More)
What does a child’s search of a large, complex cartoon for the eponymous character (Waldo) have to do with Internet routing? Network operators also search complex datasets, but Waldo is the least of their worries. Routing oscillation is a much greater concern. Networks can be designed to avoid routing oscillation, but the approaches so far proposed(More)
0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.011 * Corresponding author. Tel.: +61 413018820. E-mail addresses: ashley.flavel@gmail.com (A. adelaide.edu.au (J. McMahon), ashaikh@research.att rough an@adelaide.edu.au (M. Roughan), nigel.bean@a 1 This work was completed while the author was a Adelaide. Internet Service(More)
Wireless ad hoc networks often require a method for estimating their nodes' locations. Typically this is achieved by the use of pair-wise measurements between nodes and their neighbours, where a number of nodes already accurately know their location and the remaining nodes must calculate theirs using these known locations. Typically, a minimum mean square(More)
Wireless ad hoc networks provide a useful communications infrastructure for the mobile battlefield. In this paper we apply and develop passive radio frequency signal strength monitoring and packet transmission time profiling techniques, to characterise and reconstruct an encrypted wireless network’s topology. We show that by using signal strength(More)
Wireless ad hoc networks often require a method for estimating their nodes' locations. Typically this is achieved by the use of pair-wise measurements between nodes and their neighbours, where a number of nodes already accurately know their location and the remaining nodes must calculate theirs using these known locations. Often, a linear least squares(More)
Humpty Dumpty is the anthropomorphic nursery-rhyme egg broken into many pieces. Similarly, we have many pieces of measurement data to represent the current iBGP state. However, unlike the nurseryrhyme where the King’s men couldn’t put Humpty together again, we present a systematic approach to putting all the pieces of measured iBGP data together to obtain a(More)
In this paper we develop a mathematical model to capture BGP table fluctuations. This provides the necessary foundations to study shortand long-term routing table growth. We reason that this growth is operationally critical for network administrators who need to gauge the amount of memory to install in routers as well as being a potential deciding factor in(More)