• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for elektroniske systemer
  • View Item
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for elektroniske systemer
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Packet Scheduling Algorithms for Wireless Networks

Børve, Bjørn Hovland
Master thesis
Thumbnail
View/Open
348641_COVER01.pdf (102.3Kb)
348641_FULLTEXT01.pdf (5.430Mb)
URI
http://hdl.handle.net/11250/2369376
Date
2008
Metadata
Show full item record
Collections
  • Institutt for elektroniske systemer [1555]
Abstract
The evolution of services offered using communication technology has yielded a jungle of different services. Many of these services exhibits different QoS requirements; different requirements to delay, probability of packet-loss and throughput. Effectively this means they require different amounts of resources when handled in a network node. This thesis covers descriptions and simulations of four different scheduling algorithms deployed in a high-speed point-to-point radio-link scenario. The different algorithms examined in this thesis are the conventional First-In-First-Out (FIFO) algorithm, the Strict Priority (SP) queuing algorithm, the Deficit Round-Robin (DRR) algorithm and finally the Deficit Weighted Round-Robin (DWRR) algorithm. Theoretical presentations of each of the algorithms are followed by simulations which exhibits the characteristics of the different algorithms. Two of the mentioned algorithms (FIFO, DRR) does not offer capabilities of differentiation between different classified data-flows, while the two remaining algorithms (SP, DWRR) does. The simulations illustrates the advantages of deployment of scheduling algorithms capable of differentiating resource allocation with respect to the different QoS requirements of multiple data-flows. The simulation results reveals that when deployed in a high-speed point-to-point link, where low complexity is emphasized, the DWRR algorithm offers the most promising performances of the examined algorithms.
Publisher
Institutt for elektronikk og telekommunikasjon

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit