On localized application-driven topology control for energy-efficient wireless peer-to-peer file sharing

Wireless Peer-to-Peer (P2P) file sharing Is widely envisioned as one of the major applications of ad hoc networks in the near future. This trend is largely motivated by the recent advances in high-speed wireless communication technologies and high traffic demand for P2P file sharing applications. To achieve the ambitious goal of realizing a practical wireless P2P network, we need a scalable topology control protocol to solve the neighbor discovery problem and network organization problem. Indeed, we believe that the topology control mechanism should be application driven in that we should try to achieve an efficient connectivity among mobile devices in order to better serve the file sharing application. We propose a new protocol, which consists of two components, namely, Adjacency Set Construction (ASC) and Community-Based Asynchronous Wakeup (CAW). Our proposed protocol is shown to be able to enhance the fairness and provide an incentive mechanism in wireless P2P file sharing applications. It is also capable of increasing the energy efficiency. © 2008 IEEE.published_or_final_versio

An Effective Peer to Peer Video Sharing Scheme with Social Reciprocity

Online video sharing and social networking are self-fertilizing speedily in today’s Internet. Online social network users are flooding more video contents among each other. A fascinating development as it is, the operational challenge in previous video streaming systems persists, i.e., the large server load required for topping of the systems. Exploring the unique advantages of a social networking based video streaming system; it advocate utilizing social reciprocities among peers with social relationships for efficient involvement incentivization and development, so as to enable high quality video streaming with low server cost. Then why only video: because more people prefer watching videos. Videos induce people to stay longer on websites. People remember videos. It achievement social reciprocity with two give-and-take ratios at each peer: (1) peer contribution ratio (PCR), which calculates the reciprocity level between a couple of social friends, and (2) system contribution ratio (SCR), which records the give-and-take level of the user to & from the entire system. It expect efficient Peer to Peer mechanisms for video streaming using the two ratios, where each user optimally chooses which other users to seek relay help from and help in relaying video streams, respectively, based on combined evaluations of their social relationship and historical reciprocity levels. This design helps to gain effective incentives for resource contribution, load balancing among relay peers, and efficient social-aware resource scheduling, security to the videos and high prefetching accuracy. DOI: 10.17762/ijritcc2321-8169.15071

Implications of Selfish Neighbor Selection in Overlay Networks

In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.Marie Curie Outgoing International Fellowship of the EU (MOIF-CT-2005-007230); National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 020206

The performance and locality tradeoff in BitTorrent-like P2P file-sharing systems

The recent surge of large-scale peer-to-peer (P2P) applications has brought huge amounts of P2P traffic, which significantly changes the Internet traffic pattern and increases the traffic-relay cost at the Internet Service Providers (ISPs). To alleviate the stress on networks, localized peer selection has been proposed that advocates neighbor selection within the same network (AS or ISP) to reduce the cross-ISP traffic. Nevertheless, localized peer selection may potentially lead to the downgrade of downloading speed at the peers, rendering a non-negligible tradeoff between the downloading performance and traffic localization in the P2P system. Aiming at effective peer selection strategies that achieve any desired Pareto optimum in face of the tradeoff, in this paper, we characterize the performance and locality tradeoff as a multi-objective b-matching optimization problem. In particular, we first present a generic maximum weight b-matching model that characterizes the tit-for-tat in BitTorrent-like peer selection. We then introduce multiple optimization objectives into the model, which effectively characterize the performance and locality tradeoff using simultaneous objectives to optimize. We also design fully distributed peer selection algorithms that can effectively achieve any desired Pareto optimum of the global multi-objective optimization, that represents a desired tradeoff point between performance and locality in the entire system. Our models and algorithms are supported by rigorous analysis and extensive simulations. ©2010 IEEE.published_or_final_versionThe IEEE International Conference on Communications (ICC 2010), Cape Town, South Africa, 23-27 May 2010. In Proceedings of the IEEE International Conference on Communications, 2010, p. 1-