{"id":"W2169088364","doi":"10.1109/icc.1993.397416","title":"Fair-efficient call admission control policies for broadband networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Arbitration; Computer network; Blocking (statistics); Mathematical optimization; Throughput; Maximization; Nash equilibrium; Service (business); Scheme (mathematics); Admission control; Scalability; Markov decision process; Markov process; Operations research; Quality of service; Telecommunications; Mathematics; Law; Economics","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.001699902,0.0004910078,0.0004172221,0.0005914225,0.000663086,0.001260219,0.0007270239,0.0007356846,0.00185653],"category_scores_gemma":[0.005350707,0.0002798383,0.0003090615,0.0004206135,0.001129005,0.00111918,0.000778501,0.0007248758,0.0001975797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00219713,"about_ca_system_score_gemma":0.00195222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006714347,"about_ca_topic_score_gemma":0.005139989,"domain_scores_codex":[0.9989976,0.0003747359,0.00003225275,0.00008198758,0.0003113909,0.0002019491],"domain_scores_gemma":[0.9988316,0.0007502754,0.0001029923,0.00007622805,0.000178038,0.00006094215],"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.00008838965,0.00005523181,0.0002305249,0.00003474641,0.00001754058,0.00005136803,0.000115734,0.7720057,0.002602768,0.1864696,0.001328367,0.03700004],"study_design_scores_gemma":[0.00001000828,0.00001503986,0.00004280961,0.000003680077,0.000004168452,0.000007412736,0.000009766855,0.9661493,0.0003875419,0.0326464,0.0007199864,0.000003807084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03209918,0.0004269342,0.9605656,0.0002810579,0.0000547345,0.00007296386,0.00003028538,0.0002753191,0.006194024],"genre_scores_gemma":[0.9169911,0.0003522941,0.0785775,0.00007491574,0.00004869299,0.0001289851,0.00003194196,0.00003147381,0.003763182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006714347,"threshold_uncertainty_score":0.01594138,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008665451604703056,"score_gpt":0.2058626841515418,"score_spread":0.1971972325468387,"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."}}