Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
DATA PROCESSING DEVICE, DATA DISTRIBUTION PROCESSING SYSTEM, DATA PROCESSING METHOD, AND PROGRAM STORAGE MEDIUM
Document Type and Number:
WIPO Patent Application WO/2013/027784
Kind Code:
A1
Abstract:
The present invention provides a technology for a system for processing data using a plurality of nodes, whereby data can be transferred at a higher speed to a node responsible for the data ("responsible node") while achieving responsible node redundancy. A data processing device (1) is provided with a processing data transfer unit (12), a management key storage unit (15), and a routing table storage unit (17). The management key storage unit (15) stores information representing the range of a management key included in the section for which the data processing device (1) is responsible among multiple sections set by dividing the range of numerical values (key space) that the management key can take, said management key being an m-digit numerical value (where m is a positive integer). The routing table storage unit (17) stores device information including the addresses of other devices as transfer candidates determined on the basis of a multiplicity, and information representing the sections for which the other devices are responsible, said multiplicity being the nth power of the base of the numerical value of the management key (where n is a positive integer less than m). When the processing data transfer unit (12) receives processing data to be processed and a reference key that is an m-digit numerical value associated with the processing data, if the reference key is within the range of the section for which the data processing device (1) is responsible, the processing data transfer unit (12) determines that the processing data is to be processed by the data processing device (1), whereas if the reference key is outside of the section for which the data processing device (1) is responsible, the processing data transfer unit (12) transfers the processing data to another device responsible for a numerical value (generation key) having the same lower order j-digits (j=m-n) as the reference key, on the basis of the device information stored in the routing table storage unit.

Inventors:
MIKAMI SAWAKO (JP)
SATO TADASHI (JP)
Application Number:
PCT/JP2012/071249
Publication Date:
February 28, 2013
Filing Date:
August 16, 2012
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
NEC CORP (JP)
MIKAMI SAWAKO (JP)
SATO TADASHI (JP)
International Classes:
G06F12/00
Foreign References:
JP2007520778A2007-07-26
JP2006197400A2006-07-27
JP2011008711A2011-01-13
Other References:
KIYOHIDE NAKAUCHI ET AL.: "A Distributed Storage Service for Relevant Contents", IEICE TECHNICAL REPORT, vol. 102, no. 694, 28 February 2003 (2003-02-28), pages 55 - 60
VENUGOPALAN RAMASUBRAMANIAN ET AL.: "Beehive: Exploiting Power Law Query Distributions for 0 (1) Lookup Performance in Peer to Peer Overlays", PROCEEDINGS OF THE 1ST USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION, 2004, pages 1 - 14, Retrieved from the Internet
ION STOICA.. ET AL.: "Chord: A Scalable Peer to peer Look up Service for Internet Applications", PROCEEDINGS OF THE 2001 CONFERENCE ON APPLICATIONS, TECHNOLOGIES, ARCHITECTURES, AND PROTOCOLS FOR COMPUTER COMMUNICATIONS, 2001, pages 1 - 12, Retrieved from the Internet
Attorney, Agent or Firm:
SHIMOSAKA, NAOKI (JP)
Naoki Shimosaka (JP)
Download PDF:
Claims: