Loading…
The look-ahead-maximize-batch batching policy
This paper introduces a new batching policy, called look-ahead-maximize-batch (LAMB), for reducing the bandwidth demand of video servers. LAMB maximizes the number of users admitted in a window, which includes the reneging time of all pending requests at that scheduling time. LAMB admits a greater n...
Saved in:
Published in: | IEEE transactions on multimedia 2002-03, Vol.4 (1), p.114-120 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c436t-d6b84a6cec1021ae56b325fb43615b5e6905eab03ad6e9f26597ea9cedbfa8823 |
---|---|
cites | cdi_FETCH-LOGICAL-c436t-d6b84a6cec1021ae56b325fb43615b5e6905eab03ad6e9f26597ea9cedbfa8823 |
container_end_page | 120 |
container_issue | 1 |
container_start_page | 114 |
container_title | IEEE transactions on multimedia |
container_volume | 4 |
creator | da Fonseca, N.L.S. Facanha, R.D.A. |
description | This paper introduces a new batching policy, called look-ahead-maximize-batch (LAMB), for reducing the bandwidth demand of video servers. LAMB maximizes the number of users admitted in a window, which includes the reneging time of all pending requests at that scheduling time. LAMB admits a greater number of users than other existing batching policies. Furthermore, the benefits of integrating batching and piggybacking is analyzed. |
doi_str_mv | 10.1109/6046.985559 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1022887921</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>985559</ieee_id><sourcerecordid>1022887921</sourcerecordid><originalsourceid>FETCH-LOGICAL-c436t-d6b84a6cec1021ae56b325fb43615b5e6905eab03ad6e9f26597ea9cedbfa8823</originalsourceid><addsrcrecordid>eNp90L1LAzEYBvAgCtbq5OZUHESQ1CSX5JJRil9QcKlzSHLv2dS7pl5asP71pl5xcHBJAu-PNzwPQueUjCkl-lYSLsdaCSH0ARpQzSkmpCwP81swgjWj5BidpLQghHJBygHCszmMmhjfsZ2DrXBrP0MbvgA7u_bz0c8Zlm-jVWyC356io9o2Cc729xC9PtzPJk94-vL4PLmbYs8LucaVdIpb6cFTwqgFIV3BRO3ykAonQGoiwDpS2EqCrpkUugSrPVSutkqxYoiu-r2rLn5sIK1NG5KHprFLiJtkmJKc52AZXv8L8_9MqTIHz_TyD13ETbfMMYxSnBeUSZ7RTY98F1PqoDarLrS22-ZNZlex2VVs-oqzvuh1AIBfuR9-AwHAdIA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884431264</pqid></control><display><type>article</type><title>The look-ahead-maximize-batch batching policy</title><source>IEEE Xplore (Online service)</source><creator>da Fonseca, N.L.S. ; Facanha, R.D.A.</creator><creatorcontrib>da Fonseca, N.L.S. ; Facanha, R.D.A.</creatorcontrib><description>This paper introduces a new batching policy, called look-ahead-maximize-batch (LAMB), for reducing the bandwidth demand of video servers. LAMB maximizes the number of users admitted in a window, which includes the reneging time of all pending requests at that scheduling time. LAMB admits a greater number of users than other existing batching policies. Furthermore, the benefits of integrating batching and piggybacking is analyzed.</description><identifier>ISSN: 1520-9210</identifier><identifier>EISSN: 1941-0077</identifier><identifier>DOI: 10.1109/6046.985559</identifier><identifier>CODEN: ITMUF8</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Bandwidth ; Delay ; Displays ; HDTV ; Lamb ; Large-scale systems ; Marketing ; Multimedia ; Network servers ; Policies ; Scheduling ; Servers ; Streaming media ; Telecommunication traffic ; Throughput ; Windows (intervals)</subject><ispartof>IEEE transactions on multimedia, 2002-03, Vol.4 (1), p.114-120</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2002</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c436t-d6b84a6cec1021ae56b325fb43615b5e6905eab03ad6e9f26597ea9cedbfa8823</citedby><cites>FETCH-LOGICAL-c436t-d6b84a6cec1021ae56b325fb43615b5e6905eab03ad6e9f26597ea9cedbfa8823</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/985559$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>da Fonseca, N.L.S.</creatorcontrib><creatorcontrib>Facanha, R.D.A.</creatorcontrib><title>The look-ahead-maximize-batch batching policy</title><title>IEEE transactions on multimedia</title><addtitle>TMM</addtitle><description>This paper introduces a new batching policy, called look-ahead-maximize-batch (LAMB), for reducing the bandwidth demand of video servers. LAMB maximizes the number of users admitted in a window, which includes the reneging time of all pending requests at that scheduling time. LAMB admits a greater number of users than other existing batching policies. Furthermore, the benefits of integrating batching and piggybacking is analyzed.</description><subject>Bandwidth</subject><subject>Delay</subject><subject>Displays</subject><subject>HDTV</subject><subject>Lamb</subject><subject>Large-scale systems</subject><subject>Marketing</subject><subject>Multimedia</subject><subject>Network servers</subject><subject>Policies</subject><subject>Scheduling</subject><subject>Servers</subject><subject>Streaming media</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>Windows (intervals)</subject><issn>1520-9210</issn><issn>1941-0077</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><recordid>eNp90L1LAzEYBvAgCtbq5OZUHESQ1CSX5JJRil9QcKlzSHLv2dS7pl5asP71pl5xcHBJAu-PNzwPQueUjCkl-lYSLsdaCSH0ARpQzSkmpCwP81swgjWj5BidpLQghHJBygHCszmMmhjfsZ2DrXBrP0MbvgA7u_bz0c8Zlm-jVWyC356io9o2Cc729xC9PtzPJk94-vL4PLmbYs8LucaVdIpb6cFTwqgFIV3BRO3ykAonQGoiwDpS2EqCrpkUugSrPVSutkqxYoiu-r2rLn5sIK1NG5KHprFLiJtkmJKc52AZXv8L8_9MqTIHz_TyD13ETbfMMYxSnBeUSZ7RTY98F1PqoDarLrS22-ZNZlex2VVs-oqzvuh1AIBfuR9-AwHAdIA</recordid><startdate>20020301</startdate><enddate>20020301</enddate><creator>da Fonseca, N.L.S.</creator><creator>Facanha, R.D.A.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20020301</creationdate><title>The look-ahead-maximize-batch batching policy</title><author>da Fonseca, N.L.S. ; Facanha, R.D.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c436t-d6b84a6cec1021ae56b325fb43615b5e6905eab03ad6e9f26597ea9cedbfa8823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Bandwidth</topic><topic>Delay</topic><topic>Displays</topic><topic>HDTV</topic><topic>Lamb</topic><topic>Large-scale systems</topic><topic>Marketing</topic><topic>Multimedia</topic><topic>Network servers</topic><topic>Policies</topic><topic>Scheduling</topic><topic>Servers</topic><topic>Streaming media</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>Windows (intervals)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>da Fonseca, N.L.S.</creatorcontrib><creatorcontrib>Facanha, R.D.A.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library Online</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on multimedia</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>da Fonseca, N.L.S.</au><au>Facanha, R.D.A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The look-ahead-maximize-batch batching policy</atitle><jtitle>IEEE transactions on multimedia</jtitle><stitle>TMM</stitle><date>2002-03-01</date><risdate>2002</risdate><volume>4</volume><issue>1</issue><spage>114</spage><epage>120</epage><pages>114-120</pages><issn>1520-9210</issn><eissn>1941-0077</eissn><coden>ITMUF8</coden><abstract>This paper introduces a new batching policy, called look-ahead-maximize-batch (LAMB), for reducing the bandwidth demand of video servers. LAMB maximizes the number of users admitted in a window, which includes the reneging time of all pending requests at that scheduling time. LAMB admits a greater number of users than other existing batching policies. Furthermore, the benefits of integrating batching and piggybacking is analyzed.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/6046.985559</doi><tpages>7</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1520-9210 |
ispartof | IEEE transactions on multimedia, 2002-03, Vol.4 (1), p.114-120 |
issn | 1520-9210 1941-0077 |
language | eng |
recordid | cdi_proquest_miscellaneous_1022887921 |
source | IEEE Xplore (Online service) |
subjects | Bandwidth Delay Displays HDTV Lamb Large-scale systems Marketing Multimedia Network servers Policies Scheduling Servers Streaming media Telecommunication traffic Throughput Windows (intervals) |
title | The look-ahead-maximize-batch batching policy |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T05%3A24%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20look-ahead-maximize-batch%20batching%20policy&rft.jtitle=IEEE%20transactions%20on%20multimedia&rft.au=da%20Fonseca,%20N.L.S.&rft.date=2002-03-01&rft.volume=4&rft.issue=1&rft.spage=114&rft.epage=120&rft.pages=114-120&rft.issn=1520-9210&rft.eissn=1941-0077&rft.coden=ITMUF8&rft_id=info:doi/10.1109/6046.985559&rft_dat=%3Cproquest_cross%3E1022887921%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c436t-d6b84a6cec1021ae56b325fb43615b5e6905eab03ad6e9f26597ea9cedbfa8823%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=884431264&rft_id=info:pmid/&rft_ieee_id=985559&rfr_iscdi=true |