WO2013001589A1 - Appareil et procédé de communication, et programme d'ordinateur - Google Patents

Appareil et procédé de communication, et programme d'ordinateur Download PDF

Info

Publication number
WO2013001589A1
WO2013001589A1 PCT/JP2011/064669 JP2011064669W WO2013001589A1 WO 2013001589 A1 WO2013001589 A1 WO 2013001589A1 JP 2011064669 W JP2011064669 W JP 2011064669W WO 2013001589 A1 WO2013001589 A1 WO 2013001589A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
user
information
users
user information
Prior art date
Application number
PCT/JP2011/064669
Other languages
English (en)
Japanese (ja)
Inventor
恭一 寺尾
秀人 遠藤
裕貴 玉田
Original Assignee
パイオニア株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by パイオニア株式会社 filed Critical パイオニア株式会社
Priority to JP2013522380A priority Critical patent/JP5675980B2/ja
Priority to PCT/JP2011/064669 priority patent/WO2013001589A1/fr
Publication of WO2013001589A1 publication Critical patent/WO2013001589A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/2866—Architectures; Arrangements
    • H04L67/30—Profiles
    • H04L67/306—User profiles

Definitions

  • the present invention relates to a communication apparatus and method for transmitting and receiving data by a peer-to-peer (P2P) method, and a technical field of computer programs.
  • P2P peer-to-peer
  • DHT distributed Hashing Table
  • Non-Patent Document 2 As application software using the conventional peer-to-peer technology used in this type of communication device, for example, software that operates in a pure peer-to-peer system that does not require a central server for file sharing has been proposed (Non-Patent Document 2). reference).
  • SNS social network service
  • the present invention has been made in view of the above problems, for example, and a communication apparatus and method capable of suppressing a decrease in communication efficiency even when a peer-to-peer method is applied to data transmission / reception in an SNS, and It is an object to provide a computer program.
  • the communication device of the present invention is a communication device that constructs a network by a peer-to-peer method, and is one or more users who are related to the own user who is the user of the own node that is the communication device. And (i) the one or more related users via the network based on the acquired one or more pieces of identification information, the first acquisition means for acquiring one or more pieces of identification information for identifying the related users And (ii) second acquisition means for acquiring one or more related user information that is user information related to the one or more related users; and Based on one or more related user information, at least one related node of the one or more related nodes is determined as an adjacent node of the own node. When, and a holding means for holding information related to the determined neighbor.
  • the communication apparatus constructs a network by a peer-to-peer method.
  • the “network” typically means a virtual network (so-called overlay network) built on an existing network based on the existing network.
  • the first acquisition unit including a memory, a processor, and the like includes at least one or more related users for identifying one or more related users who are related to the own user who is the user of the own node (that is, the communication device). Get identification information.
  • the “related user” is, for example, the family / friend / acquaintance of the user, the resident of the area where the user is resident, the participant of the community on the existing network in which the user is participating, or A person who is close to the place where the user is present, a person who likes a place that the user likes or is close to the favorite place, a person who has a hobby similar to the user, and the like.
  • identification information relating to the related user may be obtained from, for example, address data stored in the own node, data stored in the SNS server, or the like.
  • the second acquisition means including a memory, a processor, and the like is based on one or more acquired identification information, and (i) a related node that is a node used by one or more related users via an existing network.
  • a related node that is a node used by one or more related users via an existing network.
  • One or more related user information that is user information related to one or more related users is acquired.
  • the “related user information” is typically acquired from another node (including a related node) that is a node different from the own node or a management server that constructs a peer-to-peer network.
  • the determination unit including a memory, a processor, and the like determines at least one related node among the one or more related nodes as an adjacent node of the own node based on the acquired one or more related user information.
  • holding means including a memory, a processor, etc. holds information related to the determined adjacent node.
  • At least one related node among the plurality of related nodes used by each of the plurality of related users who will transmit and receive data relatively frequently is determined by the local node.
  • As an adjacent node As a result, on a peer-to-peer network, the number of nodes intervening between the own node and other nodes that transmit and receive data relatively frequently is relatively small. The decrease can be suitably suppressed.
  • the second acquisition unit further acquires own user information that is user information relating to the own user
  • the determination unit includes the acquired own user information and the acquisition.
  • calculating means for calculating a social distance, which is an index indicating a degree of association between the own node and each of the one or more related nodes, based on the one or more related user information, Based on the calculated social distance, at least one related node among the one or more related nodes is determined as an adjacent node of the own node.
  • a related node that is more suitable for the adjacent node of the own node that is, a related user who transmits and receives data more frequently by the own user
  • Related node can be selected, which is very advantageous in practice.
  • the own user information and the one or more related user information each include a plurality of feature amounts that are parameters respectively indicating characteristics of the own user or the one or more related users
  • the calculating means may calculate the social distance by weighting each of the plurality of feature amounts.
  • the related user includes a user in the vicinity of the place where the user is present.
  • the communication method of the present invention is a communication method in a communication device that constructs a network by a peer-to-peer method, and is a user related to the own user who is a user of the own node that is the communication device.
  • a second acquisition step of acquiring one or more related user information that is user information related to the one or more related users Based on the acquired one or more related user information, at least one related node among the one or more related nodes is determined as an adjacent node of the own node.
  • the communication method of the present invention can also adopt various aspects similar to the various aspects of the communication apparatus of the present invention described above.
  • the computer program of the present invention is a communication device that constructs a network by a peer-to-peer method, and is a user related to the own user who is the user of the own node that is the communication device.
  • a first acquisition means for acquiring one or more identification information for identifying one or more related users; and (i) the one or more via the network based on the acquired one or more identification information
  • second acquisition means for acquiring one or more related user information, which is user information related to the one or more related users; Based on the acquired one or more related user information, at least one related node of the one or more related nodes is determined as the own node.
  • Holding means for holding determining means for determining the neighboring node, the information relating to the determined neighboring node, To function as a communication device.
  • the information recording medium of the present invention records the above-described computer program of the present invention (including various aspects thereof) in order to solve the above problems.
  • the information recording medium of the present invention similarly to the computer program of the present invention described above, it is possible to suitably suppress a decrease in communication efficiency.
  • FIG. 1 is a schematic diagram illustrating an outline of a data communication apparatus according to the first embodiment
  • FIG. 2 is a block diagram illustrating a configuration of the data communication apparatus according to the first embodiment. 1 and 2 show only members directly related to the present embodiment, and the other members are not shown (the same applies to the following drawings).
  • the data communication apparatus 10 is connected to another data communication apparatus 21 and a node management server 22 via a network 30 such as a WAN (Wide Area Network). .
  • the node management server 22 stores information related to nodes constituting a peer-to-peer network. Note that the configuration of the data communication device 21 is the same as the configuration of the data communication device 10, and therefore, the details thereof are omitted.
  • the node management server 22 can also have a function as a data communication device, and can be a node.
  • the data communication apparatus 10 includes a CPU (Central Processing Unit) 11, a user memory 12, a content memory 13, a node memory 14, and a network IF (Interface) 15.
  • the CPU 11, user memory 12, content memory 13, node memory 14, and network IF 15 are connected to each other via a bus 16.
  • the user memory 12 for example, information related to a user (for example, a friend / acquaintance, a company colleague, a school classmate, etc.) related to the user of the data communication apparatus 10 (hereinafter referred to as “own user” as appropriate). Certain user information (hereinafter referred to as “social user information” as appropriate) is stored.
  • the user information includes, for example, a user ID as identification information for identifying one user from other users, a list of nodes used by the one user, the profile of the one user, and the like. ing.
  • the user information may be input by the own user, for example, or may be acquired from the node management server 22 or the data communication device 21 via the network 30.
  • the content memory 13 stores content information that is information related to content such as image data, text data, music data, and moving image data.
  • the content information includes, for example, a content ID as identification information for identifying one content from other content, capacity information indicating the data capacity of the one content, a description related to the one content, the one content Entity data, etc. are included.
  • the node memory 14 stores node information that is information related to the adjacent node of the data communication device 10 if an adjacent node is set.
  • the node memory 14 may store not only node information related to the adjacent node of the data communication apparatus 10 but also node information related to the adjacent node of the adjacent node. If comprised in this way, the data communication apparatus 10 can recognize the cluster relationship of the said data communication apparatus 10 vicinity comparatively easily.
  • the node information may include, for example, a node ID, an IP address, a port number, a URL (Uniform Resource Locator), a manufacturer name, model information, and the like.
  • the CPU 11 includes a social management unit 111, a content management unit 112, an adjacent node management unit 113, a social user acquisition unit 114, a content input / output unit 115, a content search / distribution request input unit 116, and a user search request input unit 117. It is configured with.
  • the social user acquisition unit 114 acquires information indicating a user ID related to another user and a social relationship related to the other user (that is, a relationship with the own user).
  • social relationships include, for example, friends / acquaintances, persons interested in the user, participants in the community on the network where the user participates, content similar to the content and devices owned by the user, For example, the person who owns the device, the person who lives in the vicinity of the current user, or the person near the current location.
  • the social management unit 111 manages user information (that is, social user information) stored in the user memory 12, acquires social user information based on the user ID acquired by the social user acquisition unit 114, and Store in the memory 12. The social management unit 111 further sets an adjacent node of the data communication device 10 based on the social user information stored in the user memory 12.
  • the adjacent node management unit 113 manages node information related to the adjacent node set by the social management unit 111 and stored in the node memory 14.
  • the content input / output unit 115 is, for example, an MPEG (Moving Picture Experts Group) decoder and video terminal, a DA (Digital to Analog) converter and speaker output, moving image data, music data, text data, etc. in a predetermined file format. May be configured by an output unit capable of outputting in the above, a video input terminal, an audio input terminal, an input unit capable of inputting a predetermined file format, and the like.
  • MPEG Motion Picture Experts Group
  • DA Digital to Analog converter and speaker output
  • Each of the social user acquisition unit 114, the content input / output unit 115, the content search / distribution request input unit 116, and the user search request input unit 117 is, for example, a user interface (see FIG. 1) via the bus 16 (see FIG. 1). (Not shown) or the like.
  • the network IF 15 includes a node information transmission / reception unit 151, a data search / acquisition unit 152, and a data distribution unit 153.
  • the node information transmission / reception unit 151 uses the node ID based on the node ID included in the social user information stored in the user memory 12 (that is, the node ID constituting the list of nodes used by one user). Node information including an address and a port number related to the node corresponding to is acquired.
  • the node information may be acquired from the node management server 22 or the data communication device 21 via the network 30, for example.
  • the data search / acquisition unit 152 is a node adjacent to the data communication device 10 in order for the data communication device 10 to acquire user information and the like related to another user (that is, a user who uses the one data communication device 21). In response to this, a search request relating to the other user is transmitted, and user information relating to the other user as an answer to the search request is acquired. The data search / acquisition unit 152 further transmits user information related to the user requested from the other node to the other node.
  • the data distribution unit 153 transmits user information and the like related to the own user to the adjacent node of the data communication apparatus 10 and receives user information and the like related to other users from the adjacent node of the data communication apparatus 10.
  • Adjacent node setting process The adjacent node setting process in the data communication apparatus 10 configured as described above will be described with reference to the flowcharts of FIGS.
  • the social user acquisition unit 114 acquires a user ID related to a user related to the user (step S101).
  • the social management unit 111 acquires social user information corresponding to the user ID from the node management server 22 based on the acquired user ID (step S102).
  • the social management unit 111 stores the acquired social user information in the user memory 12 (step S103). Subsequently, the social management unit 111 determines the node used by the user related to the stored social user information as an adjacent node (step S104). Next, the node management unit 113 stores the node information related to the adjacent node determined by the social management unit 111 in the node memory 14 (step S105).
  • the social management unit 111 corresponds to one or more pieces of node information stored in the node memory 14 based on the user ID acquired by the social management unit 114. At least one of the adjacent nodes is requested to acquire social user information corresponding to the acquired user ID. And the social management part 111 acquires social user information from an adjacent node (step S201). Then, the social management part 111 performs the process after step S103 mentioned above.
  • the node used by the user related to the user is set as the adjacent node by the data communication apparatus 10 according to the present embodiment, the node used by the user who is not related to the user at all is the adjacent node. As compared with the case where it is set as, generation of useless traffic can be suppressed. Therefore, relatively high-speed data communication can be performed. Furthermore, a peer-to-peer network having a small world property, a scale-free property, and a cluster property can be constructed relatively easily, which is very advantageous in practice.
  • the “data communication device 10”, the “social user acquisition unit 114”, the “node memory 14”, and the “user associated with the own user” according to the present embodiment are the “own node” according to the present invention, It is an example of “first acquisition unit”, “holding unit”, and “related user”.
  • the “social management unit 111” according to the present embodiment is an example of the “second acquisition unit” and the “determination unit” according to the present invention.
  • FIG. 5 is a block diagram showing the configuration of the data communication apparatus according to the second embodiment, similar to FIG.
  • the CPU 11 of the data communication apparatus 10 includes a local user information acquisition unit 118 that acquires user information related to the local user who is the user of the data communication apparatus 10 (hereinafter, referred to as “local user information” as appropriate).
  • the own user information includes a user ID related to the own user, a profile of the own user, information related to a node used by the own user other than the data communication apparatus 10, and the like.
  • the social management unit 111 sets an adjacent node of the data communication device 10 based on the own user information and the social user information.
  • FIG. 6 is an example of data included in the user information.
  • user A (see (a)) is an example of own user information
  • users B and C (see (b) and (c)) are examples of social user information.
  • the social management unit 111 When setting an adjacent node, the social management unit 111 first calculates the social distance between the user A, the user B, and the user C.
  • the “social distance” is an index indicating the degree of association between the own user and a user related to the own user.
  • the social distance between the user A and the user B is calculated as follows. That is, 1 (refer to “friendliness” of “user A's social value”) + 1/1000 (refer to “number of accesses” of “social value of user A”) + ⁇ (9 ⁇ 8) 2 + (3 ⁇ 9) 2 + ( ⁇ 4 + 1) 2 ⁇ 0.5 (refer to “favorite music” in “social value of user A” and “favorite music” in “social value of user B”) + 140 (“social value of user A”) Distance between “favorite place” and “user B social value” of “favorite place” +1 (“user A social value” “participating community” and “user B social value” “participating community” Number of common terms with ”)”).
  • the social distance between the user A and the user C is 30 + 1/3 + ⁇ (9 ⁇ ( ⁇ 9)) 2 + (3 ⁇ 5) 2 + ( ⁇ 4 ⁇ 7) 2 ⁇ 0.5 + 1300 + 0.
  • the social management unit 111 sets a node corresponding to a user with a small social distance as an adjacent node based on the calculated social distance.
  • the social distance related to the user B is smaller than the social distance related to the user C, so that the node corresponding to the user B uses the data communication device used by the user A (that is, the user). 10 adjacent nodes are set.
  • a node with a short social distance can be preferentially set as an adjacent node, so that data can be distributed more efficiently in a peer-to-peer network.
  • FIG. 7 is a block diagram showing the configuration of the data communication apparatus according to the third embodiment, similar to FIG.
  • the CPU 11 of the data communication device 10 uses the weight value set for each application program used in the data communication device 10 and the weight value set for each content stored in the content memory 13.
  • a weight holding unit 119 is further provided.
  • the social management unit 111 calculates a social distance and sets an adjacent node
  • the social management unit 111 refers to the weight value held in the weight holding unit 119 and sets the application program used by the user and the peer-to-peer network. Set the optimal adjacent node for each content to be distributed.
  • FIG. 8 is a block diagram showing the configuration of the data communication apparatus according to the fourth embodiment, similar to FIG.
  • the network IF 15 of the data communication apparatus 10 further includes a social approval unit 154.
  • the social approval unit 154 transmits a signal indicating that the social management unit 111 intends to set the adjacent node to the adjacent node, and receives a response from the node that has received the transmitted signal. To do.
  • the present invention is not limited to the above-described embodiment, and can be appropriately changed without departing from the gist or concept of the invention that can be read from the claims and the entire specification, and a communication apparatus and method with such a change.
  • computer programs are also included in the technical scope of the present invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)
  • Computer And Data Communications (AREA)

Abstract

L'invention concerne un appareil de communication (10) pour construire un réseau conformément à un protocole d'homologue à homologue. L'appareil de communication comporte : un premier moyen d'acquisition (114) pour acquérir un ou plusieurs éléments d'informations d'identification pour identifier un ou plusieurs utilisateurs connectés connectés à un utilisateur local de l'appareil de communication, qui est un nœud local ; un second moyen d'acquisition (111) pour acquérir, par l'intermédiaire d'un réseau et sur la base du ou des éléments d'informations d'identification ainsi acquis, un ou plusieurs éléments d'informations d'utilisateur connecté, (i) les informations contenant des informations de nœud relatives à des nœuds de connexion utilisés par le ou les utilisateurs connectés, et (ii) les informations étant des informations d'utilisateur relatives à un ou plusieurs utilisateurs connectés ; un moyen d'affectation (111) pour affecter au moins l'un du ou des nœuds de connexion à un nœud adjacent au nœud local sur la base du ou des éléments d'informations d'utilisateur connecté ainsi acquis ; et un moyen de conservation (14) pour conserver des informations relatives au nœud adjacent ainsi affecté.
PCT/JP2011/064669 2011-06-27 2011-06-27 Appareil et procédé de communication, et programme d'ordinateur WO2013001589A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2013522380A JP5675980B2 (ja) 2011-06-27 2011-06-27 通信装置及び方法、並びにコンピュータプログラム
PCT/JP2011/064669 WO2013001589A1 (fr) 2011-06-27 2011-06-27 Appareil et procédé de communication, et programme d'ordinateur

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2011/064669 WO2013001589A1 (fr) 2011-06-27 2011-06-27 Appareil et procédé de communication, et programme d'ordinateur

Publications (1)

Publication Number Publication Date
WO2013001589A1 true WO2013001589A1 (fr) 2013-01-03

Family

ID=47423535

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2011/064669 WO2013001589A1 (fr) 2011-06-27 2011-06-27 Appareil et procédé de communication, et programme d'ordinateur

Country Status (2)

Country Link
JP (1) JP5675980B2 (fr)
WO (1) WO2013001589A1 (fr)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011507115A (ja) * 2007-12-17 2011-03-03 アルカテル−ルーセント スーパーピアトゥピアネットワークのユーザによって発信されたコンテンツデータパッケージを配信する方法

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011507115A (ja) * 2007-12-17 2011-03-03 アルカテル−ルーセント スーパーピアトゥピアネットワークのユーザによって発信されたコンテンツデータパッケージを配信する方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
KAZUHIRO KOJIMA: "Development of Self- Organizable P2P Search Engine-TellaGate", IPSJ SIG NOTES, vol. 2004, no. 85, 6 August 2004 (2004-08-06), pages 123 - 130 *
KIMIHIKO ANDO ET AL.: "DHT Network with Access Limitation using Social Network", SYMPOSIUM ON MULTIMEDIA, DISTRIBUTED, COOPERATIVE AND MOBILE SYSTEMS (DICOM02007) RONBUNSHU, IPSJ SYMPOSIUM SERIES, vol. 2007, no. 1, 4 July 2007 (2007-07-04), pages 930 - 938 *

Also Published As

Publication number Publication date
JP5675980B2 (ja) 2015-02-25
JPWO2013001589A1 (ja) 2015-02-23

Similar Documents

Publication Publication Date Title
US20150356318A1 (en) Locative social networking using a mobile device
JP2011198023A (ja) 通信端末装置、コンピュータプログラムおよびコンテンツ検索方法
JP2008294626A (ja) コンテンツ分散保存システム、コンテンツ保存方法、ノード装置、及びノード処理プログラム
JP4506387B2 (ja) 情報通信システム、ノード装置、及びオーバーレイネットワーク形成方法等
WO2013029442A1 (fr) Procédé et système d'affichage de statut d'ami dans un réseau sns, client et serveur associés
JP5136585B2 (ja) 情報通信システム、ノード装置、情報処理方法、及び情報処理プログラム
JP4877107B2 (ja) 情報配信システムにおける端末装置及び情報処理プログラム、並びに端末装置の情報処理方法
JP4765876B2 (ja) コンテンツ配信システムにおける端末装置及びその情報処理方法並びにプログラム
JP5675980B2 (ja) 通信装置及び方法、並びにコンピュータプログラム
JP5168055B2 (ja) 通信システム、端末装置及びコンテンツ情報取得方法
JP5614866B2 (ja) 通信装置及び方法、並びにコンピュータプログラム
JP5423497B2 (ja) 情報通信システム、ノード装置、情報通信方法、及びプログラム
JP5326968B2 (ja) 情報通信システム、サポート装置、サポート装置のプログラム、及びコンテンツ取得方法
WO2012176300A1 (fr) Dispositif et procédé de communication, et programme d'ordinateur
JP5338774B2 (ja) 配信システム、情報処理装置、情報処理プログラム、及びコンテンツ投入方法
JP2011227887A (ja) 情報通信システム、情報処理装置および情報通信方法ならびにプログラム
JP5136213B2 (ja) 情報配信システム及び同システムにおける端末装置
JP2009230573A (ja) コンテンツ分散保存システム、コンテンツ再生方法、ノード装置、管理装置、ノード処理プログラム、及び管理処理プログラム
JP2018147171A (ja) コンテンツ配信方法、およびコンテンツ配信システム
JP2012078903A (ja) ノード装置、ノード装置用プログラムおよび情報処理方法
JP2015114698A (ja) ソーシャルネットワーキングサービス提供システムおよびサーバ
JP5347876B2 (ja) 情報通信システム、ノード装置、コンテンツ取得方法及びプログラム
JP5494362B2 (ja) 配信システム、情報処理装置、プログラム、及びコンテンツ投入方法
JP5326970B2 (ja) コンテンツ配信システム、ノード装置、ノードプログラム、及び公開メッセージ送信方法
JP2009129161A (ja) コンテンツ分散保存システム、コンテンツ評価値決定方法、配信装置、及び配信処理プログラム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11868720

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2013522380

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11868720

Country of ref document: EP

Kind code of ref document: A1