{"id":"W2098374802","doi":"10.1109/icdcs.2011.49","title":"One More Weight is Enough: Toward the Optimal Traffic Engineering with OSPF","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Open Shortest Path First; Computer science; Traffic engineering; Maximization; Routing protocol; Mathematical optimization; Computer network; Routing (electronic design automation); Set (abstract data type); Distributed computing; Link-state routing protocol; Mathematics","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.00201917,0.0007328106,0.0008011257,0.0006833399,0.0005397268,0.001090644,0.0008131837,0.0008054717,0.0004847137],"category_scores_gemma":[0.005209541,0.0004007404,0.0003695197,0.0006674407,0.001724085,0.003311519,0.00154982,0.001721199,0.0001828409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007682487,"about_ca_system_score_gemma":0.001045129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006940008,"about_ca_topic_score_gemma":0.0005759984,"domain_scores_codex":[0.9989728,0.0003928301,0.00003588042,0.0001016746,0.0004010413,0.00009581863],"domain_scores_gemma":[0.9989948,0.0004241662,0.000119702,0.0002312549,0.0001780133,0.0000521008],"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.0001336705,0.0001542941,0.0006515498,0.00007438382,0.00004388051,0.0001049098,0.0001187243,0.6522914,0.01218243,0.2236726,0.001780195,0.1087919],"study_design_scores_gemma":[0.00001350375,0.00003862569,0.00009818087,0.00001222955,0.000008516352,0.00003828419,0.00002539792,0.84631,0.003320407,0.1487107,0.001413314,0.00001074899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0354804,0.0002724753,0.9610273,0.0005104385,0.00003231051,0.0000226053,0.00001418958,0.0001155904,0.002524746],"genre_scores_gemma":[0.6855894,0.0006699034,0.3116992,0.0002258414,0.0001181307,0.00007119991,0.00004827782,0.0001147755,0.001463237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00201917,"threshold_uncertainty_score":0.01067853,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01844667453700867,"score_gpt":0.1805889414630052,"score_spread":0.1621422669259965,"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."}}