{"id":"W1657259300","doi":"","title":"A graph theoretical approach to traffic engineering and network control problem","year":2009,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Network traffic control; Robustness (evolution); Traffic engineering; Computer science; Traffic generation model; Mathematical optimization; Graph theory; Criticality; Multiprotocol Label Switching; Betweenness centrality; Network traffic simulation; Network planning and design; Internet traffic engineering; Network topology; Distributed computing; Topology (electrical circuits); Computer network; Mathematics; Quality of service","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.0003937568,0.0002560988,0.0002839705,0.00017861,0.0001055423,0.0003458023,0.0009662401,0.0001006513,0.0000185356],"category_scores_gemma":[0.00005467143,0.0002391942,0.00009482399,0.0003914254,0.00007723404,0.000244907,0.00007417753,0.0002562349,0.00001986723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003844638,"about_ca_system_score_gemma":0.00003637985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.302095e-7,"about_ca_topic_score_gemma":7.911196e-7,"domain_scores_codex":[0.9980974,0.00005357666,0.0003478578,0.0005890692,0.0004402641,0.0004718016],"domain_scores_gemma":[0.9989785,0.0002224393,0.00007109045,0.0002964278,0.0001579191,0.0002736501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002960448,0.00008563336,0.00002099486,0.000002834889,0.00005037077,0.00001606416,0.0000920124,0.2202501,0.00001887545,0.4890369,0.001901461,0.2884951],"study_design_scores_gemma":[0.001190076,0.0001464259,0.0008517072,0.00005116496,0.00001404866,0.0001219906,0.000008159945,0.9861286,0.000005060977,0.001644273,0.009501909,0.0003365785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06077753,0.0004007781,0.9180506,0.0113405,0.001728236,0.0007811955,0.000007508572,0.0008938462,0.006019795],"genre_scores_gemma":[0.9738501,0.00001763337,0.02374686,0.001674333,0.0005110234,0.0000571961,0.000004441394,0.00001288486,0.0001255703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9130725,"threshold_uncertainty_score":0.9754055,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004265228968429004,"score_gpt":0.2026859714419746,"score_spread":0.1984207424735455,"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."}}