Emine Şule Yazıcı

An analytical framework for self-organizing peer-to-peer anti-entropy algorithms

An analytical framework is developed for establishing exact performance measures for peer-to-peer (P2P) anti-entropy paradigms used in biologically inspired epidemic data dissemination. Major benefits of these paradigms are that they are fully distributed, self-organizing, utilize local data only via pair-wise interactions, and provide eventual consistency, reliability and scalability. We derive exact expressions for infection probabilities through elaborated counting techniques on a digraph. Considering the first passage times of a Markov chain based on these probabilities, we find the expected message delay experienced by each peer and its overall mean as a function of initial number of infectious peers. Further delay and overhead analysis is given through simulations and the analytical framework. The number of contacted peers at each round of the anti-entropy approach is an important parameter for both delay and overhead. These exact performance measures and theoretical results would be beneficial when utilizing the models in several P2P distributed system and network services such as replicated servers, multicast protocols, loss recovery, failure detection and group membership management.

Minimal homogeneous latin trades

A latin trade is a subset of a latin square which may be replaced with a disjoint mate to obtain a new latin square. A d-homogeneous latin trade is one which intersects each row, each column and each entry of the latin square either 0 or d times. In this paper we give a construction for minimal d-homogeneous latin trades of size dm, for every integer d>=3, and m>=1.75d^2+3. We also improve this bound for small values of d. Our proof relies on the construction of cyclic sequences whose adjacent sums are distinct.

A polynomial embedding of pairs of orthogonal partial Latin squares

Abstract We show that a pair of orthogonal partial Latin squares of order n can be embedded in a pair of orthogonal Latin squares of order at most 16 n 4 and all orders greater than or equal to 48 n 4 . This paper provides the first direct polynomial order embedding construction for pairs of orthogonal partial Latin squares.

Orthogonal Trades and the Intersection Problem for Orthogonal Arrays

This work provides an orthogonal trade for all possible volumes

Exact probability distributions for peer-to-peer epidemic information diffusion

N \in \mathbb {Z}^+ \setminus \{1,2,3,4,5,7\}

On The Spectrum of Minimal Defining Sets of Full Designs

N∈Z+\{1,2,3,4,5,7} for block size 4. All orthogonal trades of volume

Estimates of the coverage of parameter space by Latin Hypercube and Orthogonal array-based sampling

N\leqslant 15