Protocol and connectivity based overlay level capacity calculation of P2P networks

Date

2006-12-22

Author

Oztoprak, Kasim
Kilic, Hurevren

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

99
views

0
downloads

In this paper, we proposed a metric for P2P networks based on Shannon's L-channel capacity calculation idea. The metric calculates the maximum rate of information (in bits per second) that can be transmitted over P2P network (a.k.a. combinatorial capacity) caused by protocol and overlay-level connectivity. We suggest P2P systems to be modeled as a discrete noiseless channel on which the protocol together with dynamically changing overlay-level instant connectivity topology defines a Shannon Language. In experimental works, we applied the metric first to the Gnutella 0.6 protocol for which message traffic explosion is a known problem and then to its time-based clustering version. The obtained results are compared with other two known metrics' namely, number of query hits and unit query-hit response time, results and potential correlations among them are discussed.

Subject Keywords

Shannon languages, Combinatorial capacity metric, Time-based clustering

URI

https://hdl.handle.net/11511/65243

DOI

https://doi.org/10.1109/wi-iatw.2006.108

Conference Name

IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006)

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Priority based multi-constrained quality of service routing in military applications Araz, Bora; Koçyiğit, Altan; Department of Information Systems (2005) This thesis proposes a new algorithm for multi-constrained Quality of Service Optimal Path Routing in the context of military applications. The objective of our routing algorithm is to manage network traffic according to quality of service requirements of connection requests using military metrics. The algorithm is mainly based on communication priority. The QoS metrics such as bandwidth, delay and packet loss ratio are considered as basic metrics on path finding. If there is no suitable path for the reques...
Broadband Multilevel Fast Multipole Algorithm For Large-Scale Problems With Nonuniform Discretizations Ergül, Özgür Salih; Takrimi, Manouchehr; Erturk, Vakur B. (2016-08-18) We present a broadband implementation of the multilevel fast multipole algorithm (MLFMA) for fast and accurate solutions of multiscale problems involving highly nonuniform discretizations. Incomplete tree structures, which are based on population-based clustering with flexible leaf-level boxes at different levels, are used to handle extremely varying triangulation sizes on the same structures. Superior efficiency and accuracy of the developed implementation, in comparison to the standard and broadband MLFMA...
Consensus clustering of time series data Yetere Kurşun, Ayça; Batmaz, İnci; İyigün, Cem; Department of Scientific Computing (2014) In this study, we aim to develop a methodology that merges Dynamic Time Warping (DTW) and consensus clustering in a single algorithm. Mostly used time series distance measures require data to be of the same length and measure the distance between time series data mostly depends on the similarity of each coinciding data pair in time. DTW is a relatively new measure used to compare two time dependent sequences which may be out of phase or may not have the same lengths or frequencies. DTW aligns two time serie...
Broadband MLFMA based on an approximate diagonalization of the three-dimensional Green's function Ergül, Özgür Salih (2015-09-11) We present an approximate diagonalization of the three-dimensional Green's function for straightforward broadband implementations of the multilevel fast multipole algorithm. The diagonalization is based on the use of scaled spherical functions and plane waves, leading to approximate but stable expansions for arbitrarily short distances with respect to wavelength. Despite its limited accuracy, the approximate diagonalization is easy to insert into existing MLFMA implementations for converting them into broad...
Score Based Non-Technical Loss Detection Algorithm for Electricity Distribution Networks Terciyanli, Erman; Eryigit, Emre; Emre, Tamer; Caliskan, Sevil (2017-04-21) This paper proposes a score based computational technique for the detection of non-technical losses in electricity distribution networks. The methodology is comprised of three steps. In the first one, a score is assigned to each meter number considering the area that customers live. In second step, a Cmeans-based fuzzy clustering is applied to find consumers with similar consumption profiles. Then, a fuzzy classification is performed with fuzzy membership matrices. Afterwards, the Euclidean distances betwee...

Citation Formats

K. Oztoprak and H. Kilic, “Protocol and connectivity based overlay level capacity calculation of P2P networks,” Hong Kong, PEOPLES R CHINA, 2006, p. 447, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65243.