29 citations · 55 across the 13 of their papers we have counts for
14 papers
Anomaly Detection Within Mission-Critical Call Processing
Sean Doris, Iosif Salem, Stefan Schmid
With increasingly larger and more complex telecommunication networks, there is a need for improved monitoring and reliability. Requirements increase further when working with missi…
Toward Self-Adjusting k-ary Search Tree Networks
Evgenii Feder, Anton Paramonov, Pavel Mavrin +3
Datacenter networks are becoming increasingly flexible with the incorporation of new networking technologies, such as optical circuit switches. These technologies allow for program…
XR-RF Imaging Enabled by Software-Defined Metasurfaces and Machine Learning: Foundational Vision, Technologies and Challenges
C. Liaskos, A. Tsioliaridou, K. Georgopoulos +18
We present a new approach to Extended Reality (XR), denoted as iCOPYWAVES, which seeks to offer naturally low-latency operation and cost-effectiveness, overcoming the critical scal…
Self-Adjusting Linear Networks with Ladder Demand Graph
Anton Paramonov, Iosif Salem, Stefan Schmid +1
Self-adjusting networks (SANs) have the ability to adapt to communication demand by dynamically adjusting the workload (or demand) embedding, i.e., the mapping of communication req…
Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation
Samarth Tiwari, Michelle Yeo, Zeta Avarikioti +3
Payment channel networks (PCNs) are one of the most prominent solutions to the limited transaction throughput of blockchains. Nevertheless, PCNs suffer themselves from a throughput…
Deterministic Self-Adjusting Tree Networks Using Rotor Walks
Chen Avin, Marcin Bienkowski, Iosif Salem +3
We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications…
HIDE & SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks
Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem +3
Payment channels effectively move the transaction load off-chain thereby successfully addressing the inherent scalability problem most cryptocurrencies face. A major drawback of pa…
LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks
Krzysztof Pietrzak, Iosif Salem, Stefan Schmid +1
Payment channel networks are a promising approach to improve the scalability of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion, along multi-hop rout…
Optimizing Virtual Payment Channel Establishment in the Face of On-Path Adversaries
Lukas Aumayr, Esra Ceylan, Yannik Kopyciok +4
Payment channel networks (PCNs) are among the most promising solutions to the scalability issues in permissionless blockchains, by allowing parties to pay each other off-chain thro…
An Online Matching Model for Self-Adjusting ToR-to-ToR Networks
Chen Avin, Chen Griner, Iosif Salem +1
This is a short note that formally presents the matching model for the theoretical study of self-adjusting networks as initially proposed in [1].
Practically-Self-Stabilizing Vector Clocks in the Absence of Execution Fairness
Iosif Salem, Elad Michael Schiller
Vector clock algorithms are basic wait-free building blocks that facilitate causal ordering of events. As wait-free algorithms, they are guaranteed to complete their operations wit…
Renaissance: A Self-Stabilizing Distributed SDN Control Plane using In-band Communications
Marco Canini, Iosif Salem, Liron Schiff +2
By introducing programmability, automated verification, and innovative debugging tools, Software-Defined Networks (SDNs) are poised to meet the increasingly stringent dependability…
Shared-object System Equilibria: Delay and Throughput Analysis
Iosif Salem, Elad M. Schiller, Marina Papatriantafilou +1
We consider shared-object systems that require their threads to fulfill the system jobs by first acquiring sequentially the objects needed for the jobs and then holding on to them…
Effective Computation of Immersion Obstructions for Unions of Graph Classes
Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theor…