{"id":"W2150523008","doi":"10.1109/broadnets.2004.2","title":"A call admission control for service differentiation and fairness management in WDM grooming networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Traffic grooming; Bandwidth (computing); Markov decision process; Markov process; Call Admission Control; Heuristic; Resource allocation; Wireless network; Bandwidth allocation; Resource management (computing); Distributed computing; Admission control; Differentiated services; Markov chain; Quality of service; Wavelength-division multiplexing; Wireless; Telecommunications","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.001874103,0.0004360972,0.0005170945,0.0004018205,0.0008718532,0.001161446,0.0009382376,0.0007640736,0.00077808],"category_scores_gemma":[0.00413241,0.0002198016,0.0002803836,0.0003534807,0.0009771023,0.0009782326,0.0007158373,0.0007270693,0.0001040183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00132869,"about_ca_system_score_gemma":0.00162527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003774926,"about_ca_topic_score_gemma":0.002677299,"domain_scores_codex":[0.9989374,0.0004575481,0.00002494789,0.00009292206,0.0003312349,0.0001558506],"domain_scores_gemma":[0.9988393,0.0006715101,0.0001119561,0.00009167323,0.0002002371,0.00008528691],"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.0002760451,0.0002114471,0.001038269,0.00005348189,0.00004247191,0.000150423,0.000200873,0.758603,0.02045674,0.1269949,0.001277185,0.09069514],"study_design_scores_gemma":[0.000007680801,0.00001572532,0.00008333628,0.000001926817,0.000004473175,0.00001289846,0.000005504744,0.9926886,0.001202987,0.00563308,0.000338714,0.000005076066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1155705,0.0005958286,0.8789815,0.000458736,0.00009770916,0.00009581756,0.00002662689,0.0002205224,0.003952923],"genre_scores_gemma":[0.9433547,0.0001511347,0.05482994,0.00008200274,0.00007558028,0.00005979753,0.00001788444,0.00001253727,0.001416451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003774926,"threshold_uncertainty_score":0.009911299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006392994042062746,"score_gpt":0.2107591438562688,"score_spread":0.2043661498142061,"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."}}