Panagiotis Pantazopoulos

Panagiotis Pantazopoulos

Auto-generated profile, based on publicly available information

Panagiotis Pantazopoulos

Institute of Communication and Computer Systems, National Technical University of Athens, Athens, Greece

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 February 2023 in Computer Networks
Verified
Journal Article
Closed access
GDGeorgios Drainakis
Georgios Drainakis
PPPanagiotis Pantazopoulos
Panagiotis Pantazopoulos
KKKonstantinos Katsaros
Konstantinos Katsaros
VSVasileios (Vasilis) Sourlas
Vasileios (Vasilis) Sourlas
Angelos AmditisAngelos Amditis
Angelos Amditis
DKDimitra I. Kaklamani
Dimitra I. Kaklamani

30 July 2013 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
PPPanagiotis Pantazopoulos
Panagiotis Pantazopoulos
MKMerkouris Karaliopoulos
Merkouris Karaliopoulos
ISIoannis Stavrakakis
Ioannis Stavrakakis
The optimal placement of service facilities largely determines the capability of a data network to efficiently support its users' service demands. As centralized solutions over large-scale distributed environments are extremely expensive, inefficient or even infeasible, distributed approaches that rely on partial topology and demand information are the only credible approaches to the service placement problem, even at the expense of non-guaranteed optimality. In this paper, we propose a distributed service migration heuristic that iteratively solves instances of the 1-median problem pushing progressively the service to more cost-effective locations. Key to our algorithm is a traffic-aware centrality metric, called weighted conditional betweenness centrality (wCBC), that captures the ability of a node to act as service demand concentrator and is employed in both selecting the nodes and setting their weights for the 1-median problem instance. The assessment of our heuristic proceeds in two steps. First, assuming (ideal) knowledge of the invoked wCBC metric, we carry out a proof-of-concept study that demonstrates the effectiveness of the heuristic over synthetic and real-world topologies as well as its advantages against comparable local-search-like migration schemes. Next, we devise practical protocol implementations that approximate the heuristic using local measurements of transit traffic and preserve the excellent accuracy and fast convergence properties of the algorithm for different routing policies. Our solution applies to a broad range of networking scenarios, and is very relevant to the emerging trends for in-network storage and involvement of the end-user in the creation and distribution of lightweight (autonomic) service facilities.

1 February 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
ISIppokratis Sartzetakis
Ippokratis Sartzetakis
PSPolyzois of Communication and Computer Soumplis
Polyzois of Communication and Computer Soumplis
PPPanagiotis Pantazopoulos
Panagiotis Pantazopoulos
KKKonstantinos Katsaros
Konstantinos Katsaros
VSVasilis Sourlas
Vasilis Sourlas
EVEmmanouel Varvarigos
Emmanouel Varvarigos

1 March 2015
Verified
Conference Paper
Closed access
PPPanagiotis Pantazopoulos
Panagiotis Pantazopoulos
ISIoannis Stavrakakis
Ioannis Stavrakakis
Internet vulnerability studies typically consider highly central nodes as favorable targets of intelligent (malicious) attacks. Heuristics that use redundancy adding k extra links in the topology are a common class of countermeasures seeking to enhance Internet robustness. To identify the nodes to be linked most previous works propose very simple centrality criteria that lack a clear rationale and only occasionally address Intra-domain topologies. More importantly, the implementation cost induced by adding lengthy links between nodes of remote network locations is rarely taken into account. In this paper, we explore cost-effective link additions in the locality of the targets having the k extra links added only between their first neighbors. We introduce an innovative link utility metric that identifies which pair of a target's neighbors aggregates the most shortest paths coming from the rest of the nodes and therefore could enhance the network connectivity, if linked. This metric drives the proposed heuristic that solves the problem of assigning the link budget k to the neighbors of the targets. By employing a rich Intra-domain networks dataset we first conduct a proof-of-concept study to validate the effectiveness of the metric. Then we compare our approach with the so-far most effective heuristic that does not bound the length of the added links. Our results suggest that the proposed enhancement can closely approximate the connectivity levels the so-far winner yields, yet with up to eight times lower implementation cost.