{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121293,0.0004603009,0.0007311883,0.0007795878,0.0005719456,0.001015309,0.001791903,0.0008075347,0.0009990229],"category_scores_gemma":[0.002252664,0.0003145975,0.0003557349,0.0007557861,0.000957065,0.0020645,0.001398075,0.0008462568,0.0002839475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004261495,"about_ca_system_score_gemma":0.0004733363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004342774,"about_ca_topic_score_gemma":0.0005986365,"domain_scores_codex":[0.9991866,0.0002583798,0.00004142237,0.0001180513,0.0003455571,0.00005000458],"domain_scores_gemma":[0.998476,0.0006374562,0.0001606294,0.0003796517,0.0002476618,0.00009852577],"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.0003645566,0.000229006,0.002197064,0.0003996685,0.0001162382,0.0004244221,0.0006284048,0.1557575,0.09419713,0.08882825,0.004498368,0.6523595],"study_design_scores_gemma":[0.00008500893,0.0002807435,0.000850041,0.00003679404,0.00006428234,0.0008112657,0.00009779252,0.9163537,0.02250918,0.03996133,0.01888257,0.00006728454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006721794,0.0003570699,0.9912332,0.0001138806,0.00003880403,0.00004520774,0.00001122327,0.0004701097,0.001008674],"genre_scores_gemma":[0.3654199,0.0007993205,0.6302106,0.0001612007,0.000153762,0.0002336709,0.00008878075,0.00009532489,0.002837433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001791903,"threshold_uncertainty_score":0.006414652,"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."}}