{"id":"W2021080064","doi":"10.1109/iccnc.2013.6504227","title":"A queueing theoretic model for opportunistic network coding","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Network packet; Linear network coding; Queueing theory; Computer network; Coding (social sciences); Markov process; Markov chain; Markovian arrival process; Point process; Discrete time and continuous time; Real-time computing; 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.001566018,0.0009608682,0.0009112495,0.0008372439,0.001015761,0.002082479,0.002400603,0.001699529,0.004358757],"category_scores_gemma":[0.004365923,0.0005654174,0.0006302074,0.001199628,0.001724126,0.002849424,0.001282625,0.001597877,0.0006730984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003543366,"about_ca_system_score_gemma":0.002363767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01227641,"about_ca_topic_score_gemma":0.007200984,"domain_scores_codex":[0.9987771,0.0004073535,0.00004660745,0.00017497,0.0003517831,0.0002421885],"domain_scores_gemma":[0.9979122,0.001304534,0.0002097143,0.0001492883,0.0003034647,0.0001207741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004242492,0.00005344253,0.0003102004,0.00005575767,0.00001600888,0.0003441456,0.000229631,0.3974472,0.001585614,0.5945855,0.001609002,0.003721145],"study_design_scores_gemma":[0.00001721025,0.00002068163,0.00007238271,0.000007930071,0.000007416359,0.000076529,0.00004536797,0.924711,0.0001601693,0.07308221,0.00178515,0.00001401751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02606547,0.000490493,0.9526523,0.001036801,0.0001698464,0.0001622888,0.0003714205,0.000224125,0.01882724],"genre_scores_gemma":[0.9140206,0.0009785964,0.06383669,0.0003800012,0.0002438946,0.0005785387,0.0002437936,0.00007740696,0.01964043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01227641,"threshold_uncertainty_score":0.02570903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1354324222664618,"score_gpt":0.330710470689993,"score_spread":0.1952780484235313,"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."}}