{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000393424,0.0001583466,0.000235568,0.0004808852,0.0000381741,0.0001415549,0.001533505,0.0001645965,0.00004619193],"category_scores_gemma":[0.0003215529,0.0001420289,0.0001700828,0.0001510327,0.0001046639,0.0005042678,0.0001351731,0.0003107176,0.0000196003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001832876,"about_ca_system_score_gemma":0.0001512425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.937731e-7,"about_ca_topic_score_gemma":0.00001219674,"domain_scores_codex":[0.9983738,0.00003735644,0.0007826963,0.000238384,0.0003287109,0.0002390366],"domain_scores_gemma":[0.9978792,0.0001939683,0.0007301313,0.0001863937,0.0009442623,0.00006602464],"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.000180663,0.0001792295,0.0004170397,0.000005799435,0.0001690305,0.00003126431,0.0002009282,0.0121011,0.0006606602,0.05234952,0.002751733,0.930953],"study_design_scores_gemma":[0.00523175,0.000586057,0.00004566598,0.0001761401,0.00001065624,0.0008644256,0.00007256497,0.8396335,0.00469083,0.001144263,0.1473313,0.0002129151],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007856717,0.00001105834,0.9566986,0.01244851,0.0008779846,0.02164244,0.000003318481,0.000204507,0.0002568609],"genre_scores_gemma":[0.8744423,0.000001279913,0.1053431,0.0003360616,0.0008056225,0.01888967,0.00000132783,0.00001187282,0.0001688484],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9307401,"threshold_uncertainty_score":0.5791769,"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."}}