{"id":"W1999429894","doi":"10.1117/12.482435","title":"<title>Competitive game theoretic optimal routing in optical networks</title>","year":2002,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Provisioning; Service provider; Computer science; Game theory; Profit (economics); Bandwidth (computing); The Internet; Bandwidth allocation; Telecommunications service; Profitability index; Differentiated services; Telecommunications; Quality of service; Service (business); Business; Microeconomics; Economics; World Wide Web; Marketing; Finance","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.0006909361,0.0005931061,0.000613802,0.0003005101,0.0005585345,0.001965186,0.0008172955,0.001143174,0.006524972],"category_scores_gemma":[0.001713344,0.000263445,0.0004652486,0.0006840097,0.001391488,0.001901226,0.0006271277,0.001224732,0.000818965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002753542,"about_ca_system_score_gemma":0.001428497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008577233,"about_ca_topic_score_gemma":0.006425222,"domain_scores_codex":[0.9995016,0.000251324,0.00001071643,0.00004542666,0.0001152504,0.00007565649],"domain_scores_gemma":[0.9993099,0.0004857139,0.00003769973,0.00002113541,0.0001003682,0.00004522151],"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.000102598,0.0001139929,0.0003961188,0.0001546879,0.00003167714,0.000177556,0.0001138088,0.4538812,0.001904986,0.4988037,0.02287489,0.02144483],"study_design_scores_gemma":[0.00002812948,0.00006147048,0.0002164839,0.00003899395,0.00001343426,0.00004885492,0.00008210111,0.8368211,0.0003848888,0.1493314,0.0129501,0.00002291139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06716205,0.005038388,0.717868,0.01039064,0.0020551,0.0003443578,0.0004066603,0.0002478537,0.196487],"genre_scores_gemma":[0.8488787,0.006182246,0.0784772,0.001413244,0.000658134,0.0003353667,0.0002614727,0.000165177,0.06362838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008577233,"threshold_uncertainty_score":0.02182823,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008182895876926935,"score_gpt":0.2066802644446529,"score_spread":0.1984973685677259,"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."}}