{"id":"W62155812","doi":"","title":"Fair Matching Algorithm: Fixed-Length Frame Scheduling in All-Photonic Networks.","year":2006,"lang":"en","type":"article","venue":"","topic":"Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scheduling (production processes); Bottleneck; Proportionally fair; Photonics; Distributed computing; Matching (statistics); Round-robin scheduling; Dynamic priority scheduling; Algorithm; Mathematical optimization; Topology (electrical circuits); Computer network; Mathematics; Quality of service","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":[],"consensus_categories":[],"category_scores_codex":[0.0001661023,0.0002478865,0.0002695748,0.0001443188,0.0000361474,0.00007393157,0.0003008218,0.0003112546,0.00008084917],"category_scores_gemma":[0.00001606543,0.0002445142,0.00006470739,0.0004213574,0.00004778906,0.0001905273,0.0001116176,0.0006829384,0.00008042302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001388258,"about_ca_system_score_gemma":0.000006924512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001314838,"about_ca_topic_score_gemma":0.0001732117,"domain_scores_codex":[0.9985244,0.00001278288,0.0003615718,0.0002658357,0.000153355,0.0006819983],"domain_scores_gemma":[0.9994609,0.0001311838,0.00002108674,0.0003243716,0.00001417415,0.00004825886],"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.000001175718,0.00002178205,0.00045194,0.00001427036,0.00001716768,0.0000247567,0.00001405663,0.9716803,0.0001865833,0.009301354,0.0004577835,0.01782884],"study_design_scores_gemma":[0.0002174091,0.00001440706,0.0008244452,0.00004800633,0.000006880668,0.000005540004,0.00009798107,0.9892752,0.0005342322,0.007485072,0.001173687,0.0003171123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5766391,0.001618893,0.4027368,0.0002332683,0.0004802149,0.0002822598,0.000002122047,0.004460742,0.01354658],"genre_scores_gemma":[0.7562082,0.0001646522,0.2432809,0.00006200351,0.0001306489,0.00002416717,0.000009168567,0.00005195468,0.00006832347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1795691,"threshold_uncertainty_score":0.9971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007611355605453858,"score_gpt":0.2124714080874443,"score_spread":0.2048600524819905,"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."}}