Providing Quality of Service for Streaming Applications in Evolved 3G Networks

• Main Author: Eriksson, Jonas
• Format: Others
• Language: English
• Published: Linköpings universitet, Institutionen för systemteknik 2004
• Subjects: Reglerteknik; UMTS; WCDMA; HSDPA; HS-DSCH; QoS; Streaming; Scheduling; Automatic control
• Online Access: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2177

The third generation, 3G, mobile telephone systems are designed for multimedia communication and will offer us similar services as in our stationary computers. This will involve large traffic loads, especially in the downlink direction, i.e. from base station to terminal. To improve the downlink capacity for packet data services a new concept is included in evolved 3G networks. The concept is called High Speed Data Packet Access, HSDPA, and provides peak bit rates of 14 Mbps. HSDPA uses a so-called best effort channel, i.e. it is developed for services that do not require guaranteed bit rates. The channel is divided in time between the users and a scheduling algorithm is used to allocate the channel among them. Streaming is a common technology for video transmission over the Internet and with 3G it is supposed to become popular also in our mobiles. Streaming generates lots of data traffic in the downlink direction and it would thus be satisfying to make use of the high bit rates HSDPA provides. The problem is that streaming requires reasonable stable bit rates, which is not guaranteed using HSDPA. The aim of this study is to modify the scheduling algorithms to prioritise streaming over web users and provide streaming Quality of Service, QoS. QoS is the ability to guarantee certain transmission characteristics. The results of the study show that it is hard to improve the streaming capacity by modifications of the scheduling. Of course, a consequence is that the web user throughput is decreased and to avoid this, new users have to be rejected by the admission control.The solution is to prioritise the streaming users both in the scheduling algorithm and in the admission control, i.e. when the system is nearly full new web users are rejected. By doing so the results are significantly improved.