liu.seSearch for publications in DiVA
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
Secure Scalable VPLS: A Lagrangian Relaxation Approach to Tunnel Relaying Optimization
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-3570-3297
Ericsson AB, Stockholm, Sweden.ORCID iD: 0000-0001-8960-0544
Network Softwarization and Security Labs (NetsLab), 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.ORCID iD: 0000-0002-9829-9287
2025 (English)In: IEEE Transactions on Networking, E-ISSN 2998-4157Article in journal (Refereed) Epub ahead of print
Abstract [en]

Virtual Private LAN Service (VPLS) is commonly used for secure multi-point communication across geographically scattered industrial sites, simulating a unified LAN broadcast domain for Industrial IoT (IIoT)-type devices. This configuration demands a fully-connected overlay network with encrypted Host Identity Protocol (HIP)/IPsec tunnels exhibiting quadratic scalability to the number of tunnels and a significant increase in forwarding table entries. Herein, we introduce Tunnel Relay Nodes (TRNs) as selected routers that maintain full-mesh connectivity. This approach allows non-TRN routers, or Provider Equipment (PEs) acting as spoke PEs, to connect via a TRN. We explore the challenges of using TRNs in secure HIP-based VPLS (HIPLS) networks, including (i) placing reliable TRNs within provider networks and (ii) scheduling TRNs to minimize their activation/deactivation costs as well as the connection cost among PEs. We then demonstrate how (i) can be addressed in polynomial time using a modified general median problem approach. Additionally, we formulate (ii) as a Mixed Integer Linear Programming (MILP) scheduling problem and prove its NP-completeness. Furthermore, we introduce an algorithm based on Lagrangian relaxation to address the intractability in large-scale deployments. This algorithm offers fast, near-optimal solutions while simultaneously balancing solution quality and execution time. Our simulations on three real-world network topologies with real network demands show a 92% average reduction in forwarding table entries on PE. Compared to existing solutions, our method reduces the number of tunnels established by up to 95%, at the expense of a 1.39-fold increase in tunnel path length.

Place, publisher, year, edition, pages
IEEE, 2025.
Keywords [en]
Industrial Internet of Things; Hip; Scalability; Relays; Costs; Virtual private networks; Local area networks; Peer-to-peer computing; Computer crime; Routing protocols; IIoT; VPLS; HIPLS; network design; optimization
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-219328DOI: 10.1109/ton.2025.3617789ISI: 001610960000001Scopus ID: 2-s2.0-105020935510OAI: oai:DiVA.org:liu-219328DiVA, id: diva2:2012257
Funder
CUGS (National Graduate School in Computer Science)ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications, A.4 Project
Note

Funding Agencies|Graduate School in Computer Science (CUGS); Excellence Center at Linkoping-Lund in Information Technology (ELLIIT) A.4 Project

Available from: 2025-11-07 Created: 2025-11-07 Last updated: 2025-12-18

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Borhani, MohammadGurtov, Andrei

Search in DiVA

By author/editor
Borhani, MohammadAvgouleas, IoannisLiyanage, MadhusankaGurtov, Andrei
By organisation
Database and information techniquesFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 174 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