Demo Data from VLDB 2026 / reviewers in the wild / expert
Sepehr Taeb
dblp:243/3138
· DBLP profile ↗
7ranked-venue papers
2as first author
3since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 5 · 1 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
3 papers |
Cellular and mobile networks · 29% Optical networks · 26% Network optimization and economics · 18% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Optical networks
elastic optical networks |
1.3 | 3 | 2021 | Disruption Minimized Bandwidth Scaling in EON-Enabled Transport Network Slices · IEEE J. Sel. Areas Commun. 2021 Achieving a Fully-Flexible Virtual Network Embedding in Elastic Optical Networks · INFOCOM 2019 Virtual Network Embedding with Path-based Latency Guarantees in Elastic Optical Networks · ICNP 2019 |
Cellular and mobile networks
network slicing |
1.0 | 3 | 2021 | Disruption Minimized Bandwidth Scaling in EON-Enabled Transport Network Slices · IEEE J. Sel. Areas Commun. 2021 Virtual Network Embedding with Path-based Latency Guarantees in Elastic Optical Networks · ICNP 2019 Achieving a Fully-Flexible Virtual Network Embedding in Elastic Optical Networks · INFOCOM 2019 |
Software-defined and programmable networks › network virtualization
virtual network embedding |
0.8 | 2 | 2019 | Achieving a Fully-Flexible Virtual Network Embedding in Elastic Optical Networks · INFOCOM 2019 Virtual Network Embedding with Path-based Latency Guarantees in Elastic Optical Networks · ICNP 2019 |
Transport protocols and congestion control › transport protocol performance
bandwidth scalability |
0.5 | 1 | 2021 | Disruption Minimized Bandwidth Scaling in EON-Enabled Transport Network Slices · IEEE J. Sel. Areas Commun. 2021 |
Network optimization and economics
resource allocation |
0.5 | 1 | 2021 | Disruption Minimized Bandwidth Scaling in EON-Enabled Transport Network Slices · IEEE J. Sel. Areas Commun. 2021 |
Network optimization and economics › resource allocation
spectrum allocation |
0.4 | 1 | 2019 | Achieving a Fully-Flexible Virtual Network Embedding in Elastic Optical Networks · INFOCOM 2019 |
Cellular and mobile networks
5g |
0.2 | 2 | 2019 | Achieving a Fully-Flexible Virtual Network Embedding in Elastic Optical Networks · INFOCOM 2019 Virtual Network Embedding with Path-based Latency Guarantees in Elastic Optical Networks · ICNP 2019 |
Cellular and mobile networks › network slicing
slice reconfiguration |
0.1 | 1 | 2021 | Disruption Minimized Bandwidth Scaling in EON-Enabled Transport Network Slices · IEEE J. Sel. Areas Commun. 2021 |
Methods — techniques the papers use, named apart from their topics
integer linear programming · 0.9heuristic · 0.8heuristic algorithm · 0.5simulation · 0.4optimization · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | DRL-Assisted Reoptimization of Network Slice Embedding on EON-Enabled Transport Networksabstract5G transport networks will support dynamic services with diverse requirements through network slicing. Elastic Optical Networks (EONs) facilitate transport network slicing by flexible spectrum allocation and tuning of transmission configurations. A major challenge in supporting dynamic services is the lack of priori knowledge of future slice requests. As a consequence, slice embedding can become sub-optimal over time, leading to spectrum fragmentation and skewed utilization. This in turn can block future slice requests, impacting operator revenue. To address this issue, operators can periodically re-optimize slice embedding for reducing fragmentation. In this paper, we address this problem of re-optimizing network slice embedding on EONs for minimizing fragmentation. The problem is solved in its splittable version, which significantly increases problem complexity, but also offers more opportunities for a larger set of re-configuration actions. We employ simulated annealing for systematically exploring the large solution space. We also propose a greedy algorithm to address the practical constraint of limiting the number of re-configuration steps. Moreover, we present a novel method based on Deep Reinforcement Learning (DRL) for determining when performing re-configuration is most effective. Our extensive simulations demonstrate that the greedy algorithm yields a solution very close to that obtained using simulated annealing while requiring orders of magnitude lesser re-configuration actions. Finally, we show that by applying the greedy algorithm periodically on the network according to the DRL-based time selection algorithm, a significant improvement in the total number of accepted slice requests can be achieved with only performing a limited number of re-configuration operations. Seyed Soheil Johari, Sepehr Taeb, Nashid Shahriar, Shihabur Rahman Chowdhury, Massimo Tornatore, Raouf Boutaba, Jeebak Mitra, Mahdi Hemmati |
IEEE Trans. Netw. Serv. Manag. | 2 |
| 2021 | Reoptimizing Network Slice Embedding on EON-enabled Transport Networksabstract5G transport networks will support dynamic services with diverse requirements through network slicing. Elastic Optical Networks (EONs) facilitate transport network slicing by flexible spectrum allocation and tuning of transmission configurations such as modulation format and forward error correction. A major challenge in supporting dynamic services is the lack of a priori knowledge of future slice requests. In consequence, slice embedding can become sub-optimal over time, leading to spectrum fragmentation and skewed utilization. This in turn can block future slice requests, impacting operator revenue. Therefore, operators need to periodically re-optimize slice embedding for reducing fragmentation. In this paper, we address this problem of re-optimizing network slice embedding on EONs for minimizing fragmentation. The problem is solved in its splittable version, which significantly increases problem complexity, but offers more opportunities for a larger set of re-configuration actions. We employ simulated annealing for systematically exploring the large solution space. We also propose a greedy algorithm to address the practical constraint to limit the number of re-configuration steps taken to reach a defragmentated state. Our extensive simulations demonstrate that the greedy algorithm yields a solution very close to that obtained using simulated annealing while requiring orders of magnitude lesser number of re-configuration actions. Sepehr Taeb, Nashid Shahriar, Shihabur Rahman Chowdhury, Massimo Tornatore, Raouf Boutaba, Jeebak Mitra, Mahdi Hemmati |
CNSM | 1 |
| 2021 | Disruption Minimized Bandwidth Scaling in EON-Enabled Transport Network SlicesabstractElastic Optical Networks (EONs) enable finer-grained resource allocation and tuning of transmission configurations for right-sized resource allocation. These features make EONs excellent choice for 5G transport networks supporting highly dynamic traffic with diverse Quality-of-Service (QoS) requirements. 5G network slices are expected to host applications with a dynamic nature (e.g., augmented/virtual reality broadcasting), which will result in slice resource requirement changing over time. The initial resource allocation to network slices has to be adapted to accommodate such changes without causing significant disruption to existing traffic and using minimal additional resources. In this paper, we address the problem of scaling bandwidth demand of network slices on an EON-enabled 5G transport network. In contrast to the state-of-the-art, we do not assume any specific technologies for minimizing disruption when accommodating the scaling request. Rather, we propose an Integer Linear Program (ILP) and a heuristic algorithm for accommodating scaling requests by choosing from a comprehensive set of reconfiguration actions. We carefully design a novel cost model for capturing traffic disruptions and additional resource usage by these different actions. Our extensive simulations using realistic network topologies shed light on the trade-off between additional resource usage and disruption while accommodating slice scaling requests by employing a comprehensive set of reconfiguration actions. Simulation results also show that our heuristic algorithm can find solutions that remain within 10% of ILP-based solutions, while executing several orders of magnitude faster than ILP. Nashid Shahriar, Mubeen Zulfiqar, Shihabur Rahman Chowdhury, Sepehr Taeb, Raouf Boutaba, Jeebak Mitra, Mahdi Hemmati |
IEEE J. Sel. Areas Commun. | 4 |
| 2020 | Reliable Slicing of 5G Transport Networks With Bandwidth Squeezing and Multi-Path Provisioningabstract5G network slicing allows partitioning of network resources to meet stringent end-to-end service requirements across multiple network segments, from access to transport. These requirements are shaping technical evolution in each of these segments. In particular, the transport segment is currently evolving in the direction of elastic optical networks (EONs), a new generation of optical networks supporting a flexible optical-spectrum grid and novel elastic transponder capabilities. In this paper, we focus on the reliability of 5G transport-network slices in EON. Specifically, we consider the problem of slicing 5G transport networks,i.e., establishing virtual networks on 5G transport, while providing dedicated protection. As dedicated protection requires a large amount of backup resources, our proposed solution incorporates two techniques to reduce backup resources: (i) bandwidth squeezing,i.e., providing a reduced protection bandwidth than the original request; and (ii) survivable multi-path provisioning. We leverage the capability of EONs to fine tune spectrum allocation and adapt modulation format and forward error correction for allocating spectrum resources. Our numerical evaluation over realistic network topologies quantifies the spectrum savings achieved by employing EON over traditional fixed-grid optical networks, and provides new insights on the impact of bandwidth squeezing and multi-path provisioning on spectrum utilization. One key takeaway from our evaluation is that multi-path provisioning can guarantee up to 40% of the bandwidth requested by a VN during failures by provisioning only 10% additional spectrum resources. This also caused VN blocking ratio for BSR up to 40% to remain very close to that of the no-backup case. Nashid Shahriar, Sepehr Taeb, Shihabur Rahman Chowdhury, Mubeen Zulfiqar, Massimo Tornatore, Raouf Boutaba, Jeebak Mitra, Mahdi Hemmati |
IEEE Trans. Netw. Serv. Manag. | 2 |
| 2019 | Reliable Slicing of 5G Transport Networks with Dedicated ProtectionabstractIn 5G networks, slicing allows partitioning of network resources to meet stringent end-to-end service requirements across multiple network segments, from access to transport. These requirements are shaping technical evolution in each of these segments. In particular, the transport segment is currently evolving in the direction of the so-called elastic optical networks (EONs), a new generation of optical networks supporting a flexible optical-spectrum grid and novel elastic transponder capabilities. In this paper, we focus on the reliability of 5G transport-network slices in EON. Specifically, we consider the problem of slicing 5G transport networks, i.e., establishing virtual networks on 5G transport, while providing dedicated protection. As dedicated protection requires a large amount of backup resources, our proposed solution incorporates two techniques to reduce backup resources: (i) bandwidth squeezing, i.e., providing a reduced protection bandwidth with respect to the original request; and (ii) survivable multi-path provisioning. We leverage the capability of EONs to fine tune spectrum allocation and adapt modulation format and Forward Error Correction (FEC) for allocating rightsize spectrum resources to network slices. Our numerical evaluation over realistic case-study network topologies quantifies the spectrum savings achieved by employing EON over traditional fixed-grid optical networks, and provides new insights on the impact of bandwidth squeezing and multi-path provisioning on spectrum utilization. Nashid Shahriar, Sepehr Taeb, Shihabur Rahman Chowdhury, Mubeen Zulfiqar, Massimo Tornatore, Raouf Boutaba, Jeebak Mitra, Mahdi Hemmati |
CNSM | 2 |
| 2019 | Virtual Network Embedding with Path-based Latency Guarantees in Elastic Optical NetworksabstractElastic Optical Network (EON) virtualization has recently emerged as an enabling technology for 5G network slicing. A fundamental problem in EON slicing (known as Virtual Network Embedding (VNE)) is how to efficiently map a virtual network (VN) on a substrate EON characterized by elastic transponders and flexible grid. Since a number of 5G services will have strict latency requirements, the VNE problem in EONs must be solved while guaranteeing latency targets. In existing literature, latency has always been modeled as a constraint applied on the virtual links of the VN. In contrast, we argue in favor of an alternate modeling that constrains the latency of virtual paths. Constraining latency over virtual paths (vs. over virtual links) poses additional modeling and algorithmic challenges to the VNE problem, but allows us to capture end-to-end service requirements. In this paper, we first model latency in an EON by identifying the different factors that contribute to it. We formulate the VNE problem with latency guarantees as an Integer Linear Program (ILP) and propose a heuristic solution that can scale to large problem instances. We evaluated our proposed solutions using real network topologies and realistic transmission configurations under different scenarios and observed that, for a given VN request, latency constraints can be guaranteed by accepting a modest increase in network resource utilization. Latency constraints instead showed a higher impact on VN blocking ratio in dynamic scenarios. Sepehr Taeb, Nashid Shahriar, Shihabur Rahman Chowdhury, Massimo Tornatore, Raouf Boutaba, Jeebak Mitra, Mahdi Hemmati |
ICNP | 1 |
| 2019 | Achieving a Fully-Flexible Virtual Network Embedding in Elastic Optical NetworksabstractNetwork operators must continuously scale the capacity of their optical backbone networks to keep apace with the proliferation of bandwidth-intensive applications. Today’s optical networks are designed to carry large traffic aggregates with coarse-grained resource allocation, and are not adequate for maximizing utilization of the expensive optical substrate. Elastic Optical Network (EON) is an emerging technology that facilitates flexible allocation of fiber spectrum by leveraging finer-grained channel spacing, tunable modulation formats and Forward Error Correction (FEC) overheads, and baud-rate assignment, to right size spectrum allocation to customer needs. Virtual Network Embedding (VNE) over EON has been a recent topic of interest due to its importance for 5G network slicing. However, the problem has not yet been addressed while simultaneously considering the full flexibility offered by an EON. In this paper, we present an optimization model that solves the VNE problem over EON when lightpath configurations can be chosen among a large (and practical) set of combinations of paths, modulation formats, FEC overheads and baud rates. The VNE over EON problem is solved in its splittable version, which significantly increases problem complexity, but is much more likely to return a feasible solution. Given the intractability of the optimal solution, we propose a heuristic to solve larger problem instances. Key results from extensive simulations are: (i) a fully-flexible VNE can save up to 60% spectrum resources compared to that where no flexibility is exploited, and (ii) solutions of our heuristic fall in more than 90% of the cases, within 5% of the optimal solution, while executing several orders of magnitude faster. Nashid Shahriar, Sepehr Taeb, Shihabur Rahman Chowdhury, Massimo Tornatore, Raouf Boutaba, Jeebak Mitra, Mahdi Hemmati |
INFOCOM | 2 |