Communal Acceptor- Inaugurate Multicast for Gridiron Applications  

Abstract

Gridiron applications habitually necessitate sharing out large amounts of records proficiently from one huddle to compound others (multicast). Obtainable sender-initiated methods dispose nodes in optimized tree structures, based on peripheral complex monitoring records. This confidence on monitoring information relentlessly impacts both ease of consumption and adaptivity to vigorously shifting network circumstances. In this paper, we present Robber, a united, receiver-initiated, high-throughput multicast loom enthused by the BitTorrent etiquette. Unlike BitTorrent, Robber is explicitly deliberate to maximize the throughput between multiple cluster computers. Nodes in the same cluster work mutually as a common that tries to thieve information from peer clusters. Instead of using potentially outmoded monitoring information, Robber repeatedly adapts to the presently feasible bandwidth ratios. Within a communal, nodes repeatedly tune the quantity of information they steal tenuously to their virtual recital. Our untried assessment compares Robber to BitTorrent, to disinterested Multicasting, and to its forerunner MOB. unprejudiced Multicasting optimizes multicast trees based on exterior monitoring information, while MOB uses communal, receiver-initiated multicast with static load harmonizing. We show that both Robber and MOB outperform BitTorrent. They are cutthroat with impartial Multicasting as long as the network bandwidth vestiges stable, and outperform it by wide limitations when bandwidth changes vigorously. In large environments and assorted clusters, Robber outperforms MOB.  

Authors and Affiliations

M. Nirmala Kumari , M. KiranKumar , B. KrishnaMurthy , P. Nirupama

Keywords

Related Articles

Design of Least Complex S-Box and its Fault Detection for Robust AES Algorithm 

Advanced Encryption Standard (AES) is the symmetric key standard for encryption and decryption. In this work, a 128-bit AES encryption and decryption using Rijndael Algorithm is designed and synthesized using veril...

Improving Memory Access time by Building an AMBA AHB compliant Memory Controller  

Memory access time has been a bottleneck in many microprocessor applications which limits the system performance. Memory controller (MC) is designed and built to attacking this problem. The memory controller is the...

Implementation on FPGA for Tuned Low Complexity Modified Curve Fitting Algorithm

An effort is made to minimize the arithmetic intricacy of signal by using the VHDL module on FPGA. A curve fitting algorithm is used for finding the fundamental frequency of a given signal. Modification of algorithm is r...

Secure Re-encryption in Unreliable Cloud using Synchronous clock

In this Paper With rapid development of cloud computing, more and more enterprises will outsource their sensitive data for sharing in a cloud. To keep the shared data confidential against untrusted cloud service provi...

C0-axial Feed Rectangular Patch Antenna over High Impedance Surface

In the field of wireless communication as the demand for small size systems are increasing, the compact size, low profile, light weight micro strip antennas are attracting the antenna designers attention. But these an...

Download PDF file
  • EP ID EP151765
  • DOI -
  • Views 81
  • Downloads 0

How To Cite

M. Nirmala Kumari, M. KiranKumar, B. KrishnaMurthy, P. Nirupama (2012). Communal Acceptor- Inaugurate Multicast for Gridiron Applications  . International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 1(5), 328-334. https://europub.co.uk/articles/-A-151765