|
Program
Paper submission
Registration
Travel
CFP [
txt|
pdf]
|
|
Call for Papers
Large-scale networks with complex interaction patterns
between elements are found in abundance in Communication
Networks like: social networks, blog & collaborative
networks, WWW, P2P, DTN, Sensors... In the last decade
many research efforts contributed to establishing the
concept of a network science to characterize, model, and
analyze complex networks. Network Science founds
applications in a variety of domains and show a
mainstream research topic of interest for theoretical
physicists, epidemiologists, biologist, economists, and
computer scientists.
For the communication networking community there is a
strong research interest in the analysis of the
structure and properties of dynamic networks at several
layers: network/communication layers but also at the
social/application layers. Understanding how the
interplay of these different layers of complex networks
happens and the potential mutual effects they may have
on each other in a dynamic graph context is a key
challenge.
Topics
- Bio-inspired networks; Social Networks
- Characterizing and analyzing dynamic networks
- Correlation of different types of social networks
- Delay tolerant and disruption tolerant networks (DTN)
- Discrete optimization and algorithms
- Dynamical processes (proliferation, diffusion etc.)
- Game theoretic models, pricing and incentives on dynamic networks
- Implications of social networking on distributed network/systems
- Mobility modeling and management
- Robustness & Stability of dynamical networks
- Sensor Networks
- Social networks
- Tools and methods for collecting, analyzing, or visualizing data from dynamic networks
Technical Program
Friday, June 410:00 - 11:00S1: Invited speaker: Renaud Lambiotte
- 10:00 Multi-scale Modularity in Complex Networks
Renaud Lambiotte (Imperial College, United Kingdom)
We focus on the detection of communities in multi-scale networks, namely networks made of different levels of organization and in which modules exist at different scales. It is first shown that methods based on modularity are not appropriate to uncover modules in empirical networks, mainly because modularity optimization has an intrinsic bias towards partitions having a characteristic number of modules which might not be compatible with the modular organization of the system. We argue for the use of more flexible quality functions incorporating a resolution parameter that allows us to reveal the natural scales of the system. Different types of multi-resolution quality functions are described and unified by looking at the partitioning problem from a dynamical viewpoint. Finally, significant values of the resolution parameter are selected by using complementary measures of robustness of the uncovered partitions. The methods are illustrated on a benchmark and an empirical network.
11:00 - 12:00S2: Monitoring & Protocols
- 11:00 Optimal Monotone Forwarding Policies in DTN Mobile Ad Hoc Networks with Classes
Francesco De Pellegrini (Create-Net, Italy); Eitan Altman (INRIA, France); Tamer Basar (University of Illinois at Urbana-Champaign, USA)
In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes exist. We specialize the description of the energy-delay tradeoffs as an optimization problem based on a fluid approximation. We then adopt two product forms to model message diffusion and show that extremal controls are of bang-bang type. Using the general framework we analyze some specific cases of interest for applications.
- 11:30 Detecting Events in the Dynamics of Ego-centered Measurements of the Internet Topology
Assia Hamzaoui (UPMC, France); Matthieu Latapy (LIP6 - CNRS and UPMC, France); Clémence Magnien (CNRS, France)
Detecting events such as major routing changes, in the dynamics of internet topology is an important but challenging task. We explore here a 'top-down' approach based on a notion of statistically meaningful events. It consists in identifying statistics which exhibit a homogeneous distribution with outliers, which correspond to events. We apply this approach to 'ego-centerd' measurements of the internet topology (views obtained from a single monitor) and show that it succeeds in detecting meaningful events. Finally, we give some hints for the interpretation of such events in terms of network events.
14:00 - 15:30S3: Models & Tools
- 14:00 K-Shell Decomposition for Dynamic Complex Networks
Daniele Miorandi (Create-Net, Italy); Francesco De Pellegrini (Create-Net, Italy)
K-shell graph decomposition methods have been recently proposed as a technique for understanding the most influential spreader in a complex network. Such techniques apply to static networks, whereby topology does not change over time. In this paper we address the extension of such a framework to dynamic networks, which can be characterized by a pattern of contacts among nodes in the network. We proposed two methods and we compare them by using synthetic contact traces.
- 14:30 Static community detection algorithms for evolving networks
Thomas Aynaud (LIP6, France); Jean-Loup Guillaume (Université Paris 6 Pierre et Marie Curie, France)
Complex networks can often be divided in dense sub-networks called communities. We study, using a partition edit distance, how three community detection algorithms transform their outputs if the input network is sligthly modified. The instabilities appear to be important and we propose a modification of one algorithm to stabilize it and to allow the tracking of the communities in a dynamic network. This modification has one parameter which is a tradeoff between stability and quality. The resulting algorithm appears to be very effective. We finnaly use it on a dynamic network of blogs.
Submission Instructions
Submissions must be no greater than 8 pages in
length. The submission will be handled via EDAS system. Only PDF files
are acceptable; please make sure that the paper prints
without problems (take care to embed all required fonts,
etc.).
Reviews will be single-blind: authors name and affiliation
should be included in the submission.
Submissions must strictly follow the formatting
guidelines at
http://lia.univ-avignon.fr/index.php?id=2052.
The proceedings will be published by IEEE : accepted
papers will be available via the IEEE Xplorer
website.
Authors of accepted papers are expected to present their
papers at the workshop and . Submissions must be original
work not under review at any other workshop, conference,
or journal.
Papers can be submitted through the submission site on EDAS:
http://www.edas.info/newPaper.php?c=8636&track=9154.
|
|
Workshop Chairs:
Technical Program
Committee:
- Jussara Almeida, Federal University of Minas Gerais, Brazil
- Amar Prakash Azad, INRIA, France
- Alain Barrat, Centre de Physique Theorique, France
- Fehmi Ben Abdesslem, University of St Andrews, UK
- Marcelo Dias de Amorim, UPMC Paris Universitas
- Daniel Figueiredo, UFRJ, Brazil
- Marco Fiore, INSA de Lyon, France
- Niloy Ganguly, Indian Institute of Technology Kharagpur, India
- Marta Gonzalez, CCNR, USA
- Jean-Loup Guillaume, Université Paris 6 Pierre et Marie Curie, France
- Pan Hui, Deutsche Telekom Laboratories, Germany
- Renaud Lambiotte, Imperial
College, UK
- Jeremie Leguay, Thales Communications, France
- Daniele Miorandi, Create-Net, Italy
- iJukka-Pekka Onnela, Harvard University, USA
- Camille Roth, CAMS (Cnrs/Ehess), France
- Thrasyvoulos Spyropoulos, ETHZ, Switzerland
- Eiko Yoneki, University of Cambridge, UK
|
|