A Least Mean Loss Algorithm for Scheduling Traffic with Deadlines

ASIA unversity > 資訊學院 > 光電與通訊學系 > 博碩士論文 > Item 310904400/2712

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/2712

題名:	A Least Mean Loss Algorithm for Scheduling Traffic with Deadlines
作者:	Chu-Yin Huang
貢獻者:	Department of Photonics and Communication Engineering
關鍵詞:	uality of service;QoS;Real-time traffic;Scheduling policy;least mean packet loss algorithm;LMPL
日期:	2008
上傳時間:	2009-11-16 08:04:18 (UTC+0)
出版者:	Asia University
摘要:	In this thesis we study the problem of scheduling multiple real-time streams with deadlines over a shared wireless channel. We propose to schedule the packets from the queues based on a least mean packet loss (LMPL) policy. The computation on the number of mean lost packets takes into account the transmission errors of respective users and the deadlines of their head of line (HOL) packets. A recursive algorithm is developed to conduct the computation. Examples show that the proposed policy can obtain less lost packets than the earliest deadline first (EDF) or feasible earliest deadline first (FEDF) policy. We also modify the algorithm so that it can be applied to Rayleigh fading channel based on finite state Markov chain (FSMC) model. With the FSMC model, the LMPL algorithm presumes future channel conditions based on the state transition probabilities associated with the FSMC model. Thus, the modified version is more suitable for practical applications.
顯示於類別:	[光電與通訊學系] 博碩士論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
	0Kb	Unknown	577	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.