Approximate Analysis of a Round Robin Scheduling Scheme for Network Coding Omer H. Abdelrahman and Erol Gelenbe Department of Electrical and Electronic Engineering, Imperial College London, UK {oha06,e.gelenbe}@imperial - Erol Gelenbe - Document - PDFSEARCH.IO

First Page	Meta Content
	Approximate Analysis of a Round Robin Scheduling Scheme for Network Coding Omer H. Abdelrahman and Erol Gelenbe Department of Electrical and Electronic Engineering, Imperial College London, UK {oha06,e.gelenbe}@imperial Add to Reading List Document Date: 2009-06-22 10:40:00 Open Document File Size: 207,63 KB Share Result on Facebook City London / / / Facility Imperial College / / IndustryTerm oﬀer greater communications eﬃciency / analytical solution / forward packet network / forward network / equivalent ith server / equivalent server / ith server / eﬃcient network algorithms / / Organization European Union / Imperial College London / Erol Gelenbe Department of Electrical and Electronic Engineering / Annales de l’institut Henri Poincar / / Person Robin Scheduling / Omer H. Abdelrahman / Henri Poincar / / ProgrammingLanguage J / / ProvinceOrState North Carolina / / PublishedMedium IEEE Transactions on Information Theory / / Technology simulation / Quality of Service / eﬃcient network algorithms / / SocialTag Stochastic processes Mathematical sciences Scheduling algorithms Markov models Operations research Network coding Queueing model Throughput Packet switching Statistics

Approximate Analysis of a Round Robin Scheduling Scheme for Network Coding Omer H. Abdelrahman and Erol Gelenbe Department of Electrical and Electronic Engineering, Imperial College London, UK {oha06,e.gelenbe}@imperialAdd to Reading List