{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002422059,0.001164973,0.001903548,0.0009197886,0.001080416,0.00304064,0.001978476,0.001391542,0.003210517],"category_scores_gemma":[0.009922992,0.001071805,0.0003849506,0.001679266,0.002018277,0.002979568,0.00217045,0.001736117,0.0003646116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002371584,"about_ca_system_score_gemma":0.002255788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003113053,"about_ca_topic_score_gemma":0.003064143,"domain_scores_codex":[0.9985282,0.0004727518,0.00004131423,0.0001306311,0.000272919,0.0005541316],"domain_scores_gemma":[0.9959316,0.002794829,0.0003427856,0.0001877161,0.0003659582,0.0003772593],"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.0007551814,0.0002090043,0.0006620231,0.0001377945,0.00004125528,0.0003690504,0.0001288802,0.7354354,0.005489411,0.2251131,0.003763996,0.02789494],"study_design_scores_gemma":[0.00006601623,0.00003755492,0.0001185318,0.000007894281,0.00001190709,0.00005235359,0.00003788749,0.9078196,0.001048857,0.09035199,0.0004353848,0.00001204294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4340941,0.0008441092,0.5399948,0.002444823,0.0002407446,0.000156133,0.0002773188,0.0006609976,0.02128698],"genre_scores_gemma":[0.979638,0.0002168269,0.0181972,0.00005978175,0.00007475007,0.00002919429,0.00003297082,0.00007723425,0.001674108],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003210517,"threshold_uncertainty_score":0.01720709,"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."}}