{"id":"W1852912980","doi":"10.1109/ccece.1995.528067","title":"A simple upper bound for blocking probabilities in large multi-rate loss networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; McGill University","funders":"","keywords":"Blocking (statistics); Upper and lower bounds; Computer science; Computation; Gaussian; Simple (philosophy); Routing (electronic design automation); Laplace transform; Mathematical optimization; Algorithm; Topology (electrical circuits); Mathematics; Computer network","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.002993118,0.00176708,0.001215662,0.002177838,0.0008864888,0.002300827,0.002286553,0.00161737,0.005235917],"category_scores_gemma":[0.01884998,0.0006984187,0.000509388,0.001460105,0.00267563,0.003964182,0.002058893,0.002874888,0.001430791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001432314,"about_ca_system_score_gemma":0.000705654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113757,"about_ca_topic_score_gemma":0.001088912,"domain_scores_codex":[0.9980421,0.0004065978,0.00005299024,0.000209661,0.001053367,0.0002352743],"domain_scores_gemma":[0.9895331,0.007648203,0.0005805025,0.0009087893,0.0009438224,0.0003856096],"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.000212554,0.0001862118,0.001898323,0.0004934293,0.00008231551,0.0004347349,0.0002927778,0.6142085,0.02229867,0.2732595,0.004908314,0.08172472],"study_design_scores_gemma":[0.00001602501,0.0000461075,0.0007281969,0.00006337509,0.00003162721,0.0002244833,0.00001913818,0.8671342,0.003553533,0.1249746,0.003162344,0.00004634357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02507153,0.00307268,0.9601087,0.0005215101,0.000168576,0.00006595829,0.000112736,0.0005635866,0.01031472],"genre_scores_gemma":[0.8305032,0.005081576,0.1561887,0.0004162039,0.0007889711,0.0003185229,0.0002231153,0.0003154443,0.006164316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005235917,"threshold_uncertainty_score":0.01751584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02302673483871203,"score_gpt":0.24719529561314,"score_spread":0.224168560774428,"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."}}