Research Outputs

Permanent URI for this communityhttps://hdl.handle.net/20.500.14288/2

Browse

Filters

2006 - 20083

Advanced Search

Filter by

Settings

Department: search.filters.department.Department of MathematicsSubject: search.filters.subject.Computer engineering

Search Results

Now showing 1 - 3 of 3
  • Placeholder
    PublicationMetadata only
    Analytical model for topology dependence in peer-to-peer anti-entropy spreading
    (Bogazici University, 2008) N/A; Department of Computer Engineering; Department of Mathematics; Özkasap, Öznur; Çağlar, Mine; İskender, Emre; Faculty Member; Faculty Member; Master Student; Department of Computer Engineering; Department of Mathematics; College of Engineering; College of Sciences; Graduate School of Sciences and Engineering; 113507; 105131; N/A
    We examine spreading of epidemics for an anti-entropy algorithm in networks with various P2P (peer-to-peer) overlay topologies. Neighborhood knowledge among peers and information exchange based on proximity are considered. Our analytical model for SI (Susceptible-Infected) epidemics involves equations for calculating the infection probability of each peer in consecutive epidemic rounds as a function of the topology. Using numerical evaluations, we study the effect of graph properties on dissemination as an aspect of real world P2P overlays
  • Placeholder
    PublicationMetadata only
    Stepwise probabilistic buffering for epidemic information dissemination
    (Institute of Electrical and Electronics Engineers (IEEE), 2006) N/A; Department of Mathematics; Department of Computer Engineering; Ahi, Emrah; Çağlar, Mine; Özkasap, Öznur; Master Student; Faculty Member; Faculty Member; Department of Mathematics; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Sciences; College of Engineering; N/A; 105131; 113507
    For large-scale peer-to-peer applications, bioinspired epidemic protocols have considerable advantages as they are robust against network failures, scalable and provide probabilistic reliability guarantees. While providing reliability, a key issue to consider is the usage of system wide buffer space. In this context, we introduce a novel scheme called stepwise probabilistic buffering that reduces the amount of buffering and distributes the load of buffering to the entire system where every peer does not have the complete view of the system. We compute the performance measures through simulations of large-scale application scenarios.
  • Placeholder
    PublicationMetadata only
    Topology dependent information dissemination in P2P networks for anti-entropy algorithms
    (IEEE, 2008) N/A; Department of Computer Engineering; Department of Mathematics; Özkasap, Öznur; Çağlar, Mine; İskender, Emre; Faculty Member; Faculty Member; Master Student; Department of Computer Engineering; Department of Mathematics; College of Engineering; College of Sciences; Graduate School of Sciences and Engineering; 113507; 105131; N/A
    Analyzing the behavior of epidemic spreading in a network is a good way of modeling several network phenomena. There are several studies analyzing the spreading of email viruses. Spreading of epidemics is also a good model for several types of information dissemination in distributed systems. In this study, we examine spreading of epidemics for anti-entropy algorithms in a peer-to-peer network with any given topology. We derive nodes' exact probability distributions of being infected in each epidemic cycle.