{"id":"W1664656711","doi":"10.1109/nca.2001.962553","title":"Limited scope probing: a distributed approach for QoS-based routing","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Unicast; Computer science; Computer network; Open Shortest Path First; Distributed computing; Static routing; Link-state routing protocol; Policy-based routing; Dynamic Source Routing; Equal-cost multi-path routing; Geographic routing; Routing protocol; Routing table; Routing Information Protocol; Routing (electronic design automation); Scope (computer science); Multicast","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.0002177688,0.000141021,0.0001609032,0.00004919096,0.0001816122,0.0002004538,0.0005370803,0.00006342732,0.00002980091],"category_scores_gemma":[0.00005214163,0.0001195536,0.00009105007,0.0004227039,0.00002499369,0.0001869525,0.00004978117,0.00009037306,0.00002335572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003043589,"about_ca_system_score_gemma":0.00002900773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002281016,"about_ca_topic_score_gemma":9.761276e-7,"domain_scores_codex":[0.998812,0.00004054528,0.000218349,0.0004007617,0.0001572254,0.0003711859],"domain_scores_gemma":[0.9991868,0.0001553516,0.00007367258,0.000372587,0.0001067263,0.0001048905],"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.00004383878,0.0007681018,0.0002160569,0.00005968656,0.00007713824,0.000009767809,0.0002860131,0.06423765,0.0003351634,0.189604,0.06022081,0.6841418],"study_design_scores_gemma":[0.001049514,0.00007185899,0.00002015675,0.00001206945,0.000008107965,0.000003280698,0.000009134336,0.9934489,0.0001949442,0.00004012486,0.004972311,0.000169615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004173364,0.0001187844,0.9923968,0.00163969,0.0001582058,0.0005482835,0.000004147339,0.0006099714,0.00410676],"genre_scores_gemma":[0.8604065,0.000001449602,0.1379989,0.0006113149,0.0001433214,0.0001500366,0.00002249598,0.000009351572,0.0006565828],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9292113,"threshold_uncertainty_score":0.4875255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0313930151556827,"score_gpt":0.2189796806664086,"score_spread":0.1875866655107259,"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."}}