{"id":"W23113228","doi":"","title":"A framework for performance characterization and enhancement of the OSPF routing protocol","year":2005,"lang":"en","type":"article","venue":"Iranian Journal of Public Health","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Open Shortest Path First; Computer science; Distributed computing; Routing protocol; Dijkstra's algorithm; Computer network; Shortest path problem; Link-state routing protocol; Distance-vector routing protocol; Routing Information Protocol; Hazy Sighted Link State Routing Protocol; Interior gateway protocol; Routing (electronic design automation); Theoretical computer science","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.002435377,0.00007430196,0.0002085043,0.00007466196,0.0001412128,0.0001024132,0.0004259463,0.00003340877,0.000008467729],"category_scores_gemma":[0.0001186844,0.00004820506,0.00007901639,0.0002129083,0.00002280576,0.0004500292,0.00004916921,0.0001732492,4.768719e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000691784,"about_ca_system_score_gemma":0.0003179193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.034326e-7,"about_ca_topic_score_gemma":0.000002731188,"domain_scores_codex":[0.9986045,0.0001130465,0.0006817359,0.0001071318,0.0002601022,0.0002334742],"domain_scores_gemma":[0.9985217,0.00004872272,0.0009886634,0.0001084278,0.0002293845,0.0001031031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000142288,0.0001638526,0.00211825,0.0002218996,0.00005166386,3.458564e-7,0.01361672,0.0001397659,0.0003338944,0.1446512,0.00006403367,0.8386242],"study_design_scores_gemma":[0.001283363,0.001133455,0.01789338,0.0009470065,0.00001062764,0.00007010806,0.0002500087,0.9373518,0.0011448,0.00006893472,0.03965032,0.0001961926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.129084,0.00001057091,0.8584501,0.009582769,0.0000973993,0.002758595,5.987963e-7,0.000004800434,0.00001114034],"genre_scores_gemma":[0.9607925,0.000005118632,0.03800316,0.000750405,0.0002283763,0.0001871696,2.521881e-7,0.000004506115,0.000028465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.937212,"threshold_uncertainty_score":0.1965745,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04087797630435569,"score_gpt":0.3121228002804037,"score_spread":0.271244823976048,"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."}}