{"id":"W2073814030","doi":"10.1016/j.comnet.2007.01.021","title":"Achieving optimal revenues in dynamically priced network services with QoS guarantees","year":2007,"lang":"en","type":"article","venue":"Computer Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quality of service; Revenue; Computer network; Bandwidth (computing); Heuristic; Bandwidth allocation; Path (computing); Service (business); Mathematical optimization; Distributed computing; Business","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.0009368875,0.0003317582,0.0004096082,0.0001206325,0.0001785719,0.000291093,0.001320008,0.000170681,0.000003983033],"category_scores_gemma":[0.000002424974,0.0002904091,0.00008551993,0.0009358933,0.00006537564,0.0004687577,0.0003548131,0.0005104768,0.00001791692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006212264,"about_ca_system_score_gemma":0.00003899409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001146548,"about_ca_topic_score_gemma":0.00023507,"domain_scores_codex":[0.997382,0.0001277672,0.0005144521,0.0006923524,0.0003183329,0.0009650838],"domain_scores_gemma":[0.9985268,0.0003727722,0.0002021979,0.0006368604,0.00008788008,0.0001735028],"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.00008796227,0.00005951785,0.01013048,0.00001518632,0.00003727192,0.0001768718,0.0002491126,0.6740222,0.000002495573,0.004450158,0.0004986987,0.3102701],"study_design_scores_gemma":[0.000823692,0.0001765869,0.04486615,0.0003623921,0.00001092714,0.00005230849,0.000009409831,0.9509518,6.511628e-7,0.00007453429,0.002306564,0.0003650335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08112609,0.001096119,0.9154224,0.000327955,0.001083626,0.0003133478,3.455353e-7,0.0003550086,0.0002751491],"genre_scores_gemma":[0.8467084,0.00004587093,0.1496022,0.001246129,0.002295721,0.00001532222,0.000009430642,0.00002641583,0.00005053267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7658202,"threshold_uncertainty_score":0.9999548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.002567059222805904,"score_gpt":0.1890420383085572,"score_spread":0.1864749790857513,"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."}}