[1] |
KARGER D , KAASHOEK F , STOICA I . Chord: a scalable peer-to-peer lookup service for Internet applications[A]. Proceedings of ACM SIGCOMM[C]. San Diego, 2001. 140-160.
|
[2] |
RATNASAMY S , FRANCES P , HANDLEY M . A scalable con-tent-addressable network[A]. Proceedings of ACM SIGCOMM[C]. San Diego, 2001. 161-172.
|
[3] |
ZHAO B Y , HUANG L , STRIBLING J . Tapestry: a resilient global-scale overlay for service deployment[J]. IEEE Journal on Se-lected Areas in Communications, 2004,22(1): 41-53.
|
[4] |
ROWSTRO A , DRUSCHEL P . Pastry: scalable,decentralized object location and routing for large-scale peer-to-peer systems [A].Proceedings of ACM/IFIP/USENIX Middleware 2001[C]. Heidelberg,Germany, 2001. 329-350.
|
[5] |
LI D , LU X , WU J . FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs[A]. Proceedings of IEEE INFOCOM[C]. 2005. 1677-1688.
|
[6] |
FRANS K , KARGER D . Koorde: a simple degree-optimal distributed hash table[A]. Proceedings of IPTPS 2003[C]. Berkeley, 2003. 98-107.
|
[7] |
LOGUINOV D , KUMAR A , RAI V . Graph theoretic analysis of structured peer-to-peer systems: routing distances and fault resil-ience[A]. Proceedings of SIGCOMM[C]. Karlsruhe, 2003. 395-406.
|
[8] |
XU J , KUMMAR A , YU X . On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks[J]. IEEE Journal on Selected Areas in Communications (JSAC), 2004,22(1): 151-163.
|
[9] |
CASTRO M , DRUSCHEL P , HU Y . Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays[R]. MSR-TR-2003-52,Microsoft Research, 2003.
|
[10] |
GUMMADI K , GUMMADI R , GRIBBLE S . The impact of DHT routing geometry on resilience and proximity[A]. Proceedings of ACM SIGCOMM[C]. Karlruhe,Germany, 2003. 381-394.
|
[11] |
CHUN B , ZHAO B . Impact of neighbor selection on performance and resilience of structured P2P networks[A]. Proceedings of IPTPS[C]. Ithaca NY USA, 2005. 264-274.
|
[12] |
ZHAO Y , DUAN Y , HUANG L . Brocade: landmark routing on over-lay networks[A]. Proceedings of IPTPS[C]. Cambridge MA USA, 2002. 34-44.
|
[13] |
XU Z , MAHALINGAM M , KARLSSON M . Turning heterogeneity into an advantage in overlay routing[A]. Proceedings of IEEE IN-FOCOM[C]. San Francisco, 2003. 1499-1509.
|
[14] |
DABEK F , LI J , SIT E et al. Designing a DHT for low latency and high throughput[A]. Proceedings of NSDI[C]. San Francisco, 2004. 85-98.
|
[15] |
DABEK F , COX R , KAASHOEK F . Vivaldi: a decentralized network coordinate system[A]. Proceedings of ACM SIGCOMM[C]. Portland, 2003. 15-26.
|
[16] |
MIT[EB/OL]. . 2006.
|
[17] |
AST[EB/OL]. . 2005.
|
[18] |
RICE[EB/OL]. .
|
[19] |
MIT[EB/OL]. . 2005.
|