{"id":"W2113831551","doi":"10.1109/icdcs.2005.30","title":"End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Maximum throughput scheduling; Hop (telecommunications); Reuse; End-to-end principle; Scheduling (production processes); Fairness measure; Wireless; Bandwidth (computing); Bandwidth allocation; Wireless network; Distributed computing; Throughput; Dynamic priority scheduling; Quality of service; Round-robin scheduling; Telecommunications; Engineering","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.0005112484,0.0002221298,0.0002467496,0.0001429895,0.0001011529,0.0002292093,0.0009532108,0.0001469825,0.000118914],"category_scores_gemma":[0.000009489257,0.0001983806,0.00006393354,0.0007575201,0.00002878184,0.0006347903,0.0002780161,0.0002541057,0.0001422809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009854376,"about_ca_system_score_gemma":0.00006587742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005063393,"about_ca_topic_score_gemma":0.00193307,"domain_scores_codex":[0.9980896,0.0001065175,0.0003923982,0.0005776247,0.0002790449,0.0005548909],"domain_scores_gemma":[0.9988915,0.0001126283,0.00008112618,0.0006399163,0.00007331707,0.000201527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001848329,0.0001372061,0.001089847,0.000006962144,0.000007274432,0.000007487773,0.0004343333,0.07930639,0.0001035688,0.005440092,0.003802117,0.9096462],"study_design_scores_gemma":[0.000803868,0.00008385805,0.0104471,0.00006411647,0.000001750245,0.000004508211,0.00001596517,0.9385502,0.0004355293,0.00007680821,0.04919542,0.0003208716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007941999,0.0002843056,0.9833649,0.003107532,0.0002121521,0.003427617,7.928315e-7,0.0002436202,0.001417101],"genre_scores_gemma":[0.9154881,0.00009228038,0.0789353,0.002010084,0.0002477319,0.001854865,0.000005917781,0.0000197897,0.001345962],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9093254,"threshold_uncertainty_score":0.8089725,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02246923897096811,"score_gpt":0.2739504298465881,"score_spread":0.25148119087562,"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."}}