{"id":"W1999423211","doi":"10.1109/iwcmc.2012.6314312","title":"On-demand scheduling for concurrent multipath transfer under delay-based disparity","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"University of Toronto; Princeton University","keywords":"Computer science; Scheduling (production processes); Distributed computing; Multipath propagation; Network congestion; Computer network; Fair-share scheduling; Data transmission; Dynamic priority scheduling; Round-robin scheduling; Job shop scheduling; Real-time computing; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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.0007264069,0.0004765043,0.0005623531,0.0004536296,0.0008842347,0.0005920979,0.001300507,0.0002927905,0.001474514],"category_scores_gemma":[0.002155417,0.0002130961,0.0002895912,0.000493781,0.0004254938,0.0007767844,0.0009266682,0.0006273025,0.0001408941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001146194,"about_ca_system_score_gemma":0.001476644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004293595,"about_ca_topic_score_gemma":0.005174926,"domain_scores_codex":[0.9995655,0.00009357026,0.00002163308,0.00005679254,0.0001424325,0.0001199775],"domain_scores_gemma":[0.9989304,0.0004178695,0.000111655,0.0001665351,0.000237272,0.0001361294],"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.0009948625,0.0002702736,0.004078954,0.0001556257,0.00008564179,0.0004128631,0.000371124,0.645128,0.06595939,0.0369225,0.003435752,0.242185],"study_design_scores_gemma":[0.00003382564,0.00007841772,0.0002529589,0.000002695287,0.000009863737,0.00004611629,0.0000312556,0.9882085,0.006273006,0.003780261,0.001272548,0.00001055936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1998896,0.0001896276,0.7953646,0.0001781322,0.0001556212,0.0001252896,0.00007933645,0.0007677041,0.00324999],"genre_scores_gemma":[0.9319136,0.00008458861,0.0669001,0.00003300775,0.00005160413,0.00004350239,0.0000608232,0.00005781163,0.0008548624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004293595,"threshold_uncertainty_score":0.008537173,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02803234572313531,"score_gpt":0.267013599271884,"score_spread":0.2389812535487487,"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."}}