Browsing by Author "Kaymak, Yagiz"

Now showing 1 - 3 of 3

Citation - WoS: 6
Citation - Scopus: 5
Adaptive, Incentive and Scalable Dynamic Tree Overlay for P2p Live Video Streaming
(Springer, 2016) Sayit, Muge; Demirci, Sercan; Kaymak, Yagiz; Tunali, E. Turhan
In this paper, we propose a new multicast tree framework to be used in peer-to-peer (P2P) live video streaming systems. The proposed system, adapts the tree links under high peer churn and runs in a totally distributed manner. In order to provide this dynamism and seamless streaming at the same time, we propose a cross layer design involving scalable video codec, backup parents and hierarchical clusters. The performance of the system is measured in real world environment PlanetLab that has nodes distributed all over the world. The experiments show that the proposed system provides high quality of experience (QoE) in terms of Peak Signal to Noise Ratio (PSNR), playback delay and duration of pauses. The proposed system also provides incentive mechanism to its users.
Citation - WoS: 1
Citation - Scopus: 1
An Efficient Jsd-Based Search on Interest-Based Hierarchical Clustering of Overlay Networks
(Iaria Xps Press, 2010) Bulut, Hasan; Yardimci, Asil; Demirci, Sercan; Kaymak, Yagiz; Fesci-Sayit, Muge; Tunali, E. Turhan
In P2P networks, peers share contents, especially video files, which represent their interests. However, the underlying P2P topology may not represent this interest distribution. Thus, one important aspect of constructing an efficient P2P network is to exploit the interest similarity among peers. In this paper, we propose a hierarchical clustering mechanism for constructing an overlay network that takes interest similarity among peers into account. By measuring the similarity among interests of peers and clusters, interest-based hierarchical clusters are formed by using Jensen-Shannon Divergence metric. The clustering performance metrics, accuracy and correctness, are reported on PlanetLab. For limited keyword collections, a novel Jensen-Shannon Divergence-based search mechanism is implemented. It has been observed that the integrated mechanism provides an efficient method and better performance as compared to classical keyword-based search.
Citation - WoS: 25
Citation - Scopus: 35
Shortest Hop Multipath Algorithm for Wireless Sensor Networks
(Pergamon-Elsevier Science Ltd, 2012) Yilmaz, Onur; Demirci, Serkan; Kaymak, Yagiz; Ergun, Serkan; Yildirim, Ahmet
Shortest hop or distance path is one of the most common methods used for relaying messages in a wide variety of networks. It provides an efficient message relaying to destination in terms of energy and time. There are many algorithms for constructing shortest hop or distance path. However, according to our knowledge, no algorithm for constructing a shortest hop multipath for wireless sensor networks (WSNs) has yet been proposed in the literature. In this paper, we propose a novel distributed shortest hop multipath algorithm for WSNs in order to generate energy efficient paths for data dissemination or routing. The proposed algorithm generates shortest hop braided multipath to be used for fault-tolerance or load-balancing. It guarantees the BFS tree and generates near optimal paths in O(V.D + V) message complexity and O(D-2) time complexity regarding the communication costs towards the sink after termination of algorithm. (C) 2011 Elsevier Ltd. All rights reserved.