Sussex Research Online: No conditions. Results ordered -Date Deposited. http://sro.sussex.ac.uk/ http://sro.sussex.ac.uk/images/sitelogo.png Sussex Research Online: No conditions. Results ordered -Date Deposited. http://sro.sussex.ac.uk/ Thu, 23 Nov 2023 12:21:40 +0000 Thu, 23 Nov 2023 12:21:40 +0000 en Thu, 22 Jul 2021 15:41:38 +0100 SCDP: systematic rateless coding for efficient data transport in data centres http://sro.sussex.ac.uk/id/eprint/100696/ http://sro.sussex.ac.uk/id/eprint/100696/ Alasmar, Mohammed, Parisis, George and Crowcroft, Jon (2021) SCDP: systematic rateless coding for efficient data transport in data centres. IEEE/ACM Transactions on Networking, 29 (6). pp. 2723-2736. ISSN 1063-6692 Thu, 04 Feb 2021 08:46:41 +0000 Internet traffic volumes are not Gaussian - they are log-normal: an 18-year longitudinal study with implications for modelling and prediction http://sro.sussex.ac.uk/id/eprint/96912/ http://sro.sussex.ac.uk/id/eprint/96912/ Alasmar, Mohammed, Clegg, Richard, Zakhleniuk, Nickolay and Parisis, George (2021) Internet traffic volumes are not Gaussian - they are log-normal: an 18-year longitudinal study with implications for modelling and prediction. IEEE/ACM Transactions on Networking, 29 (3). pp. 1266-1279. ISSN 1063-6692 Wed, 01 Jul 2020 07:55:16 +0100 A partitioning approach to RFID identification http://sro.sussex.ac.uk/id/eprint/92217/ http://sro.sussex.ac.uk/id/eprint/92217/ Su, Jian, Liu, Alex X, Sheng, Zhengguo and Chen, Yongrui (2020) A partitioning approach to RFID identification. IEEE/ACM Transactions on Networking, 28 (5). pp. 2160-2173. ISSN 1063-6692 Mon, 06 Feb 2012 18:36:11 +0000 A Dynamic Call Admission Policy for Precision QoS Guarantee Using Stochastic Control for Mobile Wireless Networks http://sro.sussex.ac.uk/id/eprint/17335/ http://sro.sussex.ac.uk/id/eprint/17335/ Wu, Si, Wong, K Y M and Li, Bo (2002) A Dynamic Call Admission Policy for Precision QoS Guarantee Using Stochastic Control for Mobile Wireless Networks. IEEE/ACM Transactions on Networking, 10 (2). pp. 257-271. ISSN 1063-6692