Richard Cziva
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Richard Cziva has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
Simon Jouet
School of Computing Science, University of Glasgow, Glasgow, UK
4 shared publicationsDimitrios P. Pezaros
School of Computing Science, University of Glasgow, Glasgow, G12 8QQ, Scotland
3 shared publications- Dimitrios P. Pezaros
University of Glasgow, Glasgow, United Kingdom
3 shared publications Dimitrios P Pezaros
2 shared publicationsFung Po Tso
School of Computing & Mathematical Science, Liverpool John Moores University, UK
2 shared publications- Satyajeet Singh Ahuja
Meta Platforms, Inc, Menlo Park, USA
2 shared publications
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1764-1778
Planogram: A Multi-dimensional Physical Location Planning System for DC Networks
Meta's data centers underpin a vast array of Internet services and have faced unprecedented demand due to the rapid expansion of AI workloads. The traditional approach of building standardized data centers is increasingly challenged by the exponential growth in required capacity that is now sourced in a variety of non-standard physical environments and data center designs. This shift introduces a complex challenge: how to rapidly and repeatably design custom data center networks that balance multiple, often conflicting, objectives across diverse engineering disciplines. In response, we present Planogram, a physical location mapping framework for DC networking. Planogram automates the traditionally manual and time-consuming process of mapping logical network entities onto physical data center floor plans. By ingesting a logical network, a DC stencil of physical constraints, and a set of design objectives, Planogram leverages Integer Linear Programming and Reinforcement Learning to produce fully mapped floor plans. Our production experience with Planogram, having already designed multiple datacenter regions, has shown substantial reduction in the time to design, while improving design quality and consistency across network segments and regions.
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1764-1778
Open AccessPlanogram: A Multi-dimensional Physical Location Planning System for DC Networks
Meta's data centers underpin a vast array of Internet services and have faced unprecedented demand due to the rapid expansion of AI workloads. The traditional approach of building standardized data centers is increasingly challenged by the exponential growth in required capacity that is now sourced in a variety of non-standard physical environments and data center designs. This shift introduces a complex challenge: how to rapidly and repeatably design custom data center networks that balance multiple, often conflicting, objectives across diverse engineering disciplines. In response, we present Planogram, a physical location mapping framework for DC networking. Planogram automates the traditionally manual and time-consuming process of mapping logical network entities onto physical data center floor plans. By ingesting a logical network, a DC stencil of physical constraints, and a set of design objectives, Planogram leverages Integer Linear Programming and Reinforcement Learning to produce fully mapped floor plans. Our production experience with Planogram, having already designed multiple datacenter regions, has shown substantial reduction in the time to design, while improving design quality and consistency across network segments and regions.
- Open Access
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 333-345
Hose-based cross-layer backbone network design with Benders decomposition
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 333-345
Open AccessHose-based cross-layer backbone network design with Benders decomposition
- Open Access
- 11 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (1) , 1064-1076
Adaptive Protection of Scientific Backbone Networks Using Machine Learning
In this paper, we propose a new protection scheme for backbone networks to guarantee high service availability. The presented scheme does not require any reconfiguration immediately after the failure (i.e., it is proactive). At the same time, it does not require any reserved backup network resources either. To achieve these seemingly contradictory goals, we utilize the recent advancements in Machine Learning (ML) to implement a network intelligence that periodically re-allocates the unused capacity as protection bandwidth to meet the service availability requirements of each connection. Our goal is achieved by two components (1) predicting the traffic for the next period on each link, and (2) intelligently selecting the best fit dedicated protection scheme for the next period depending on the estimated unused (spare) bandwidth and the previous service availability violations. Note that re-allocating protection bandwidth affects neither the operational connections nor the current best practice of operators to over-provision network bandwidth to support elephant flows. Finally, we provide a case study on the real traffic from Energy Sciences Network (ESnet), a high-speed, international scientific backbone network. The key benefit of our framework is that adaptively utilizing the over-provisioned bandwidth for spare capacity is sufficient to improve the availability from three-nines to five-nines (in ESnet for the 30 examined connections). The drawback is negligible bandwidth limitations; the user perceives a minor and very temporal bandwidth limitation in less than 0.1% of the time.
- 11 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (1) , 1064-1076
Open AccessAdaptive Protection of Scientific Backbone Networks Using Machine Learning
In this paper, we propose a new protection scheme for backbone networks to guarantee high service availability. The presented scheme does not require any reconfiguration immediately after the failure (i.e., it is proactive). At the same time, it does not require any reserved backup network resources either. To achieve these seemingly contradictory goals, we utilize the recent advancements in Machine Learning (ML) to implement a network intelligence that periodically re-allocates the unused capacity as protection bandwidth to meet the service availability requirements of each connection. Our goal is achieved by two components (1) predicting the traffic for the next period on each link, and (2) intelligently selecting the best fit dedicated protection scheme for the next period depending on the estimated unused (spare) bandwidth and the previous service availability violations. Note that re-allocating protection bandwidth affects neither the operational connections nor the current best practice of operators to over-provision network bandwidth to support elephant flows. Finally, we provide a case study on the real traffic from Energy Sciences Network (ESnet), a high-speed, international scientific backbone network. The key benefit of our framework is that adaptively utilizing the over-provisioned bandwidth for spare capacity is sufficient to improve the availability from three-nines to five-nines (in ESnet for the 30 examined connections). The drawback is negligible bandwidth limitations; the user perceives a minor and very temporal bandwidth limitation in less than 0.1% of the time.
- Top Cited Papers
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 693-701
Dynamic, Latency-Optimal vNF Placement at the Network Edge
Future networks are expected to support low-latency, context-aware and user-specific services in a highly flexible and efficient manner. One approach to support emerging use cases such as, e.g., virtual reality and in-network image processing is to introduce virtualized network functions (vNF)s at the edge of the network, placed in close proximity to the end users to reduce end-to-end latency, time-to-response, and unnecessary utilisation in the core network. While placement of vNFs has been studied before, it has so far mostly focused on reducing the utilisation of server resources (i.e., minimising the number of servers required in the network to run a specific set of vNFs), and not taking network conditions into consideration such as, e.g., end-to-end latency, the constantly changing network dynamics, or user mobility patterns. In this paper, we formulate the Edge vNF placement problem to allocate vNFs to a distributed edge infrastructure, minimising end-to-end latency from all users to their associated vNFs. We present a way to dynamically re-schedule the optimal placement of vNFs based on temporal network-wide latency fluctuations using optimal stopping theory. We then evaluate our dynamic scheduler over a simulated nation-wide backbone network using real-world ISP latency characteristics. We show that our proposed dynamic placement scheduler minimises vNF migrations compared to other schedulers (e.g., periodic and always-on scheduling of a new placement), and offers Quality of Service guarantees by not exceeding a maximum number of latency violations that can be tolerated by certain applications.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 693-701
Top Cited PapersDynamic, Latency-Optimal vNF Placement at the Network Edge
Future networks are expected to support low-latency, context-aware and user-specific services in a highly flexible and efficient manner. One approach to support emerging use cases such as, e.g., virtual reality and in-network image processing is to introduce virtualized network functions (vNF)s at the edge of the network, placed in close proximity to the end users to reduce end-to-end latency, time-to-response, and unnecessary utilisation in the core network. While placement of vNFs has been studied before, it has so far mostly focused on reducing the utilisation of server resources (i.e., minimising the number of servers required in the network to run a specific set of vNFs), and not taking network conditions into consideration such as, e.g., end-to-end latency, the constantly changing network dynamics, or user mobility patterns. In this paper, we formulate the Edge vNF placement problem to allocate vNFs to a distributed edge infrastructure, minimising end-to-end latency from all users to their associated vNFs. We present a way to dynamically re-schedule the optimal placement of vNFs based on temporal network-wide latency fluctuations using optimal stopping theory. We then evaluate our dynamic scheduler over a simulated nation-wide backbone network using real-world ISP latency characteristics. We show that our proposed dynamic placement scheduler minimises vNF migrations compared to other schedulers (e.g., periodic and always-on scheduling of a new placement), and offers Quality of Service guarantees by not exceeding a maximum number of latency violations that can be tolerated by certain applications.
- 16 March 2018
- Published by Institution of Engineering and Technology (IET)
- p. 69-89
SDN for cloud data centres
In this chapter, we provide a technical overview of cloud DCs and their network infrastructure evolution and discuss how SDN has emerged as a prominent technology for configuring and managing large-scale complex networks in this space. After comparing and contrasting the most common DC network topologies (such as canonical and fat tree, B-cube, DCell, etc.), we discuss the main challenges that SDN can help addressing due to, among others, the fast and flexible deployment of advanced services it can facilitate, its inherent programmability, and its suitability for supporting measurement-based resource provisioning. We subsequently describe the benefits of using SDN for DC network configuration and management and briefly outline some prominent SDN deployments over large-scale DCs. We discuss the potential of SDN to play the role of the central nervous system for the converged management of server and network resources over single-administrative DC environments and, finally, we highlight promising open issues for future research and development in this area.
- 16 March 2018
- Published by Institution of Engineering and Technology (IET)
- p. 69-89
SDN for cloud data centres
In this chapter, we provide a technical overview of cloud DCs and their network infrastructure evolution and discuss how SDN has emerged as a prominent technology for configuring and managing large-scale complex networks in this space. After comparing and contrasting the most common DC network topologies (such as canonical and fat tree, B-cube, DCell, etc.), we discuss the main challenges that SDN can help addressing due to, among others, the fast and flexible deployment of advanced services it can facilitate, its inherent programmability, and its suitability for supporting measurement-based resource provisioning. We subsequently describe the benefits of using SDN for DC network configuration and management and briefly outline some prominent SDN deployments over large-scale DCs. We discuss the potential of SDN to play the role of the central nervous system for the converged management of server and network resources over single-administrative DC environments and, finally, we highlight promising open issues for future research and development in this area.
- 12 November 2017
- Published by Springer Nature
- p. 171-196
SDNFV-Based DDoS Detection and Remediation in Multi-tenant, Virtualised Infrastructures
- 12 November 2017
- Published by Springer Nature
- p. 171-196
SDNFV-Based DDoS Detection and Remediation in Multi-tenant, Virtualised Infrastructures
- 12 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 55 (6) , 24-31
Container Network Functions: Bringing NFV to the Network Edge
In order to cope with the increasing network utilization driven by new mobile clients, and to satisfy demand for new network services and performance guarantees, telecommunication service providers are exploiting virtualization over their network by implementing network services in virtual machines, decoupled from legacy hardware accelerated appliances. This effort, known as NFV, reduces OPEX and provides new business opportunities. At the same time, next generation mobile, enterprise, and IoT networks are introducing the concept of computing capabilities being pushed at the network edge, in close proximity of the users. However, the heavy footprint of today's NFV platforms prevents them from operating at the network edge. In this article, we identify the opportunities of virtualization at the network edge and present Glasgow Network Functions (GNF), a container-based NFV platform that runs and orchestrates lightweight container VNFs, saving core network utilization and providing lower latency. Finally, we demonstrate three useful examples of the platform: IoT DDoS remediation, on-demand troubleshooting for telco networks, and supporting roaming of network functions.
- 12 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 55 (6) , 24-31
Container Network Functions: Bringing NFV to the Network Edge
In order to cope with the increasing network utilization driven by new mobile clients, and to satisfy demand for new network services and performance guarantees, telecommunication service providers are exploiting virtualization over their network by implementing network services in virtual machines, decoupled from legacy hardware accelerated appliances. This effort, known as NFV, reduces OPEX and provides new business opportunities. At the same time, next generation mobile, enterprise, and IoT networks are introducing the concept of computing capabilities being pushed at the network edge, in close proximity of the users. However, the heavy footprint of today's NFV platforms prevents them from operating at the network edge. In this article, we identify the opportunities of virtualization at the network edge and present Glasgow Network Functions (GNF), a container-based NFV platform that runs and orchestrates lightweight container VNFs, saving core network utilization and providing lower latency. Finally, we demonstrate three useful examples of the platform: IoT DDoS remediation, on-demand troubleshooting for telco networks, and supporting roaming of network functions.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 105-106
On the Latency Benefits of Edge NFV
Next-generation networks are expected to support low-latency, context-aware and user-specific services in a highly flexible and efficient manner. Proposed applications include high-definition, low-latency video streaming, remote surgery, as well as applications for tactile Internet, virtual or augmented reality that demand network side data processing (such as image recognition, transformation or head/eye motion aware rendering). One approach to support these use cases is to introduce virtualized network services at the edge of the network, in close proximity of the end users to reduce end-to-end latency, time-to-response and unnecessary utilization of the core network, while providing flexibility for resource allocation. While many research projects including our previous work on Glasgow Network Functions have proposed running virtual network functions (vNF)s at the network edge, a latency-optimal placement allocation has not been presented before for the network edge and therefore the impact on user-to-vNF latency has not been investigated. In this paper, we formulate a simple vNF placement problem that minimizes end-to-end latency from users to their network functions. We have implemented the problem using Integer Linear Programming (ILP) with the Gurobi solver, and evaluated it with a real topology of a network provider. We use our solution to compare two vNF deployment scenarios over an emulation of a national backbone network: a two-tier edge deployment and a cloud-only deployment. We show that, in our example, using edge servers can deliver up to 70% improvement in user-to-vNF latency.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 105-106
On the Latency Benefits of Edge NFV
Next-generation networks are expected to support low-latency, context-aware and user-specific services in a highly flexible and efficient manner. Proposed applications include high-definition, low-latency video streaming, remote surgery, as well as applications for tactile Internet, virtual or augmented reality that demand network side data processing (such as image recognition, transformation or head/eye motion aware rendering). One approach to support these use cases is to introduce virtualized network services at the edge of the network, in close proximity of the end users to reduce end-to-end latency, time-to-response and unnecessary utilization of the core network, while providing flexibility for resource allocation. While many research projects including our previous work on Glasgow Network Functions have proposed running virtual network functions (vNF)s at the network edge, a latency-optimal placement allocation has not been presented before for the network edge and therefore the impact on user-to-vNF latency has not been investigated. In this paper, we formulate a simple vNF placement problem that minimizes end-to-end latency from users to their network functions. We have implemented the problem using Integer Linear Programming (ILP) with the Gurobi solver, and evaluated it with a real topology of a network provider. We use our solution to compare two vNF deployment scenarios over an emulation of a national backbone network: a two-tier edge deployment and a cloud-only deployment. We show that, in our example, using edge servers can deliver up to 70% improvement in user-to-vNF latency.
- Open Access
- 22 August 2016
- Published by Association for Computing Machinery (ACM)
- p. 601-602
Roaming Edge vNFs using Glasgow Network Functions
While the network edge is becoming more important for the provision of customized services in next generation mobile networks, current NFV architectures are unsuitable to meet the increasing future demand. They rely on commodity servers with resource-hungry Virtual Machines that are unable to provide the high network function density and mobility requirements necessary for upcoming wide-area and 5G networks. In this demo, we showcase Glasgow Network Functions (GNF), a virtualization framework suitable for next generation mobile networks that exploits lightweight network functions (NFs) deployed at the edge and transparently following users' devices as they roam between cells.
- 22 August 2016
- Published by Association for Computing Machinery (ACM)
- p. 601-602
Open AccessRoaming Edge vNFs using Glasgow Network Functions
While the network edge is becoming more important for the provision of customized services in next generation mobile networks, current NFV architectures are unsuitable to meet the increasing future demand. They rely on commodity servers with resource-hungry Virtual Machines that are unable to provide the high network function density and mobility requirements necessary for upcoming wide-area and 5G networks. In this demo, we showcase Glasgow Network Functions (GNF), a virtualization framework suitable for next generation mobile networks that exploits lightweight network functions (NFs) deployed at the edge and transparently following users' devices as they roam between cells.
- Open Access
- 1 April 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Synergistic policy and virtual machine consolidation in cloud data centers
In modern Cloud Data Centers (DC)s, correct implementation of network policies is crucial to provide secure, efficient and high performance services for tenants. It is reported that the inefficient management of network policies accounts for 78% of DC downtime, challenged by the dynamically changing network characteristics and by the effects of dynamic Virtual Machine (VM) consolidation. While there has been significant research in policy and VM management, they have so far been treated as disjoint research problems. In this paper, we explore the simultaneous, dynamic VM and policy consolidation, and formulate the Policy-VM Consolidation (PVC) problem, which is shown to be NP-Hard. We then propose Sync, an efficient and synergistic scheme to jointly consolidate network policies and virtual machines. Extensive evaluation results and a testbed implementation of our controller show that policy and VM migration under Sync significantly reduces flow end-to-end delay by nearly 40%, and network-wide communication cost by 50% within few seconds, while adhering strictly to the requirements of network policies.
- 1 April 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Open AccessSynergistic policy and virtual machine consolidation in cloud data centers
In modern Cloud Data Centers (DC)s, correct implementation of network policies is crucial to provide secure, efficient and high performance services for tenants. It is reported that the inefficient management of network policies accounts for 78% of DC downtime, challenged by the dynamically changing network characteristics and by the effects of dynamic Virtual Machine (VM) consolidation. While there has been significant research in policy and VM management, they have so far been treated as disjoint research problems. In this paper, we explore the simultaneous, dynamic VM and policy consolidation, and formulate the Policy-VM Consolidation (PVC) problem, which is shown to be NP-Hard. We then propose Sync, an efficient and synergistic scheme to jointly consolidate network policies and virtual machines. Extensive evaluation results and a testbed implementation of our controller show that policy and VM migration under Sync significantly reduces flow end-to-end delay by nearly 40%, and network-wide communication cost by 50% within few seconds, while adhering strictly to the requirements of network policies.