{"id":"W1903226867","doi":"10.1109/ccece.2004.1347721","title":"Multicast routing with delay and delay variation constraints using genetic algorithm","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Multicast; Computer science; Routing (electronic design automation); End-to-end delay; Computer network; Distance Vector Multicast Routing Protocol; Algorithm; Quality of service; Genetic algorithm; Elmore delay; Distributed computing; Xcast; Propagation delay; Delay calculation","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.0001243428,0.0001115971,0.0001055094,0.0000400128,0.0001452836,0.0001503288,0.000144285,0.00004407474,0.000009745811],"category_scores_gemma":[0.000007618997,0.0000901791,0.00001605582,0.0001596763,0.0000751453,0.0002234229,0.00004721124,0.00007781303,0.000007404761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003613234,"about_ca_system_score_gemma":0.00009926497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007942453,"about_ca_topic_score_gemma":0.00001422085,"domain_scores_codex":[0.9991527,0.00002883758,0.0001561093,0.0002899518,0.0001501932,0.0002222417],"domain_scores_gemma":[0.999554,0.00005059245,0.0000589308,0.0001652511,0.00007552477,0.00009573235],"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.000003589417,0.00003195829,0.0003207397,0.000002036577,0.00002981361,0.00006575863,0.0004649657,0.05250015,0.0000945623,0.02517289,0.000001696157,0.9213119],"study_design_scores_gemma":[0.001078831,0.00005608191,0.002759485,0.00002294193,0.00001592004,0.0003997021,0.00002834395,0.9951377,0.00002779918,0.0003143569,0.00001473815,0.0001441173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05607032,0.00004850173,0.9430869,0.0002023198,0.00008689596,0.0001304505,5.892961e-7,0.0001203959,0.0002535851],"genre_scores_gemma":[0.5504309,0.000002095052,0.449372,0.0001422342,0.0000364873,0.000002106109,2.43508e-7,0.000003636963,0.00001032237],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9426376,"threshold_uncertainty_score":0.3677397,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01027900391409743,"score_gpt":0.2157875817093419,"score_spread":0.2055085777952444,"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."}}