Efficient Routing in Networks with Long Range Contacts-Reference-Cited by-同舟云学术

Efficient Routing in Networks with Long Range Contacts

Published:2001 Issue: Volume: Page:270-284
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Barriére Lali,Fraigniaud Pierre,Kranakis Evangelos,Krizanc Danny

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45414-4_19

Reference18 articles.

1. W. Aiello, F. Chung, and L. Lu, “A Random Graph Model for Massive Graphs”, in 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000.

2. B. Bollobas, “Random graphs”, Academic Press, 1985.

3. B. Bollobas and F. Chung, “The Diameter of a Cycle Plus a Random Matching”, SIAM Journal on Discrete Mathematics 1:328–333, 1988.

4. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, J. Wiener, “Graph Structure in the Web”, in 9th International World Wide Web Conference, Amsterdam, May 15-19, 2000.

5. F. Chung and M. Garey, “Diameter Bounds for Altered Graphs”, Journal of Graph Theory, 8:511–534, 1984.

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. State-of-the-art survey on P2P overlay networks in pervasive computing environments;Journal of Network and Computer Applications;2015-09

2. Greedy routing in small-world networks with power-law degrees;Distributed Computing;2014-04-22

3. Hierarchical Neighbor Maintenance;Structured Peer-to-Peer Systems;2012-10-10

4. Survey on hierarchical routing schemes in “flat” distributed hash tables;Peer-to-Peer Networking and Applications;2010-10-05

5. References;Overlay Networks;2010-02-09