3 citations · 8 across the 12 of their papers we have counts for
13 papers
Rethinking Fronthaul Topologies for Cell-Free 6G Networks
Max Franke, Arash Pourdamghani, Fabian Göttsch +2
Due to significant progress in physical layer (PHY) technologies, future 6G networks are expected to feature much denser antenna deployments. Cell-free MIMO network designs are one…
A Tutorial on Controlling Metasurfaces from the Network Perspective
Christos Liaskos, Evangelos Papapetrou, Kostas Katsalis +6
Metasurfaces have emerged as transformative electromagnetic structures for wireless communications, enabling the real-time control over wave propagation, yielding potential for imp…
Optimizing Fronthaul Quantization for Flexible User Load in Cell-Free Massive MIMO
Fabian Göttsch, Max Franke, Arash Pourdamghani +2
We investigate the physical layer (PHY) spectral efficiency and fronthaul network load of a scalable user-centric cell-free massive MIMO system. Each user-centric cluster processor…
BSB: Towards Demand-Aware Peer Selection With XOR-based Routing
Qingyun Ji, Darya Melnyk, Arash Pourdamghani +1
Peer-to-peer networks, as a key enabler of modern networked and distributed systems, rely on peer-selection algorithms to optimize their scalability and performance. Peer-selection…
A Learning-Augmented Overlay Network
Julien Dallot, Caio Caldeira, Arash Pourdamghani +2
This paper studies the integration of machine-learned advice in overlay networks in order to adapt their topology to the incoming demand. Such demand-aware systems have recently re…
Hash & Adjust: Competitive Demand-Aware Consistent Hashing
Arash Pourdamghani, Chen Avin, Robert Sama +2
Distributed systems often serve dynamic workloads and resource demands evolve over time. Such a temporal behavior stands in contrast to the static and demand-oblivious nature of mo…
SpiderDAN: Matching Augmentation in Demand-Aware Networks
Aleksander Figiel, Darya Melnyk, André Nichterlein +2
Graph augmentation is a fundamental and well-studied problem that arises in network optimization. We consider a new variant of this model motivated by reconfigurable communication…
DecentPeeR: A Self-Incentivised & Inclusive Decentralized Peer Review System
Johannes Gruendler, Darya Melnyk, Arash Pourdamghani +1
Peer review, as a widely used practice to ensure the quality and integrity of publications, lacks a well-defined and common mechanism to self-incentivize virtuous behavior across a…
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree
Arash Pourdamghani, Chen Avin, Robert Sama +1
We consider the fundamental problem of designing a self-adjusting tree, which efficiently and locally adapts itself towards the demand it serves (namely accesses to the items store…
The Augmentation-Speed Tradeoff for Consistent Network Updates
Monika Henzinger, Ami Paz, Arash Pourdamghani +1
Emerging software-defined networking technologies enable more adaptive communication infrastructures, allowing for quick reactions to changes in networking requirements by exploiti…
Self-Adjusting Packet Classification
Maciej Pacut, Juan Vanerio, Vamsi Addanki +3
This paper is motivated by the vision of more efficient packet classification mechanisms that self-optimize in a demand-aware manner. At the heart of our approach lies a self-adjus…
Online List Access with Precedence Constraints
Maciej Pacut, Juan Vanerio, Vamsi Addanki +3
This paper considers a natural generalization of the online list access problem in the paid exchange model, where additionally there can be precedence constraints ("dependencies")…
Probabilistic Smart Contracts: Secure Randomness on the Blockchain
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani
In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a w…