The week's pick
Random Articles
Reseach Article
Resolving Packet Loss in a Computer Centre Applications
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 74 - Number 1 |
| Year of Publication: 2013 |
| Authors: M. Rajalakshmi, C. Angel, K. M. Brindha Shree |
10.5120/12848-9266
|
M. Rajalakshmi, C. Angel, K. M. Brindha Shree . Resolving Packet Loss in a Computer Centre Applications. International Journal of Computer Applications. 74, 1 ( July 2013), 12-16. DOI=10.5120/12848-9266
Abstract
The modern data centre consists of tens of thousands of servers to interconnect distributed computations. It is a centralized repository for storage, management and distribution of data and information. Data centre applications have group communication. Multicast routing supports group communication by both saving network traffic and improving application throughput. Receiver driven multicast routing protocol is inefficient for number of links in a formed multicast tree and not support for largely connected networks and their routing entries. The results show that there is a severe link waste compared to efficient one. To build efficient multicast tree ESM uses source to receiver expansion approach. It eliminates unnecessary intermediate switches used in receiver driven multicast routing. For scalability ESM uses and combines both in packet bloom filter and in-switch entries to make the transaction between number of multicast groups. During packet forwarding there may be a chance to loss of packets. To reduce the packet loss in a multicast group by combining packet bloom filter and contention window adaptation (CWA). Results can be analysed and executed by Network Simulator.
References
- Dan Li, Yuanjie Li, Jianping Wu, Sen Su, and Jiangwei Yu, "ESM: Efficient and Scalable Data Centre Multicast Routing". IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 20, NO. 3, JUNE 2012.
- S. Ghemawat, H. Gobio, and S. Leungm, "The Google file system," in Proc. ACM SOSP. , 2003, pp. 29–43.
- "Hadoop," Apache Software Foundation, 2011 [Online]. Available: http://hadoop. apache. org/.
- C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, and C. Tian, "BCube:A high performance, server-centric network architecture for modular data centres," in Proc. ACM SIGCOMM, Aug. 2009, pp. 63–74.
- M. Al-Fares, A. Loukissas, and A. Vahdat, "A scalable, commodity data centre network architecture," in Proc. ACM SIGCOMM, Aug. 2008, pp. 63–74.
- A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri,D. A. Maltz, P. Patel, and S. Sengupta, "VL2: A scalable and flexible data centre network," in Proc. ACMSIGCOMM,Aug. 2009, pp. 51–62.
- D. Li, M. Xu, H. Zhao, and X. Fu, "Building mega data centre from heterogeneous containers," in Proc. IEEE ICNP, Oct. 2011, to be published.
- P. Jokela, A. Zahemszky, C. E. Rothenberg, S. Arianfar, and P. Nikander, "LIPSIN: Line speed publish/subscribe inter-networking,"in Proc. ACM SIGCOMM, Aug. 2009, pp. 195–206.
- D. Li, J. Yu, J. Yu, and J. Wu, "Exploring efficient and scalable multicast routing in future data centre networks," in Proc. IEEE INFOCOM,Apr. 2011, pp. 1368–1376.
- Bose, P. , Guo, H. , Kranakis, E. , Maheshwari, A. , Morin, P. , Morrison, J. , Smid, M. , and Tang, Y. (2008). On the false-positive rate of Bloom filters. Information Processing Letters, 108(4):210–213.
- Hui Ma, Sumit Roy. , "Contention Window and Transmission Opportunity Adaptation" for Dense IEEE 802. 11 WLAN Based on Loss Differentiation. WA 98195-2500.
Index Terms
Keywords