{"id":"W2116532947","doi":"10.1109/cdc.2004.1429320","title":"Call admission and fairness control in WDM networks with grooming capabilities","year":2004,"lang":"en","type":"article","venue":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Traffic grooming; Computer science; Computer network; Markov decision process; Bandwidth (computing); Fairness measure; Markov process; Heuristic; Wavelength-division multiplexing; Markov chain; Distributed computing; Admission control; Max-min fairness; Quality of service; Resource allocation; Throughput; Telecommunications; Mathematics","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.002905011,0.0006709344,0.0006639851,0.0005912495,0.001065175,0.001452545,0.001314711,0.0008346452,0.0006303588],"category_scores_gemma":[0.006721582,0.0003606526,0.000277496,0.0004859155,0.001666931,0.001498457,0.001257805,0.0007873309,0.00009806536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002004474,"about_ca_system_score_gemma":0.001452967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006939288,"about_ca_topic_score_gemma":0.00452642,"domain_scores_codex":[0.9984273,0.0006292262,0.00003767878,0.0001743646,0.0003993777,0.0003319791],"domain_scores_gemma":[0.9969613,0.001901584,0.0003959355,0.000169327,0.000345491,0.0002263765],"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.0003452813,0.0001274648,0.001161263,0.00003436395,0.00003434125,0.0001579005,0.0002007561,0.8968527,0.009575559,0.05458653,0.0005127292,0.03641101],"study_design_scores_gemma":[0.00001121798,0.00001717977,0.0001277943,0.000001477164,0.000005484124,0.00001026201,0.000008557887,0.991155,0.001004256,0.007476487,0.0001760123,0.000006145959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3114904,0.0008159602,0.6822153,0.0005315241,0.0001303828,0.00007984824,0.00004455937,0.0003140964,0.004377762],"genre_scores_gemma":[0.9810956,0.00009351425,0.01777452,0.00004153589,0.00005845296,0.00002891794,0.00001098393,0.00001020976,0.0008863235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006939288,"threshold_uncertainty_score":0.01536334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008983930256137496,"score_gpt":0.2168840848378102,"score_spread":0.2079001545816727,"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."}}