liu.seSearch for publications in DiVA
System disruptions
There are recurring service disruptions on some of the search portals due to high traffic. We are working to resolve the issue, you may temporarily encounter an error message.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
KDC Placement Problem in Secure VPLS Networks
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering. (AEGIS)ORCID iD: 0000-0002-3570-3297
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-8960-0544
School of Computer Science, University College Dublin, Dublin, Ireland.ORCID iD: 0000-0003-4786-030X
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering. (AEGIS)ORCID iD: 0000-0002-9829-9287
2023 (English)In: IEEE Transactions on Information Forensics and Security, ISSN 1556-6013, E-ISSN 1556-6021, Vol. 18, p. 1951-1962Article in journal (Refereed) Published
Abstract [en]

Virtual Private LAN Service (VPLS) is a VPN technology that connects remote client sites with provider networks in a transparent manner. Session key-based HIPLS (S-HIPLS) is a VPLS architecture based on the Host Identity Protocol (HIP) that provides a secure VPLS architecture using a Key Distribution Center (KDC) to implement security mechanisms such as authentication, encryption etc. It exhibits limited scalability though. Using multiple distributed KDCs would offer numerous advantages including reduced workload per KDC, distributed key storage, and improved scalability, while simultaneously eliminating the single point of failure of S-HIPLS. It would also come with the need for optimally placing KDCs in the provider network. In this work, we formulate the KDC placement (KDCP) problem for a secure VPLS network as an Integer Linear Programming (ILP) problem. The latter is NP-hard, thereby suggesting a high computational cost for obtaining exact solutions especially for large deployments. Therefore, we motivate the use of a primal-dual algorithm to efficiently produce near-optimal solutions. Extensive evaluations on large-scale network topologies, such as the random Internet graph, demonstrate our method’s time-efficiency as well as its improved scalability and usefulness compared to both HIPLS and S-HIPLS.

Place, publisher, year, edition, pages
IEEE, 2023. Vol. 18, p. 1951-1962
Keywords [en]
VPLS, VPN, HIP, security, industrial internet
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:liu:diva-192470DOI: 10.1109/tifs.2023.3254447ISI: 000960679600004Scopus ID: 2-s2.0-85149833183OAI: oai:DiVA.org:liu-192470DiVA, id: diva2:1744533
Funder
CUGS (National Graduate School in Computer Science)ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Note

Funding: Graduate School in Computer Science (CUGS); Excellence Center at Linkoping-Lund in Information Technology (ELLIIT)

Available from: 2023-03-20 Created: 2023-03-20 Last updated: 2026-09-07Bibliographically approved
In thesis
1. Scalable and Secure Virtual Private LAN Service: Design and Optimization
Open this publication in new window or tab >>Scalable and Secure Virtual Private LAN Service: Design and Optimization
2026 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The digitalization of industrial operations under Industry 4.0 and beyond has increased reliance on wide-area connectivity across distributed industrial environments. While improving efficiency, this connectivity expands the external attack surface. Internet-wide scanning and reconnaissance tools (e.g., Shodan and Nmap) can identify exposed industrial assets and reveal device information that facilitates vulnerability-driven targeting. Consequently, robust network architectures are required to reduce device exposure and discoverability while providing secure, scalable, and resilient communication.

This thesis addresses these challenges through architectural design and optimization for secure and scalable Virtual Private LAN Service (VPLS). It first analyzes industrial device scanners and the security risks associated with active scanning, motivating the adoption of Host Identity Protocol (HIP)-based VPLS (HIPLS) for secure industrial communication. However, traditional HIPLS suffers from scalability limitations as encrypted tunnels, forwarding table entries, and control-plane overhead grow rapidly with the number of participating sites.

To overcome these limitations, this thesis develops a sequence of architectural and optimization solutions for secure VPLS. First, it replaces the full-mesh design with relay-based communication and formulates the Relay Placement Problem (RPP) to determine cost-efficient relay configurations while maintaining connectivity among all participating sites. For this NP-hard problem, a polynomial-time approximation algorithm with a provable performance guarantee is developed. The relay architecture is subsequently extended through Tunnel Relay Nodes (TRNs) and dynamic tunnel scheduling, for which a Lagrangian-relaxation-based algorithm efficiently obtains high-quality feasible solutions under connectivity and capacity constraints. The thesis also addresses the scalability of cryptographic key management by formulating the Key Distribution Center Placement (KDCP) problem and proposing an approximation framework with a provable solution-quality guarantee for distributed KDC deployment. Finally, the underlying trust model of secure VPLS is reconsidered through a Zero Trust architecture based on a multiparty extension of the HIP Base Exchange (HIP-MBEX), reducing customer dependence on trusted provider infrastructure. Evaluations using realistic and real-world network topologies demonstrate considerable reductions in tunnel count, forwarding state, and control-plane signaling, while maintaining bounded path stretch and low latency overhead in the evaluated scenarios.

The proposed algorithmic frameworks for relay and KDCP provide theoretical guarantees on solution quality, ensuring a provably cost-effective VPLS deployment. These contributions offer a dual advantage: they enable service providers to minimize Capital and Operational Expenditures (CAPEX/OPEX) through near-optimal resource utilization, while simultaneously providing customers with a secure, scalable solution for multi-site connectivity. Consequently, this thesis establishes a practical and robust foundation for next-generation industrial networks.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2026. p. 77
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 2529
National Category
Communication Systems
Identifiers
urn:nbn:se:liu:diva-227320 (URN)10.3384/9789181185959 (DOI)9789181185942 (ISBN)9789181185959 (ISBN)
Public defence
2026-10-09, Ada Lovelace, B Building, Campus Valla, Linköping, 09:15 (English)
Opponent
Supervisors
Note

Funding agency: The Graduate School in Computer Science (CUGS)

Available from: 2026-09-07 Created: 2026-09-07 Last updated: 2026-09-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Borhani, MohammadAvgouleas, IoannisGurtov, Andrei

Search in DiVA

By author/editor
Borhani, MohammadAvgouleas, IoannisLiyanage, MadhusankaGurtov, Andrei
By organisation
Database and information techniquesFaculty of Science & Engineering
In the same journal
IEEE Transactions on Information Forensics and Security
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 249 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf