{"id":"W2166257010","doi":"10.1109/icc.2005.1494496","title":"Virtual queuing: an efficient algorithm for bandwidth management in resilient packet rings","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Fair queuing; Fairness measure; Throughput; Queueing theory; Bandwidth (computing); Packet loss; Network packet; Algorithm; Computer network; Distributed computing; Computational complexity theory; Dynamic priority scheduling; Quality of service; Round-robin scheduling; Wireless","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00256737,0.0005789536,0.0008402009,0.0008434581,0.001055749,0.001003741,0.002575504,0.0007389143,0.001529383],"category_scores_gemma":[0.002911818,0.0003571825,0.0004513173,0.0006549472,0.0008764096,0.001534906,0.001407017,0.000733518,0.000312184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001164304,"about_ca_system_score_gemma":0.001637041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002508395,"about_ca_topic_score_gemma":0.002174984,"domain_scores_codex":[0.9989911,0.0003326878,0.00006634094,0.0001370275,0.0003227822,0.0001500958],"domain_scores_gemma":[0.9991779,0.0003630952,0.0001111619,0.0001354723,0.0001533873,0.00005901657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005485187,0.0001830764,0.001073386,0.0001352318,0.00009779975,0.0001264374,0.000256225,0.6030477,0.01615028,0.1007796,0.005187856,0.2724138],"study_design_scores_gemma":[0.00003081097,0.00005942319,0.00004961164,0.000004929449,0.00001057863,0.00002903355,0.000009855774,0.988204,0.001994298,0.007961011,0.001634948,0.00001139806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00615963,0.0001382515,0.9924023,0.00007475087,0.00005078851,0.00006945071,0.0000147289,0.0005590938,0.0005310432],"genre_scores_gemma":[0.3900736,0.0002586533,0.6069902,0.0001283748,0.00009969594,0.0002613929,0.00008703068,0.0001283583,0.001972776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002575504,"threshold_uncertainty_score":0.0135777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006032936565115886,"score_gpt":0.2284684824121992,"score_spread":0.2224355458470833,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}