Maintaining distributed hash tables in an overlay network

An overlay network and network technology, applied in the field of optimization process of processing nodes leaving the overlay network, can solve problems such as network overload, and achieve the effect of reducing the risk of rupture

Active Publication Date: 2011-04-27
TELEFON AB LM ERICSSON (PUBL)
View PDF2 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

While an intuitive solution to this problem is to send DHT maintenance messages more frequently, the interval between periodic maintenance messages cannot be made arbitrarily small because the resulting signaling load would overload the network

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Maintaining distributed hash tables in an overlay network
  • Maintaining distributed hash tables in an overlay network
  • Maintaining distributed hash tables in an overlay network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] The optimized DHT leave operation described here relies on the node to help the neighboring node update its routing table quickly when the neighboring node's routing table is affected by the node's departure from the network. The leaving node may be a neighboring node, that is, in the case of a moderate departure, or another neighboring node in the case of an inappropriate departure. Now consider these two situations in detail.

[0042] Refer again figure 2 , Which shows an example of Chord's DHT-based overlay network using a ring topology. Although Chord DHT is used here as an example, the process described can also be applied to other DHT-based overlay networks. In the illustrated example, it is assumed that each node in the DHT-based overlay network saves pointers to 6 neighbors: that is, three predecessor nodes and three subsequent nodes. Of course, the proposed mechanism works with any number of follow-up and predecessor indicators.

[0043] figure 2 In, node X has...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A method of maintaining routing tables at nodes of an overlay network, where a routing table of a given node contains, for each of a set of neighbouring successor and predecessor nodes, a mapping between an overlay network address of the node and a physical locator of the node. The method comprises, upon or immediately prior to departure of a node from the overlay network, sending a Leave request from the departing node (or one of the neighbouring nodes of the departing node aware of the departure) to each neighbouring node (or each other neighbouring node of the departing node), indicating the departure and containing one or more mappings for nodes not contained within the routing table of the recipient node. Each neighbouring node (or each other neighbouring node) receives the Leave request and uses said mapping(s) to update its routing table.

Description

Technical field [0001] The present invention relates to a mechanism for maintaining a distributed hash table in an overlay network. Specifically, the present invention is applicable to the optimization process of processing nodes leaving the overlay network. Background technique [0002] Peer-to-peer or P2P networks utilize pooled resources of participating nodes including processing power and communication bandwidth in order to facilitate a large number of services including file sharing and VoIP telephony. When there is no central service, specific P2P services can use the "overlay network" to optimize resource locations. The overlay network includes nodes connected by virtual links that represent paths that extend over many possible physical links in a basic network (such as the Internet). Each node in the overlay network maintains a routing table containing a set of links to some other nodes in the overlay network. Transfer resource requests between nodes until they reach ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/06H04L45/02
CPCH04L29/08342H04L29/08414H04L67/104H04L67/1048H04L67/1065H04L29/08306
Inventor J·马恩帕
Owner TELEFON AB LM ERICSSON (PUBL)
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap