Loading…

Explicit allocation of best-effort packet delivery service

This paper presents the "allocated-capacity" framework for providing different levels of best-effort service in times of network congestion. The "allocated-capacity" framework-extensions to the Internet protocols and algorithms-can allocate bandwidth to different users in a contr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 1998-08, Vol.6 (4), p.362-373
Main Authors: Clark, D.D., Wenjia Fang
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-c440t-cbdc23c6ef93d7f5026d0d9b78cf0953510d782d68384382166ed7bb2e841c903
cites cdi_FETCH-LOGICAL-c440t-cbdc23c6ef93d7f5026d0d9b78cf0953510d782d68384382166ed7bb2e841c903
container_end_page 373
container_issue 4
container_start_page 362
container_title IEEE/ACM transactions on networking
container_volume 6
creator Clark, D.D.
Wenjia Fang
description This paper presents the "allocated-capacity" framework for providing different levels of best-effort service in times of network congestion. The "allocated-capacity" framework-extensions to the Internet protocols and algorithms-can allocate bandwidth to different users in a controlled and predictable way during network congestion. The framework supports two complementary ways of controlling the bandwidth allocation: sender-based and receiver-based. In today's heterogeneous and commercial Internet the framework can serve as a basis for charging for usage and for more efficiently utilizing the network resources. We focus on algorithms for essential components of the framework: a differential dropping algorithm for network routers and a tagging algorithm for profile meters at the edge of the network for bulk-data transfers. We present simulation results to illustrate the effectiveness of the combined algorithms in controlling transmission control protocol (TCP) traffic to achieve certain targeted sending rates.
doi_str_mv 10.1109/90.720870
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_720870</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>720870</ieee_id><sourcerecordid>26856949</sourcerecordid><originalsourceid>FETCH-LOGICAL-c440t-cbdc23c6ef93d7f5026d0d9b78cf0953510d782d68384382166ed7bb2e841c903</originalsourceid><addsrcrecordid>eNqNkE1LAzEQhoMoWKsHr572JHjYOkk2X96k1A8oeNFz2E0mEN12a7It9t-7ssWrnuaFeXhneAi5pDCjFMytgZlioBUckQkVQpdMSHk8ZJC8lNKwU3KW8zsA5cDkhNwtvjZtdLEv6rbtXN3Hbl10oWgw9yWG0KW-2NTuA_vCYxt3mPZFxrSLDs_JSajbjBeHOSVvD4vX-VO5fHl8nt8vS1dV0Jeu8Y5xJzEY7lUQw1kP3jRKuwBGcEHBK8281FxXXDMqJXrVNAx1RZ0BPiXXY-8mdZ_b4S-7itlh29Zr7LbZMjPUVFT9DQ5apOL_aJRaSFOZAbwZQZe6nBMGu0lxVae9pWB_fFsDdvQ9sFcjGxHxlzssvwGoPnlE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26856949</pqid></control><display><type>article</type><title>Explicit allocation of best-effort packet delivery service</title><source>IEEE Electronic Library (IEL) Journals</source><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Clark, D.D. ; Wenjia Fang</creator><creatorcontrib>Clark, D.D. ; Wenjia Fang</creatorcontrib><description>This paper presents the "allocated-capacity" framework for providing different levels of best-effort service in times of network congestion. The "allocated-capacity" framework-extensions to the Internet protocols and algorithms-can allocate bandwidth to different users in a controlled and predictable way during network congestion. The framework supports two complementary ways of controlling the bandwidth allocation: sender-based and receiver-based. In today's heterogeneous and commercial Internet the framework can serve as a basis for charging for usage and for more efficiently utilizing the network resources. We focus on algorithms for essential components of the framework: a differential dropping algorithm for network routers and a tagging algorithm for profile meters at the edge of the network for bulk-data transfers. We present simulation results to illustrate the effectiveness of the combined algorithms in controlling transmission control protocol (TCP) traffic to achieve certain targeted sending rates.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/90.720870</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Channel allocation ; Communication system traffic control ; IP networks ; Protocols ; Quality of service ; Resource management ; Tagging ; Traffic control ; Web and internet services</subject><ispartof>IEEE/ACM transactions on networking, 1998-08, Vol.6 (4), p.362-373</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c440t-cbdc23c6ef93d7f5026d0d9b78cf0953510d782d68384382166ed7bb2e841c903</citedby><cites>FETCH-LOGICAL-c440t-cbdc23c6ef93d7f5026d0d9b78cf0953510d782d68384382166ed7bb2e841c903</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/720870$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,54795</link.rule.ids></links><search><creatorcontrib>Clark, D.D.</creatorcontrib><creatorcontrib>Wenjia Fang</creatorcontrib><title>Explicit allocation of best-effort packet delivery service</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>This paper presents the "allocated-capacity" framework for providing different levels of best-effort service in times of network congestion. The "allocated-capacity" framework-extensions to the Internet protocols and algorithms-can allocate bandwidth to different users in a controlled and predictable way during network congestion. The framework supports two complementary ways of controlling the bandwidth allocation: sender-based and receiver-based. In today's heterogeneous and commercial Internet the framework can serve as a basis for charging for usage and for more efficiently utilizing the network resources. We focus on algorithms for essential components of the framework: a differential dropping algorithm for network routers and a tagging algorithm for profile meters at the edge of the network for bulk-data transfers. We present simulation results to illustrate the effectiveness of the combined algorithms in controlling transmission control protocol (TCP) traffic to achieve certain targeted sending rates.</description><subject>Bandwidth</subject><subject>Channel allocation</subject><subject>Communication system traffic control</subject><subject>IP networks</subject><subject>Protocols</subject><subject>Quality of service</subject><subject>Resource management</subject><subject>Tagging</subject><subject>Traffic control</subject><subject>Web and internet services</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><recordid>eNqNkE1LAzEQhoMoWKsHr572JHjYOkk2X96k1A8oeNFz2E0mEN12a7It9t-7ssWrnuaFeXhneAi5pDCjFMytgZlioBUckQkVQpdMSHk8ZJC8lNKwU3KW8zsA5cDkhNwtvjZtdLEv6rbtXN3Hbl10oWgw9yWG0KW-2NTuA_vCYxt3mPZFxrSLDs_JSajbjBeHOSVvD4vX-VO5fHl8nt8vS1dV0Jeu8Y5xJzEY7lUQw1kP3jRKuwBGcEHBK8281FxXXDMqJXrVNAx1RZ0BPiXXY-8mdZ_b4S-7itlh29Zr7LbZMjPUVFT9DQ5apOL_aJRaSFOZAbwZQZe6nBMGu0lxVae9pWB_fFsDdvQ9sFcjGxHxlzssvwGoPnlE</recordid><startdate>19980801</startdate><enddate>19980801</enddate><creator>Clark, D.D.</creator><creator>Wenjia Fang</creator><general>IEEE</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7SP</scope></search><sort><creationdate>19980801</creationdate><title>Explicit allocation of best-effort packet delivery service</title><author>Clark, D.D. ; Wenjia Fang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c440t-cbdc23c6ef93d7f5026d0d9b78cf0953510d782d68384382166ed7bb2e841c903</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Bandwidth</topic><topic>Channel allocation</topic><topic>Communication system traffic control</topic><topic>IP networks</topic><topic>Protocols</topic><topic>Quality of service</topic><topic>Resource management</topic><topic>Tagging</topic><topic>Traffic control</topic><topic>Web and internet services</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Clark, D.D.</creatorcontrib><creatorcontrib>Wenjia Fang</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems 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>Electronics &amp; Communications Abstracts</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Clark, D.D.</au><au>Wenjia Fang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Explicit allocation of best-effort packet delivery service</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>1998-08-01</date><risdate>1998</risdate><volume>6</volume><issue>4</issue><spage>362</spage><epage>373</epage><pages>362-373</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>This paper presents the "allocated-capacity" framework for providing different levels of best-effort service in times of network congestion. The "allocated-capacity" framework-extensions to the Internet protocols and algorithms-can allocate bandwidth to different users in a controlled and predictable way during network congestion. The framework supports two complementary ways of controlling the bandwidth allocation: sender-based and receiver-based. In today's heterogeneous and commercial Internet the framework can serve as a basis for charging for usage and for more efficiently utilizing the network resources. We focus on algorithms for essential components of the framework: a differential dropping algorithm for network routers and a tagging algorithm for profile meters at the edge of the network for bulk-data transfers. We present simulation results to illustrate the effectiveness of the combined algorithms in controlling transmission control protocol (TCP) traffic to achieve certain targeted sending rates.</abstract><pub>IEEE</pub><doi>10.1109/90.720870</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1063-6692
ispartof IEEE/ACM transactions on networking, 1998-08, Vol.6 (4), p.362-373
issn 1063-6692
1558-2566
language eng
recordid cdi_ieee_primary_720870
source IEEE Electronic Library (IEL) Journals; Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
subjects Bandwidth
Channel allocation
Communication system traffic control
IP networks
Protocols
Quality of service
Resource management
Tagging
Traffic control
Web and internet services
title Explicit allocation of best-effort packet delivery service
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T22%3A24%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Explicit%20allocation%20of%20best-effort%20packet%20delivery%20service&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Clark,%20D.D.&rft.date=1998-08-01&rft.volume=6&rft.issue=4&rft.spage=362&rft.epage=373&rft.pages=362-373&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/90.720870&rft_dat=%3Cproquest_ieee_%3E26856949%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c440t-cbdc23c6ef93d7f5026d0d9b78cf0953510d782d68384382166ed7bb2e841c903%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=26856949&rft_id=info:pmid/&rft_ieee_id=720870&rfr_iscdi=true