{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003681748,0.0007581821,0.001077052,0.0003284118,0.0002102682,0.0002132881,0.0004323431,0.0005764602,0.00004037667],"category_scores_gemma":[0.00030126,0.000616696,0.00009539081,0.0003808364,0.0004676287,0.0004287673,0.00004848189,0.0008574664,0.00003630653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002789363,"about_ca_system_score_gemma":0.0001154411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007929741,"about_ca_topic_score_gemma":0.0004725073,"domain_scores_codex":[0.9967327,0.00007107829,0.0007874524,0.0009050833,0.0004809816,0.001022745],"domain_scores_gemma":[0.9976692,0.0008215941,0.0001309496,0.0006888624,0.0002537085,0.000435643],"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.002554103,0.0002439661,0.002163873,0.0001605929,0.00014438,0.0003098321,0.0003551763,0.8178343,0.01074435,0.006158242,0.0006822368,0.158649],"study_design_scores_gemma":[0.02181539,0.001288841,0.004416874,0.001969795,0.0001156391,0.00009607551,0.0006619248,0.9520168,0.0007061544,0.01396987,0.001099083,0.001843578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5762863,0.001034855,0.4190416,0.0005174031,0.0006593028,0.001007402,0.00002831179,0.0006359923,0.0007887912],"genre_scores_gemma":[0.990172,0.001296371,0.007607658,0.0003767508,0.0001658955,0.000169031,0.000005246739,0.0000943087,0.0001127153],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4138857,"threshold_uncertainty_score":0.9996284,"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."}}