{"id":"W2098897435","doi":"10.1109/glocom.2004.1378045","title":"Effective bandwidths under dynamic weighted round robin scheduling","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scheduling (production processes); Bandwidth allocation; Quality of service; Bandwidth (computing); Dynamic bandwidth allocation; Markov process; Poisson process; Poisson distribution; Distributed computing; Sizing; Dynamic priority scheduling; Mathematical optimization; Real-time computing; Computer network; Mathematics","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.000207582,0.0001516927,0.0001562305,0.00007308804,0.0001393009,0.0001777666,0.000456318,0.00007426548,0.00009256922],"category_scores_gemma":[0.000007563502,0.0001275077,0.00007197692,0.0002919633,0.00003035868,0.0004944296,0.00008738762,0.0001621819,0.000412387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067856,"about_ca_system_score_gemma":0.00004972093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007347597,"about_ca_topic_score_gemma":0.00006267129,"domain_scores_codex":[0.9988773,0.00007686226,0.0001747847,0.0003784244,0.0001824514,0.0003101267],"domain_scores_gemma":[0.9992337,0.0001993126,0.00004737323,0.0003474435,0.00006638531,0.0001057622],"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.000008027103,0.00005572044,0.00003549922,0.000002041555,0.00003733888,0.000003660056,0.00007438124,0.02460271,0.0002088526,0.1704032,0.0002761846,0.8042924],"study_design_scores_gemma":[0.0007311835,0.00004422824,0.0006583653,0.00001268117,0.000008482404,0.00001181641,0.00001289035,0.9924353,0.0001768676,0.002205336,0.003512996,0.0001898648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03333342,0.0003737004,0.9554419,0.004210314,0.0003162175,0.00023443,2.890431e-7,0.000470847,0.005618879],"genre_scores_gemma":[0.9424351,0.00001200253,0.05380033,0.001324793,0.0001532045,0.00002917645,0.0000014818,0.000008925181,0.002234932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9678326,"threshold_uncertainty_score":0.5300537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004611646449268803,"score_gpt":0.2233223560856747,"score_spread":0.2187107096364059,"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."}}