Skip to main content
SpringerLink
Log in

RETRACTED ARTICLE: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash table

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

This article was retracted on 20 September 2022

This article has been updated

Abstract

In Peer to Peer systems (P2P); an only companion is connected to another associate in a different stockpiling framework. A different gathering of resolutions depicts disseminated hash tables outlines resources onto hubs in P2P system. It offers a “find – obtain” development where getting the advantages in the framework is available, and like this it can get back. DHT offers a liberal position of hubs and administrations yet don’t protect adjacent to vindictive hub moving lookups (the movement used to arrange the benefits in the system). Malicious hubs on a look-up pathway can precisely undermine question. Frameworks like Halo (in light of the harmony) reduction such ambushes by utilizing pointless lookup inquiries. To supply better affirmation; Reputation for Directory administrations is an establishment for training so as to boost lookups in abundance DHT how well new hubs administration lookup wishes. ReDS technique can be executed too for all intents and purposes any abundance DHT containing corona. Additionally, it perceives shared acknowledgment and dispenses with of difficult lookup paths. This acknowledgment does not wager on the partitioning of notoriety numbers and isolating is helpless to assaults that make larger part use of ReDS unfit. Corona is a plan that deeds the deterministic arranging of access to hubs in the harmony to introduce a “high-affirmation situate” through pointless investigates. Radiance was proposed to contain dynamic lookups and can browse different ways. Partitioned notoriety technique for Halo, has deterministic finger gathering. In deciding notoriety organize; the holes of attackers are diminished by utilizing unique Reciprocal Channel Variation based Identification (RCVI) technique. Load imbalance issue emerges through this lookup activity. Each Peer handles the heap by contrasting its ability. ReDS creates accomplishment lookup rates for Halo, yet next to think assailant was trying to brandish their notoriety achieves and in the presence of hub twirl.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Change history

References

  1. Akavipat R, Dhadphale A, Kapadia A, Wright M (2008) ReDS: reputation for directory services in p2p systems. In: Proceedings of The ACM Workshop on Insider Threats

  2. Ruj Akavipat, N. Mahdi AI-Ameen, Apu Kapadia (2014) ReDS:a framework for reputation- enhanced DHTs. In IEEE transaction on parallel and distributed systems 25(2) 321–331

  3. Artigas MS, Lopez PG, Ahullo JP, Skarmeta AFG (2005) Cyclone: a novel design schema for hierarchical DHTs. Proc IEEE Fifth Int’l Conf Peer-to-Peer Computing (P2P)

  4. Awerbuch B, Scheideler C (2006) Towards a scalable and robust DHT. Proc. ACM 18th Ann. Symp. Parallelism in algorithms and architectures (SPAA)

  5. Bandara HMND, Jayasumana A (2011) Evaluation of p2p resource discovery architectures using real-life multi-attribute resource and query characteristics. IEEE Consumer Communications and Networking Conf

  6. Bandara HMSD, Jayasumana AP (2012) Collaborative applications over peer-to-peer systems – challenges and solutions. Peer-to-Peer Networking and Applications

  7. Bianchi S, Serbu S, Felber P, Kropf P (2006) Adaptive load balancing for DHT lookups. In: Proc. 15th International Conference on Computer Communications and Networks (ICCCN), pp 411–418

  8. Castro M, Druschel P, Ganesh AJ, Rowstron AIT, Wallach DS (2006) Secure routing for structured peer-to-peer overlay networks. In: OSDI

  9. Dabek F, Brunskill E, Kaashoek M, Karger F, Morris D, Stoica R, Balakrishnan H (2001) Building peer-to-peer systems with Chord, a distributed location service. In Proceedings of the 8th IEEE workshop on hot topics in operating ystems (HotOS-VIII) (ElmauiOberbayern, Germany, May 2001), pp 71–76

  10. Dabek F, Zhao B, Druschel P, Kubiatowicz J, Stoica I(2003) Toward a common API for structured P2P overlays, IPTPS, pp 33–44

  11. Efthymiopoulos N, Christakidis A, Denazis S, Koufopavlou O (2006) Enabling locality in a balanced peer-to-peer overlay. In: IEEE Global Telecommunications Conference (GLOBECOM), pp 1–5

  12. Gopalakrishnan V, Silaghi B, Bhattacharjee B, Keleher P (2004) Adaptive replication in peer-to-peer systems. In: Proc. 24th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society, pp 360–369

  13. Hildrum K, Kubiatowicz JD, Rao S, Zhao BY (2002) Distributed object location in a dynamic network. In Proc. of the 14th ACM Symp. On parallel algorithms and architectures (SPAA), p 41-52

  14. Kapadia A, Triandopoulos N (2008) Halo: high-assurance locate for distributed hash tables. In: proc. network and distributed system security symposium (NDSS)

  15. Kapadia A, Triandopoulos N (2008) Halo: high-assurance locate for distributed hash tables. Proc. 15th Ann. Network and distributed system security Symp. (NDSS)

  16. Mickens JW, Noble BD (2007) Concilium: collaborative diagnosis of broken overlay routes. Proc. IEEE/IFIP 37th Ann. Int’l Conf. Dependable Systems and Networks (DSN ‘07), pp 225-234

  17. Nambiar A, Wright M (2006) “Salsa: A Structured Approach to Large-Scale Anonymity” in computer- Communication Networks, Alexandria, Virginia, ACM 1–59593–518-5/06/0010 ...$5.00. October 30–November 3, 2006

  18. Naor M, Wieder U (2003) A simple fault tolerant distributed hash table. Proc. second Int’l workshop peer-to-peer systems (IPTPS)

  19. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) Chord: a scalable content-addressable network. In Proc. ACM SIGCOMM, San Diego

  20. A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), ser. Lecture Notes in Computer Science, R. Guerraoui, Ed., no. 2218. Springer Heidelberg, Germany, 2001, pp 329–350

  21. Rowstron A, Druschel P (2001) Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: 18th ACM Symposium on Operating Systems Principles (SOSP), pp 188–201

  22. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to- peer lookup service for internet applications. Tech Rep TR-819, MIT LCS SIGCOMM'01, PP 1–12

  23. Stutzbach D, Rejaie R (2006) Improving lookup performance over a widely-deployed DHT. In: Proc. of INFOCOM

  24. Wang P, Osipkov I, Hopper N, Kim Y (2006) Myrmic: provably secure and efficient DHT routing. DTC Technical Report 2006/20, Univ. of Minnesota

  25. Yin L, Cao G (2005) Dup: dynamic-tree based update propagation in peer-to-peer networks. In: Proc. 21st International Conference on Data Engineering, ser. ICDE ‘05. Washington, DC, USA: IEEE Computer Society, pp 258–259

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Saveetha Engineering College, Chennai, Tamilnadu, India

    A. Vijayaraj

  2. Sri Lakshmi Ammaal Engineering College, Thiruvanchery, Tambaram, Chennai, Tamilnadu, India

    R. M. Suresh

  3. Department of Information Technology, Rajalakshmi Engineering College, Chennai, Tamilnadu, 602 105, India

    S. Poonkuzhali

Authors
  1. A. Vijayaraj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. M. Suresh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Poonkuzhali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Vijayaraj.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vijayaraj, A., Suresh, R.M. & Poonkuzhali, S. RETRACTED ARTICLE: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash table. Multimed Tools Appl 77, 10347–10364 (2018). https://doi.org/10.1007/s11042-018-5620-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-018-5620-6

Keywords

Search

Navigation