M Tech Dissertations
Permanent URI for this collectionhttp://ir.daiict.ac.in/handle/123456789/3
Browse
Search Results
Item Open Access Fair downlink packet scheduling approach to support QoS in HSDPA environment(Dhirubhai Ambani Institute of Information and Communication Technology, 2007) Singhal, Deepti; Jotwani, Naresh D.Traditionally, only best-effort traffic is supported by packet switching networks, but newer applications need communication services that allow end client to transport data with performance guarantees given in terms of data transfer reliability, available bandwidth and delay bounds. The choice of the packet-scheduling algorithm to be used at switching nodes is very crucial to provide the Quality of Service, QoS.This work aims at designing a downlink packet scheduling approach to QoS provisioning in High Speed Downlink Packet Access, HSDPA, based UMTS networks. In UMTS a single logical channel is shared among multiple contending users. Besides better link utilization, scheduling disciplines seek to achieve fair allocation of this shared resource. However, these two criterions can potentially be in conflict. In this work a scheduling discipline, \Wireless Fair - High Speed Scheduling", is proposed, which addresses the above-mentioned conflict. The idea is to allocate the channel fairly among users, even during short time scales, according to their data rate requirements.
The proposed algorithm is compared with Adaptive Proportional Fair Algorithm, which provides fair distribution of channel bandwidth, proportional to the data rate requirements of users. Several experiments were conducted using simulation for comparing the performance of the algorithms in different scenarios. The results ensure that the proposed scheduling algorithm provides better link utilization, and long-term and short-term fairness among users even in heavy load conditions.
Item Open Access Packet scheduling algorithm to improve delay bounds in HSDPA(Dhirubhai Ambani Institute of Information and Communication Technology, 2007) Pradhan, Pratik; Jotwani, Naresh D.With tremendous growth in mobile subscribers in recent past and trend of accessing packet data services in wireless networks, 3GPP has introduced an enhancement to Universal Mobile Telecommunications System (UMTS) standard known as High Speed Downlink Packet Access (HSDPA) to provide high data rate services, especially in the downlink. The main focus of HSDPA concept is to increase peak data rates, improve Quality of Service (QoS) and enhance the spectral efficiency for downlink packet data traffic. HSDPA introduces new transport channel named High Speed-Downlink Shared Channel (HS-DSCH) in downlink that is shared among the users accessing packet data services. Scheduling of these users is one of the most challenging and interesting problem because of constantly varying state of the wireless channel. The problem is even worse when users require certain level of QoS and the transmission rate supported by wireless channel is also varying. The Exponential Scheduling Algorithm, proposed in literature, is a good candidate to provide bounded delays when QoS requirements are speci¯ed in terms of maximum tolerable delays, but the investigations in this thesis show that it fails to provide delay bounds when it is still possible with some trade-o® with system throughput and sometimes not even that. The thesis proposes Delay Sense-Exponential Scheduling Algorithm, a variant of Exponential Scheduling Algorithm, to improve on the delay bounds provided by Exponential algorithm. The simulation results ensure that the new proposed algorithm improves on providing delay bounds to the Real Time (RT) services simultaneously providing comparable throughput to Non-Real Time (NRT) services. The proposed algorithm is studied under wide range of scenarios including NRT, RT and mixture of NRT and RT services.