MétaCan
Menu
Back to cohort
Record W2167612183 · doi:10.1109/cnsr.2006.24

Combining Petri Nets and ns-2: A Hybrid Method for Analysis and Simulation

2006· article· en· W2167612183 on OpenAlexaff
Qiang Ye, M.H. MacGregor

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsPetri netComputer scienceCorrectnessSackDistributed computingProtocol (science)Synchronization (alternating current)Communications protocolProcess architectureStochastic Petri netPetri dishComputer networkProgramming languageEngineering

Abstract

fetched live from OpenAlex

Network protocol performance and evaluation study is often carried out using a couple of widely used simulation toolkits, such as ns-2 and OPNET. These toolkits usually contain many built-in protocol models. Using these toolkits is very efficient due to the abundant models. However, the correctness of a protocol that interests us can never be proved by simulation itself. Petri net modeling enables us to verify the protocol of interest formally. But because of the generality of Petri nets, not many network protocol models are bundled with Petri net modeling tools. In this paper we present an innovative network simulation methodology that benefits from the interaction between ns-2 and Petri nets. A communication mechanism based on Socket Programming and a synchronization mechanism used to coordinate ns-2 and Petri nets were designed to make possible the interaction. In this paper, a new version of SACK TCP, alpha-min Paced SACK TCP, is used to illustrate the power of the proposed methodology

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.823
Threshold uncertainty score0.256

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.0000.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.012
GPT teacher head0.274
Teacher spread0.262 · 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 designSimulation or modeling
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

Citations11
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207