Modeling and analysis of flow controlled packet switching networks

Simon S. Lam · Y. Luke Lien

12 citations0/0 files storedACM SIGCOMM Conference (SIGCOMM)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Interconnection Networks and Systems

Abstract

Packet switching networks with flow controlled virtual channels are modeled by closed multi-chain queueing networks. The tree convolution algorithm for an exact analysis of such models is discussed. The algorithm is very efficient when routing chains have sparseness and locality properties that are typical of communication network models. The accuracy of an approximate model of equivalent open chains was investigated. An optimal routing criterion for adding a virtual channel (with a window size of one) to an existing network is explored.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 12 citations exist upstream.

References

1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers 1979A Queueing Network Analysis of Computer Communication Networks with Window Flow Control 1980Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers 1983A tree convolution algorithm for the solution of queueing networks 1979The Distribution of Queueing Network States at Input and Output Instants 1982Closed Multichain Product Form Queueing Networks with Large Population Sizes

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.