Département systèmes réseaux, cybersécurité et droit du numérique (SRCD)

Le département « Systèmes réseaux, cybersécurité et droit du numérique » (SRCD) est situé sur le campus de Rennes d'IMT Atlantique. À ce jour, il est composé de 25 enseignants-chercheurs permanents, plus de 20 post-doctorants et ingénieurs contractuels, et près de 40 doctorants. Ses domaines d'activité recouvrent tous les aspects de l'enseignement et de la recherche en :

  • systèmes réseaux au sens large, couvrant les technologies pour les réseaux fixes et mobiles jusqu'à l'internet des objets, en passant par l'étude et la sécurisation des systèmes complexes que ceux-ci permettent de

Recherche
Formation
Innovation et Transfert

Les prochains événements du département

Il n'y a pas d'événement en cours ou à venir pour le département.
Les dernières publications du département
Communication dans un congrès
Cordova Juana, Espinoza Gonzalo, Nuaymi Loutfi
Simple capacity estimations in the complex 5G/New Radio system
PIMRC 2018, Sep 2019, Bologne, Italy
Bibtext :
@inproceedings{cordova:hal-01924302,
TITLE = {{Simple capacity estimations in the complex 5G/New Radio system}},
AUTHOR = {Cordova, Juana and Espinoza, Gonzalo and Nuaymi, Loutfi},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-01924302},
BOOKTITLE = {{PIMRC 2018}},
ADDRESS = {Bologne, Italy},
YEAR = {2019},
MONTH = Sep,
HAL_ID = {hal-01924302},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Simple capacity estimations in the complex 5G/New Radio system
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Advanced technologies for operated networks (ADOPNET)
%A Cordova, Juana
%A Espinoza, Gonzalo
%A Nuaymi, Loutfi
%< avec comité de lecture
%B PIMRC 2018
%C Bologne, Italy
%8 2019-09
%D 2019
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%G English
%L hal-01924302
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-01924302
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-UBS
%~ IRISA_SET
%~ UNIV-RENNES1
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMTA_SRCD
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ IRISA-ADOPNET-IMTA
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
%~ INRIA-AUT
Communication dans un congrès
Er Ngurah Indra, Singh Kamal Deep, Bonnin Jean-Marie
DC4LED: A Hierarchical VDTN Routing for Data Collection in Smart Cities
CCNC 2019 - 16th IEEE Annual Consumer Communications and Networking Conference, Jan 2019, Las Vegas, United States. 〈http://ccnc2019.ieee-ccnc.org〉
Bibtext :
@inproceedings{er:hal-01894719,
TITLE = {{DC4LED: A Hierarchical VDTN Routing for Data Collection in Smart Cities}},
AUTHOR = {Er, Ngurah Indra and Singh, Kamal Deep and BONNIN, Jean-Marie},
URL = {https://hal.archives-ouvertes.fr/hal-01894719},
BOOKTITLE = {{CCNC 2019 - 16th IEEE Annual Consumer Communications and Networking Conference}},
ADDRESS = {Las Vegas, United States},
YEAR = {2019},
MONTH = Jan,
KEYWORDS = {Smart Cities ; Data Collection ; VDTN Routing ; DC4LED ; Hierarchical Routing},
PDF = {https://hal.archives-ouvertes.fr/hal-01894719/file/DC4LED_A_Hierarchical.pdf},
HAL_ID = {hal-01894719},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T DC4LED: A Hierarchical VDTN Routing for Data Collection in Smart Cities
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Enabling Affordable Smarter Environment (EASE)
%+ Udayana University [Bali]
%+ Université Jean Monnet [Saint-Étienne] (UJM)
%+ Laboratoire Hubert Curien [Saint Etienne] (LHC)
%A Er, Ngurah Indra
%A Singh, Kamal Deep
%A BONNIN, Jean-Marie
%< avec comité de lecture
%B CCNC 2019 - 16th IEEE Annual Consumer Communications and Networking Conference
%C Las Vegas, United States
%8 2019-01-12
%D 2019
%K Smart Cities
%K Data Collection
%K VDTN Routing
%K DC4LED
%K Hierarchical Routing
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Modeling and SimulationConference papers
%X In smart cities, the mobility of vehicles can be used to collect data produced by connected objects and to deliver them to several applications which are delay tolerant. The Vehicular Delay Tolerant Networks (VDTN) can be utilized for such services. This paper introduces DC4LED (Data Collection for Low Energy Devices): a hierarchical VDTN routing which takes advantage of the specific mobility patterns of the various type of vehicles. It provides a low-cost delivery service for applications that need to gather data produced from the field. The idea is to propose a simple routing scheme where cars, taxis, and buses route data hierarchically in a store-carry-forward mechanism to any of the several available Internet Point-of-Presences in the city. This paper aims to explore the possibility of implementing a very simple mechanism for very simple services, as opposed to utilizing complex VDTN mechanisms proposed in the literature. Our simulations compare the performance of DC4LED routing with two legacy VDTN routing schemes which represent the extreme ends of VDTN routing spectrum: First-contact and Epidemic routing. It show that DC4LED has much lower network overhead in comparison with the two legacy routing schemes, which is advantageous for its implementation scalability. The DC4LED also maintains comparable data delivery probability and latency to Epidemic routing.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01894719/document
%2 https://hal.archives-ouvertes.fr/hal-01894719/file/DC4LED_A_Hierarchical.pdf
%L hal-01894719
%U https://hal.archives-ouvertes.fr/hal-01894719
%~ UNIV-RENNES
%~ UR1-MATH-STIC
%~ UNIV-RENNES1
%~ CENTRALESUPELEC
%~ IRISA_SET
%~ INRIA-RENNES
%~ UNIV-UBS
%~ TDS-MACS
%~ IOGS
%~ PARISTECH
%~ IOGS-SACLAY
%~ IMTA_SRCD
%~ INRIA_TEST
%~ UNIV-ST-ETIENNE
%~ IRISA_IMTA
%~ TEST-UR-CSS
%~ UR1-UFR-ISTIC
%~ UR1-HAL
%~ CNRS
%~ IRISA-EASE-IMTA
%~ INRIA-RENGRE
%~ IMT-ATLANTIQUE
%~ INRIA
%~ IRISA
%~ UNIV-PARIS-SACLAY
Communication dans un congrès
Kabil Alexandre, Duval Thierry, Cuppens Nora, Le Comte Gérard, Halgand Yoran, Ponchel Christophe
From Cyber Security Activities to Collaborative Virtual Environments Practices through the 3D CyberCOP Platform
International Conference on Information Systems Security, Dec 2018, Bengaluru, India. pp.272-287, 2018, proceedings of ICISS 2018, 14th International Conference on Information Systems Security
Bibtext :
@inproceedings{kabil:hal-01892161,
TITLE = {{From Cyber Security Activities to Collaborative Virtual Environments Practices through the 3D CyberCOP Platform}},
AUTHOR = {Kabil, Alexandre and Duval, Thierry and Cuppens, Nora and Le Comte, G{\'e}rard and Halgand, Yoran and Ponchel, Christophe},
URL = {https://hal.archives-ouvertes.fr/hal-01892161},
BOOKTITLE = {{International Conference on Information Systems Security}},
ADDRESS = {Bengaluru, India},
SERIES = {proceedings of ICISS 2018, 14th International Conference on Information Systems Security},
PAGES = {272-287},
YEAR = {2018},
MONTH = Dec,
PDF = {https://hal.archives-ouvertes.fr/hal-01892161/file/main.pdf},
HAL_ID = {hal-01892161},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T From Cyber Security Activities to Collaborative Virtual Environments Practices through the 3D CyberCOP Platform
%+ Lab-STICC_IMTA_CID_IHSEV
%+ Département Logique des Usages, Sciences sociales et Sciences de l'Information (LUSSI)
%+ Lab-STICC_IMTA_CID_IRIS
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Société Générale
%+ EDF (EDF)
%+ Cassidian
%A Kabil, Alexandre
%A Duval, Thierry
%A Cuppens, Nora
%A Le Comte, Gérard
%A Halgand, Yoran
%A Ponchel, Christophe
%< avec comité de lecture
%B International Conference on Information Systems Security
%C Bengaluru, India
%3 proceedings of ICISS 2018, 14th International Conference on Information Systems Security
%P 272-287
%8 2018-12-17
%D 2018
%Z Computer Science [cs]/Graphics [cs.GR]
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]
%Z Computer Science [cs]/Cryptography and Security [cs.CR]Conference papers
%X Although collaborative practices between cyber organizations are well documented, managing activities within these organizations is still challenging as cyber operators tasks are very demanding and usually done individually. As human factors studies in cyber environments are still difficult to perform, tools and collaborative practices are evolving slowly and training is always required to increase teamwork efficiency. Contrary to other research fields, cyber security is not harnessing yet the capabilities of Collaborative Virtual Environments (CVE) which can be used both for immersive and interactive data visualization and serious gaming for training. In order to tackle cyber security teamwork issues, we propose a 3D CVE called the 3D Cyber Common Operational Picture, which aims at taking advantage of CVE practices to enhance cyber collaborative activities. Based on four Security Operations Centers (SOCs) visits we have made in different organizations, we have designed a cyber collaborative activity model which has been used as a reference to design our 3D CyberCOP platform features, such as asymetrical collaboration, mutual awareness and roles specialization. Our approach can be adapted to several use cases, and we are currently developing a cyber incident analysis scenario based on an event-driven architecture, as a proof of concept.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01892161/document
%2 https://hal.archives-ouvertes.fr/hal-01892161/file/main.pdf
%L hal-01892161
%U https://hal.archives-ouvertes.fr/hal-01892161
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA_CID_IHSEV
%~ IMT-ATLANTIQUE
%~ IMTA_SRCD
%~ LAB-STICC_IMTA_CID_IRIS
%~ EDF
%~ IMTA_LUSSI
%~ LAB-STICC_IMTA
Communication dans un congrès
Chouayakh Ayman, Bechler Aurelien, Amigo Isabel, Nuaymi Loutfi, Maillé Patrick
Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs
IFIP PERFORMANCE, Dec 2018, Toulouse, France. 2018, 〈https://performance2018.sciencesconf.org/〉
Bibtext :
@inproceedings{chouayakh:hal-01883697,
TITLE = {{Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs}},
AUTHOR = {Chouayakh, Ayman and Bechler, Aurelien and Amigo, Isabel and Nuaymi, Loutfi and Maill{\'e}, Patrick},
URL = {https://hal.archives-ouvertes.fr/hal-01883697},
BOOKTITLE = {{IFIP PERFORMANCE}},
ADDRESS = {Toulouse, France},
YEAR = {2018},
MONTH = Dec,
PDF = {https://hal.archives-ouvertes.fr/hal-01883697/file/auction-mechanisms-licensed%2821%29.pdf},
HAL_ID = {hal-01883697},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Orange Labs [Issy les Moulineaux]
%+ Département Informatique (INFO)
%+ Advanced technologies for operated networks (ADOPNET)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%A Chouayakh, Ayman
%A Bechler, Aurelien
%A Amigo, Isabel
%A Nuaymi, Loutfi
%A Maillé, Patrick
%< avec comité de lecture
%B IFIP PERFORMANCE
%C Toulouse, France
%8 2018-12-05
%D 2018
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Licensed shared access (LSA) is a new approach that allows Mobile Network Operators to use a portion of the spectrum initially licensed to another incumbent user, by obtaining a license from the regulator via an auction mechanism. In this context, diierent truthful auction mechanisms have been proposed, and diier in terms of allocation (who gets the spectrum) but also on revenue. Since those mechanisms could generate an extremely low revenue, we extend them by introducing a reserve price per bidder which represents the minimum amount that each winning bidder should pay. Since this may be at the expense of the allocation fairness, for each mechanism we nd by simulation the reserve price that optimizes a trade-oo between expected fairness and expected revenue. Also, for each mechanism, we analytically express the expected revenue when valuations of operators for the spectrum are independent and identically distributed from a uniform distribution.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01883697/document
%2 https://hal.archives-ouvertes.fr/hal-01883697/file/auction-mechanisms-licensed%2821%29.pdf
%L hal-01883697
%U https://hal.archives-ouvertes.fr/hal-01883697
%~ CNRS
%~ UNIV-UBS
%~ IRISA_SET
%~ UNIV-RENNES1
%~ IMTA_SRCD
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
%~ IMTA_INFO
%~ INRIA-RENNES
%~ INRIA_TEST
%~ TEST-IRISA-TB
%~ INRIA-RENGRE
%~ IRISA-ADOPNET-IMTA
%~ IRISA-DIONYSOS-IMTA
Communication dans un congrès
Chouayakh Ayman, Bechler Aurelien, Amigo Isabel, Nuaymi Loutfi, Maillé Patrick
Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs
IFIP WG PERFORMANCE 2018 - 36th International Symposium on Computer Performance, Modeling, Measurements and Evaluation 2018, Dec 2018, Toulouse, France. Proceedings 36th International Symposium on Computer Performance, Modeling, Measurements and Evaluation 2018, 2018
Bibtext :
@inproceedings{chouayakh:hal-01923465,
TITLE = {{Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs}},
AUTHOR = {Chouayakh, Ayman and Bechler, Aurelien and Amigo, Isabel and Nuaymi, Loutfi and Maill{\'e}, Patrick},
URL = {https://hal.archives-ouvertes.fr/hal-01923465},
BOOKTITLE = {{IFIP WG PERFORMANCE 2018 - 36th International Symposium on Computer Performance, Modeling, Measurements and Evaluation 2018}},
ADDRESS = {Toulouse, France},
HAL_LOCAL_REFERENCE = {19173},
YEAR = {2018},
MONTH = Dec,
HAL_ID = {hal-01923465},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Orange Labs [Issy les Moulineaux]
%+ Advanced technologies for operated networks (ADOPNET)
%+ Département Informatique (INFO)
%+ Objets communicants pour l'Internet du futur (OCIF)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%A Chouayakh, Ayman
%A Bechler, Aurelien
%A Amigo, Isabel
%A Nuaymi, Loutfi
%A Maillé, Patrick
%< avec comité de lecture
%Z 19173
%( Proceedings 36th International Symposium on Computer Performance, Modeling, Measurements and Evaluation 2018
%B IFIP WG PERFORMANCE 2018 - 36th International Symposium on Computer Performance, Modeling, Measurements and Evaluation 2018
%C Toulouse, France
%8 2018-12-05
%D 2018
%Z Computer Science [cs]/Computer Science and Game Theory [cs.GT]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]Conference papers
%X Licensed shared access (LSA) is a new approach that allows Mobile Network Operators to use a portion of the spectrum initially licensed to another incumbent user, by obtaining a license from the regulator via an auction mechanism. In this context, di‚erent truthful auction mechanisms have been proposed, and di‚er in terms of allocation (who gets the spectrum) but also on revenue. Since those mechanisms could generate an extremely low revenue, we extend them by introducing a reserve price per bidder which represents the minimum amount that each winning bidder should pay. Since this may be at the expense of the allocation fairness, for each mechanism we €nd by simulation the reserve price that optimizes a trade-o‚ between expected fairness and expected revenue. Also, for each mechanism, we analytically express the expected revenue when valuations of operators for the spectrum are independent and identically distributed from a uniform distribution.
%G English
%L hal-01923465
%U https://hal.archives-ouvertes.fr/hal-01923465
%~ CNRS
%~ UNIV-UBS
%~ IRISA_SET
%~ UNIV-RENNES1
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ IMTA_SRCD
%~ TEST-UR-CSS
%~ IRISA-OCIF-IMTA
%~ UNIV-RENNES
%~ IRISA-ADOPNET-IMTA
%~ IMTA_INFO
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
%~ INRIA-RENNES
%~ INRIA_TEST
%~ INRIA-RENGRE
%~ IRISA-DIONYSOS-IMTA
Article dans une revue
Kotto-Kombi Roland, Lumineau Nicolas, Lamarre Philippe, Rivetti Nicoló, Busnel Yann
DABS-Storm: A data-aware approach for elastic stream processing
Transactions on Large-Scale Data- and Knowledge-Centered Systems, Springer Berlin / Heidelberg, In press
Bibtext :
@article{kottokombi:hal-01951682,
TITLE = {{DABS-Storm: A data-aware approach for elastic stream processing}},
AUTHOR = {Kotto-Kombi, Roland and Lumineau, Nicolas and Lamarre, Philippe and Rivetti, Nicol{\'o} and Busnel, Yann},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-01951682},
JOURNAL = {{Transactions on Large-Scale Data- and Knowledge-Centered Systems}},
PUBLISHER = {{Springer Berlin / Heidelberg}},
YEAR = {2018},
MONTH = Dec,
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-01951682/file/AS-OSG.pdf},
HAL_ID = {hal-01951682},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T DABS-Storm: A data-aware approach for elastic stream processing
%+ Base de Données (BD)
%+ Middleware Laboratory (MIDLAB)
%+ Laboratoire d'Informatique de Nantes Atlantique (LINA)
%+ Technion - Israel Institute of Technology [Haifa]
%+ Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA)
%+ IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%A Kotto-Kombi, Roland
%A Lumineau, Nicolas
%A Lamarre, Philippe
%A Rivetti, Nicoló
%A Busnel, Yann
%< avec comité de lecture
%@ 1869-1994
%J Transactions on Large-Scale Data- and Knowledge-Centered Systems
%I Springer Berlin / Heidelberg
%8 2018-12
%D 2018
%Z Computer Science [cs]/Data Structures and Algorithms [cs.DS]
%Z Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
%Z Computer Science [cs]/Information Theory [cs.IT]Journal articles
%X In the last decade, stream processing has become a very active research domain motivated by the growing number of stream-based applications. These applications make use of continuous queries, which are processed by a stream processing engine (SPE) to generate timely results given the ephemeral input data. Variations of input data streams, in terms of both volume and distribution of values, have a large impact on computational resource requirements. Dynamic and Automatic Balanced Scaling for Storm (DABS-Storm) is an original solution for handling dynamic adaptation of continuous queries processing according to evolution of input stream properties, while controlling the system stability. Both fluctuations in data volume and distribution of values within data streams are handled by DABS-Storm to adjust the resources usage that best meets processing needs. To achieve this goal, the DABS-Storm holistic approach combines a proactive auto-parallelization algorithm with a latency-aware load balancing strategy.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-01951682/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-01951682/file/AS-OSG.pdf
%L hal-01951682
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-01951682
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-LYON2
%~ UNIV-UBS
%~ EC-LYON
%~ INRIA-RENNES
%~ LINA
%~ IRISA_SET
%~ UNIV-RENNES1
%~ INRIA_TEST
%~ UR1-HAL
%~ CENTRALESUPELEC
%~ UNIV-LYON1
%~ IRISA
%~ INSA-LYON
%~ INRIA
%~ IMTA_SRCD
%~ TEST-UR-CSS
%~ UNIV-NANTES
%~ LIRIS
%~ UNIV-RENNES
%~ INRIA-RENGRE
%~ IRISA-DIONYSOS-IMTA
%~ LS2N-IMTA
%~ LYON2
%~ INSA-GROUPE
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
Communication dans un congrès
Maillé Patrick, Tuffin Bruno
Analysis of Sponsored Data in the Case of Competing Wireless Service Providers
NETGCOOP 2018 - 9th International Conference on Network Games, Control and Optimization, Nov 2018, New York City, United States. pp.1-16, 2018
Bibtext :
@inproceedings{maille:hal-01670139,
TITLE = {{Analysis of Sponsored Data in the Case of Competing Wireless Service Providers}},
AUTHOR = {Maill{\'e}, Patrick and Tuffin, Bruno},
URL = {https://hal.inria.fr/hal-01670139},
BOOKTITLE = {{NETGCOOP 2018 - 9th International Conference on Network Games, Control and Optimization}},
ADDRESS = {New York City, United States},
PAGES = {1-16},
YEAR = {2018},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-01670139/file/Sponsored-data1col.pdf},
HAL_ID = {hal-01670139},
HAL_VERSION = {v2},
}
Endnote :
%0 Conference Proceedings
%T Analysis of Sponsored Data in the Case of Competing Wireless Service Providers
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%A Maillé, Patrick
%A Tuffin, Bruno
%< avec comité de lecture
%B NETGCOOP 2018 - 9th International Conference on Network Games, Control and Optimization
%C New York City, United States
%P 1-16
%8 2018-11-14
%D 2018
%Z Computer Science [cs]/Operations Research [cs.RO]Conference papers
%X With wireless sponsored data, a third party, content or service provider, can pay for some of your data traffic so that it is not counted in your plan's monthly cap. This type of behavior is currently under scrutiny, with telecommunication regulators wondering if it could be applied to prevent competitors from entering the market, and what the impact on all telecommunication actors can be. To answer those questions, we design and analyze in this paper a model where a Content Provider (CP) can choose the proportion of data to sponsor and a level of advertisement to get a return on investment, and several Internet Service Providers (ISPs) in competition. We distinguish three scenarios: no sponsoring, the same sponsoring to all users, and a different sponsoring depending on the ISP you have subscribed to. This last possibility may particularly be considered an infringement of the network neutrality principle. We see that sponsoring can be beneficial to users and ISPs depending on the chosen advertisement level. We also discuss the impact of zero-rating where an ISP offers free data to a CP to attract more customers, and vertical integration where a CP and an ISP are the same company.
%G English
%2 https://hal.inria.fr/hal-01670139v2/document
%2 https://hal.inria.fr/hal-01670139/file/Sponsored-data1col.pdf
%L hal-01670139
%U https://hal.inria.fr/hal-01670139
%~ CNRS
%~ UNIV-UBS
%~ INRIA-RENNES
%~ IRISA_SET
%~ UNIV-RENNES1
%~ IMTA_SRCD
%~ INRIA_TEST
%~ UR1-HAL
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ INRIA-RENGRE
%~ IRISA-DIONYSOS-IMTA
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
Communication dans un congrès
Chouayakh Ayman, Bechler Aurelien, Amigo Isabel, Nuaymi Loutfi, Maillé Patrick
A truthful auction mechanism for dynamic allocation of LSA spectrum blocks for 5G
NetGCoop 2018 - 9th International Conference on NETwork Games, COntrol and OPtimisation, Nov 2018, New York, United States. Proceedings NetGCoop'18, 2018
Bibtext :
@inproceedings{chouayakh:hal-01923463,
TITLE = {{A truthful auction mechanism for dynamic allocation of LSA spectrum blocks for 5G}},
AUTHOR = {Chouayakh, Ayman and Bechler, Aurelien and Amigo, Isabel and Nuaymi, Loutfi and Maill{\'e}, Patrick},
URL = {https://hal.archives-ouvertes.fr/hal-01923463},
BOOKTITLE = {{NetGCoop 2018 - 9th International Conference on NETwork Games, COntrol and OPtimisation}},
ADDRESS = {New York, United States},
HAL_LOCAL_REFERENCE = {19218},
YEAR = {2018},
MONTH = Nov,
HAL_ID = {hal-01923463},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T A truthful auction mechanism for dynamic allocation of LSA spectrum blocks for 5G
%+ Orange Labs [Issy les Moulineaux]
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Advanced technologies for operated networks (ADOPNET)
%+ Département Informatique (INFO)
%+ Objets communicants pour l'Internet du futur (OCIF)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%A Chouayakh, Ayman
%A Bechler, Aurelien
%A Amigo, Isabel
%A Nuaymi, Loutfi
%A Maillé, Patrick
%< avec comité de lecture
%Z 19218
%( Proceedings NetGCoop'18
%B NetGCoop 2018 - 9th International Conference on NETwork Games, COntrol and OPtimisation
%C New York, United States
%8 2018-11-14
%D 2018
%Z Computer Science [cs]/Computer Science and Game Theory [cs.GT]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]Conference papers
%X Licensed shared access is a new frequency sharing concept that allows Mobile Network Operators (MNOs) to use some of the spectrum initially allocated to other incumbents, after obtaining a temporary license from the regulator. The allocation is made among groups such that two base stations in the same group can use the same spectrum simultaneously. In this context, different auction schemes were proposed, however they consider the scenario in which the regulator has one and only one block of LSA frequency to allocate. In this paper, we remove this hypothesis: we suppose that the regulator has K identical blocks of spectrum to allocate, and we propose a truthful auction mechanism based on the Vickrey-Clarke- Groves mechanism (VCG).We evaluate the efficiency of our mechanism in terms of social welfare, which depends on the allocation rule of the mechanism. Simulations show that the efficiency of the proposed mechanism is at least 60 % of that of VCG, which is known to be optimal.
%G English
%L hal-01923463
%U https://hal.archives-ouvertes.fr/hal-01923463
%~ CNRS
%~ UNIV-UBS
%~ IRISA_SET
%~ UNIV-RENNES1
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ IMTA_SRCD
%~ TEST-UR-CSS
%~ IRISA-OCIF-IMTA
%~ UNIV-RENNES
%~ IRISA-ADOPNET-IMTA
%~ IMTA_INFO
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
%~ INRIA-RENNES
%~ INRIA_TEST
%~ INRIA-RENGRE
%~ IRISA-DIONYSOS-IMTA
Communication dans un congrès
Anceaume Emmanuelle, Guellier Antoine, Ludinard Romaric, Sericola Bruno
Sycomore : a Permissionless Distributed Ledger that self-adapts to Transactions Demand
NCA 2018 - 17th IEEE International Symposium on Network Computing and Applications, Nov 2018, Boston, United States. pp.1-8
Bibtext :
@inproceedings{anceaume:hal-01888265,
TITLE = {{Sycomore : a Permissionless Distributed Ledger that self-adapts to Transactions Demand}},
AUTHOR = {Anceaume, Emmanuelle and Guellier, Antoine and Ludinard, Romaric and Sericola, Bruno},
URL = {https://hal.archives-ouvertes.fr/hal-01888265},
BOOKTITLE = {{NCA 2018 - 17th IEEE International Symposium on Network Computing and Applications}},
ADDRESS = {Boston, United States},
ORGANIZATION = {{IEEE}},
PAGES = {1-8},
YEAR = {2018},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01888265/file/sycomore.pdf},
HAL_ID = {hal-01888265},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Sycomore : a Permissionless Distributed Ledger that self-adapts to Transactions Demand
%+ Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE)
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Advanced technologies for operated networks (ADOPNET)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%A Anceaume, Emmanuelle
%A Guellier, Antoine
%A Ludinard, Romaric
%A Sericola, Bruno
%< avec comité de lecture
%B NCA 2018 - 17th IEEE International Symposium on Network Computing and Applications
%C Boston, United States
%P 1-8
%8 2018-11-01
%D 2018
%Z Computer Science [cs]
%Z Computer Science [cs]/Data Structures and Algorithms [cs.DS]
%Z Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]Conference papers
%X We propose a new way to organise both transactions and blocks in a distributed ledger to address the performance issues of permissionless ledgers. In contrast to most of the existing solutions in which the ledger is a chain of blocks extracted from a tree or a graph of chains, we present a distributed ledger whose structure is a balanced directed acyclic graph of blocks. We call this specific graph a SYC-DAG. We show that a SYC-DAG allows us to keep all the remarkable properties of the Bitcoin blockchain in terms of security, immutability, and transparency, while enjoying higher throughput and self-adaptivity to transactions demand. To the best of our knowledge, such a design has never been proposed so far.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01888265/document
%2 https://hal.archives-ouvertes.fr/hal-01888265/file/sycomore.pdf
%L hal-01888265
%U https://hal.archives-ouvertes.fr/hal-01888265
%~ CNRS
%~ UNIV-UBS
%~ INRIA-RENNES
%~ IRISA_SET
%~ UNIV-RENNES1
%~ INRIA_TEST
%~ UR1-HAL
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ SUP_CIDRE
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ INRIA-RENGRE
%~ UR1-MATH-STIC
%~ CENTRALESUPELEC-SACLAY-VP
%~ UR1-UFR-ISTIC
%~ CENTRALESUPELEC-SACLAY
%~ UNIV-PARIS-SACLAY
%~ IMTA_SRCD
%~ IMT-ATLANTIQUE
%~ IRISA-ADOPNET-IMTA
%~ IRISA-DIONYSOS-IMTA
%~ IRISA_IMTA
Communication dans un congrès
Anceaume Emmanuelle, Busnel Yann, Cazacu Vasile
On the Fly Detection of the Top-k Items in the Distributed Sliding Window Model
NCA 2018 - 17th IEEE International Symposium on Network Computing and Applications, Nov 2018, Boston, United States. IEEE, pp.1-8
Bibtext :
@inproceedings{anceaume:hal-01888298,
TITLE = {{On the Fly Detection of the Top-k Items in the Distributed Sliding Window Model}},
AUTHOR = {Anceaume, Emmanuelle and Busnel, Yann and Cazacu, Vasile},
URL = {https://hal.archives-ouvertes.fr/hal-01888298},
BOOKTITLE = {{NCA 2018 - 17th IEEE International Symposium on Network Computing and Applications}},
ADDRESS = {Boston, United States},
ORGANIZATION = {{IEEE}},
PUBLISHER = {{IEEE}},
PAGES = {1-8},
YEAR = {2018},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01888298/file/NCA_2018.pdf},
HAL_ID = {hal-01888298},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T On the Fly Detection of the Top-k Items in the Distributed Sliding Window Model
%+ Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE)
%+ IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%A Anceaume, Emmanuelle
%A Busnel, Yann
%A Cazacu, Vasile
%< avec comité de lecture
%B NCA 2018 - 17th IEEE International Symposium on Network Computing and Applications
%C Boston, United States
%I IEEE
%P 1-8
%8 2018-11-01
%D 2018
%Z Computer Science [cs]
%Z Computer Science [cs]/Data Structures and Algorithms [cs.DS]
%Z Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]Conference papers
%X This paper presents a new algorithm that detects on the fly the k most frequent items in the sliding window model. This algorithm is distributed among the nodes of the system. It is inspired by a recent and innovative approach, which consists in associating a stochastic value correlated with the item's frequency instead of trying to estimate its number of occurrences. This stochastic value corresponds to the number of consecutive heads in coin flipping until the first tail occurs. The original approach was to retain just the maximum of consecutive heads obtained by an item, since an item that often occurs will have a higher probability of having a high value. While effective for very skewed data distributions, the correlation is not tight enough to robustly distinguish items with comparable frequencies. To address this important issue, we propose to combine the stochastic approach together with a deterministic counting of items. Specifically, in place of keeping the maximum number of consecutive heads obtained by an item, we count the number of times the coin flipping process of an item has exceeded a given threshold. This threshold is defined by combining theoretical results in leader election and coupon collector problems. Results on simulated data show how impressive is the detection of the top-k items in a large range of distributions.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01888298/document
%2 https://hal.archives-ouvertes.fr/hal-01888298/file/NCA_2018.pdf
%L hal-01888298
%U https://hal.archives-ouvertes.fr/hal-01888298
%~ CNRS
%~ UNIV-UBS
%~ INRIA-RENNES
%~ IRISA_SET
%~ UNIV-RENNES1
%~ INRIA_TEST
%~ UR1-HAL
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ SUP_CIDRE
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ INRIA-RENGRE
%~ UR1-MATH-STIC
%~ CENTRALESUPELEC-SACLAY-VP
%~ UR1-UFR-ISTIC
%~ CENTRALESUPELEC-SACLAY
%~ UNIV-PARIS-SACLAY
%~ IMTA_SRCD
%~ IMT-ATLANTIQUE
%~ IRISA-DIONYSOS-IMTA
%~ IRISA_IMTA
Voir toutes les publications du département
Contacts
Responsable de département : Yann BUSNEL
Tél : +33 2 99 12 70 50
Assistante de département : Sandrine FROUIN
Tél : +33 2 99 12 70 54
Voir tous les membres du département
Infos pratiques :