A network occupancy cost model for data distribution equilibrium measurement

Journal of Computational Information Systems

Volumn 6, Issue 12, 2010, Pages 3911-3918

  Chen, Jianhong ^a   Xi, Jianqing ^a   Shao, Liang ^b  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Data Distribution; Modeling; Network Topology; Peer to Peer

Indexed keywords

COST MODELS; DATA DISTRIBUTION; DATA DISTRIBUTION SCHEMES; DATA FLOW; EQUILIBRIUM MEASUREMENTS; INTERNET BACKBONE; INTERNET TRAFFIC; MEASURING DATA; MINIMUM NETWORKS; MODEL SET; MODELING; NETWORK TOPOLOGY; P2P TRAFFICS; PEER TO PEER; TOPOLOGY AWARE;

COSTS; DATA FLOW ANALYSIS; DECISION THEORY; DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK TOPOLOGY; INTERNET; TRAFFIC SURVEYS;

PEER TO PEER NETWORKS;

EID: 78651375661     PISSN: 15539105     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. K. Thomas, R. Pablo, and P. Konstantina. Should Internet service providers fear peer-assisted content distribution? In Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement, Berkeley, CA, USA, pp.6-6, 2005.
2. R. Yakov and L. Tony. RFC 1771, A Border Gateway Protocol 4 (BGP-4). Internet Engineering Task Force: 1995.
3. L. Chunguang and C. Guanrong. Modelling of Weighted Evolving Networks with Community Structures. Physica A, 370, pp. 869-876, 2006.
4. Z. Moshe, N.D. Timothy, and A.G. Ronald. Internet Traffic Modeling and Future Technology Implications. IEEE INFOCOM 2003.
5. C. Yan, L. Khian-Hao, and K.H. Randy, Overton C. On the Stability of Network Distance Estimation. ACM SIGMETRICS Performance Evaluation Review, pp. 21-30, 2002.
6. X. Haiyong, K. Arvind, Y.R. Yang, and S. Avi. P4P: Proactive Provider Participation for P2P. Yale Computer Science YALE/DCS/TR1377. 2007
7. S.L. Hakimi. Steiner Problem in Graphs and Its Implications. Networks, 1, pp. 113-133, 1971.
8. C. Bram. Incentives Build Robustness in BitTorrent. Workshop on Economics of P2P systems. 2003
9. M.E. Raymond, and T.W. James, Complexity of Computer Computations, Plenum Press, New York, 1972
10. H. Takahashi and A. Matsuyama. An Approximate Solution for the Steiner Problem in Graphs. Math. Japonica, 24, pp. 573-577, 1980.
11. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, 2001
12. C. Guanrong, F. Zhengping, and L. Xiang Modeling the Complex Internet Topology. In Complex Dynamics in Communication Networks, Berlin: Springer-Verlag, pp. 213-234, 2005.
13. G. Macro, P. Maurizio. Dynamic Analysis of the Autonomous System Graph. IPS2004, Inter-Domain Performance and Simulation, pp. 13-24, 2004.
14. M.V. Harsha, I. Tomas, P. Michael, D. Colin, A. Thomas, K. Arvind, and V. Arun. iPlane: An Information Plane for Distributed Services. In Proc. OSDI, pp. 367-380, 2006.