reine Buchbestellungen ab 5 Euro senden wir Ihnen Portofrei zuDiesen Artikel senden wir Ihnen ohne weiteren Aufpreis als PAKET

Performance Analysis of an ISP-based Distributed Sloppy Hash Table
(Englisch)
The Performance Analysis of an ISP-based Distributed Sloppy Hash Table
Md. Wahid Murad

Print on Demand - Dieser Artikel wird für Sie gedruckt!

37,95 €

inkl. MwSt. · Portofrei
Dieses Produkt wird für Sie gedruckt, Lieferzeit ca. 10 Werktage
Menge:

Performance Analysis of an ISP-based Distributed Sloppy Hash Table

Seiten
Erscheinungsdatum
Auflage
Ausstattung
Erscheinungsjahr
Sprache
Erscheinungsland
Kategorie
Warengruppenindex
Features
Laenge
Breite
Hoehe
Gewicht
Relevanz
Referenznummer
Verantwortlich für dieses Produkt
  • OmniScriptum GmbH & Co. KG
    Bahnhofstr. 28
    DE-66111 Saarbrücken
    +49 681 9100698
    info@akademikerverlag.de
Moluna-Artikelnummer
  • 5480417

Produktbeschreibung

Autor/Autorin: Murad Md. Wahid

MD WAHID MURAD was born on 30th May 1985 in Dhaka Bangladesh. He has completed his BSc in Electrical and Electronic Engineering from American International University- Bangladesh in 2007. He has completed his MSc Programme in Electrical Engineering with emphasis on Telecommunications from Blekinge Institute of Technology, Sweden in 2011.
DHT systems are the basics for routing protocols in peer-to-peer network, suitable for flat design ensuring evenly distributed file storage. But a well structured and hierarchical system providing for scalability, fault tolerance and to cater adequately for web cashing and multicast resource control in Internet applications in mobile environment is the use of distributed sloppy hash table (DSHT).We worked on how a well structured overlay application of Distributed Sloppy Hash Table (DSHT) that will perform better in terms of scalability, lookup time and ease of use. We focused on the application of real time usage with the incorporation of ISP (internet service provider) based partitioning for DSHTs. The sloppy hash DHT is employed to take advantageous use of low round trip times. The ISP bash DSHT yields some additional benefits to regular DHTs. These benefits include the use of pointers to reference keys in particular layers, thereby avoiding data replication at nodes for bandwidth utilization. Also, effective use of spillover in concentric rings is employed for load balancing and the phenomenon of distance optimization by the introduction of geographical proximity.



Über den Autor

MD WAHID MURAD was born on 30th May 1985 in Dhaka Bangladesh. He has completed his BSc in Electrical and Electronic Engineering from American International University- Bangladesh in 2007. He has completed his MSc Programme in Electrical Engineering with emphasis on Telecommunications from Blekinge Institute of Technology, Sweden in 2011.


Klappentext

DHT systems are the basics for routing protocols in peer-to-peer network, suitable for flat design ensuring evenly distributed file storage. But a well structured and hierarchical system providing for scalability, fault tolerance and to cater adequately for web cashing and multicast resource control in Internet applications in mobile environment is the use of distributed sloppy hash table (DSHT).We worked on how a well structured overlay application of Distributed Sloppy Hash Table (DSHT) that will perform better in terms of scalability, lookup time and ease of use. We focused on the application of real time usage with the incorporation of ISP (internet service provider) based partitioning for DSHTs. The sloppy hash DHT is employed to take advantageous use of low round trip times. The ISP bash DSHT yields some additional benefits to regular DHTs. These benefits include the use of pointers to reference keys in particular layers, thereby avoiding data replication at nodes for bandwidth utilization. Also, effective use of spillover in concentric rings is employed for load balancing and the phenomenon of distance optimization by the introduction of geographical proximity.



Datenschutz-Einstellungen