Marco Chiesa

Marco Chiesa

Auto-generated profile, based on publicly available information

Marco Chiesa

KTH Royal Institute of Technology, Stockholm, Sweden

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
2 November 2011
Verified
Conference Paper
Open access
PDF file
ADAlberto Dainotti
Alberto Dainotti
CSClaudio Squarcella
Claudio Squarcella
EAEmile Aben
Emile Aben
KCKimberly C. Claffy
Kimberly C. Claffy
MCMarco Chiesa
Marco Chiesa
APAntonio Pescapé
Antonio Pescapé

13 June 2024 in Proceedings of the ACM on Networking
Verified
Journal Article
Open access
CWChangjie Wang
Changjie Wang
MSMariano Scazzariello
Mariano Scazzariello
AFAlireza Farshin
Alireza Farshin
SFSimone Ferlin
Simone Ferlin
DKDejan Kostic
Dejan Kostic
MCMarco Chiesa
Marco Chiesa
This paper explores opportunities to utilize Large Language Models (LLMs) to make network configuration human-friendly, simplifying the configuration of network devices & development of routing algorithms and minimizing errors. We design a set of benchmarks (NetConfEval) to examine the effectiveness of different models in facilitating and automating network configuration. More specifically, we focus on the scenarios where LLMs translate high-level policies, requirements, and descriptions (i.e., specified in natural language) into low-level network configurations & Python code. NetConfEval considers four tasks that could potentially facilitate network configuration, such as (i) generating high-level requirements into a formal specification format, (ii) generating API/function calls from high-level requirements, (iii) developing routing algorithms based on high-level descriptions, and (iv) generating low-level configuration for existing and new protocols based on input documentation. Learning from the results of our study, we propose a set of principles to design LLM-based systems to configure networks. Finally, we present two GPT-4-based prototypes to (i) automatically configure P4-enabled devices from a set of high-level requirements and (ii) integrate LLMs into existing network synthesizers.

11 October 2016 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
MCMarco Chiesa
Marco Chiesa
GKGuy Kindler
Guy Kindler
MSMichael Schapira
Michael Schapira
To efficiently exploit the network resources operators, do traffic engineering (TE), i.e., adapt the routing of traffic to the prevailing demands. TE in large IP networks typically relies on configuring static link weights and splitting traffic between the resulting shortest paths via the Equal-Cost-MultiPath (ECMP) mechanism. Yet, despite its vast popularity, crucial operational aspects of TE via ECMP are still little-understood from an algorithmic viewpoint. We embark upon a systematic algorithmic study of TE with ECMP. We consider the standard model of TE with ECMP and prove that, in general, even approximating the optimal link-weight configuration for ECMP within any constant ratio is an intractable feat, settling a long-standing open question. We establish, in contrast, that ECMP can provably achieve optimal traffic flow for the important category of Clos datacenter networks. We last consider a well-documented shortcoming of ECMP: suboptimal routing of large (“elephant”) flows. We present algorithms for scheduling “elephant” flows on top of ECMP (as in, e.g., Hedera) with provable approximation guarantees. Our results complement and shed new light on past experimental and empirical studies of the performance of TE with ECMP.

11 March 2021 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Open access
MCMarco Chiesa
Marco Chiesa
AKAndrzej Kamisinski
Andrzej Kamisinski
JRJacek Rak
Jacek Rak
GRGabor Retvari
Gabor Retvari
SSStefan Schmid
Stefan Schmid
In order to meet their stringent dependability requirements, most modern packet-switched communication networks support fast-recovery mechanisms in the data plane. While reactions to failures in the data plane can be significantly faster compared to control plane mechanisms, implementing fast recovery in the data plane is challenging, and has recently received much attention in the literature. This survey presents a systematic, tutorial-like overview of packet-based fast-recovery mechanisms in the data plane, focusing on concepts but structured around different networking technologies, from traditional link-layer and IP-based mechanisms, over BGP and MPLS to emerging software-defined networks and programmable data planes. We examine the evolution of fast-recovery standards and mechanisms over time, and identify and discuss the fundamental principles and algorithms underlying different mechanisms. We then present a taxonomy of the state of the art, summarize the main lessons learned, and propose a few concrete future directions.

1 November 2016 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
MCMarco Chiesa
Marco Chiesa
INIlya Nikolaevskiy
Ilya Nikolaevskiy
SMSlobodan Mitrovic
Slobodan Mitrovic
Andrei GurtovAndrei Gurtov
Andrei Gurtov
AMAleksander Madry
Aleksander Madry
SSScott Shenker
Scott Shenker
Fast reroute and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. In this paper, we embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packet-header-rewriting, with packet-duplication). Our results show that the resiliency of a routing scheme depends on the “connectivity” k of a network, i.e., the minimum number of link deletions that partition a network. We complement our theoretical result with extensive simulations. We show that resiliency to four simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplication or randomization. Furthermore, our routing schemes provide resiliency against k - 1 failures, with limited path stretch, by storing log(k) bits in the packet header, with limited packet duplication, or with randomized forwarding technique.

3 April 2017
Verified
Conference Paper
Open access
TNThanh Dang Nguyen
Thanh Dang Nguyen
MCMarco Chiesa
Marco Chiesa
MCMarco Canini
Marco Canini
We present ez-Segway, a decentralized mechanism to consistently and quickly update the network state while preventing forwarding anomalies (loops and black-holes) and avoiding link congestion. In our design, the centralized SDN controller only pre-computes information needed by the switches during the update execution. This information is distributed to the switches, which use partial knowledge and direct message passing to efficiently realize the update. This separation of concerns has the key benefit of improving update performance as the communication and computation bottlenecks at the controller are removed. Our evaluations via network emulations and large-scale simulations demonstrate the efficiency of ez-Segway, which compared to a centralized approach, improves network update times by up to 45% and 57% at the median and the 99th percentile, respectively. A deployment of a system prototype in a real OpenFlow switch and an implementation in P4 demonstrate the feasibility and low overhead of implementing simple network update functionality within switches.