Neighbour Peer Selection Scheme Based on Effective Capacity for Mobile Peer-to-Peer Streaming

For Peer-to-Peer (P2P) streaming services in mobile networks, the selection of appropriate neighbour peers from candidate peers with demanding data is an important approach to improve Quality-of-Service (QoS). This paper proposes a novel Effective Capacity Peer Selection (ECPS) scheme based on effective capacity. In the ECPS scheme, the neighbour peer selection problem was modeled using the Multiple Attribute Decision Making (MADM) theory, which considered multiple factors of candidate peers, including Signal to Interference and Noise Ratio (SINR), residency time, power level, security, moving speed, and effective capacity. This model could increase the suitability of ECPS for wireless mobile environments. Then, the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) was used to solve the MADM problem and identify the preferred neighbour peers. Simulation results show that the ECPS scheme can improve the network throughput, reduce packet delay by about 82%, and almost double the packet delivery ratio of the mobile P2P streaming service.

Peer selecting model based on FCM for wireless distributed P2P files sharing systems

IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.

Modeling and Analysis for Streaming Service Systems

The proliferation of streaming service system in various application areas gains increasing importance and also poses more challenges in the research of streaming service system. In this paper, we propose a novel dynamic model composed of a set of differential equations to describe the evolution of streaming service systems. And in the model, we focus on how the policies for admission control and peer selection influence on the system. We first introduce a flexible abstraction of streaming service systems. The abstraction is generally enough to capture the essences of streaming service systems with different structures, physical characteristics,software protocols and client behaviors. Then, by analyzing the state which is defined as the number of requests, a novel dynamic model is developed in microscopic scale to characterize the behaviors of streaming service systems. The model proposed in this paper demonstrates the interactions between clients and servers and also between different servers. The interactions are primarily influenced by the admission control policy and peer selection policy. Finally, some experiments are designed to verify the validation and reasonability of the model.