{"id":"W2099116406","doi":"10.1109/icc.2006.254877","title":"Equal Opportunity Fairness in Resilient Packet Rings","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Stateful firewall; Computer science; Bandwidth (computing); Network packet; Reuse; Fairness measure; Bandwidth allocation; Degradation (telecommunications); Computer network; Throughput; Scheme (mathematics); Ring (chemistry); Distributed computing; Mathematics; Telecommunications; Wireless; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004463144,0.0003879664,0.0006475439,0.0006153493,0.0008264923,0.001147793,0.001505073,0.00056504,0.0007364752],"category_scores_gemma":[0.006655554,0.0003764587,0.0004662226,0.0004581755,0.001385163,0.001648395,0.00119098,0.0007072982,0.0001051966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001537109,"about_ca_system_score_gemma":0.0008640873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001597972,"about_ca_topic_score_gemma":0.0009591546,"domain_scores_codex":[0.997459,0.00120964,0.00008919259,0.0002879748,0.0005800975,0.0003741396],"domain_scores_gemma":[0.9967894,0.001872137,0.0003916573,0.0004779786,0.0003216454,0.0001471466],"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.0004310119,0.00008058846,0.001395173,0.00005018485,0.00005153644,0.0001638251,0.000293246,0.750414,0.006772487,0.2142936,0.0005990074,0.02545531],"study_design_scores_gemma":[0.00001795783,0.00006257423,0.0001622919,0.000004101626,0.00001098495,0.00003942854,0.00001646004,0.9721791,0.001588906,0.02528597,0.0006205349,0.00001170541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.131101,0.0003606292,0.8651513,0.0001708104,0.00006404571,0.00004857711,0.0000248323,0.0002226848,0.002856136],"genre_scores_gemma":[0.9714578,0.0001027036,0.02735139,0.00004007404,0.00003593327,0.00003637908,0.00001133098,0.00001721298,0.00094717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004463144,"threshold_uncertainty_score":0.02360368,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09110053322300368,"score_gpt":0.3266313976594065,"score_spread":0.2355308644364028,"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."}}