Results 191 to 200 of about 55,204 (231)
Some of the next articles are maybe not open access.
2007 IEEE Wireless Communications and Networking Conference, 2007
This paper presents an architecture called social distributed hash table (SDHT) that combines strengths of distributed hash table (DHT) algorithms and social networks making mobile search fast and context oriented. The paper presents possible implementations of the proposed architecture in the IP multimedia subsystem (IMS) and as a standalone SIP based
Marcin Matuszewski +1 more
openaire +1 more source
This paper presents an architecture called social distributed hash table (SDHT) that combines strengths of distributed hash table (DHT) algorithms and social networks making mobile search fast and context oriented. The paper presents possible implementations of the proposed architecture in the IP multimedia subsystem (IMS) and as a standalone SIP based
Marcin Matuszewski +1 more
openaire +1 more source
TYPHOON: mobile distributed hash tables
Journal of Parallel and Distributed Computing, 2005TYPHOON is a capability-aware peer-to-peer (P2P) system. It exploits the heterogeneity of nodes in the system based on the concept of virtual homes. Nodes participating in the system are classified as good and inactive. TYPHOON uses resources provided by good peers. It is thus more reliable and agile than a naive structured P2P system. When a good peer
Hung-Chang Hsiao +2 more
openaire +1 more source
Distributed MapReduce framework using distributed hash table
2013 International Joint Conference on Awareness Science and Technology & Ubi-Media Computing (iCAST 2013 & UMEDIA 2013), 2013In past years, Cloud computing is gained more attention in industry and academic area. The advance technologies are needed to match the demand of the development of cloud computing. MapReduce is one of the enabling technology. MapReduce is a programming model supporting parallel computation especially for data-intensive cloud computing applications ...
Chuan-Feng Chiu +2 more
openaire +1 more source
2005
In the last few years, an increasing number of massively distributed systems with millions of participants has emerged within very short time frames. Applications, such as instant messaging, file-sharing, and content distribution have attracted countless numbers of users.
Klaus Wehrle, Stefan Götz, Simon Rieche
openaire +1 more source
In the last few years, an increasing number of massively distributed systems with millions of participants has emerged within very short time frames. Applications, such as instant messaging, file-sharing, and content distribution have attracted countless numbers of users.
Klaus Wehrle, Stefan Götz, Simon Rieche
openaire +1 more source
Towards Secure Distributed Hash Table
2016A distributed hash table (DHT) provides decentralized lookup service for distributed applications. All current implementations of DHT are achieved by the individual components being run by the participants of the application in question. Namely, the correctness of the DHT relies on that all the participants follow the same protocol. Unfortunately, this
Zhe Wang, Naftaly H. Minsky
openaire +1 more source
Auto-adaptive distributed hash tables
The 6th IEEE/ACM International Workshop on Grid Computing, 2005., 2005In this paper we propose a new distributed hash table model called auto-adaptive distributed hash table (AA-DHT). This model uses a distributed profiling of the nodes of the DHT to dynamically adapt the size of the index tables in order to reduce both the message cost and the request latency.
openaire +1 more source
Distributed Hash Table on Mobile Phones
2008 5th IEEE Consumer Communications and Networking Conference, 2008Distributed hash tables (DHTs) are commonly used in wired peer-to-peer networks for various purposes. However, implementing a DHT on mobile devices, especially on commercially available mobile phones, has not been carried out yet. We created a generic DHT library that is based on the Kademlia protocol.
Imre Kelenyi, Bertalan Forstner
openaire +1 more source
LDHT: Locality-aware Distributed Hash Tables
2008 International Conference on Information Networking, 2008As the substrate of structured peer-to-peer systems, distributed hash table (DHT) plays a key role in P2P routing infrastructures. Traditional DHT does not consider the location of the nodes for the assignment of identifiers, which will result in high end-to-end latency on DHT-based overlay networks. In this paper, we propose a design of locality-aware
Weiyu Wu +6 more
openaire +1 more source
SkewCCC+: A Heterogeneous Distributed Hash Table
2010Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that consider heterogeneity of nodes inside the construction process or properly serve data of different load.
Marcin Bienkowski +3 more
openaire +1 more source