Dynamic reconfiguration of telecommunication networks
- Authors: Dzalilov, Zari , Ouveysi, Iradj , Rubinov, Alex
- Date: 2003
- Type: Text , Conference paper
- Relation: Paper presented at the Industrial Optimisation 2003 Conference, Perth : 30th October, 2002
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000451
Visual tools for analysing evolution, emergence, and error in data streams
- Authors: Hart, Sol , Yearwood, John , Bagirov, Adil
- Date: 2007
- Type: Text , Conference paper
- Relation: Paper presented at 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007, Melbourne, Victoria : 11th-13th July 2007 p. 987-992
- Full Text:
- Description: The relatively new field of stream mining has necessitated the development of robust drift-aware algorithms that provide accurate, real time, data handling capabilities. Tools are needed to assess and diagnose important trends and investigate drift evolution parameters. In this paper, we present two new and novel visualisation techniques, Pixie and Luna graphs, which incorporate salient group statistics coupled with intuitive visual representations of multidimensional groupings over time. Through the novel representations presented here, spatial interactions between temporal divisions can be diagnosed and overall distribution patterns identified. It provides a means of evaluating in non-constrained capacity, commonly constrained evolutionary problems.
- Description: 2003005432
A highway-centric labeling approach for answering distance queries on large sparse graphs
- Authors: Jin, Ruoming , Ruan, Ning , Xiang, Yang , Lee, Victor
- Date: 2012
- Type: Text , Conference paper
- Relation: ACM SIGMOD International Conference on Management of Data, 2012 p. 445-456
- Full Text: false
- Reviewed:
- Description: The distance query, which asks the length of the shortest path from a vertex u to another vertex v, has applications ranging from link analysis, semantic web and other ontology processing, to social network operations. Here, we propose a novel labeling scheme, referred to as Highway-Centric Labeling, for answering distance queries in a large sparse graph. It empowers the distance labeling with a highway structure and leverages a novel bipartite set cover framework/algorithm. Highway-centric labeling provides better labeling size than the state-of-the-art 2-hop labeling, theoretically and empirically. It also offers both exact distance and approximate distance with bounded accuracy. A detailed experimental evaluation on both synthetic and real datasets demonstrates that highway-centric labeling can outperform the state-of-the-art distance computation approaches in terms of both index size and query time. © 2012 ACM.
- Description: Proceedings of the ACM SIGMOD International Conference on Management of Data
Dynamic reconfiguration and graph theory approaches to failures in IT based telecommunication networks
- Authors: Patel, Keyurkumar , Dzalilov, Zari
- Date: 2004
- Type: Text , Conference paper
- Relation: Paper presented at 4th IASTED International Conference on Modelling, Simulation, and Optimisation, Marbella, Spain : 17-19th August, 2004 p. 219-244
- Full Text: false
- Reviewed:
- Description: For the last quarter of a century understanding of the nature of telecommunication network traffic has been considered as an important research topic. Any well designed recovery strategy has to take into account the different resilience requirements of the single traffic flows in order to avoid excessive usage of bandwidth for standby links. Faced with multiple recovery options, an internet service provider (ISP) must decide which flows to protect to what extent against networks. Traditional techniques and models used to determine the availability and failure rates of telecommunications networks are based on classic failure models such as Mean-time between failure and Mean-time between service outage predictors. Network failures occur for many different reasons and occur in many different forms. These classic models only assume that the failure is caused by a hardware component of the network. With the widespread deployment of Internet technologies other factors that cause or contribute to failure in a telecommunications network must be explored. Two additional failure modes to existing published failure models, failure from Denial of Service attacks, and failures due to catastrophic events have been identified and defined along with an initial outline of a generalized prediction model based on Dynamic System Theory. Discussion is done on the effects of failures and survivability issues in network failures and how to overcome failures in IT based telecommunication network
- Description: E1
- Description: 2003002567