MétaCan
Menu
Back to cohort
Record W2460907032 · doi:10.1109/noms.2016.7502871

Surviving link failures in multicast VN embedded applications

2016· article· en· W2460907032 on OpenAlexaff
Abdulaziz M. Ghaleb, Tarek Khalifa, Sara Ayoubi, Khaled Shaban

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsConcordia University
FundersQatar National Research Fund
KeywordsComputer scienceSurvivabilityMulticastComputer networkNode (physics)BackupDistributed computingLink (geometry)Virtual networkEngineeringOperating system

Abstract

fetched live from OpenAlex

Virtual network embedding (VNE) is defined as the allocation of network resources to multiple virtual networks (VNs) and is recognized to be a challenging task to perform efficiently. Virtual network survivability is a new term that describes the measures taken to provide a failure-proof VN against physical link and/or node failure. Indeed, a single link or node failure in a substrate network can bring down multiple hosted VNs, i.e., the ones that utilize that failed link or node. As such, virtual network survivability becomes an essential part of VNE. While much work has been dedicated to studying the impact of a variety of failure cases in a VN, little attention has been directed towards studying the link failure impact on multicast virtual network (MVN) applications, which principally restrict end-to-end delay and delay variation measures. In fact, most of the introduced survivability schemes adopt protection techniques by reserving backup resources prior to embedding, which inevitably leads to under-utilization of the network resources. In this paper, we first investigate the impact of physical link failure on MVNs. Then, we introduce a novel recovery approach to restore MVNs while considering their end-delay and delay variation requirements. Simulation experiments prove that our recovery technique achieves good restoration ratio in considerably fast execution time and low link mapping cost with little impact on the admittance ratio.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.916
Threshold uncertainty score0.292

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.011
GPT teacher head0.234
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations8
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicSoftware-Defined Networks and 5GFrench-language works237,207