Browsing by Subject "Peer to peer networks"

Now showing 1 - 4 of 4

Open Access
Capacity region of multi-resolution streaming in peer-to-peer networks
(IEEE, 2013) Karagöz, B.; Yavuz, Semih; Ho, T.; Effros, M.
We consider multi-resolution streaming in fully-connected peer-to-peer networks, where transmission rates are constrained by arbitrarily specified upload capacities of the source and peers. We fully characterize the capacity region of rate vectors achievable with arbitrary coding, where an achievable rate vector describes a vector of throughputs of the different resolutions that can be supported by the network. We then prove that all rate vectors in the capacity region can be achieved using pure routing strategies. This shows that coding has no capacity advantage over routing in this scenario. © 2013 IEEE.
Open Access
Energy cost model for frequent item set discovery in unstructured P2P networks
(Springer, London, 2012) Cem, E.; Demirkaya, Ender; Esiner, E.; Ozaydin, B.; Ozkasap O.
For large scale distributed systems, designing energy efficient protocols and services has become as significant as considering conventional performance criteria like scalability, reliability, fault-tolerance and security. We consider frequent item set discovery problem in this context. Although it has attracted attention due to its extensive applicability in diverse areas, there is no prior work on energy cost model for such distributed protocols. In this paper, we develop an energy cost model for frequent item set discovery in unstructured P2P networks. To the best of our knowledge, this is the first study that proposes an energy cost model for a generic peer using gossip-based communication. As a case study protocol, we use our gossip-based approach ProFID for frequent item set discovery. After developing the energy cost model, we examine the effect of protocol parameters on energy consumption using our simulation model on PeerSim and compare push-pull method of ProFID with the well-known push-based gossiping approach. Based on the analysis results, we reformulate the upper bound for the peer's energy cost. © 2012 Springer-Verlag London Limited.
Open Access
Minimum maximum-degree publish-subscribe overlay network design
(IEEE, 2011) Onus, Melih; Richa, A.W.
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. It is only natural then to formalize the following problem: Given a collection of nodes and their topic subscriptions, connect the nodes into a graph that has least possible maximum degree in such a way that for each topic t, the graph induced by the nodes interested in t is connected. We present the first polynomial-time logarithmic approximation algorithm for this problem and prove an almost tight lower bound on the approximation ratio. Our experimental results show that our algorithm drastically improves the maximum degree of publish/subscribe overlay systems. We also propose a variation of the problem by enforcing that each topic-connected overlay network be of constant diameter while keeping the average degree low. We present three heuristics for this problem that guarantee that each topic-connected overlay network will be of diameter 2 and that aim at keeping the overall average node degree low. Our experimental results validate our algorithms, showing that our algorithms are able to achieve very low diameter without increasing the average degree by much. © 2011 IEEE.
Open Access
A path-quality-aware peer-to-peer file sharing protocol for mobile ad-hoc networks: Wi-Share
(IEEE, 2009-09) Karasabun, Efe; Ertemür, Doğuş; Sarıyıldız, Seyhun; Tekkalmaz, Metin; Körpeoğlu, İbrahim
Peer-to-peer networks are rather well-studied and currently there are numerous systems based on peer-to-peer principles running on the Internet. On the other hand peer-to-peer networks for mobile ad-hoc networks have attracted attention only in the recent years. In this paper, we propose a novel peer-to-peer file sharing system particularly designed for mobile ad-hoc networks. The proposed system, namely Wi-Share, has both network and application layer aspects enabling efficient search and download of the shared files. Wi-Share uses reactive routing for the search operation combined with source discovery and uses the routing tables constructed during the search operation for the download operation. In order to increase the overall efficiency of the file sharing in the network, Wi-Share applies techniques to reduce the required traffic and to increase efficient parallelism of the download operation. These techniques include filtering search results, preferring the higher quality routing paths, using partitioned download scheme and allowing the nodes that have joined to the network recently to contribute to the ongoing downloads. Wi-Share is implemented to work on mobile computers and the results of several experiments are also presented in the paper. © 2009 IEEE.