메뉴 건너뛰기




Volumn , Issue , 2017, Pages 11-20

Frugal: Building Degree-Constrained Overlay Topology from Social Graphs

Author keywords

Fog network; P2P overlay networks; social networks; topology management

Indexed keywords

COSTS; DISTRIBUTED COMPUTER SYSTEMS; FOG; GEOGRAPHICAL DISTRIBUTION; NETWORK ARCHITECTURE; OVERLAY NETWORKS; SENSOR NETWORKS; SOCIAL NETWORKING (ONLINE); SOCIAL SCIENCES COMPUTING; TOPOLOGY; TREES (MATHEMATICS); VIRTUAL PRIVATE NETWORKS;

EID: 85030317079     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICFEC.2017.19     Document Type: Conference Paper
Times cited : (9)

References (27)
  • 2
    • 84996757871 scopus 로고    scopus 로고
    • Finding your way in the fog: Towards a comprehensive definition of fog computing
    • (October), ACM, 2014
    • Luis M. Vaquero and Luis Rodero-Merino, "Finding your Way in the Fog: Towards a Comprehensive Definition of Fog Computing", In SIGCOMM Comput. Commun. Rev. 44, 5 (October 2014), pp. 27-32, ACM, 2014.
    • (2014) SIGCOMM Comput. Commun. Rev. , vol.44 , Issue.5 , pp. 27-32
    • Vaquero, L.M.1    Rodero-Merino, L.2
  • 3
    • 85010031130 scopus 로고    scopus 로고
    • Fog and IoT: An overview of research opportunities
    • Dec.
    • M. Chiang and T. Zhang, "Fog and IoT: An Overview of Research Opportunities", In IEEE Internet of Things Journal, vol. 3, no. 6, pp. 854-864, Dec. 2016.
    • (2016) IEEE Internet of Things Journal , vol.3 , Issue.6 , pp. 854-864
    • Chiang, M.1    Zhang, T.2
  • 4
    • 84979498200 scopus 로고    scopus 로고
    • SNAP: A general-purpose network analysis and graph-mining library
    • (July), ACM, 2016
    • Jure Leskovec and Rok Sosi, "SNAP: A General-Purpose Network Analysis and Graph-Mining Library", In Trans. Intell. Syst. Technol. 8, 1, Article 1 (July 2016), pp. 1-20, ACM, 2016.
    • (2016) Trans. Intell. Syst. Technol. , vol.8 , Issue.1 , pp. 1-20
    • Leskovec, J.1    Sosi, R.2
  • 6
    • 84875262995 scopus 로고    scopus 로고
    • Degree constrained minimum spanning tree problem: A learning automata approach
    • (April), 2013
    • Javad Akbari Torkestani, "Degree constrained minimum spanning tree problem: a learning automata approach", In J. Supercomput. 64, 1 (April 2013), pp. 226-249, 2013.
    • (2013) J. Supercomput , vol.64 , Issue.1 , pp. 226-249
    • Torkestani, J.A.1
  • 7
    • 84859709381 scopus 로고    scopus 로고
    • An improved ant-based algorithm for the degree-constrained minimum spanning tree problem
    • TN Bui, X Deng, CM Zrncic, "An improved ant-based algorithm for the degree-constrained minimum spanning tree problem", In IEEE Trans Evol Comput 16(2):pp. 266-278, 2012.
    • (2012) IEEE Trans Evol Comput , vol.16 , Issue.2 , pp. 266-278
    • Bui, T.N.1    Deng, X.2    Zrncic, C.M.3
  • 10
    • 77955416055 scopus 로고    scopus 로고
    • SocialVPN: Enabling wide-area collaboration with integrated social and overlay networks
    • Pierre St. Juste, David Wolinsky, P. Oscar Boykin, Michael J. Covington, and Renato J. Figueiredo, "SocialVPN: Enabling wide-area collaboration with integrated social and overlay networks". In ACM Computer Networks, 54(12) pp. 1926-1938, 2010.
    • (2010) ACM Computer Networks , vol.54 , Issue.12 , pp. 1926-1938
    • Juste, P.S.1    Wolinsky, D.2    Oscar Boykin, P.3    Covington, M.J.4    Figueiredo, R.J.5
  • 14
    • 47749095395 scopus 로고    scopus 로고
    • PROSA: P2P resource organisation by social acquaintances
    • Sam Joseph, Zoran Despotovic, Gianluca Moro, and Sonia Bergamaschi (Eds.). Lecture Notes In Artificial Intelligence, Springer-Verlag, Berlin, Heidelberg
    • Vincenza Carchiolo, Michele Malgeri, Giuseppe Mangioni, and Vincenzo Nicosia, "PROSA: P2P Resource Organisation by Social Acquaintances", In Agents and Peer-to-Peer Computing, Sam Joseph, Zoran Despotovic, Gianluca Moro, and Sonia Bergamaschi (Eds.). Lecture Notes In Artificial Intelligence, Vol. 4461. Springer-Verlag, Berlin, Heidelberg pp. 135-142, 2006.
    • (2006) Agents and Peer-to-Peer Computing , vol.4461 , pp. 135-142
    • Carchiolo, V.1    Malgeri, M.2    Mangioni, G.3    Nicosia, V.4
  • 15
    • 84860710770 scopus 로고    scopus 로고
    • The anatomy of the facebook social graph
    • abs/1111.4503
    • Johan Ugander, Brian Karrer, Lars Backstrom, and Cameron Marlow, "The anatomy of the facebook social graph". CoRR, abs/1111.4503, 2011.
    • (2011) CoRR
    • Ugander, J.1    Karrer, B.2    Backstrom, L.3    Marlow, C.4
  • 17
    • 67249148362 scopus 로고    scopus 로고
    • Exploring network structure, dynamics, and function using NetworkX
    • Gel Varoquaux, Travis Vaught, and Jarrod Millman (Eds), (Pasadena, CA USA)
    • Aric A. Hagberg, Daniel A. Schult and Pieter J. Swart, "Exploring network structure, dynamics, and function using NetworkX, In Proceedings of the 7th Python in Science Conference (SciPy2008), Gel Varoquaux, Travis Vaught, and Jarrod Millman (Eds), (Pasadena, CA USA), pp. 11-15, 2008.
    • (2008) Proceedings of the 7th Python in Science Conference (SciPy2008) , pp. 11-15
    • Hagberg, A.A.1    Schult, D.A.2    Swart, P.J.3
  • 19
    • 4143094718 scopus 로고    scopus 로고
    • (last accessed December 2012)
    • T. Klingberg and R. Manfredi. Gnutella 0.6. http://rfcgnutella. sourceforge.net/src/rfc-0 6-draft.html (last accessed December 2012), 2002.
    • (2002) Gnutella 0.6
    • Klingberg, T.1    Manfredi, R.2
  • 21
    • 0034225435 scopus 로고    scopus 로고
    • A new evolutionary approach to the degreeconstrained minimum spanning tree problem
    • J. Knowles and D. Corne, "A new evolutionary approach to the degreeconstrained minimum spanning tree problem", In IEEE Transactions on Evolutionary Computation, vol. 4, no. 2, pp. 125-134, 2000.
    • (2000) IEEE Transactions on Evolutionary Computation , vol.4 , Issue.2 , pp. 125-134
    • Knowles, J.1    Corne, D.2
  • 22
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Plenum, New York
    • Karp RM "Reducibility among combinatorial problems", In Complexity of computer computations. Plenum, New York, pp. 85-103, 1972.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 23
    • 33644606026 scopus 로고    scopus 로고
    • Using lagrangian dual information to generate degree constrained spanning trees
    • Andrade R, Lucena A, Maculan N, "Using Lagrangian dual information to generate degree constrained spanning trees", In Discrete Appl Math 154 pp. 703-717, 2006.
    • (2006) Discrete Appl Math , vol.154 , pp. 703-717
    • Andrade, R.1    Lucena, A.2    Maculan, N.3
  • 26
    • 84947235017 scopus 로고    scopus 로고
    • Kademlia: A peer-to-peer information system based on the XOR metric
    • Peter Druschel, M. Frans Kaashoek, and Antony I. T. Rowstron (Eds.). Springer-Verlag, London, UK
    • Petar Maymounkov and David Mazires, "Kademlia: A Peer-to-Peer Information System Based on the XOR Metric", In Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS '01), Peter Druschel, M. Frans Kaashoek, and Antony I. T. Rowstron (Eds.). Springer-Verlag, London, UK, pp. 53-65, 2002.
    • (2002) Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS '01) , pp. 53-65
    • Maymounkov, P.1    Mazires, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.