{"id":"W3039682304","doi":"10.1109/pimrc48278.2020.9217139","title":"Probabilistic Bounds on the End-to-End Delay of Service Function Chains using Deep MDN","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Queueing theory; Computer science; Probabilistic logic; End-to-end principle; Service (business); Task (project management); Function (biology); Layered queueing network; Statistical model; Mathematical optimization; Artificial intelligence; Computer network; Mathematics; Engineering","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.002552972,0.001266707,0.001234987,0.0008149026,0.0005122896,0.001193962,0.002023025,0.001547829,0.00164378],"category_scores_gemma":[0.01300699,0.0008428973,0.0007162723,0.0006170421,0.001472469,0.002395007,0.001504297,0.003075864,0.0002662112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003619793,"about_ca_system_score_gemma":0.002347273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01441918,"about_ca_topic_score_gemma":0.01239431,"domain_scores_codex":[0.9993705,0.0001815484,0.00002820623,0.0001548268,0.0001383094,0.0001265446],"domain_scores_gemma":[0.9918213,0.006307827,0.0005000894,0.0002806074,0.0007288571,0.0003612121],"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.00004372829,0.00001134959,0.0004122714,0.00001652472,0.000009728731,0.0000121622,0.00001273204,0.9922504,0.0002173332,0.003628405,0.000188478,0.003196784],"study_design_scores_gemma":[0.000001015318,0.000001940731,0.00002160409,0.000001503949,7.835201e-7,0.000001208282,0.000001013061,0.9983813,0.00006506498,0.001500824,0.00002274108,9.521286e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07367394,0.0005403212,0.9226712,0.0006668774,0.00006020012,0.00003674769,0.0002073962,0.0005357519,0.001607556],"genre_scores_gemma":[0.9368507,0.0003596403,0.05946907,0.000208892,0.0000616226,0.0001084362,0.0004419536,0.0001470587,0.002352646],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01441918,"threshold_uncertainty_score":0.02867049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04185064687958321,"score_gpt":0.2450419093100612,"score_spread":0.203191262430478,"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."}}