Combining opportunistic and size-based scheduling in wireless systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Combining opportunistic and size-based scheduling in wireless systems

Full text

Pdf (277 KB)

Source

International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems table of contents

Vancouver, British Columbia, Canada

SESSION: Scheduling and medium access control table of contents

Pages 323-332

Year of Publication: 2008

ISBN:978-1-60558-235-1

Authors

Pasi Lassila	TKK Helsinki University of Technology, Espoo, Finland
Samuli Aalto	TKK Helsinki University of Technology, Espoo, Finland

Sponsors

ACM: Association for Computing Machinery
SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 56, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454503.1454558 What is a DOI?

ABSTRACT

HSDPA/HDR systems allow the use of sophisticated opportunistic schedulers that can utilize information on instantaneous channel conditions. On the other hand, for elastic data traffic the size of the files can be used in size-dependent scheduling methods, e.g., the well known SRPT scheduler, to minimize the flow delays. In this paper, we consider the optimal use of both size and channel information for minimizing the flow delay. We derive several heuristics which utilize both types of information. In a static setting with two flows and two rates, the optimal policy can be constructed via dynamic programming and can be compared against the policies using exact size knowledge. In the dynamic setting (stochastically arriving flows with random sizes), extensive simulations have been performed to evaluate the performance of the schedulers under heavy traffic. In the symmetric setting, the differences between the schedulers are clearly visible, while in the asymmetric setting the dynamics are more complex. The results still show that significant gains can be achieved with additionally using size information.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. Aalto and P. Lassila. Impact of size-based scheduling on flow-level performance in wireless downlink data channels. In Proceedings of the 20th International Teletraffic Congress, pages 1096--1107, June 2007.
	2	F. Berggren and R. Jäntti. Asymptotically fair transmission scheduling over fading channels. IEEE Transactions on Wireless Communications, 3(1):326--336, Jan. 2004.
	3	T. Bonald. A score-based opportunistic scheduler for fading radio channels. In Proceedings of European Wireless, pages 283--292, Feb. 2004.
	4	T. Bonald. Flow-level performance analysis of some opportunistic scheduling algorithms. European Transactions on Telecommunications, 16(1):65--75, 2005.
	5	Thomas Bonald , Alexandre Proutière, Wireless downlink data channels: user performance and cell dimensioning, Proceedings of the 9th annual international conference on Mobile computing and networking, September 14-19, 2003, San Diego, CA, USA [doi>10.1145/938985.939020]
	6	Sem Borst, User-level performance of channel-aware scheduling algorithms in wireless data networks, IEEE/ACM Transactions on Networking (TON), v.13 n.3, p.636-647, June 2005 [doi>10.1109/TNET.2005.850215]
	7	Mark E. Crovella , Azer Bestavros, Self-similarity in World Wide Web traffic: evidence and possible causes, Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, p.160-169, May 23-26, 1996, Philadelphia, Pennsylvania, United States
	8	J. Holtzman. Asymptotic analysis of proportional fair algorithm. In Proceedings of IEEE PIMRC, volume 2, pages 33--37, Sept. 2001.
	9	Ming Hu , Junshan Zhang , John Sadowsky, Traffic aided opportunistic scheduling for wireless networks: algorithms and performance bounds, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.46 n.4, p.505-518, 15 November 2004 [doi>10.1016/j.comnet.2004.05.005]
	10	L. Kleinrock. Queueing systems, vol II: computer applications. John Wiley & Sons, first edition, 1976.
	11	S. Patil and G. de Veciana. Measurement-based opportunistic scheduling for heterogenous wireless systems. submitted to IEEE Transactions On Communications, Jan. 2006.
	12	R. Righter and J. Shanthikumar. Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probability in the Engineering and Informational Sciences, 3:323--333, 1989.
	13	L. E. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16:687--690, 1968.
	14	B. Tsybakov. File transmission over wireless fast fading downlink. IEEE Transactions on Information Theory, 48(8):2323--2337, Aug. 2002.
	15	Hans van den Berg , Remco Litjens , Joost Laverman, HSDPA flow level performance: the impact of key system and traffic aspects, Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems, October 04-06, 2004, Venice, Italy [doi>10.1145/1023663.1023713]
	16	P. Viswanath, D. Tse, and R. Laroia. Opportunistic beamforming using dumb antennas. IEEE Transactions on Information Theory, 48(6):1277--1294, jun 2002.
	17	S. F. Yashkov, Processor-sharing queues: some progress in analysis, Queueing Systems: Theory and Applications, v.2 n.1, p.1-17, June 1987 [doi>10.1007/BF01182931]