{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109444,0.001477949,0.0008906581,0.002048052,0.0008519081,0.002135059,0.001558175,0.001777653,0.006342791],"category_scores_gemma":[0.002664774,0.0004337615,0.0009610211,0.002190941,0.003110297,0.002850431,0.001295532,0.003246312,0.0006625513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002754071,"about_ca_system_score_gemma":0.001677246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003940598,"about_ca_topic_score_gemma":0.002500901,"domain_scores_codex":[0.9987693,0.0005646333,0.00004114846,0.0002015162,0.0003354814,0.00008773265],"domain_scores_gemma":[0.9986266,0.0009892645,0.00008880171,0.00007734469,0.0001597736,0.00005825303],"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.000006356992,0.00002237452,0.00006484231,0.00008293449,0.00001550454,0.00005118478,0.00003946663,0.09484909,0.000334215,0.8920727,0.002047274,0.01041408],"study_design_scores_gemma":[0.00001103508,0.00002804837,0.00007244528,0.00002800421,0.000010439,0.0000622665,0.00004098714,0.2188485,0.0001919672,0.7663675,0.01432589,0.00001291114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002030248,0.001384098,0.9763703,0.002411613,0.0002210919,0.00004670373,0.0001035632,0.00005946806,0.01737292],"genre_scores_gemma":[0.4218265,0.01404125,0.5242404,0.002563455,0.002897167,0.0008841267,0.0005522091,0.0002485064,0.0327465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006342791,"threshold_uncertainty_score":0.02121878,"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."}}