Researcher:
Ahi, Emrah

Profile Picture
ORCID

Job Title

Master Student

First Name

Emrah

Last Name

Ahi

Name

Name Variants

Ahi, Emrah

Email Address

Birth Date

Filters

2006 - 20073

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.a3184039-6f91-4e5a-9cce-76f4d516ac5a

Search Results

Now showing 1 - 3 of 3
  • 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
    Stepwise fair-share buffering underneath bio-inspired P2P data dissemination
    (IEEE Computer Soc, 2007) 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
    We consider buffer management problem in support of large-scale bio-inspired peer-to-peer data dissemination services. Bio-inspired epidemic protocols have considerable benefits as they are robust against network failures, scalable and provide probabilistic reliability guarantees. Coupled with an efficient buffering mechanism, system wide buffer usage can be optimized while providing reliability and scalability in such protocols. We propose a novel algorithm, Stepwise Fair-share Buffering, that provides uniform load distribution in comparison to earlier approaches and reduces the overall buffer usage where every peer has the partial view of the system. We report and discuss the comparative performance results and provide an analytical evaluation of our approach.
  • Placeholder
    PublicationMetadata only
    Message buffering in epidemic data dissemination
    (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
    In reliable group communication, epidemic or probabilistic protocols gained popularity due to their scalability to large number of peers and robustness against network failures. Reliability properties of these protocols are ensured via probabilistic guarantees. A key issue to consider when offering reliability is the buffer space used by individual peers of the group. Our aim is to optimize the buffer space while providing reliability in epidemic data dissemination protocols. We introduce a novel randomized model and compare it with a hash-based approach for buffer management. The effect of short and Iona, term buffering of peers and the buffer size on delivery latency and reliability are considered. We compute the performance measures through simulations of large-scale application scenarios.