暂无分享,去创建一个
Ioannis Stavrakakis | Merkourios Karaliopoulos | Panagiotis Pantazopoulos | I. Stavrakakis | P. Pantazopoulos | M. Karaliopoulos
[1] L. Freeman. Centrality in social networks conceptual clarification , 1978 .
[2] David Hausheer,et al. Towards the Future Internet - A European Research Perspective , 2009, Future Internet Assembly.
[3] Stephen E. Deering,et al. Host extensions for IP multicasting , 1986, RFC.
[4] Olivier Bonaventure,et al. Extracting Intra-domain Topology from mrinfo Probing , 2010, PAM.
[5] Bhaba R. Sarker,et al. Discrete location theory , 1991 .
[6] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[7] Marco Conti,et al. Efficient social-aware content placement in opportunistic networks , 2010, 2010 Seventh International Conference on Wireless On-demand Network Systems and Services (WONS).
[8] Olivier Bonaventure,et al. Quantifying ases multiconnectivity using multicast information , 2009, IMC '09.
[9] David A. Bader,et al. Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation , 2009, 2009 International Conference on Parallel Processing.
[10] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[11] Guillaume Urvoy-Keller,et al. From content distribution networks to content networks - issues and challenges , 2006, Comput. Commun..
[12] Said Salhi,et al. Discrete Location Theory , 1991 .
[13] Michalis Faloutsos,et al. Power laws and the AS-level internet topology , 2003, TNET.
[14] Alessandro Bassi,et al. Management Architecture and Systems for Future Internet Networks , 2009, Future Internet Assembly.
[15] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.
[16] Pan Hui,et al. BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.
[17] Mark E. J. Newman. A measure of betweenness centrality based on random walks , 2005, Soc. Networks.
[18] David B. Shmoys,et al. Approximation algorithms for facility location problems , 2000, APPROX.
[19] Van Jacobson,et al. Networking named content , 2009, CoNEXT '09.
[20] Leonard M. Freeman,et al. A set of measures of centrality based upon betweenness , 1977 .
[21] Jochen H. Schiller,et al. A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks , 2008, 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom).
[22] Mads Haahr,et al. Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.
[23] Sriram V. Pemmaraju,et al. Return of the primal-dual: distributed metric facilitylocation , 2009, PODC '09.
[24] Mikkel Thorup,et al. Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..
[25] A. J. Goldman. Optimal Center Location in Simple Networks , 1971 .
[26] Roger Wattenhofer,et al. Facility location: distributed approximation , 2005, PODC '05.
[27] Martin Everett,et al. Ego network betweenness , 2005, Soc. Networks.
[28] Jiawei Zhang,et al. Approximation algorithms for facility location problems , 2004 .
[29] Roberto Solis-Oba,et al. Approximation Algorithms for the k-Median Problem , 2006, Efficient Approximation and Online Algorithms.
[30] Marten van Sinderen,et al. Supporting Dynamic Service Composition at Runtime based on End-user Requirements , 2009 .
[31] Ioannis Stavrakakis,et al. Scalable service migration in autonomic network environments , 2010, IEEE Journal on Selected Areas in Communications.
[32] Robert E. Tarjan,et al. Linear expected-time algorithms for connectivity problems (Extended Abstract) , 1980, STOC '80.
[33] Albert,et al. Emergence of scaling in random networks , 1999, Science.