Browsing by Subject "Network management"

Filter results by typing the first few letters
Now showing 1 - 6 of 6
  • Thumbnail Image
    ItemOpen Access
    ALACA: a platform for dynamic alarm collection and alert notification in network management systems
    (John Wiley and Sons Ltd., 2017) Solmaz, S. E.; Gedik, B.; Ferhatosmanoğlu, H.; Sözüer, S.; Zeydan, E.; Etemoğlu, Ç. Ö.
    Mobile network operators run Operations Support Systems that produce vast amounts of alarm events. These events can have different significance levels and domains and also can trigger other ones. Network operators face the challenge to identify the significance and root causes of these system problems in real time and to keep the number of remedial actions at an optimal level, so that customer satisfaction rates can be guaranteed at a reasonable cost. In this paper, we propose a scalable streaming alarm management system, referred to as Alarm Collector and Analyzer, that includes complex event processing and root cause analysis. We describe a rule mining and root cause analysis solution for alarm event correlation and analyses. The solution includes a dynamic index for matching active alarms, an algorithm for generating candidate alarm rules, a sliding window–based approach to save system resources, and a graph-based solution to identify root causes. Alarm Collector and Analyzer is used in the network operation center of a major mobile telecom provider. It helps operators to enhance the design of their alarm management systems by allowing continuous analysis of data and event streams and predict network behavior with respect to potential failures by using the results of root cause analysis. We present experimental results that provide insights on performance of real-time alarm data analytics systems. Copyright © 2017 John Wiley & Sons, Ltd.
  • Thumbnail Image
    ItemOpen Access
    A connection management protocol for promoting cooperation in Peer-to-Peer networks
    (Elsevier BV, 2008-02-05) Karakaya, M.; Körpeoǧlu, I.; Ulusoy, Özgür
    The existence of a high degree of free riding in Peer-to-Peer (P2P) networks is an important threat that should be addressed while designing P2P protocols. In this paper we propose a connection-based solution that will help to reduce the free riding effects on a P2P network and discourage free riding. Our solution includes a novel P2P connection type and an adaptive connection management protocol that dynamically establishes and adapts a P2P network topology considering the contributions of peers. The aim of the protocol is to bring contributing peers closer to each other on the adapted topology and to push the free riders away from the contributors. In this way contribution is promoted and free riding is discouraged. Unlike some other proposals against free riding, our solution does not require any permanent identification of peers or a security infrastructure for maintaining a global reputation system. It is shown through simulation experiments that there is a significant improvement in performance for contributing peers in a network that applies our protocol. © 2007 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    ItemOpen Access
    Counteracting free riding in Peer-to-Peer networks
    (Elsevier BV, 2008-03) Karakaya, M.; Körpeoǧlu, I.; Ulusoy, O.
    The existence of a high degree of free riding is a serious threat to Peer-to-Peer (P2P) networks. In this paper, we propose a distributed framework to reduce the adverse effects of free riding on P2P networks. Our solution primarily focuses on locating free riders and taking actions against them. We propose a framework in which each peer monitors its neighbors, decides if they are free riders, and takes appropriate actions. Unlike other proposals against free riding, our framework does not require any permanent identification of peers or security infrastructures for maintaining a global reputation system. Our simulation results show that the framework can reduce the effects of free riding and can therefore increase the performance of a P2P network. © 2007 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    ItemOpen Access
    Investigation of load balancing scalability in space plasma simulations
    (Springer, Berlin, Heidelberg, 2013) Türk, Ata; Demirci, Gündüz V.; Aykanat, Cevdet; Von Alfthan, S.; Honkonen I.
    In this study we report the load-balancing performance issues that are observed during the petascaling of a space plasma simulation code developed at the Finnish Meteorological Institute (FMI). The code models the communication pattern as a hypergraph, and partitions the computational grid using the parallel hypergraph partitioning scheme (PHG) of the Zoltan partitioning framework. The result of partitioning determines the distribution of grid cells to processors. It is observed that the initial partitioning and data distribution phases take a substantial percentage of the overall computation time. Alternative (graph-partitioning-based) schemes that provide better balance are investigated. Comparisons in terms of effect on running time and load-balancing quality are presented. Test results on Juelich BlueGene/P cluster are reported. © 2013 Springer-Verlag.
  • Thumbnail Image
    ItemOpen Access
    Online balancing two independent criteria
    (Springer, 2008-10) Tse, Savio S.H.
    We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing their loads and required storage spaces. We first revisit the best existing solution for document placement, and rewrite it in our first algorithm by imposing some flexibilities. The second algorithm bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively; and more importantly, for each server, the value of at least one parameter is far from its worst case. The time complexities for both algorithm are O(logM). © 2008 Springer Berlin Heidelberg.
  • Thumbnail Image
    ItemOpen Access
    A reordering-free multipath traffic engineering architecture for DiffServ-MPLS networks
    (IEEE, 2003-10) Akar, Nail; Hokelek, İbrahim; Atik, Muammer; Karasan, Ezhan
    We propose a novel traffic engineering architecture for IP networks with multiprotocol label switching (MPLS) backbones. In this architecture, two (primary and secondary) label switched paths (LSPs) are established among every pair of IP routers located at the edge of an MPLS cloud. Traffic between a source-destination pair is then split between the primary and secondary LSPs using an ABR-like explicit-rate feedback gathered from the network. Taking into consideration the packet reordering effect of packet-based load balancing schemes, we propose a novel traffic splitting mechanism that operates on a per-flow basis. We show, using a variety of scenarios, that deploying flow-based multipath traffic engineering not only provides significantly and consistently better throughput than that of a single path, but is also void of any packet reordering. © 2003 IEEE.