Crossover-Based Improved Sine Cosine Algorithm for Multimedia Content Distribution in Cloud Environment

Widespread growth of multimedia content distribution can increase the cost and time of the content distribution. The multimedia services are stored by the service provider and the user is provided based on their demand. Basically, the network user number increases quickly, and the response time for huge numbers of users also increases rapidly. Therefore, the need of service cannot be reached. Initially, we solicited notable extraction technique to collect the interest features of user. The adjacent region and similar service interests of users are divided into service user and nonservice user. Therefore, the coherent utility value is suggested to the user evaluation procedure, so the combination of different users experience character is needed to calculate the integrated utility value. Hence, the users experience characteristics are derived by presentation of physical user, behavior of selfish user and character of the user. Consequently, we minimized the content distribution cost and time with crossover-based sine cosine algorithm (CSCA). The proposed CSCA was established for the selection of user service number. The experimental results of proposed method can decrease the multimedia user cost and improve the performance of multimedia content.

An Efficient Framework for Network Code based Multimedia Content Distribution in Hybrid P2P Network

Most of the existing peer-to-peer (P2P) content distribution schemes carry out a random or rarest piece first content dissemination procedure to avoid duplicate transmission of the same pieces of data and rare pieces of data occurring in the network. This problem is solved using P2P content distribution based on network coding scheme. Network coding scheme uses random linear combination of coded pieces. Hence, the above-stated problem is solved easily and simply. Our proposed mechanism uses network coding mechanism in which several contents having the same message are grouped into different groups and coding operation is performed only within the same group. The interested peers are also divided into several groups with each group having the responsibility to spread one set of contents of messages. The coding system is designed to assure the property that any subset of the messages can be utilized to decode the original content as long as the size of the subset is suitably large. To meet this condition, dynamic smart network coding (DSNC) scheme is defined which assures the preferred property, then peers are connected in the same group to send the corresponding message, and connect peers in different groups to disseminate messages for carrying out decoding operation. Moreover, the proposed system is readily expanded to support topology change to get better system performance further in terms of reliability, link stress and throughput. The simulation results prove that the proposed system can attain 20–25% higher throughput than existing systems, good reliability, link failure and robustness to peer churn.