LOCATION-AWARE SERVER DISCOVERY
BASED ON A FAIR DISTRIBUTED HASH TABLE
Versandkostenfrei!
Versandfertig in 6-10 Tagen
45,99 €
inkl. MwSt.
PAYBACK Punkte
23 °P sammeln!
The current Internet includes a large number of distributed services. In order to guarantee the QoS of the communications in these services, a client has to select a close-by server with enough available resources. To achieve this objective, in this book, we propose a simple and practical solution for Dynamic and Location Aware Server Discovery based on a Distributed Hash Table (DHT). In more detail, the solution works as follows. The servers offering a given service S form a DHT. In addition, they register their location (topological and/or geographical) information in the DHT. Each client us...
The current Internet includes a large number of distributed services. In order to guarantee the QoS of the communications in these services, a client has to select a close-by server with enough available resources. To achieve this objective, in this book, we propose a simple and practical solution for Dynamic and Location Aware Server Discovery based on a Distributed Hash Table (DHT). In more detail, the solution works as follows. The servers offering a given service S form a DHT. In addition, they register their location (topological and/or geographical) information in the DHT. Each client using the service S is connected to at least one server from the DHT. Eventually, a given client C realizes that it is connected to a server providing a bad QoS, then, it queries the DHT in order to find an appropriate server (i.e. a close-by server with enough available resources). We define 11 design criteria, and compare our solution to the Related Work based on them. We show that our solution is the most complete one. Furthermore, we validate the performance of our solution in two different scenarios: (i) NAT Traversal Server Discovery and (ii) Home Agent Discovery in Mobile IP scenarios.
Andere Kunden interessierten sich für
