{"id":"W2000297053","doi":"10.1109/noms.2006.1687666","title":"A Bandwidth Bargain Model based on Adaptive Weighted Fair Queueing","year":2006,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Weighted fair queueing; Computer science; Computer network; Bandwidth (computing); Queueing theory; Quality of service; Bandwidth allocation; Dynamic bandwidth allocation; Network packet; Proportionally fair; Fair queuing; Distributed computing; Dynamic priority scheduling; Round-robin scheduling","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000166607,0.0001572775,0.0001459294,0.0000920026,0.0001194211,0.00009318542,0.0004199779,0.00006189523,0.00003194818],"category_scores_gemma":[0.000004495011,0.0001291103,0.0000746169,0.0002708459,0.00002368877,0.0002069422,0.0000394344,0.0001226276,0.00008131094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004351065,"about_ca_system_score_gemma":0.0001371002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005254,"about_ca_topic_score_gemma":0.00003614992,"domain_scores_codex":[0.9988142,0.00006240137,0.000182087,0.0003873494,0.000259936,0.0002940382],"domain_scores_gemma":[0.9992986,0.0001355475,0.00004803032,0.0003729855,0.0000665046,0.00007830887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002378306,0.0000762231,0.00003011991,9.688014e-7,0.000005124867,0.00001142889,0.00001765184,0.399295,0.00003000246,0.510265,0.006746133,0.08349857],"study_design_scores_gemma":[0.000681063,0.00007699388,0.0001091927,0.00001487156,0.000003815392,9.122728e-7,0.000002969956,0.9877033,0.00009714474,0.01044404,0.000690694,0.0001749706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007358289,0.00003133572,0.9341562,0.001569032,0.00009640093,0.0001396642,0.000001142637,0.0004596101,0.06281079],"genre_scores_gemma":[0.9386635,7.502592e-7,0.05684034,0.001972861,0.00009698666,0.00002304275,0.000002246744,0.000008869966,0.002391433],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9379277,"threshold_uncertainty_score":0.5264964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007061470665946677,"score_gpt":0.1901878412449711,"score_spread":0.1831263705790245,"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."}}