International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 3 | Issue 3 | Year 2012 | Article Id. IJCTT-V3I3P116 | DOI : https://doi.org/10.14445/22312803/IJCTT-V3I3P116

Event Dissemination Protocol for SNS inspired P2P Games

G. Devi Vasudha Rani, D. Varun Prasad

Citation :

G. Devi Vasudha Rani, D. Varun Prasad, "Event Dissemination Protocol for SNS inspired P2P Games," International Journal of Computer Trends and Technology (IJCTT), vol. 3, no. 3, pp. 1011-1016, 2012. Crossref, https://doi.org/10.14445/22312803/IJCTT-V3I3P116

Abstract

According to the first one, upon reception of a stimulus from a neighbor, a peer increases its dissemination probability towards that node irrespectively from the sender. In the second, a peer increases only the dissemination probability for a given sender towards all its neighbors. Finally, the third step takes into consideration both the sender and the neighbor in order to decide how to increase the dissemination probability. These three steps are implemented in the form of an event dissemination protocol implemented in an SNS driven P2P overlay network for offering a better p2p gaming experience.

Keywords

Neural Network, FRR, FAR, pixel density method, directional method.

References

[1] G. Smaragdakis, N. Laoutaris, A. Bestavros, and J. W. Byers, “Implications of Selfish Neighbor International Journal of Computer Trends and Technology- volume3Issue3- 2012 Selection in Overlay Networks,” in Proc. IEEE INFOCOM’07.
[2] V. Lekakis, G. Smaragdakis, N. Laoutaris, J. W. Byers, A. Bestavros, and M. Roussopoulos, “EGOIST: Overlay Routing using Selfish Neighbor Selection,” in Proc. ACM CoNEXT’08.
[3] D. Andersen, F. Kaashoek, H. Balakrishnan, and R. Morris, “Resilient Overlay Networks,” in Proc. ACM SOSP’01.
[4] I. Stoica, R. Fonseca, B.-G. Chun, and J. Kubiatowicz, “Characterizing Selfishly Constructed Overlay Routing Networks,” in Proc. IEEE INFOCOM’04.
[5] B. G. Rocha, V. Almeida, and D. Guedes, “Improving Reliability of Selfish Overlay Networks,” in Proc. WWW’06.
[6] V. Arya, N. Garg, A. Meyerson, R. Khandekar, K. Munagala, and V. Pandit, “Local Search Heuristics for k-Median and Facility Location Problems,” SIAM J. on Computing, vol. 33, no. 3, pp. 544–562, 2004.
[7] A. Young, A. Krishnamurthy, J. Chen, Z. Ma, L. L. Peterson, and R. Wang, “Overlay Mesh Construction Using Interleaved Spanning Trees,” in Proc. IEEE INFOCOM’04.
[8] G. de Veciana and X. Yang, “Performance of Peer-to-peer Networks: Service Capacity and Role of Resource Sharing Policies,” Perform. Eval., vol. 63, no. 3, pp. 175–194, 2006.
[9] G. Smaragdakis, “Overlay Network Creation and Maintenance with Selfish Users,” Ph.D. Dissertation, Boston University, 2009.
[10] J. Navratil, V. Ribeiro, R. Baraniuk, R. Riedi, and L. Cottrell, “pathChirp: Efficient Available Bandwidth Estimation for Network Paths,” in Proc. PAM’03.