{"id":"W2156865683","doi":"10.1504/ijipt.2005.007555","title":"Traffic driven multiple constraint-optimisation for QoS routing","year":2005,"lang":"en","type":"article","venue":"International Journal of Internet Protocol Technology","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quality of service; Routing (electronic design automation); Constraint (computer-aided design); Mathematical optimization; Path (computing); Distributed computing; Computer network; 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.001587972,0.0009044084,0.0006713392,0.0006727999,0.0005969176,0.001059962,0.001129346,0.001070439,0.003020184],"category_scores_gemma":[0.005255534,0.0004347724,0.0007554917,0.001253195,0.0009053262,0.00110259,0.001067752,0.001676148,0.0003870447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237178,"about_ca_system_score_gemma":0.001197174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003831186,"about_ca_topic_score_gemma":0.003097284,"domain_scores_codex":[0.9991981,0.0003198211,0.00003231304,0.00008286203,0.000295059,0.00007181636],"domain_scores_gemma":[0.9981535,0.001319442,0.0001340788,0.00009137121,0.0002572628,0.00004429405],"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.00003076113,0.00001738836,0.0001319395,0.00004748288,0.00001559578,0.00003710865,0.00002494117,0.9488489,0.001463445,0.02560088,0.0007753341,0.02300627],"study_design_scores_gemma":[0.000004543348,0.000007078567,0.00001926179,0.000002771145,0.000001713399,0.00000837786,0.000002242336,0.994034,0.0003528461,0.00501138,0.0005524016,0.000003369045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004287114,0.00009336311,0.9927654,0.0001165425,0.00002499803,0.00003229387,0.00002375335,0.0001091702,0.002547292],"genre_scores_gemma":[0.2899292,0.0003279673,0.7043867,0.0001572979,0.00007413302,0.0003226314,0.0001828085,0.0002178331,0.004401467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003831186,"threshold_uncertainty_score":0.01010358,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01410466112965372,"score_gpt":0.2885978633375276,"score_spread":0.2744932022078739,"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."}}