Oztoprak, KasimKilic, HurevrenComputer Engineering2024-07-052024-07-0520064978076952749910.1109/WI-IATW.2006.1082-s2.0-34250779901https://doi.org/10.1109/WI-IATW.2006.108https://hdl.handle.net/20.500.14411/1162Kilic, Hurevren/0000-0002-9058-0365; KILIC, HUREVREN/0000-0003-2647-8451In 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.eninfo:eu-repo/semantics/closedAccessShannon LanguagesCombinatorial Capacity Metrictime-based clusteringConference Object447+WOS:000244608000099