{"id":"W2086785629","doi":"10.1016/j.peva.2011.10.001","title":"Optimal anticipative congestion control of flows with time-varying input stream","year":2011,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"European Social Fund; Ministerio de Ciencia e Innovación; Universidad Carlos III de Madrid; Eusko Jaurlaritza; European Commission; Comunidad de Madrid","keywords":"Computer science; Bottleneck; Network congestion; Flow control (data); Router; Probabilistic logic; Transmission (telecommunications); Computer network; Index (typography); Markov process; Markov chain; Markov decision process; Flow (mathematics); Mathematical optimization; Mathematics; Network packet; Telecommunications","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.000909062,0.0001431709,0.0002022081,0.000102911,0.0001034502,0.00002662459,0.0002823354,0.00005546902,0.0001644901],"category_scores_gemma":[0.0000355077,0.0001182766,0.00003348378,0.0002786046,0.00005682972,0.0008201829,0.00002803492,0.0001041426,0.00006584225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004534528,"about_ca_system_score_gemma":0.0001716668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008796651,"about_ca_topic_score_gemma":0.000003086582,"domain_scores_codex":[0.9985726,0.0001378751,0.0002810382,0.0002714878,0.0005187694,0.0002181916],"domain_scores_gemma":[0.998785,0.00007236785,0.0002369176,0.0003039547,0.0005448911,0.00005691847],"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.000344731,0.0001575569,0.00827161,0.00001869581,0.00009210939,0.00000164263,0.002746104,0.1999653,0.000736459,0.0009179116,0.00004458483,0.7867033],"study_design_scores_gemma":[0.001780715,0.000553304,0.02486488,0.00006796502,0.00007230819,0.000005434788,0.0000142623,0.9704735,0.001983525,0.00002549956,0.00001459403,0.0001440173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6842934,0.00006887518,0.3130107,0.00005991458,0.0001153275,0.0004072459,0.000001530139,0.00007605575,0.001966945],"genre_scores_gemma":[0.9866503,0.00001294616,0.01307887,0.00004801679,0.00005976583,0.00009037949,0.000008022569,0.000008046687,0.00004359867],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7865593,"threshold_uncertainty_score":0.4823181,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02923529351829863,"score_gpt":0.250301701071222,"score_spread":0.2210664075529233,"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."}}