Loading…

Scheduling algorithm based on sender buffer backlog for real-time application in mobile packet networks

The demand for high-speed data communication and the use of real-time applications in mobile networks is becoming increasingly high and communication systems that specialise in downlink packet transfer are being developed and deployed. In these high-speed downlink packet networks, scheduling at the...

Full description

Saved in:
Bibliographic Details
Main Authors: Koto, H., Fukushima, M., Nomoto, S., Takahata, F.
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 157 Vol. 1
container_issue
container_start_page 151
container_title
container_volume 1
creator Koto, H.
Fukushima, M.
Nomoto, S.
Takahata, F.
description The demand for high-speed data communication and the use of real-time applications in mobile networks is becoming increasingly high and communication systems that specialise in downlink packet transfer are being developed and deployed. In these high-speed downlink packet networks, scheduling at the base station is one of the key technologies to accomplish such high speed. A scheduling algorithm that is based on the proportional fair criterion is widely used in commercial networks, but the problem with such an algorithm is that it does not schedule real-time application traffic efficiently. This paper proposes a new scheduling algorithm for real-time applications that does not need substantial change in the existing system and coexists efficiently with the proportional fair criterion. We evaluate the characteristics of the proposed algorithm through computer simulation and show that the efficiency of the proposed algorithm is better than that of existing algorithms.
doi_str_mv 10.1109/WCNC.2005.1424491
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_1424491</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1424491</ieee_id><sourcerecordid>1424491</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1771-b7a9b4df6fb90069245a0471a3171be1f65de0816dee84efdf82dcce2c2c0e43</originalsourceid><addsrcrecordid>eNotkMlOwzAURS0GiVL6AYiNfyDFz_GQLFEEBamCBZVYVh6eU9NMclIh_p5W9G7O4h7dxSXkHtgSgJWPX9V7teSMySUILkQJF2QGUhYZV8AvyS3TBcuLUil-dSq4zHIJcEMW4_jNjhFSCK5npP50O_SHJnY1NU3dpzjtWmrNiJ72HR2x85ioPYRwgnH7pq9p6BNNaJpsii1SMwxNdGaKRz92tO1tbJAORxcn2uH006f9eEeug2lGXJw5J5uX5031mq0_Vm_V0zqLoDVkVpvSCh9UsCVjquRCGiY0mBw0WISgpEdWgPKIhcDgQ8G9c8gddwxFPicP_7MREbdDiq1Jv9vzRfkfYN1aUQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Scheduling algorithm based on sender buffer backlog for real-time application in mobile packet networks</title><source>IEEE Xplore All Conference Series</source><creator>Koto, H. ; Fukushima, M. ; Nomoto, S. ; Takahata, F.</creator><creatorcontrib>Koto, H. ; Fukushima, M. ; Nomoto, S. ; Takahata, F.</creatorcontrib><description>The demand for high-speed data communication and the use of real-time applications in mobile networks is becoming increasingly high and communication systems that specialise in downlink packet transfer are being developed and deployed. In these high-speed downlink packet networks, scheduling at the base station is one of the key technologies to accomplish such high speed. A scheduling algorithm that is based on the proportional fair criterion is widely used in commercial networks, but the problem with such an algorithm is that it does not schedule real-time application traffic efficiently. This paper proposes a new scheduling algorithm for real-time applications that does not need substantial change in the existing system and coexists efficiently with the proportional fair criterion. We evaluate the characteristics of the proposed algorithm through computer simulation and show that the efficiency of the proposed algorithm is better than that of existing algorithms.</description><identifier>ISSN: 1525-3511</identifier><identifier>ISBN: 0780389662</identifier><identifier>ISBN: 9780780389663</identifier><identifier>EISSN: 1558-2612</identifier><identifier>DOI: 10.1109/WCNC.2005.1424491</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Base stations ; Computer simulation ; Data communication ; Downlink ; Processor scheduling ; Real time systems ; Scheduling algorithm ; Telecommunication traffic ; Traffic control</subject><ispartof>IEEE Wireless Communications and Networking Conference, 2005, 2005, Vol.1, p.151-157 Vol. 1</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1424491$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54533,54898,54910</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1424491$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Koto, H.</creatorcontrib><creatorcontrib>Fukushima, M.</creatorcontrib><creatorcontrib>Nomoto, S.</creatorcontrib><creatorcontrib>Takahata, F.</creatorcontrib><title>Scheduling algorithm based on sender buffer backlog for real-time application in mobile packet networks</title><title>IEEE Wireless Communications and Networking Conference, 2005</title><addtitle>WCNC</addtitle><description>The demand for high-speed data communication and the use of real-time applications in mobile networks is becoming increasingly high and communication systems that specialise in downlink packet transfer are being developed and deployed. In these high-speed downlink packet networks, scheduling at the base station is one of the key technologies to accomplish such high speed. A scheduling algorithm that is based on the proportional fair criterion is widely used in commercial networks, but the problem with such an algorithm is that it does not schedule real-time application traffic efficiently. This paper proposes a new scheduling algorithm for real-time applications that does not need substantial change in the existing system and coexists efficiently with the proportional fair criterion. We evaluate the characteristics of the proposed algorithm through computer simulation and show that the efficiency of the proposed algorithm is better than that of existing algorithms.</description><subject>Application software</subject><subject>Base stations</subject><subject>Computer simulation</subject><subject>Data communication</subject><subject>Downlink</subject><subject>Processor scheduling</subject><subject>Real time systems</subject><subject>Scheduling algorithm</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><issn>1525-3511</issn><issn>1558-2612</issn><isbn>0780389662</isbn><isbn>9780780389663</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotkMlOwzAURS0GiVL6AYiNfyDFz_GQLFEEBamCBZVYVh6eU9NMclIh_p5W9G7O4h7dxSXkHtgSgJWPX9V7teSMySUILkQJF2QGUhYZV8AvyS3TBcuLUil-dSq4zHIJcEMW4_jNjhFSCK5npP50O_SHJnY1NU3dpzjtWmrNiJ72HR2x85ioPYRwgnH7pq9p6BNNaJpsii1SMwxNdGaKRz92tO1tbJAORxcn2uH006f9eEeug2lGXJw5J5uX5031mq0_Vm_V0zqLoDVkVpvSCh9UsCVjquRCGiY0mBw0WISgpEdWgPKIhcDgQ8G9c8gddwxFPicP_7MREbdDiq1Jv9vzRfkfYN1aUQ</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Koto, H.</creator><creator>Fukushima, M.</creator><creator>Nomoto, S.</creator><creator>Takahata, F.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>Scheduling algorithm based on sender buffer backlog for real-time application in mobile packet networks</title><author>Koto, H. ; Fukushima, M. ; Nomoto, S. ; Takahata, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1771-b7a9b4df6fb90069245a0471a3171be1f65de0816dee84efdf82dcce2c2c0e43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Application software</topic><topic>Base stations</topic><topic>Computer simulation</topic><topic>Data communication</topic><topic>Downlink</topic><topic>Processor scheduling</topic><topic>Real time systems</topic><topic>Scheduling algorithm</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Koto, H.</creatorcontrib><creatorcontrib>Fukushima, M.</creatorcontrib><creatorcontrib>Nomoto, S.</creatorcontrib><creatorcontrib>Takahata, F.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Koto, H.</au><au>Fukushima, M.</au><au>Nomoto, S.</au><au>Takahata, F.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Scheduling algorithm based on sender buffer backlog for real-time application in mobile packet networks</atitle><btitle>IEEE Wireless Communications and Networking Conference, 2005</btitle><stitle>WCNC</stitle><date>2005</date><risdate>2005</risdate><volume>1</volume><spage>151</spage><epage>157 Vol. 1</epage><pages>151-157 Vol. 1</pages><issn>1525-3511</issn><eissn>1558-2612</eissn><isbn>0780389662</isbn><isbn>9780780389663</isbn><abstract>The demand for high-speed data communication and the use of real-time applications in mobile networks is becoming increasingly high and communication systems that specialise in downlink packet transfer are being developed and deployed. In these high-speed downlink packet networks, scheduling at the base station is one of the key technologies to accomplish such high speed. A scheduling algorithm that is based on the proportional fair criterion is widely used in commercial networks, but the problem with such an algorithm is that it does not schedule real-time application traffic efficiently. This paper proposes a new scheduling algorithm for real-time applications that does not need substantial change in the existing system and coexists efficiently with the proportional fair criterion. We evaluate the characteristics of the proposed algorithm through computer simulation and show that the efficiency of the proposed algorithm is better than that of existing algorithms.</abstract><pub>IEEE</pub><doi>10.1109/WCNC.2005.1424491</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1525-3511
ispartof IEEE Wireless Communications and Networking Conference, 2005, 2005, Vol.1, p.151-157 Vol. 1
issn 1525-3511
1558-2612
language eng
recordid cdi_ieee_primary_1424491
source IEEE Xplore All Conference Series
subjects Application software
Base stations
Computer simulation
Data communication
Downlink
Processor scheduling
Real time systems
Scheduling algorithm
Telecommunication traffic
Traffic control
title Scheduling algorithm based on sender buffer backlog for real-time application in mobile packet networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T05%3A01%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Scheduling%20algorithm%20based%20on%20sender%20buffer%20backlog%20for%20real-time%20application%20in%20mobile%20packet%20networks&rft.btitle=IEEE%20Wireless%20Communications%20and%20Networking%20Conference,%202005&rft.au=Koto,%20H.&rft.date=2005&rft.volume=1&rft.spage=151&rft.epage=157%20Vol.%201&rft.pages=151-157%20Vol.%201&rft.issn=1525-3511&rft.eissn=1558-2612&rft.isbn=0780389662&rft.isbn_list=9780780389663&rft_id=info:doi/10.1109/WCNC.2005.1424491&rft_dat=%3Cieee_CHZPO%3E1424491%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i1771-b7a9b4df6fb90069245a0471a3171be1f65de0816dee84efdf82dcce2c2c0e43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1424491&rfr_iscdi=true