On updating buffer allocation

Ashok K. Thareja; Satish K. Tripathi; Richard A. Upton

doi:10.1145/800047.801697

On updating buffer allocation

Ashok K. Thareja
, Satish K. Tripathi
, Richard A. Upton

University of Maryland, College Park

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Most of the analysis of buffer sharing schemes has been aimed at obtaining the optimal operational parameters under stationary load situations. It is well known that in most operating environments the traffic load changes. In this paper, we address the problem of updating buffer allocation as the traffic load at a network node changes. We investigate the behavior of a complete partitioning buffer sharing scheme to gain insight into the dependency of the throughput upon system parameters. The summary of the analysis is presented in the form of a heuristic. The heuristic is shown to perform reasonably well under two different types of stress tests.

Original language	English
Title of host publication	Proceedings of the Computer Network Performance Symposium
Publisher	Association for Computing Machinery, Inc
Pages	101-110
Number of pages	10
ISBN (Electronic)	0897910699, 9780897910699
DOIs	https://doi.org/10.1145/800047.801697
State	Published - Apr 13 1982
Event	Computer Network Performance Symposium 1982 - College Park, United States Duration: Apr 13 1982 → Apr 14 1982

Publication series

Name	Proceedings of the Computer Network Performance Symposium

Conference

Conference	Computer Network Performance Symposium 1982
Country/Territory	United States
City	College Park
Period	04/13/82 → 04/14/82

Access to Document

10.1145/800047.801697

Cite this

@inproceedings{f154cd4bf04243b791eca6626ecb0619,

title = "On updating buffer allocation",

abstract = "Most of the analysis of buffer sharing schemes has been aimed at obtaining the optimal operational parameters under stationary load situations. It is well known that in most operating environments the traffic load changes. In this paper, we address the problem of updating buffer allocation as the traffic load at a network node changes. We investigate the behavior of a complete partitioning buffer sharing scheme to gain insight into the dependency of the throughput upon system parameters. The summary of the analysis is presented in the form of a heuristic. The heuristic is shown to perform reasonably well under two different types of stress tests.",

author = "Thareja, \{Ashok K.\} and Tripathi, \{Satish K.\} and Upton, \{Richard A.\}",

note = "Publisher Copyright: {\textcopyright} 1982 ACM.; Computer Network Performance Symposium 1982 ; Conference date: 13-04-1982 Through 14-04-1982",

year = "1982",

month = apr,

day = "13",

doi = "10.1145/800047.801697",

language = "English",

series = "Proceedings of the Computer Network Performance Symposium",

publisher = "Association for Computing Machinery, Inc",

pages = "101--110",

booktitle = "Proceedings of the Computer Network Performance Symposium",

}

Thareja, AK, Tripathi, SK & Upton, RA 1982, On updating buffer allocation. in Proceedings of the Computer Network Performance Symposium. Proceedings of the Computer Network Performance Symposium, Association for Computing Machinery, Inc, pp. 101-110, Computer Network Performance Symposium 1982, College Park, United States, 04/13/82. https://doi.org/10.1145/800047.801697

On updating buffer allocation. / Thareja, Ashok K.; Tripathi, Satish K.; Upton, Richard A.
Proceedings of the Computer Network Performance Symposium. Association for Computing Machinery, Inc, 1982. p. 101-110 (Proceedings of the Computer Network Performance Symposium).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On updating buffer allocation

AU - Thareja, Ashok K.

AU - Tripathi, Satish K.

AU - Upton, Richard A.

PY - 1982/4/13

Y1 - 1982/4/13

N2 - Most of the analysis of buffer sharing schemes has been aimed at obtaining the optimal operational parameters under stationary load situations. It is well known that in most operating environments the traffic load changes. In this paper, we address the problem of updating buffer allocation as the traffic load at a network node changes. We investigate the behavior of a complete partitioning buffer sharing scheme to gain insight into the dependency of the throughput upon system parameters. The summary of the analysis is presented in the form of a heuristic. The heuristic is shown to perform reasonably well under two different types of stress tests.

AB - Most of the analysis of buffer sharing schemes has been aimed at obtaining the optimal operational parameters under stationary load situations. It is well known that in most operating environments the traffic load changes. In this paper, we address the problem of updating buffer allocation as the traffic load at a network node changes. We investigate the behavior of a complete partitioning buffer sharing scheme to gain insight into the dependency of the throughput upon system parameters. The summary of the analysis is presented in the form of a heuristic. The heuristic is shown to perform reasonably well under two different types of stress tests.

UR - https://www.scopus.com/pages/publications/85051256469

U2 - 10.1145/800047.801697

DO - 10.1145/800047.801697

M3 - Conference contribution

AN - SCOPUS:85051256469

T3 - Proceedings of the Computer Network Performance Symposium

SP - 101

EP - 110

BT - Proceedings of the Computer Network Performance Symposium

PB - Association for Computing Machinery, Inc

T2 - Computer Network Performance Symposium 1982

Y2 - 13 April 1982 through 14 April 1982

ER -

On updating buffer allocation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this