Publications

2023

• Piron, Tom and Iannone, Luigi and Donnet, Benoit, Implementation and Evaluation of LISP Publish/Subscribe, International Conference on 6G Networking (6GNet) oct, 2023. conference Abstract
  The design of future 6G network will push even further the convergence of different types of mobile networks, integrating space, aerial and terrestrial access. Mobility, remains one of the most difficult aspects to tackle in this context. One approach under consideration is the use of an overlay solution able to cope with new mobility requirements. LISP (Locator/ID Separation Protocol) being one candidate overlay protocol. LISP separates the addressing space in two orthogonal spaces, one to identify end points, the other to locate them. End-to-end communication is guaranteed by a mapping system allowing to associate location with identities. Mapping resolution is done at communication setup, opening the question: how to guarantee that, in case of changes, the latest mapping is used? Originally, there was no mechanism to explicitly express the interest in updates of specific mappings. LISP Publish-Subscribe has been introduced in order to provide such a feature. This paper provides an implementation of LISP Publish-Subscribe in the NS-3 simulator and quantitatively analyze its benefits.

  @inproceedings{iannone2023lisp,
    title = {Implementation and Evaluation of LISP Publish/Subscribe},
    author = {Piron, Tom and Iannone, Luigi and Donnet, Benoit},
    booktitle = {International Conference on 6G Networking (6GNet)},
    year = {2023},
    month = oct,
    volume = {},
    number = {},
    pages = {}
  }
  

• Fressancourt, Antoine and Iannone, Luigi, Ariadne: a Privacy-Preserving Network Layer Protocol, 2023 7th Cyber Security in Networking Conference (CSNet) 2023. conference Abstract
  This paper presents Ariadne, a privacy-preserving network layer communication protocol using source routing to avoid relying on trusted third parties. In Ariadne, a source node willing to send anonymized network traffic to a destination uses a path consisting in nodes with which it has pre-shared symmetric keys through a setup phase. It uses temporary keys derived from those pre-shared keys to protect communication privacy using onion routing techniques. Ariadne enhances previous approaches by introducing two novelties. Firstly, the temporary keys used to process the packets on the path are referenced using mutually known encrypted patterns. This avoids the use of an explicit key reference that could be used to de-anonymize the communications. Secondly, the source route is encoded in a fixed size, sequentially encrypted vector of routing information elements, in which the elements’ positions in the vector are pseudo-randomly permuted.

  @inproceedings{fressancourt2023ariadne,
    title = {Ariadne: a Privacy-Preserving Network Layer Protocol},
    author = {Fressancourt, Antoine and Iannone, Luigi},
    booktitle = {2023 7th Cyber Security in Networking Conference (CSNet)},
    year = {2023},
    volume = {},
    number = {},
    pages = {}
  }
  

• Zhang, Jiachen and Magnouche, Youcef and Martin, Sebastien and Fressancourt, Antoine and Beck, J. Christopher, The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm, 2023 9th International Conference on Control, Decision and Information Technologies (CoDIT) 2023. DOI 10.1109/CoDIT58514.2023.10284108 conference Abstract
  Data routing in networks is required to be efficient and reliable. Fast detection and recovery from link or path failures play crucial roles in the reliability guarantee. In this work, we investigate a variant of the multi-commodity flow problem to address one formalization of reliability, where for each demand, a primary path transmits the demand without exceeding a jitter limit and an arc-disjoint secondary path signals the possible failure of the primary path. We first present a compact mixed-integer linear programming model and then we devise a Branch-and-Benders-Cut algorithm to solve this combinatorial optimization problem. On a diverse set of instances, we evaluate the algorithm’s performance and discuss several numerical results.

  @inproceedings{zhang2023multi-commodity,
    title = {The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm},
    author = {Zhang, Jiachen and Magnouche, Youcef and Martin, Sebastien and Fressancourt, Antoine and Beck, J. Christopher},
    booktitle = {2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)},
    year = {2023},
    volume = {},
    number = {},
    pages = {477-482},
    doi = {10.1109/CoDIT58514.2023.10284108}
  }
  

2022

• Li, Guangpeng and Lou, David and Iannone, Luigi, Topological addressing enabling energy efficient IoT communication, Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing 2022. conference Abstract
  This paper specifies a topological addressing scheme, called Native Short Address (NSA) that enables a more energy efficient IP packet transmission over links in the IoT domain, where it is effective and desirable not to carry full length addresses in the packet (especially large IPv6 addresses). NSA relies on an address assignment function that algorithmically calculates and assigns the address of IoT nodes, based on their roles and location in hierarchy. The small size of the assigned addresses helps lowering the power consumption. Moreover, the main feature of NSA is stateless forwarding, which reduces the computation complexity by eliminating routing calculation, thus making the overall system even more energy efficient. This paper focuses on a low power and lossy network, where the topology of the network is relatively static. The nodes’ location is fixed and the connection between nodes is rather stable. The paper illustrates the NSA architecture, address allocation function, forwarding mechanism, header format design, including lengthvariable fields, and IPv6 interconnection support.

  @inproceedings{li2022topological,
    title = {Topological addressing enabling energy efficient IoT communication},
    author = {Li, Guangpeng and Lou, David and Iannone, Luigi},
    booktitle = {Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing \& Addressing},
    pages = {12--17},
    year = {2022}
  }
  

2021

• Gabriel, Mattias and Iannone, Luigi and Donnet, Benoit, LISP Mapping System as DoS Amplification Vector, In IEEE Networking Letters, Vol. 3, No. 1, pp.36–39, 2021. journal Abstract
  There is a growing interest in solutions relying on the identifier/locator separation paradigm. It introduces several benefits in terms of scalability and flexibility. It relies on two addressing spaces, namely the identifiers, for endpoint identification, and the locators, for packet forwarding. An additional control plane is necessary to map one space to the other. In this letter, we explore how control messages can be an amplification vector for DoS attacks. We evaluate the possible amplification factor based on a real deployment, showing that the amplification factor exists. We also build a GNS-3 testbed to demonstrate further and analyze the attack.

  @article{gabriel2021lisp,
    title = {LISP Mapping System as DoS Amplification Vector},
    author = {Gabriel, Mattias and Iannone, Luigi and Donnet, Benoit},
    journal = {IEEE Networking Letters},
    volume = {3},
    number = {1},
    pages = {36--39},
    year = {2021},
    publisher = {IEEE}
  }