NUST Institutional Repository

Earliest Deadline First & Best Effort Scheduling Algorithm (E-BES)

Show simple item record

dc.contributor.author Qasim Bilal Lone
dc.date.accessioned 2020-11-03T14:09:25Z
dc.date.available 2020-11-03T14:09:25Z
dc.date.issued 2006
dc.identifier.uri http://10.250.8.41:8080/xmlui/handle/123456789/9168
dc.description Supervisor: Dr. S.M.Hasan Zaidi en_US
dc.description.abstract Cellular telecommunication has evolved a great deal during the past decade. Service providers are shifting their focus from voice-oriented services to data oriented services. UMTS (Universal Mobile Telecommunications Service) is a third-generation (3G) broadband, packet-based transmission of text, digitized voice, video, and multimedia over cellular networks. In UMTS systems, Radio Network Controller (RNC) is key sub-system that is responsible for providing high Quality of Service to end- user. In this paper, our objective is to improve the scope of QoS in cellular systems by introducing packet scheduling at RNC. We propose scheduling algorithm, which exhibits substantial efficiency in terms of packet loss and starvation when compared to previous proposed algorithms (Time Division Scheduling and Code Division Scheduling). The underlying principal of proposed methodology works on dynamic burst generation performs scheduling on packets in queues and sends those packets early whose dead line is closest to expiry which results in decreased packet loss and reduced starvation. en_US
dc.publisher SEECS, National University of Sciences and Technology, Islamabad en_US
dc.subject Information Technology en_US
dc.title Earliest Deadline First & Best Effort Scheduling Algorithm (E-BES) en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

  • BS [440]

Show simple item record

Search DSpace


Advanced Search

Browse

My Account