Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Siavash Fathi

dblp:208/0127 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

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
1 paper
Network optimization and economics · 46% Software-defined and programmable networks · 23% Network management and operations · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network management and operations › network robustness
fault tolerance
0.312018
Virtual Network Survivability Through Joint Spare Capacity Allocation and Embedding · IEEE J. Sel. Areas Commun. 2018
Network optimization and economics
resource allocation
0.312018
Virtual Network Survivability Through Joint Spare Capacity Allocation and Embedding · IEEE J. Sel. Areas Commun. 2018
Network optimization and economics › network design
survivable network design
0.312018
Virtual Network Survivability Through Joint Spare Capacity Allocation and Embedding · IEEE J. Sel. Areas Commun. 2018
Software-defined and programmable networks › network virtualization
virtual network embedding
0.312018
Virtual Network Survivability Through Joint Spare Capacity Allocation and Embedding · IEEE J. Sel. Areas Commun. 2018
Routing and switching › traffic engineering
spare capacity allocation
0.112018
Virtual Network Survivability Through Joint Spare Capacity Allocation and Embedding · IEEE J. Sel. Areas Commun. 2018

Methods — techniques the papers use, named apart from their topics

quadratic integer programming · 0.3integer linear programming · 0.3heuristic algorithm · 0.3
YearPublicationVenuePosition
2018 Virtual Network Survivability Through Joint Spare Capacity Allocation and Embedding
abstract
A key challenge in network virtualization is to efficiently map a virtual network (VN) on a substrate network (SN), while accounting for possible substrate failures. This is known as the survivable VN embedding (SVNE) problem. The state-of-the-art literature has studied the SVNE problem from infrastructure providers' (InPs') perspective, i.e., provisioning backup resources in the SN. A rather unexplored solution spectrum is to augment the VN with sufficient spare backup capacity to survive substrate failures and embed the resulting VN accordingly. Such augmentation enables InPs to offload failure recovery decisions to the VN operator, thus providing more flexible VN management. In this paper, we study the problem of jointly optimizing spare capacity allocation in a VN and embedding the VN to guarantee full bandwidth in the presence of multiple substrate link failures. We formulate the optimal solution to this problem as a quadratic integer program that we transform into an integer linear program. We also propose a heuristic algorithm to solve larger instances of the problem. Based on analytical study and simulation, our key findings are: 1) provisioning shared backup resources in the VN can yield ~33% more resource efficient embedding compared to doing the same at the SN level and 2) our heuristic allocates ~21% extra resources compared to the optimal, while executing several orders of magnitude faster.
Nashid Shahriar, Shihabur Rahman Chowdhury, Reaz Ahmed, Aimal Khan, Siavash Fathi, Raouf Boutaba, Jeebak Mitra
IEEE J. Sel. Areas Commun.5