Kademlia -首藤一幸 - 産æ¥æŠ€è¡“ç·åˆç ”究所 ã‚°ãƒªãƒƒãƒ‰ç ”ç©¶ã‚»ãƒ³ã‚¿ãƒ¼
1 Kademlia 首藤一幸 産æ¥æŠ€è¡“ç·åˆç ”究所 ã‚°ãƒªãƒƒãƒ‰ç ”ç©¶ã‚»ãƒ³ã‚¿ãƒ¼ 2004å¹´ 7月 27日（ç«ï¼‰ 2 資料 IPTPS02 ã®è«–æ–‡ã¨ã‚¹ãƒ©ã‚¤ãƒ‰ � “Kademlia: A Peer-topeer Information System Based on the XOR Metric†ウェブページ � http://kademlia.scs.cs.nyu.edu/ 7/26時点ã§ã¯å‚ç…§ã§ããšã€‚ 3 Kademlia ã®ä½ç½®ä»˜ã‘ è«–æ–‡ä¸ã«ç¾ã‚Œã‚‹æ¯”較対象: � Chord � Chord ã®æ‚ªã„点: � 経路表ãŒåŽ³æ ¼ã€‚ � ノード㮠failure ã‚„ã€çµŒè·¯è¡¨ã®æ¬ æã‹ã‚‰ã®å¾©æ—§ãŒè¤‡é›‘。 � qeury 転é€ã®æ–¹å‘ãŒä¸€æ–¹å‘。 � Incoming traffic ã‚’å…ƒã«çµŒè·¯è¡¨ã‚’æ›´æ–°ã§ããªã„。 � Kademlia ã§ã¯ã€2ノード間ã®é–¢ä¿‚㯠symmetric。 � x ㌠y ã®çµŒè·¯è¡¨ã«è¼‰ã£
TomP2P, a P2P-based key-value pair storage library
TomP2PTomP2P is a DHT with additional features, such as storing multiple values for a key. Each peer has a table (either disk-based or memory-based) to store its values. A single value can be queried / updated with a secondary key. The underlying communication framework uses Java NIO to handle many concurrent connections. DevelopmentTomP2P uses github for development and issue tracking. In case ca
Can Symform's P2P Cloud Storage Platform Really Work?
The explosion of electronically stored data represents the fastest growing segment of IT. Storage media and disk drives are becoming cheaper, and yet many backup services charge thousands of dollars a year to back up an $80 disk drive; Amazon costs close to $250 a month to back up 2 TB, notes Praerit Garg, president of Symform, a new cloud network that uses sharing to offer low-cost storage and ba
Chordアルゴリズムã«ã‚ˆã‚‹DHT入門
Chordアルゴリズムã®è§£èª¬ãƒšãƒ¼ã‚¸ã§ã™ã€‚ 掲載コンテンツã¸ã®ãƒªãƒ³ã‚¯å…ˆã‚’変更ã™ã‚‹å¯èƒ½æ€§ãŒã‚ã‚‹ã®ã§ã€ãƒ–ックマークやリンクã¯ã€ã“ã®ãƒšãƒ¼ã‚¸ã«ãŠé¡˜ã„ã—ã¾ã™ã€‚ Chordã¯ã€DHT（Distributed Hash Table）ã¨å‘¼ã°ã‚Œã‚‹ç¨®é¡žã®Peer-to-Peerアルゴリズムã§ã™ã€‚ 特ã«ã€æ§‹é€ 化オーãƒãƒ¬ã‚¤ï¼ˆStructured Overlay Network）ã¨å‘¼ã°ã‚Œã‚‹ãƒ«ãƒ¼ãƒ†ã‚£ãƒ³ã‚°æ‰‹æ³•ã«ç‰¹å¾´ãŒã‚ã‚Šã¾ã™ã€‚ 解説スライドã§ã¯ã€ãã‚‚ãã‚‚DHTã¨ã¯ä½•ãªã®ã‹ã¨ã„ã†åˆæ©çš„ãªã“ã¨ã‹ã‚‰ã€successorã‚„predecessorã€finger tableã¨å‘¼ã°ã‚Œã‚‹Chordã®æœ‰åãªçµŒè·¯è¡¨ã®è§£èª¬ã‚„ã€å¤šãã®è§£èª¬ã§ã¯ã‚ã¾ã‚Šè§¦ã‚Œã‚‰ã‚Œã‚‹ã“ã¨ãŒãªã„ã‘ã‚Œã©ã‚‚ãã‚ã‚ã¦é‡è¦ã§ã‚ã‚‹ã€ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã®æ§‹ç¯‰æ–¹æ³•ï¼ˆjoin・stabilize）ã«ã¤ã„ã¦ã‚‚詳細ã«è§£èª¬ã—ã¦ã„ã¾ã™ã€‚ スライドã®ãƒšãƒ¼ã‚¸æ•°ã¯å¤šã„ã§ã™ãŒã€ï¼‘ページ当ãŸã‚Šå¹³å‡æ•°ç§’ã§èªã‚ã‚‹ã¯
Skip graphs
Skip Graphs James Aspnes, Gauri Shah Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2003, pp. 384-393. Submitted to Journal of Algorithms. Abstract Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where elements are stored in separate nodes that may fail at any time.
About libjingle - Google Talk for Developers - Google Code
About libjingle libjingle is a collection of open-source C++ code and sample applications that enables you to build a peer-to-peer application. The code handles creating a network connection (through NAT and firewall devices, relay servers, and proxies), negotiating session details (codecs, formats, etc.), and exchanging data. It also provides helper tasks such as parsing XML, and handling network
inforno :: Python: 勉強ãŒã¦ã‚‰DHT(Kademliaã£ã½ã„ã‚‚ã®)を実装ã—ã¾ã—ãŸ
å‰ã€…ã‹ã‚‰ä¸€åº¦ã˜ã£ãり勉強ã—ãªã„ã¨ãªãã¨æ€ã£ã¦ã„ãŸDHTã¾ã‚ã‚Šã®å‹‰å¼·ãŒã¦ã‚‰Kademliaã£ã½ã„ã‚‚ã®ã‚’Pythonã§å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ Kademliaã¯ã„ã‚ã„ã‚実装ãŒã‚ã‚‹ã®ã§ã€ã‚½ãƒ¼ã‚¹ã‚’èªã‚“ã˜ã‚ƒã†ã¨ç”ãˆã¿ã¡ã‚ƒã£ãŸæ„Ÿã˜ã«ãªã‚‹ã‹ãªãƒ¼ã¨æ€ã£ã¦ã€å…ƒè«–文㨠首藤様ã®è³‡æ–™ ãらã„ã—ã‹è¦‹ãšã«å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ã®ã§ã€ã„ã‚ã„ã‚é–“é•ã£ã¦ã‚‹ã‹ã‚‚知れã¾ã›ã‚“ãŒï½¥ï½¥ï½¥ã€‚ 本家Kademliaã¨ã®ä¸»ãªé•ã„㯠UDPã§ã¯ãªãTCPを使ã£ã¦ã„ã‚‹ ãƒãƒ¼ã‚«ãƒ«ç’°å¢ƒã—ã‹ã‚‚ã£ã¦ã„ãªã„ã®ã§ã€UDPパケットãŒãƒã‚¹ã—ã‚„ã™ã„å ´åˆ(WAN)を想定ã—ã¦å®Ÿè£…ã™ã‚‹ã®ãŒã‚ã‚“ã©ãã•ã„。 よã£ã¦RPC-IDã‚’ã¤ã‘ã¦ã„ãªã„。 パケットã®åˆ†å‰²ã‚„å†é€ã‚‚TCPã«ãŠã¾ã‹ã›ã€‚ original publisherã‹ã‚‰ä¸€å®šæ™‚é–“publishã‚’å—ã‘ãªãã¦ã‚‚ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹æƒ…å ±ã‚’expireã—ã¦ã„ãªã„ 実装ã™ã‚‹ã®ã¯ç°¡å˜ã§ã™ã€‚ ノードãŒãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«å‚åŠ ã—ãŸã¨ãã€Indexæƒ…å ±ã‚’
ã„ã¾åˆ†æ•£ã‚·ã‚¹ãƒ†ãƒ ãŒé¢ç™½ã„ç†ç”± - Blog by Sadayuki Furuhashi
最近 クラウド ã¨ã„ã†å˜èªžãŒæµè¡Œã—ã¦ã„ã¾ã™ãŒã€ã€Œå¤§è¦æ¨¡ãªè¨ˆç®—資æºã‚’低コストã§æä¾›ã—ã¦ãれるトコãƒãŒã‚るらã—ã„ã®ã§ã€è‡ªå‰ã§æŒã£ã¦ã„ãŸè¨ˆç®—資æºã‚’委託ã—ã¡ã‚ƒãˆã°é‹ç”¨ã™ã‚‹æ‰‹é–“も知è˜ã‚‚è¦ã‚‰ãªã„ã—ã€ãã‚‚ãもサーãƒãƒ¼ã‚’è²·ã†è²»ç”¨ã‚’çœã‘ã¡ã‚ƒã†ã‹ã‚‰å¬‰ã—ã„ã€ã¨ã„ã†ç™ºæƒ³ã«åŸºã¥ã„ã¦ã„るらã—ãã€ã—ã‹ã—技術的ã«ã¯ 大è¦æ¨¡ãªè¨ˆç®—資æºã‚’低コストã§æ§‹ç¯‰ã™ã‚‹æŠ€è¡“ ãŒãƒã‚¤ãƒ³ãƒˆã§ã—ょã†ã€‚ 大è¦æ¨¡ãªè¨ˆç®—資æºã‚’ã©ã†ã‚„ã£ã¦å®‰ã構築ã™ã‚‹ã‹ã€‚ 従æ¥ã¯ã€ã‚·ã‚¹ãƒ†ãƒ ã®èƒ½åŠ›ã‚’高ã‚ã‚‹ãŸã‚ã«ã¯ã€é«˜æ€§èƒ½ãƒ»é«˜æ©Ÿèƒ½ï¼ˆãれゆãˆé«˜ä¾¡ãªï¼‰ãƒžã‚·ãƒ³ã‚’å°Žå…¥ã™ã‚‹ã¨ã„ã†ã‚¹ã‚±ãƒ¼ãƒ«ã‚¢ãƒƒãƒ—ã®æ‰‹æ³•ãŒæŽ¡ã‚‰ã‚Œã¦ã„ãŸã®ã ãŒã€ã“ã®æ‰‹æ³•ã§ã¯10å€ã«æ€§èƒ½ã‚’上ã’ã‚‹ãŸã‚ã«ã€ãŸã¨ãˆã°30å€ã®ã‚³ã‚¹ãƒˆãŒã‹ã‹ã‚‹ã‹ã‚‚ã—ã‚Œãªã„。スケールアップã¨æ¯”ã¹ã¦ã‚¹ã‚±ãƒ¼ãƒ«ã‚¢ã‚¦ãƒˆã§ã¯ã€å°Žå…¥ã—ãŸã‚³ã‚¹ãƒˆã«ã»ã¼æ¯”例ã—ã¦ã€ãƒ‘フォーマンスã®å‘上ãŒè¦‹è¾¼ã‚る。 『UNIX magazine 2009å¹´4月å·ã€ p.31 *1 何百万円もã™
Chord - Wikipedia
Chordã§ã¯ã€ã‚³ãƒ³ãƒ†ãƒ³ãƒ„ã®ãƒãƒƒã‚·ãƒ¥å€¤ã‚’求ã‚る関数ã«SHA-1を採用ã™ã‚‹ã®ãŒä¸€èˆ¬çš„ã§ã‚る。ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«å‚åŠ ã™ã‚‹ãƒŽãƒ¼ãƒ‰ã¯ã€SHA-1ã®ãƒãƒƒã‚·ãƒ¥å€¤ã®å€¤åŸŸã‚’満ãŸã™ä¸€æ„ãªãŒå‰²ã‚Šå½“ã¦ã‚‰ã‚Œã‚‹ã€‚ ã“ã“ã§ã€ã¨ã„ã†é–¢æ•°ã‚’定義ã™ã‚‹ã€‚ã“ã®é–¢æ•°ã¯ã€ãƒãƒƒã‚·ãƒ¥å€¤ãŒä¸Žãˆã‚‰ã‚ŒãŸã¨ãã€å€¤ã‚’å¢—åŠ ã•ã›ã‚‹æ–¹å‘ã§æ¬¡ã«å˜åœ¨ã—ã¦ã„るノードã®ã‚’è¿”ã™ã€‚ãªãŠã€ã¨ã¯æŽ¥ç¶šã•ã‚Œã¦ã„ã‚‹ã¨è€ƒãˆã‚‹ã€‚ ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã§æƒ…å ±ã‚’å…±æœ‰ã™ã‚‹éš›ã«ã¯ã€å…±æœ‰ã—ãŸã„æƒ…å ±ã®ãƒãƒƒã‚·ãƒ¥å€¤ã‚’ã¨ã—ã¦ã‚’満ãŸã™ã‚’æŒã¤ãƒŽãƒ¼ãƒ‰ãŒã€å®Ÿéš›ã«æƒ…å ±ã‚’ä¿æŒã—ã¦ã„るノードã®ä½ç½®ã‚’示ã™IPアドレスç‰ã®æƒ…å ±ã‚’ä¿æŒã™ã‚‹ã€‚ ã¾ãŸã€ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«å‚åŠ ã™ã‚‹ãƒŽãƒ¼ãƒ‰ã¯ã€è‡ªèº«ã®ã‚’ã¨ã—ãŸå ´åˆã€ , ãŸã ã— ã®ã‚’ã‚‚ã¤ãƒŽãƒ¼ãƒ‰ã®IPアドレスをルーティングテーブルã¨ã—ã¦ä¿æŒã™ã‚‹ã€‚ 共有ã•ã‚Œã¦ã„ã‚‹æƒ…å ±ã‚’æ¤œç´¢ã™ã‚‹éš›ã«ã¯ã€æ¤œç´¢ã—ãŸã„æƒ…å ±ã®ãƒãƒƒã‚·ãƒ¥å€¤ã‚’ã¨ã—ãŸã¨ãã€ã¨ã—ã¦ãŒå‰²ã‚Šå½“ã¦ã‚‰ã‚Œã¦ã„るノードをå„ノードã®ãƒ«ãƒ¼ãƒ†ã‚£ãƒ³ã‚°ãƒ†ãƒ¼ãƒ–ルを利用ã—
P2Pã¨åˆ†æ•£ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ル〜ãã®ï¼‘
ã•ã¦ã€P2Pã§ã¯æœ€è¿‘「分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã€ã¨ã„ã†ã‚ーワードをよãèžãã¾ã™ã€‚分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã¤ã„ã¦ã¯å¾Œã§ç´¹ä»‹ã—ã¾ã™ãŒã€ã“れを用ã„ã‚‹ã¨ãƒ«ãƒ¼ãƒ†ã‚£ãƒ³ã‚°ã€æ¤œç´¢ãŒé«˜é€Ÿã«ã€ã—ã‹ã‚‚P2Pãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯å…¨ä½“ã«å¯¾ã—ã¦é©ç”¨ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚例ãˆã°æ—¢ã«eMuleã¨å‘¼ã°ã‚Œã‚‹ãƒ•ã‚¡ã‚¤ãƒ«å…±æœ‰ã‚·ã‚¹ãƒ†ãƒ ã§ã¯åˆ†æ•£ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã®ä¸€ç¨®ã§ã‚ã‚‹kademliaãŒä½¿ã‚ã‚Œã¦ã„ã¾ã™ã€‚ã§ã¯ãã‚‚ãも分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã¨ã¯ã©ã†ã„ã†ã‚‚ã®ãªã®ã§ã—ょã†ã‹ï¼Ÿãれを説明ã™ã‚‹ã«ã¯ã¾ãšæ¤œç´¢ã§ä½¿ã‚れるãƒãƒƒã‚·ãƒ¥æ³•ã‚’説明ã™ã‚‹å¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚ [ãŠçŸ¥ã‚‰ã›]分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ル（ＤＨＴ）ã«ã¤ã„ã¦ã‚ã‹ã‚Šã‚„ã™ã解説ã—ãŸãƒšãƒ¼ã‚¸ã‚’作りã¾ã—ãŸã€‚ ＤＨＴã«èˆˆå‘³ã®ã‚ã‚‹æ–¹ã¯ã¾ãšã“ã¡ã‚‰ã‚’ã”覧下ã•ã„。 分散ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ル（ＤＨＴ）入門〜ãã®ï¼‘ ãƒãƒƒã‚·ãƒ¥æ³• 今ã€ã‚るデータベースを考ãˆã¦ãã ã•ã„。ã“ã“ã«ã¯äººã®åå‰ã¨èº«é•·ãŒæ›¸ã„ã¦ã‚るテーブルã¨ã—ã¾ã—ょã†ã€‚例ãˆã° table_1={
P2P Programming Framework - Python
P2P Programming › Overview » Python framework implementation › Java framework implementation › Python P2P File Sharing App On this page › Peer initialization › Main loop › Handling connections › Routing and sending › Other methods › PeerConnection class The P2P Framework Implementation (Python version) This page walks through a Python implementation of the P2P framework library itself. I will assu
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
https://qiita.com/nyarla/items/ba3f05c7c2c7bd6490e8
次世代éžé›†æ¨©åž‹ã‚¤ãƒ³ã‚¿ãƒ¼ãƒãƒƒãƒˆ MaidSafe ã¨ã¯ä½•ã‹? - Qiita
Home
Bisq - A decentralized bitcoin exchange network
Bitcoin Papers
Peer Routing Table
A Tutorial on Bittorrent, Freenet and Gnutella Protocols
Microsoft PowerPoint - csf641-04-storage.ppt
http://hyperestraier.sourceforge.net/rubypureapi/
{{#tags}}- {{label}}
{{/tags}}