- ୳ࡧΫΤϦͷసૹճϊʔυ n ʹରͯ͠ O(log n) ‣ εέʔϥϏϦςΟͷߴ͍ࢄσʔλϕʔεΛ࣮ݱ - ྫ: ࢄϋογϡද 2 [1] I. Stoica et al., “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications,” IEEE Trans. Netw., vol. 11, no. 1, pp. 17–32, 2003. ୲ϊʔυ ID IP ΞυϨε 10 203.0.113.6 2 198.51.100.2 ϊʔυ 21 ͷܦ࿏ද 21 10 2
ܦ࿏දͷҡ࣋ίετ͕͍ ‣ ࿈݁ੑ͕ߴ͍ = োੑ͕ߴ͍ ‣ ϧʔςΟϯάΞϧΰϦζϜ͕୯७ = ܦ࿏ܭࢉ͕ߴ • ਖ਼ଇάϥϑͷதͰ de Bruijn άϥϑ Kautz άϥϑ্هͷ ੑ࣭ͷଟ͘Λຬͨ͢ ‣ ఆ࣍ߏԽΦʔόϨΠ: Koorde [2]ɺSKY [3] 4 [2] M. F. Kaashoek and D. R. Karger, “Koorde: A Simple Degree-Optimal Distributed Hash Table,” in Peer-to-Peer Systems II, 2003, pp. 98–107. [3] Y. Zhang, X. Lu, and D. Li, “SKY: Efficient Peer-to-Peer Networks Based on Distributed Kautz Graphs,” Sci. China Ser. F Inf. Sci., vol. 52, no. 4, pp. 588–601, Apr. 2009.
• ϊʔυؒͷۙੑΛߟྀͯ͠୳ࡧܦ࿏ ྡϊʔυΛબͯ͠୳ࡧԆΛݮ ‣ ۙܦ࿏બ (PRS) [4] ‣ ۙྡϊʔυબ (PNS): LPRS-Chord [5] 5 [4] K. Gummadi, et al., “The Impact of DHT Routing Geometry on Resilience and Proximity,” In Proc. 2003 Conf. on App., Tech., Arch., and Proto. for Computer Comm., 2003, pp. 381–394. [5] H. Zhang, A. Goel, and R. Govindan, “Incrementally Improving Lookup Latency in Distributed Hash Table Systems,” SIGMETRICS Perform. Eval. Rev., vol. 31, no. 1, pp. 114–125, Jun. 2003. ΦʔόϨΠ ωοτϫʔΫ ԼҐωοτϫʔΫ ຊ ถࠃ
ఏҊख๏ʮۙੑΛߟྀͨ͠ࢄϥΠϯάϥϑʯ - ۙੑΛߟྀͨ͠ఆ࣍ΦʔόϨΠͷߏஙख๏ 7 τϙϩδͷՄೳੑશମ͔Βۙੑʹج͍ͮͯ࠷దͳτϙϩδΛબ [6] Y. Zhang and L. Liu, “Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs,” IEEE Trans. Knowl. Data Eng., vol. 24, no. 9, pp. 1556–1569, Sep. 2012.
ҙͷਖ਼ଇάϥϑʹجͮ͘ఆ࣍ΦʔόϨΠ͕ߏஙՄೳ ‣ ྫ: Kautz άϥϑʹجͮ͘ DLG-Kautz [3] 8 ࢄϥΠϯάϥϑ [7], [8] [7] Y. Zhang and L. Liu, “Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs,” IEEE Trans. Knowl. Data Eng., vol. 24, no. 9, pp. 1556–1569, Sep. 2012. [8] A. Manada and H. Morita, “Graph Theoretical Analysis on Distributed Line Graphs for Peer-to-Peer Networks,” IEEE Trans. Netw. Sci. Eng., pp. 1–1, 2018. [3] Y. Zhang, X. Lu, and D. Li, “SKY: Efficient Peer-to-Peer Networks Based on Distributed Kautz Graphs,” Sci. China Ser. F Inf. Sci., vol. 52, no. 4, pp. 588–601, Apr. 2009.
‣ τ(u, v) < τ(u, w) v ͕ w ΑΓ u ʹ͍ۙ͜ͱΛද͢ ‣ ϥϯυτϦοϓλΠϜͳͲ͔Βܭࢉ ‣ Ծఆ: ࣌ؒʹରͯ͠ෆมɺରশੑ (τ(u, v) = τ(v, u)) Λຬͨ͢ 12 [9] T. S. E. Ng, et al., “Measurement-Based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems,” in IEEE INFOCOM 2003., 2003, vol. 3, pp. 2199–2209 vol.3. τ(u, v) τ(u, w) u v w
5050 ͷϧʔλʹΑΔ L3 ωοτϫʔΫτϙϩδ 19 transit node transit domain stub domain stub node [10] E. W. Zegura, K. L. Calvert and S. Bhattacharjee, "How to Model an Internetwork," In Proc. IEEE INFOCOM '96. Conference on Computer Communications, 1996, pp. 594-602 vol.2. τϥϯδοτυϝΠϯ τϥϯδοτ ϊʔυ ελϒυϝΠϯ ελϒϊʔυ