{"id":"W2159743267","doi":"10.1109/tnet.2007.896507","title":"Distributed Rate Allocation for Inelastic Flows","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; California Institute of Technology; University of Toronto; Purdue University; Yonsei University; National Science Foundation","keywords":"Mathematical optimization; Computer science; Heuristics; Limit (mathematics); Maximization; Utility maximization; Rate of convergence; Provisioning; Utility maximization problem; Convergence (economics); Mathematical economics; Mathematics; Economics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002640704,0.0005300539,0.0009485097,0.0005617319,0.0005475354,0.00146698,0.00187588,0.0008359844,0.001998711],"category_scores_gemma":[0.007147789,0.0004411757,0.0004955244,0.0006767426,0.001454287,0.002038176,0.001797255,0.001444521,0.0004041737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001443316,"about_ca_system_score_gemma":0.001225239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194547,"about_ca_topic_score_gemma":0.0009010521,"domain_scores_codex":[0.9981924,0.0005835302,0.0000874695,0.0004015108,0.0005332553,0.0002019629],"domain_scores_gemma":[0.9978573,0.0009876515,0.000217937,0.000454104,0.0003971858,0.00008584168],"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.0001018515,0.0000819737,0.0003233705,0.00004696238,0.00002014348,0.0000765799,0.0001214297,0.7570593,0.003949546,0.1821008,0.00116463,0.05495337],"study_design_scores_gemma":[0.00001524003,0.00001817166,0.0000418889,0.000003228206,0.000003407819,0.00002560041,0.00001070984,0.9653159,0.0008339509,0.03304097,0.0006854821,0.000005456159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01281369,0.00009893241,0.9846631,0.0001037406,0.00002311691,0.00002694006,0.000009384574,0.0001256213,0.002135484],"genre_scores_gemma":[0.7865798,0.000226339,0.2086766,0.0001094177,0.00005951417,0.0001238113,0.00005484616,0.00009107931,0.004078582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002640704,"threshold_uncertainty_score":0.01396555,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02166859084377924,"score_gpt":0.2531395800328795,"score_spread":0.2314709891891003,"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."}}