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

First Page		Document Content
Date: 2009-06-22 10:40:00 Stochastic processes Mathematical sciences Scheduling algorithms Markov models Operations research Network coding Queueing model Throughput Packet switching Statistics Network performance Probability and 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}@imperial Add to Reading List Source URL: san.ee.ic.ac.uk Download Document from Source Website File Size: 207,63 KB Share Document on Facebook

	A Queueing Network Model of Patient Flow in an Accident and Emergency Department S.W.M. Au-Yeung, P.G. Harrison and W.J. Knottenbelt Department of Computing Imperial College London, SW7 2AZ, UK August 15, 2006 DocID: 1t2mI - View Document
	1 A Fluid Model for Layered Queueing Networks Mirco Tribastone Abstract—Layered queueing networks are a useful tool for the performance modeling and prediction of software systems that exhibit complex characteristics DocID: 1t0rh - View Document
	1 Multi-RAID Queueing Model with Zoned Disks 1 Soraya Zertal1 and Peter Harrison2 DocID: 1sYYH - View Document
	PASM 2004 Preliminary Version Calibration of a Queueing Model of RAID Systems Peter G. Harrison a,1 Soraya Zertal b,2 a DocID: 1sSdg - View Document
	1 Optimal Throughput-Delay Scaling in Wireless Networks – Part I: The Fluid Model Abbas El Gamal, James Mammen, Balaji Prabhakar, and Devavrat Shah DocID: 1rroQ - View Document