The different dimensions of dynamicity

Proceedings - 4th International Conference on Peer-to-Peer Computing, P2P2004

Volumn , Issue , 2004, Pages 244-251

  Deshpande, Mayur ^a   Venkatasubramanian, Nalini ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA-STRUCTURE ABSTRACTIONS; DYNAMIC NETWORKS; NETWORK DYNAMCITY; PEER-TO-PEER (P2P) NETWORKS;

COMPUTER ARCHITECTURE; DATA REDUCTION; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION DISSEMINATION; NETWORK PROTOCOLS; WORLD WIDE WEB;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 13244267076     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PTP.2004.1334953     Document Type: Conference Paper

References (17)

1. R. Albert, H. Jeong, and A. L. Barabasi. The internet's achilles' heel: Error and attack tolerance of complex networks. Nature, 2000.
2. L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley. Classes of small-world networks. Proc. Natl. Acad. Sci. USA, 97(21):11149-11152, 2000.
3. H. Balakrishnan. Looking up data in p2p systems. In Communications of the ACM (CACM), 2002.
4. A.-L. Barabasi, R. Albert, and H. Jeong. Scale-free characteristics of random networks: the topology of the world-wide web. Physica A, 281:69-77, 2000.
5. R. Bhagwan, S. Savage, and G. M. Voelker. Understanding availability. In International Workshop on Peer-to-Peer Systems (IPTPS), 2003.
6. A. Crespo and H. Garcia-Molina. Routing Indices For Peerto-Peer Systems. In Proceedings of the 22nd International Conference on Distributed Systems, pages 23-32, Vienna, Austria, 2002.
7. D. Eppstein and J. Wang. A steady state model for graph power laws. In 2nd International Workshop on Web Dynamics, May 2002.
8. P. Erdos and A. Renyi. On random graphs. Publ. Math. Debrecen, 6:290-297, 1959.
9. K. P. Gummadi, R. J. Dunn, S. Saroiu, S. D. Cribble, H. M. Levy, and J. Zahorjan. Measurement, modeling and analysis of a peer-to-peer file-sharing workload. In Symposium on Operatinng Systems Principles (SOSP), October 2003.
10. K. Klemm and V. M. Eguiluz. Highly clustered scale-free networks. Physical Reeview E., 65, 2002.
11. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the evolution of peer-to-peer systems. In PODC, pages 233-242, 2002.
12. A. Medina, A. Lakhina, I. Matta, and J. Byers. Brite: Universal topology generation from a user's perspective. In In Proceedings of Workshop the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS '01), October 2001.
13. S. Mossa, M. Barthelemy, H. E. Stanley, and L. A. N. Amaral. Truncation of power law behavior in scale-free network models due to information filtering. Physical Review Letters, 88(13), 2002.
14. C. R. Palmer and J. G. Steffan. Generating network topologies that obey power laws. In In Proceedings of GLOBECOMM, 2000.
15. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Ninth annual ACM symposium on Parallel algorithms and architectures, pages 311-320, 1997.
16. S. Sen and J. Wang. Analyzing peer-to-peer traffic across large networks. ACM Transactions of Networking, 12(2), 2004.
17. B. Yang and H. Garcia-Molina. Designing a super-peer network. In Proceedings of the 19th International Conference on Data Engineering (ICDE), March 2003.