Menu:

Latest news:

Mar 10, 2016:
Workshop program announced!

Feb 16, 2016:
Accepted papers announced!

Jan 28, 2015:
Prof. Ashish Goel from Stanford University announced as keynote speaker for NetSciCom 2016!

Nov 1, 2015:
Website for NetSciCom 2016 is created.

Read more...

Useful Links

IEEE INFOCOM 2016

Previous Editions

NETSCICOM 2015
NETSCICOM 2014
NETSCICOM 2013
NETSCICOM 2012
NETSCICOM 2011
NETSCICOM 2010

Welcome!

The Eighth IEEE International Workshop on Network Science for Communication Networks will be held in San Fransisco, CA, USA during April 10-15, 2016 in conjunction with IEEE INFOCOM 2016.
NetSciCom 2016 is a half day workshop scheduled in the morning session on Monday, April 11, 2016.


Scope

Network Science attracts the attention of a large number of researchers from across various disciplines, mainly due to its applicability in modelling the structure and dynamics of a wide variety of large-scale complex networks, ranging from genetic pathways and ecological networks to the Internet, WWW, peer-to-peer networks, blogs and online social networks, etc. Moreover, Network science has compelling applications in the field of (say) computer communication networks, electric power grid networks, transportation networks, social networks, and biological networks.
In the context of the digital-world, the communication and social networks have contributed immensely in generating Big Data pools. Data (say) logged from the Internet, p2p network, online social networks, scientific citations, protein interaction takes naturally the form of networks, often with a temporal/dynamic dimension. When this big data meets the recent advances of network science, decision makers gain an unprecedented insight from the emergent properties, constraints, phase transitions, and so on, that were previously hidden. Recently, data analytics techniques are used to learn the dynamics of massively large complex networks (e.g., link prediction, community formation) generated from large data. This has a substantial impact on the design of efficient, social aware communication systems.
Side by side, to design efficient large-scale communication networks of the future, it is imperative to understand the interdependency between the underlying physical network and the information networks that it intends to support. A deeper understanding of such interdependency can only be achieved by closer interaction between network scientists, communication network designers, and social and behavioral scientists.

The goal of this workshop is to a provide a forum where this diverse group of researchers can come together and exchange ideas that will lead to deeper insights into the design of robust, efficient and complex communication networks of the future.


Call for papers

In this workshop, we call for papers addressing the fundamental concepts of network science and also discuss the potential research directions and applications in computer communication and social network. We aim to gather together scientists and researchers conducting research on the network science, computer communication, data mining, data science and so on, with the stakeholders responsible for data-driven research. The accepted and presented papers will be published in the IEEE INFOCOM 2016 workshop proceedings and appear in IEEE Xplore.
The workshop’s focus lies at the intersection of network science and communication network design. This workshop welcomes contributions from researchers working on the following topics of interest, including, but not limited to:

  • Topology design and analysis
  • Traffic modeling and traffic routing
  • Authentication, security, privacy, trust in networks
  • Internet of Things
  • Fault tolerance, reliability and survivability
  • Multiplex and interdependent networks
  • Network robustness, resilience, phase transitions
  • Delay tolerant networks
  • Dynamic and time-varying networks
  • Community detection and analysis
  • Social networking and big data analytics
  • Epidemics and rumours in networks
  • Network evolution and growth mechanisms
  • Information diffusion and knowledge transfer in networks


    Important Dates

    • Submission deadline: Sun, December 27, 2015
    • Acceptance notification: February 5th, 2016
      February 16th, 2016
    • Camera ready: Tue, March 1, 2016
    • Program announcement: Fri, March 11th, 2016


    Submission Details

    Papers should contain original material, i.e., that has not been previously published or currently submitted elsewhere. Manuscripts must be limited to 6 pages in IEEE 8.5x11 conference format, and formatted in strict accordance with the IEEE Communications Society author guidelines. All submissions will be handled electronically. Reviews will be single-blind: authors name and affiliation should be included in the submission. The accepted and presented papers will be published in the IEEE INFOCOM 2016 workshop proceedings and appear in IEEE Xplore.
    Use the standard IEEE Transactions templates for Microsoft Word or LaTeX formats found here. If the paper is typeset in LaTeX, please use an unmodified version of the LaTeX template IEEEtran.cls version 1.8, and use the preamble: \documentclass[10pt, conference, letterpaper]{IEEEtran}

    Prospective authors should submit their papers though EDAS. The submission link is here.


    Keynote Speaker

    Ashish Goel, Professor, Management Science and Engineering and Computer Science, Stanford University, is the Keynote Speaker of NetSciCom 2016.

    Title: Efficient Algorithms for Personalized Search and Discovery

    Abstract: While Internet search has made great strides in the last two decades, the amount of network based personalization in search is still minimal. One reason is the lack of algorithms that can offer personalized search results at scale. In this talk, we will present a series of algorithms for efficient personalization based on network measures of proximity. We will first describe a random walk based algorithm for generating personalized recommendations. We will then outline an algorithm for social search based on network distance, and finally, an algorithm for answering Personalized PageRank queries on a directed graph that is suitable for use in a search algorithm. We will demonstrate the performance of these algorithms on a large social network, running on an open source graph library developed by Teapot. This represents joint work with P. Lofgren, S. Banerjee, and C. Seshadhri; P. Lofgren, S. Banerjee; B. Bahmani; B. Bahmani and A. Chowdhury; and P. Gupta, J. Lin, A. Sharma, D. Wang, and R. Zadeh.

    Short bio:
    Ashish Goel Ashish Goel is a Professor of Management Science and Engineering and (by courtesy) Computer Science at Stanford University, and a member of Stanford's Institute for Computational and Mathematical Engineering. He received his PhD in Computer Science from Stanford in 1999, and was an Assistant Professor of Computer Science at the University of Southern California from 1999 to 2002. His research interests lie in the design, analysis, and applications of algorithms; current application areas of interest include social networks, Internet commerce, and large scale data processing. Professor Goel is a recipient of an Alfred P. Sloan faculty fellowship (2004-06), a Terman faculty fellowship from Stanford, an NSF Career Award (2002-07), and a Rajeev Motwani mentorship award (2010). He was a co-author on the paper that won the best paper award at WWW 2009, and was a research fellow at Twitter from 2009-14 where he designed and prototyped Twitter's monetization and personalization algorithms. Professor Goel is also Principal Scientist at Teapot, Inc.

    Visit his homepage for more information.


    Workshop Schedule

    08:30 AM - 08:35 AM Opening
    08:35 AM - 09:15 AM

    SESSION 1

    Session Chair: Arun Sen, Arizona State University, USA
    Time allotted for each paper:
    15 mins (Presentation) + 5 mins (Q/A)

    • A Machine Learning Approach to Edge Type Inference in Internet AS Graphs
      Jinu Susan Varghese and Lu Ruan (Iowa State University, USA)
    • Average Degree Estimation under Ego-Centric Sampling Design
      Emrah Cem and Kamil Sarac (University of Texas at Dallas, USA)

    09:15 AM - 10:00 AM Keynote Talk

    Title: Efficient Algorithms for Personalized Search and Discovery

    Ashish Goel (Stanford University, USA)

    10:00 AM - 10:30 AM Break
    10:30 AM - 11:50 AM

    SESSION 2

    Session Chair: Sayan Pathak, Microsoft Research Redmond, USA
    Time allotted for each paper:
    15 mins (Presentation) + 5 mins (Q/A)

    • Computing Road Signatures from Cell Sequences with Minimum Inconsistencies
      Lisa Zhang (Bell Labs, Alcatel-Lucent, USA); Matthew Andrews (Nokia Bell Labs, USA); Jin Cao (Bell Labs, Lucent Technologies, USA)
    • Friendships in the Air: Integrating Social Links into Wireless Network Modeling, Routing, and Analysis
      Zhuo Lu (University of Memphis, USA); Yalin E Sagduyu (Intelligent Automation, Inc., USA); Yi Shi (Intelligent Automation Inc., USA)
    • Revisiting AS-Level Graph Reduction
      Erik Rye (United States Naval Academy, USA); Justin P Rohrer and Robert Beverly (Naval Postgraduate School, USA)
    • Trust Based Secure Routing in Delay Tolerant Networks
      Thomas Babbitt and Boleslaw K. Szymanski (Rensselaer Polytechnic Institute, USA)

    11:50 AM - 12:00 PM Closing comments


    Committee

    • Technical Program Chairs
      1. Bivas Mitra, Indian Institute of Technology Kharagpur, India
      2. Niloy Ganguly, Indian Institute of Technology Kharagpur, India
      3. Ravi Sundaram, Northeastern University, USA

    • Steering Committee
      1. Andrea Richa, Chair, Arizona State University, USA
      2. Katia Obraczka, Member, University of California, Santa Cruz, USA
      3. Guoliang Xue, Member, Arizona State University, USA
      4. Arun Sen, Member, Arizona State University, USA

    • General Chairs
      1. Ram Ramanathan, Raytheon BBN Technologies, USA
      2. Arun Sen, Arizona State University, USA

    • Program Committee
      1. Prithwish Basu, Raytheon BBN Technologies, USA
      2. Sanjukta Bhowmick, University of Nebraska, USA
      3. Hocine Cherifi, Université de Bourgogne, France
      4. Pradipta De, SUNY Korea, Korea
      5. Jean-Charles Delvenne, Université Catholique de Louvain, Belgium
      6. Markus Esch, Fraunhofer Institute for Communication, Information Processing and Ergonomics (FKIE), Germany
      7. Tanmoy Chakraborty, University of Maryland, College Park, USA
      8. Fakhteh Ghanbarnejad, Robert Koch Institute, Germany
      9. Jean-Loup Guillaume, Université de La Rochelle, France
      10. Saptarshi Ghosh, Indian Institute of Engineering Science and Technology, Shibpur
      11. Renaud Lambiotte, Department of Mathematics/Naxys, Université de Namur, Belgium
      12. Matthieu Latapy, LIP6, Université Pierre et Marie Curie, France
      13. Clemence Magnien, LIP6, Université Pierre et Marie Curie, France
      14. Prasenjit Mitra, QCRI, Qatar
      15. Sayan Pathak, Microsoft R&D, USA
      16. Joydeep Chandra, Indian Institute of Technology Patna
      17. Luis E C Rocha, Karolinska Institute, Sweden & Department of Mathematics, University of Namur, Belgium.
      18. Camille Roth, CNRS/Humboldt-Universität, Germany
      19. William Liu, Auckland University of Technology
      20. Sudipta Saha, National University of Singapore
      21. Nishant Shastry, King's College London, England
      22. Ingo Scholtes, ETH Zurich, Switzerland
      23. Sourav Dandapat, KAIST, Korea
      24. Lionel Tabourier, LIP6, Université Pierre et Marie Curie, France

    • Web Chair
      1. Satadal Sengupta, Indian Institute of Technology Kharagpur, India

    Accepted Papers

    1. A Machine Learning Approach to Edge Type Inference in Internet AS Graphs
      Jinu Susan Varghese and Lu Ruan (Iowa State University, USA)
    2. Average Degree Estimation under Ego-Centric Sampling Design
      Emrah Cem and Kamil Sarac (University of Texas at Dallas, USA)
    3. Computing Road Signatures from Cell Sequences with Minimum Inconsistencies
      Lisa Zhang (Bell Labs, Alcatel-Lucent, USA); Matthew Andrews (Nokia Bell Labs, USA); Jin Cao (Bell Labs, Lucent Technologies, USA)
    4. Friendships in the Air: Integrating Social Links into Wireless Network Modeling, Routing, and Analysis
      Zhuo Lu (University of Memphis, USA); Yalin E Sagduyu (Intelligent Automation, Inc., USA); Yi Shi (Intelligent Automation Inc., USA)
    5. Revisiting AS-Level Graph Reduction
      Erik Rye (United States Naval Academy, USA); Justin P Rohrer and Robert Beverly (Naval Postgraduate School, USA)
    6. Trust Based Secure Routing in Delay Tolerant Networks
      Thomas Babbitt (RPI, USA); Boleslaw K Szymanski (Rensselaer Polytechnic Institute, USA)

    Congratulations to all the authors!

    Instructions for Authors of Accepted Papers

    The camera-ready submission deadline for NetSciCom 2016 is 1st March 2016, 23:59 EST (hard deadline). Please ensure that your final manuscript is submitted on EDAS before the deadline.

    Registration of at least one author is mandatory before the final version can be upoaded. Click here to register.

    Detailed guidelines on camera-ready submission can be found here.