On flow control in multimedia networks

Research output: Contribution to journalConference article

Abstract

A flow control procedure is presented for virtual circuit computer networks with multimedia data traffic. It is assumed that the data packets belong to different priority groups. Power is used as the performance measure for a virtual circuit (VC). The input rate controller of every virtual circuit selects a throughput which maximizes its own objective function. A distributed algorithm is given which can be executed by the input rate controllers of the VC's without the global knowledge of the network. It is shown that the algorithm converges to the optimum of the objective function of every virtual circuit and the solution is shown to be independent of the initial throughputs. Some network examples are solved by analytical and numerical methods.

Original languageEnglish (US)
Article number246473
Pages (from-to)197-205
Number of pages9
JournalProceedings of the IEEE International Symposium on High Performance Distributed Computing
DOIs
StatePublished - Jan 1 1992
Event1st International Symposium on High-Performance Distributed Computing, HPDC 1992 - Syracuse, United States
Duration: Sep 9 1992Sep 11 1992

Fingerprint

Flow control
Networks (circuits)
Throughput
Controllers
Computer networks
Parallel algorithms
Numerical methods

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Cite this

On flow control in multimedia networks. / Varshney, Pramod Kumar; Dey, Surajit.

In: Proceedings of the IEEE International Symposium on High Performance Distributed Computing, 01.01.1992, p. 197-205.

Research output: Contribution to journalConference article

@article{60e32b1f6a5e4d11981cba279458e60e,
title = "On flow control in multimedia networks",
abstract = "A flow control procedure is presented for virtual circuit computer networks with multimedia data traffic. It is assumed that the data packets belong to different priority groups. Power is used as the performance measure for a virtual circuit (VC). The input rate controller of every virtual circuit selects a throughput which maximizes its own objective function. A distributed algorithm is given which can be executed by the input rate controllers of the VC's without the global knowledge of the network. It is shown that the algorithm converges to the optimum of the objective function of every virtual circuit and the solution is shown to be independent of the initial throughputs. Some network examples are solved by analytical and numerical methods.",
author = "Varshney, {Pramod Kumar} and Surajit Dey",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/HPDC.1992.246473",
language = "English (US)",
pages = "197--205",
journal = "IEEE International Symposium on High Performance Distributed Computing, Proceedings",
issn = "1082-8907",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - On flow control in multimedia networks

AU - Varshney, Pramod Kumar

AU - Dey, Surajit

PY - 1992/1/1

Y1 - 1992/1/1

N2 - A flow control procedure is presented for virtual circuit computer networks with multimedia data traffic. It is assumed that the data packets belong to different priority groups. Power is used as the performance measure for a virtual circuit (VC). The input rate controller of every virtual circuit selects a throughput which maximizes its own objective function. A distributed algorithm is given which can be executed by the input rate controllers of the VC's without the global knowledge of the network. It is shown that the algorithm converges to the optimum of the objective function of every virtual circuit and the solution is shown to be independent of the initial throughputs. Some network examples are solved by analytical and numerical methods.

AB - A flow control procedure is presented for virtual circuit computer networks with multimedia data traffic. It is assumed that the data packets belong to different priority groups. Power is used as the performance measure for a virtual circuit (VC). The input rate controller of every virtual circuit selects a throughput which maximizes its own objective function. A distributed algorithm is given which can be executed by the input rate controllers of the VC's without the global knowledge of the network. It is shown that the algorithm converges to the optimum of the objective function of every virtual circuit and the solution is shown to be independent of the initial throughputs. Some network examples are solved by analytical and numerical methods.

UR - http://www.scopus.com/inward/record.url?scp=85065858802&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85065858802&partnerID=8YFLogxK

U2 - 10.1109/HPDC.1992.246473

DO - 10.1109/HPDC.1992.246473

M3 - Conference article

AN - SCOPUS:85065858802

SP - 197

EP - 205

JO - IEEE International Symposium on High Performance Distributed Computing, Proceedings

JF - IEEE International Symposium on High Performance Distributed Computing, Proceedings

SN - 1082-8907

M1 - 246473

ER -