Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • Sistem İçeriği
  • Analiz
  • Talep/Soru
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Fesci-Sayit M." seçeneğine göre listele

Listeleniyor 1 - 2 / 2
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Küçük Resim Yok
    Öğe
    Bandwidth-aware multiple multicast tree formation for P2P scalable video streaming using hierarchical clusters
    (IEEE Computer Society, 2009) Fesci-Sayit M.; Tunali E.T.; Tekalp A.M.
    Peer-to-peer (P2P) video streaming is a promising method for multimedia distribution over the Internet, yet many problems remain to be solved such as providing the best quality of service to each peer in proportion to its available resources, low-delay, and fault tolerance. In this paper, we propose a new bandwidth-aware multiple multicast tree formation procedure built on top of a hierarchical cluster based P2P overlay architecture for scalable video (SVC) streaming. The tree formation procedure considers number of sources, SVC layer rates available at each source, as well as delay and available bandwidth over links in an attempt to maximize the quality of received video at each peer. Simulations are performed on NS2 with 500 nodes to demonstrate that the overall performance of the system in terms of average received video quality of all peers is significantly better if peers with higher available bandwidth are placed higher up in the trees and peers with lower bandwidth are near the leaves. ©2009 IEEE.
  • Küçük Resim Yok
    Öğe
    An efficient JSD-based search on interest-based hierarchical clustering of overlay networks
    (2010) Bulut H.; Yardimci A.; Demirci S.; Kaymak Y.; Fesci-Sayit M.; Tunali E.T.
    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. Copyright © IARIA, 2010.

| Ege Üniversitesi | Kütüphane | Açık Erişim Politikası | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Ege Üniversitesi Rektörlüğü Gençlik Caddesi No : 12 35040 Bornova - İZMİR, TÜRKİYE
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

DSpace 7.6.1, Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2025 LYRASIS

  • Çerez Ayarları
  • Gizlilik Politikası
  • Son Kullanıcı Sözleşmesi
  • Geri Bildirim