ORCID Profile
0000-0002-7882-7329
Current Organisation
University of Adelaide
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Research Topics
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Top 5 Research Topics
ANZSRC Field of Research (FoR)
Communications Technologies | Operations Research | Computer Communications Networks | Computer Communications Networks | Stochastic Analysis And Modelling | Applied Statistics | Data Communications | Signal Processing | Applied Mathematics | Statistics | Operations Research | Distributed Computing | Networking and Communications | Statistical Theory | Statistical Mechanics, Physical Combinatorics and Mathematical Aspects of Condensed Matter | Simulation and Modelling | Stochastic Analysis and Modelling | Communications Technologies Not Elsewhere Classified | Data Security
ANZSRC Socio-Economic Objective (SEO)
Telecommunications | Fixed Line Data Networks and Services | Communication Networks and Services not elsewhere classified | Mathematical sciences | Expanding Knowledge in the Mathematical Sciences | Combined operations | The Media | Expanding Knowledge in the Medical and Health Sciences | Energy Services and Utilities | Internet Broadcasting | Mobile Data Networks and Services | Mobile Telephone Networks and Services | Expanding Knowledge in the Environmental Sciences |
Related Links
Publications
Multi-observer privacy-preserving Hidden Markov Models
Publisher: IEEE
Date: 04-2012
Data fusion without data fusion: Localization and tracking without sharing sensitive information
Publisher: IEEE
Date: 02-2007
Stable and flexible iBGP
Publisher: Association for Computing Machinery (ACM)
Date: 16-08-2009
Abstract: Routing oscillation is highly detrimental. It can decrease performance and lead to a high level of update churn placing unnecessary workload on router the problem is distributed between many providers. However, iBGP --- the routing protocol used to distribute routes inside a single Autonomous System --- has also been shown to oscillate. Despite the fact that iBGP is configured by a single provider according to apparently straight forward rules, more than eight years of research has not solved the problem of iBGP oscillation. Various solutions have been proposed but they all lack critical features: either they are complicated to implement, restrict routing flexibility, or lack guarantees of stability. In this paper we propose a very simple adaptation to the BGP decision process. Despite its simplicity and negligible cost we prove algebraically that it prevents iBGP oscillation. We extend the idea to provide routing flexibility, such as respecting the MED attribute, without sacrificing network stability.
A case study of the accuracy of SNMP measurements
Publisher: Hindawi Limited
Date: 2010
DOI: 10.1155/2010/812979
Abstract: For some time it has been known that the standard method for collecting link-traffic measurements in IP networks—the Simple Network Management Protocol or SNMP—is flawed. It has often been noted that SNMP is subject to missing data, and that its measurements contain errors. However, very little work has been aimed at assessing the magnitude of these errors. This paper develops a simple, easily applicable technique for measuring SNMP errors, and uses it in a case study to assess errors in a common SNMP collection tool. The results indicate that most link-load measurement errors are relatively small, but the distribution has a heavy-tail, and that a few measurement errors can be as large as the measurements themselves. The approach also allows us to go some way towards explaining the cause of the errors.
Secure distributed data-mining and its application to large-scale network measurements
Publisher: Association for Computing Machinery (ACM)
Date: 10-01-2006
Abstract: The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data --- for instance, how much traffic does the Internet now carry? The problem is not that the data is technically hard to obtain, or that it does not exist, but rather that the data is not shared. Obtaining an overall picture requires data from multiple sources, few of whom are open to sharing such data, either because it violates privacy legislation, or exposes business secrets. Likewise, detection of global Internet health problems is h ered by a lack of data sharing. The approaches used so far in the Internet, e.g. trusted third parties, or data anonymization, have been only partially successful, and are not widely adopted.The paper presents a method for performing computations on shared data without any participants revealing their secret data . For ex le, one can compute the sum of traffic over a set of service providers without any service provider learning the traffic of another. The method is simple, scalable, and flexible enough to perform a wide range of valuable operations on Internet data.
Efficient network-wide flow record generation
Publisher: IEEE
Date: 04-2011
On the success of network inference using a Markov routing model
Publisher: IEEE
Date: 05-2011
BasisDetect: A model-based network event detection framework
Publisher: ACM
Date: 11-2010
Information flow estimation: A study of news on Twitter
Publisher: Elsevier BV
Date: 09-2022
Generalized graph products for network design and analysis
Publisher: IEEE
Date: 10-2011
How to Write a Review for a Scientific or Mathematical Paper
Publisher: Center for Open Science
Date: 06-10-2020
Abstract: Reviewing a paper or grant proposal is a difficult and thankless task. Yet tens of billions of dollars in grants are dispersed on the basis of peer review. And careers are made and broken through publications that are judged through peer review. The goal of this report is to provide an education resource to improve the quality and efficiency of reviews.
A Review of Shannon and Differential Entropy Rate Estimation
Publisher: MDPI AG
Date: 13-08-2021
DOI: 10.3390/E23081046
Abstract: In this paper, we present a review of Shannon and differential entropy rate estimation techniques. Entropy rate, which measures the average information gain from a stochastic process, is a measure of uncertainty and complexity of a stochastic process. We discuss the estimation of entropy rate from empirical data, and review both parametric and non-parametric techniques. We look at many different assumptions on properties of the processes for parametric processes, in particular focussing on Markov and Gaussian assumptions. Non-parametric estimation relies on limit theorems which involve the entropy rate from observations, and to discuss these, we introduce some theory and the practical implementations of estimators of this type.
The hitchhikers guide to sharing graph data
Publisher: IEEE
Date: 08-2015
ForestStream: Accurate Measurement of Cascades in Online Social Networks
Publisher: IEEE
Date: 07-2017
Hiccups on the road to privacy-preserving linear programming
Publisher: ACM
Date: 09-11-2009
Verifying and Monitoring IoTs Network Behavior Using MUD Profiles
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Surreal Birthdays and Their Arithmetic
Publisher: Informa UK Limited
Date: 27-05-2023
Popularity and centrality in Spotify networks: critical transitions in eigenvector centrality
Publisher: Oxford University Press (OUP)
Date: 12-2021
Abstract: The modern age of digital music access has increased the availability of data about music consumption and creation, facilitating the large-scale analysis of the complex networks that connect musical works and artists. Data about user streaming behaviour and the musical collaboration networks are particularly important with new data-driven recommendation systems. Here, we present a new collaboration network of artists from the online music streaming service Spotify and demonstrate a critical change in the eigenvector centrality of artists, as low popularity artists are removed. This critical change in centrality, from a central core of classical artists to a core of rap artists, demonstrates deeper structural properties of the network. Both the popularity and degree of collaborators play an important role in the centrality of these groups. Rap artists have dense collaborations with other popular artists whereas classical artists are ersely connected to a large number of low and medium popularity artists throughout the graph through renditions and compilations. A Social Group Centrality model is presented to simulate this critical transition behaviour, and switching between dominant eigenvectors is observed. By contrasting a group of high-degree ersely connected community leaders to a group of celebrities which only connect to high popularity nodes, this model presents a novel investigation into the effect of popularity bias on how centrality and importance are measured.
BGP route prediction within ISPs
Publisher: Elsevier BV
Date: 06-2010
Self-similar traffic and network dynamics
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2002
Lossy Compression of Dynamic, Weighted Graphs
Publisher: IEEE
Date: 08-2015
Super-blockers and the Effect of Network Structure on Information Cascades
Publisher: ACM Press
Date: 2018
Improving Hidden Markov Model Inferences With Private Data From Multiple Observers
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2012
Generating connected random graphs
Publisher: Oxford University Press (OUP)
Date: 20-03-2019
Abstract: S ling random graphs is essential in many applications, and often algorithms use Markov chain Monte Carlo methods to s le uniformly from the space of graphs. However, often there is a need to s le graphs with some property that we are unable, or it is too inefficient, to s le using standard approaches. In this article, we are interested in s ling graphs from a conditional ensemble of the underlying graph model. We present an algorithm to generate s les from an ensemble of connected random graphs using a Metropolis–Hastings framework. The algorithm extends to a general framework for s ling from a known distribution of graphs, conditioned on a desired property. We demonstrate the method to generate connected spatially embedded random graphs, specifically the well-known Waxman network, and illustrate the convergence and practicalities of the algorithm.
Towards a meaningful MRA of traffic matrices
Publisher: ACM
Date: 20-10-2008
Bigfoot, Sasquatch, the Yeti and other missing links: What we don't know about the AS graph
Publisher: ACM
Date: 20-10-2008
STRIP: Privacy-preserving vector-based routing
Publisher: IEEE
Date: 10-2013
On the predictive power of shortest-path weight inference
Publisher: ACM
Date: 20-10-2008
Diffusion wavelets-based analysis on traffic matrices
Publisher: IEEE
Date: 10-2011
Hidden Markov model identifiability via tensors
Publisher: IEEE
Date: 07-2013
On the correlation of internet packet losses
Publisher: IEEE
Date: 12-2008
Maximizing networking lifetime in wireless sensor networks with regular topologies
Publisher: IEEE
Date: 2008
Martingale methods for analysing single-server queues
Publisher: Springer Science and Business Media LLC
Date: 2002
Quantitative analysis of Incorrectly-Configured Bogon-Filter detection
Publisher: IEEE
Date: 12-2008
Conversion of Real-Numbered Privacy-Preserving Problems into the Integer Domain
Publisher: Springer Berlin Heidelberg
Date: 2012
Rigorous statistical analysis of internet loss measurements
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2013
10 Lessons from 10 Years of Measuring and Modeling the Internet's Autonomous Systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2011
Spatio-temporal compressive sensing and internet traffic matrices
Publisher: Association for Computing Machinery (ACM)
Date: 16-08-2009
Abstract: Many basic network engineering tasks (e.g., traffic engineering, capacity planning, anomaly detection) rely heavily on the availability and accuracy of traffic matrices. However, in practice it is challenging to reliably measure traffic matrices. Missing values are common. This observation brings us into the realm of compressive sensing, a generic technique for dealing with missing values that exploits the presence of structure and redundancy in many real-world systems. Despite much recent progress made in compressive sensing, existing compressive-sensing solutions often perform poorly for traffic matrix interpolation, because real traffic matrices rarely satisfy the technical conditions required for these solutions. To address this problem, we develop a novel spatio-temporal compressive sensing framework with two key components: (i) a new technique called Sparsity Regularized Matrix Factorization (SRMF) that leverages the sparse or low-rank nature of real-world traffic matrices and their spatio-temporal properties, and (ii) a mechanism for combining low-rank approximations with local interpolation procedures. We illustrate our new framework and demonstrate its superior performance in problems involving interpolation with real traffic matrices where we can successfully replace up to 98% of the values. Evaluation in applications such as network tomography, traffic prediction, and anomaly detection confirms the flexibility and effectiveness of our approach.
The internet topology zoo
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2011
Testing the reachability of (new) address space
Publisher: ACM
Date: 27-08-2007
Privacy-Preserving Fraud Detection Across Multiple Phone Record Databases
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2015
Impact of the COVID-19 pandemic on South Australia’s emergency departments: evidence from two lockdowns
Publisher: CSIRO Publishing
Date: 20-05-2021
DOI: 10.1071/AH20366
Abstract: Objective This study assessed the impact of the COVID-19 pandemic on emergency departments (EDs) in South Australia, measured by changes in the number and casemix of patients in the system over time. Methods Data from the South Australia Emergency Department Dashboard, updated every 30 min, were analysed for the period 4 October–21 December 2020. The Dashboard reports live counts of the number and type of patients in each of the six adult metropolitan public EDs in Adelaide, South Australia. Results There was a significant difference in the mean daily average occupied ED capacity before and during two distinct increases in COVID-19 cases in South Australia. An increase in COVID-19 cases coincided with a decrease in patients in EDs (Pearson’s r = –0.93 and –0.67 P 0.001 for both). Presentations in Australasian Triage Scale (ATS) Categories 2–5 decreased during these periods, whereas ATS Category 1 stayed constant. Mental health patients continued to present to the ED, despite the overall drop in ED presentations. Conclusions During the two periods of COVID-19 case growth in South Australia, there was a significant drop in the number of patients presenting to the major public EDs and a change in the casemix of patients over time. What is known about the topic? EDs in Australia often operate at or over capacity, with frequent reports of ambulance r ing, access block and long waiting times. There have been reports internationally of significant declines in ED presentations throughout the COVID-19 pandemic. What does this paper add? This paper uses a novel publicly available data source that is available in real time to contribute a new perspective from South Australia, which has experienced two distinct periods of strict restrictions and lockdown. The research showed that the number of mental health presentations remained consistently high, despite a significant overall decline in ED occupancy. What are the implications for practitioners? This study demonstrates that South Australians are accessing emergency medical treatment differently in response to the COVID-19 pandemic. In the context of an overall decline in presentation numbers, the number of mental health-related presentations has not changed significantly, suggesting that this trend should be closely monitored. The findings corroborate the national concern that unwell people have avoided accessing emergency medical care during the pandemic, leading to worse outcomes and increased need for healthcare resources at a later date. It will be important to monitor and quickly detect further changes in ED usage using real-time data as the pandemic evolves, as well as in any future significant health crises.
Generating Name-Like Vectors for Testing Large-Scale Entity Resolution
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Network link tomography and compressive sensing
Publisher: ACM
Date: 07-06-2011
Towards Standardising Firewall Reporting
Publisher: Springer International Publishing
Date: 2016
Performance of traffic in traffic engineering
Publisher: Association for Computing Machinery (ACM)
Date: 10-06-2003
Abstract: We consider the performance of estimated traffic matrices in traffic engineering. More precisely, we first optimize the routing in an IP backbone to minimize congestion with the estimated traffic matrix. We then test the performance of the resulting routing on the real traffic matrix.
The robust yet fragile nature of the Internet
Publisher: Proceedings of the National Academy of Sciences
Date: 04-10-2005
Abstract: The search for unifying properties of complex networks is popular, challenging, and important. For modeling approaches that focus on robustness and fragility as unifying concepts, the Internet is an especially attractive case study, mainly because its applications are ubiquitous and pervasive, and widely available expositions exist at every level of detail. Nevertheless, alternative approaches to modeling the Internet often make extremely different assumptions and derive opposite conclusions about fundamental properties of one and the same system. Fortunately, a detailed understanding of Internet technology combined with a unique ability to measure the network means that these differences can be understood thoroughly and resolved unambiguously. This article aims to make recent results of this process accessible beyond Internet specialists to the broader scientific community and to clarify several sources of basic methodological differences that are relevant beyond either the Internet or the two specific approaches focused on here (i.e., scale-free networks and highly optimized tolerance networks).
Mathematical Reconciliation of Medical Privacy Policies
Publisher: Association for Computing Machinery (ACM)
Date: 08-12-2020
DOI: 10.1145/3397520
Abstract: Healthcare data are arguably the most private of personal data. This very private information in the wrong hands can lead to identity theft, prescription fraud, insurance fraud, and an array of other crimes. Electronic-health systems such as My Health Record in Australia holds great promise in sharing medical data and improving healthcare quality. But, a key privacy issue in these systems is the misuse of healthcare data by “authorities.” The recent General Data Protection Regulation (GDPR) introduced in the EU aims to reduce personal-data misuse. But, there are no tools currently available to accurately reconcile a domestic E-health policy against the GDPR to identify discrepancies. Reconciling privacy policies is also non-trivial, because policies are often written in free text, making them subject to human interpretation. In this article, we propose a tool that allows the description of E-health privacy policies, represents them using formal constructs making the policies precise and explicit. Using this formal framework, our tool can automatically reconcile a domestic E-health policy against the GDPR to identify violations and omissions. We use our prototype to illustrate several critical flaws in Australia’s My Health Record policy, including a non-compliance with GDPR that allows healthcare providers to access medical records by default.
Video Assessment Tasks in Tertiary Education: Practice and Experience in STEM
Publisher: Center for Open Science
Date: 06-10-2020
Abstract: The COVID-19 (Coronavirus) pandemic mandated many changes in delivery and assessment in the first half of 2020. This paper describes one tool for assessment that might never have been trialled without this impetus – video creation – that proved to be a valuable and interesting approach with many advantages over traditional assessment methods. Used in conjunction with traditional assessments I believe this will enhance both quality of assessment and student engagement.
How the Avengers assemble: Ecological modelling of effective cast sizes for movies
Publisher: Public Library of Science (PLoS)
Date: 26-02-2020
Fundamental bounds on the accuracy of network performance measurements
Publisher: ACM
Date: 06-06-2005
Simplifying the synthesis of internet traffic matrices
Publisher: Association for Computing Machinery (ACM)
Date: 06-10-2005
Abstract: A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial input for testing many new networking algorithms, but traffic matrices themselves are generally kept secret by providers. Furthermore, even given traffic matrices from a real network, it is difficult to realistically adjust these to generate a range of scenarios (for instance for different network sizes). This note is concerned with the first step presented in [8]: generation of a matrix with similar statistics to that of a real traffic matrix. The method applied in [8] is based on fitting a large number of distributions, and finding that the log-normal distribution appears to fit most consistently. Best fits (without some intuitive explanation for the fit) are fraught with problems. How general are the results? How do the distribution parameters relate? This note presents a simpler approach based on a gravity model. Its simplicity provides us with a better understanding of the origins of the results of [8], and this insight is useful, particularly because it allows one to adapt the synthesis process to different scenarios in a more intuitive manner. Additionally, [8] measures the quality of its fit to the distribution's body. This note shows that the tails of the distributions are less heavy than the log-normal distribution (a counterintuitive result for Internet traffic), and that the gravity model replicates these tails more accurately.
Likelihood-Based Inference for Modelling Packet Transit From Thinned Flow Summaries
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Node Localisation in Wireless Ad Hoc Networks
Publisher: IEEE
Date: 11-2007
Privacy-preserving performance measurements
Publisher: ACM
Date: 11-09-2006
Counting Candy Crush configurations
Publisher: Elsevier BV
Date: 05-2021
GATEway: symbiotic inter-domain traffic engineering
Publisher: Springer Science and Business Media LLC
Date: 05-05-2010
On the identifiability of multi-observer hidden Markov models
Publisher: IEEE
Date: 03-2012
A BasisEvolution framework for network traffic anomaly detection
Publisher: Elsevier BV
Date: 04-2018
Fast Generation of Spatially Embedded Random Networks
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2017
Guest editorial - internet scalability: properties and evolution
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2008
Case Studies of SCADA Firewall Configurations and the Implications for Best Practices
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2016
Where’s Waldo? practical searches for stability in iBGP
Publisher: IEEE
Date: 10-2008
Practically surreal: Surreal arithmetic in Julia
Publisher: Elsevier BV
Date: 2019
Large-scale measurement and modeling of backbone internet traffic
Publisher: SPIE
Date: 02-07-2002
DOI: 10.1117/12.473390
A comparison of poisson and uniform sampling for active measurements
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2006
Spatio-Temporal Compressive Sensing and Internet Traffic Matrices (Extended Version)
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2012
Verifiable Policy-Defined Networking Using Metagraphs
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
The Measurement Paradox in Valiant Network Design
Publisher: Hindawi Limited
Date: 2009
DOI: 10.1155/2009/939840
Abstract: Valiant network design was proposed, at least in part, to counter the difficulties in measuring network traffic matrices. However, in this paper we show that in a Valiant network design, the traffic matrix is in fact easy to measure, leading to a subtle paradox in the design strategy.
Humpty Dumpty: Putting iBGP Back Together Again
Publisher: Springer Berlin Heidelberg
Date: 2009
An Information-Theoretic Approach to Traffic Matrix Estimation
Publisher: Association for Computing Machinery (ACM)
Date: 27-08-2003
Abstract: This paper presents the design of a new Internet routing architecture (NIRA). In today's Internet, users can pick their own ISPs, but once the packets have entered the network, the users have no control over the overall routes their packets take. NIRA aims at providing end users the ability to choose the sequence of Internet service providers a packet traverses. User choice fosters competition, which imposes an economic discipline on the market, and fosters innovation and the introduction of new services.This paper explores various technical problems that would have to be solved to give users the ability to choose: how a user discovers routes and whether the dynamic conditions of the routes satisfy his requirements, how to efficiently represent routes, and how to properly compensate providers if a user chooses to use them. In particular, NIRA utilizes a hierarchical provider-rooted addressing scheme so that a common type of domain-level route can be efficiently represented by a pair of addresses. In NIRA, each user keeps track of the topology information on domains that provide transit service for him. A source retrieves the topology information of the destination on demand and combines this information with his own to discover end-to-end routes. This route discovery process ensures that each user does not need to know the complete topology of the Internet.
Pragmatic modeling of broadband access traffic
Publisher: Elsevier BV
Date: 05-2003
Identifying the missing aspects of the ANSI/ISA best practices for security policy
Publisher: ACM
Date: 14-04-2015
Spatiotemporal Traffic Matrix Synthesis
Publisher: ACM
Date: 17-08-2015
Computation of IP traffic from link
Publisher: Association for Computing Machinery (ACM)
Date: 10-06-2003
Abstract: A matrix giving the traffic volumes between origin and destination in a network has tremendously potential utility for network capacity planning and management. Unfortunately, traffic matrices are generally unavailable in large operational IP networks. On the other hand, link load measurements are readily available in IP networks. In this paper, we propose a new method for practical and rapid inference of traffic matrices in IP networks from link load measurements, augmented by readily available network and routing configuration information. We apply and validate the method by computing backbone-router to backbone-router traffic matrices on a large operational tier-1 IP network -- a problem an order of magnitude larger than any other comparable method has tackled. The results show that the method is remarkably fast and accurate, delivering the traffic matrix in under five seconds.
Multi-observer privacy-preserving hidden markov models
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2013
MGtoolkit: A python package for implementing metagraphs
Publisher: Elsevier BV
Date: 2017
Clear As MUD: Generating, Validating and Applying IoT Behavioral Profiles
Publisher: ACM
Date: 07-08-2018
Network-design sensitivity analysis
Publisher: ACM
Date: 16-06-2014
#IStandWithPutin Versus #IStandWithUkraine: The Interaction of Bots and Humans in Discussion of the Russia/Ukraine War
Publisher: Springer International Publishing
Date: 2022
Wide-Scale Monitoring of Satellite Lifetimes: Pitfalls and a Benchmark Dataset
Publisher: American Institute of Aeronautics and Astronautics (AIAA)
Date: 25-08-2023
DOI: 10.2514/1.A35642
CleanBGP: verifying the consistency of BGP data
Publisher: IEEE
Date: 10-2008
I can see for miles: Re-visualizing the internet
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2012
The multilevel splitting algorithm for graph colouring with application to the Potts model
Publisher: Informa UK Limited
Date: 13-04-2017
Estimating point-to-point and point-to-multipoint traffic matrices: An information-theoretic approach
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2005
GATEway: symbiotic inter-domain traffic engineering
Publisher: ICST
Date: 2008
The need for simulation in evaluating anomaly detectors
Publisher: Association for Computing Machinery (ACM)
Date: 30-01-2008
Abstract: Anomalous events that affect the performance of networks are a fact of life. It is therefore not surprising that recent years have seen an explosion in research on network anomaly detection. What is quite surprising, however, is the lack of controlled evaluation of these detectors. In this paper we argue that there are numerous important questions regarding the effectiveness of anomaly detectors that cannot be answered by the evaluation techniques employed today. We present four central requirements of a rigorous evaluation that can only be met by simulating both the anomaly and its surrounding environment. While simulation is necessary, it is not sufficient. We therefore present an outline of an evaluation methodology that leverages both simulation and traces from operational networks
Building an AS-topology model that captures route diversity
Publisher: Association for Computing Machinery (ACM)
Date: 11-08-2006
Abstract: An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e. g., making decisions about peering relationships, choice of upstream providers, inter-domain traffic engineering. One essential component of these tasks is the ability to predict routes in the Internet. However, the Internet is composed of a large number of independent autonomous systems (ASes) resulting in complex interactions, and until now no model of the Internet has succeeded in producing predictions of acceptable accuracy.We demonstrate that there are two limitations of prior models: (i) they have all assumed that an Autonomous System (AS) is an atomic structure - it is not, and (ii) models have tended to oversimplify the relationships between ASes. Our approach uses multiple quasi-routers to capture route ersity within the ASes, and is deliberately agnostic regarding the types of relationships between ASes. The resulting model ensures that its routing is consistent with the observed routes. Exploiting a large number of observation points, we show that our model provides accurate predictions for unobserved routes, a first step towards developing structural mod-els of the Internet that enable real applications.
Rigorous statistical analysis of Internet loss measurements
Publisher: Association for Computing Machinery (ACM)
Date: 12-06-2010
Abstract: In this paper we present a rigorous technique for estimating confidence intervals of packet loss measurements. Our approach is motivated by simple observations that the loss process can be modelled as an alternating renewal process. We use this structure to build a Hidden Semi-Markov Model (HSMM) for the measurement process, and from this estimate both loss rates, and their confidence intervals. We use both simulations and a set of more than 18000 hours of real Internet measurements (between dedicated measurement hosts, PlanetLab hosts, web and DNS servers) to cross-validate our estimates, and show that they are significantly more accurate than any current alternative.
An automated system for emulated network experimentation
Publisher: ACM
Date: 09-12-2013
Some remarks on unexpected scaling exponents
Publisher: Association for Computing Machinery (ACM)
Date: 20-10-2007
Public review for the devil and packet trace anonymization
Publisher: Association for Computing Machinery (ACM)
Date: 10-01-2006
Abstract: Reproducible research hinges on the ability to use common datasets, and so public datasets containing measurements of real, operational networks are important for the Internet measurement community, and subsequently for all those fields of networking that use their research. There are several such datasets available now, but given the ongoing evolution of the Internet, more are always needed. However, such data is often considered proprietary, or its release raises privacy or security concerns, and so access to data is often limited to the organization that collected itAnonymization of data has sometimes been used to remove the offending components of a dataset so that the remainder can be made public.As with all such work, the Devil is in the detail. Different organizations have their own requirements for anonymization, while on the other hand, researchers have different interests in a dataset. Particular aspects of an anonymization may remove the component of the data that is of interest in a study. Anonymization policies that balance security and privacy with research value are needed. It is a challenging problem --- as one reviewer put it "the difference between a researcher and an attacker cannot be expressed in pure data analysis terms. It is motivation or funding source that makes the difference.In studying the issues of their own organization, the authors of this paper sought not to add a new tool that would perform anonymization according to their own policies, but rather they aimed to create a new (freely available) tool 'tcpmkpub,' which would allow one to implement complicated, multifaceted anonymization policies, considerably beyond the capabilities of existing tools. The paper also provides considerable discussion of the issues surrounding anonymization policies, and finally provides access to a large dataset (11 GB set of packet traces anonymized using their tool)The reviewers were all largely positive about the paper, for instance saying "it raises the level of thoroughness at which packet traces are anonymized," and "The authors present a tool able to fulfil this task [anonymization] in an elegant way and whose flexibility promises to make it easy to adapt in different environments." However, two reviewers noted the fundamental problem of making a trace totally attacker proof is not solved here, though this problem is highly challenging, and perhaps not solvable --- so there is plenty of remaining research to be performed in this area
Bayesian Inference of Network Structure From Information Cascades
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Computing queue-length distributions for power-law queues
Publisher: IEEE
Date: 1998
How to build complex, large-scale emulated networks
Publisher: Springer Berlin Heidelberg
Date: 2011
On the beneficial impact of strong correlations for anomaly detection
Publisher: Informa UK Limited
Date: 12-02-2009
The Many Facets of Internet Topology and Traffic
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 2006
A strategic planning model for the operation plan in lamb supply chains
Publisher: Modelling and Simulation Society of Australia and New Zealand
Date: 08-2023
Controlled Synthesis of Traffic Matrices
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2017
Related Organisations
Related Funding Activities
Discovery Projects - Grant ID: DP0665427
Start Date: 2006
End Date: 12-2010
Amount: $240,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP100200493
Start Date: 11-2010
End Date: 12-2016
Amount: $104,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP210103700
Start Date: 12-2021
End Date: 12-2024
Amount: $390,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP140100489
Start Date: 07-2014
End Date: 07-2018
Amount: $194,873.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0985063
Start Date: 2009
End Date: 12-2015
Amount: $315,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0557066
Start Date: 2005
End Date: 12-2008
Amount: $388,000.00
Funder: Australian Research Council
View Funded ActivityARC Centres Of Excellence - Grant ID: CE140100049
Start Date: 06-2014
End Date: 12-2021
Amount: $20,000,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Infrastructure, Equipment And Facilities - Grant ID: LE150100030
Start Date: 03-2015
End Date: 03-2018
Amount: $270,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP110103505
Start Date: 2011
End Date: 12-2017
Amount: $425,000.00
Funder: Australian Research Council
View Funded Activity