Shared buffering in nonblocking copy networks

Manju V. Hegde; P. S. Min; A. Chandra; H. Saidi

Shared buffering in nonblocking copy networks

Manju V. Hegde
, P. S. Min
, A. Chandra
, H. Saidi

Department of Electrical & Systems Engineering

Research output: Contribution to conference › Paper › peer-review

Abstract

This paper investigates the performance of nonblocking copy networks employing the shared buffering scheme. We use the technique of tagged Markov chains to derive the stationary distributions for the occupancy of the buffers. Based on these stationary distributions, delay, throughput, and packet loss probability are calculated as critical performance measures of the copy network. We also carry out analyses for variations in the copying policy such as fanout splitting wherein a copy request from a single packet may be completed over two time slots, and fixed channel priority wherein there exists a certain priority among input channels.

Original language	English
State	Published - 1994
Event	Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994

Conference

Conference	Proceedings of the 1994 IEEE International Symposium on Information Theory
City	Trodheim, Norw
Period	06/27/94 → 07/1/94

Cite this

@conference{5e18036c915943c8a0608ab8158f2dd2,

title = "Shared buffering in nonblocking copy networks",

abstract = "This paper investigates the performance of nonblocking copy networks employing the shared buffering scheme. We use the technique of tagged Markov chains to derive the stationary distributions for the occupancy of the buffers. Based on these stationary distributions, delay, throughput, and packet loss probability are calculated as critical performance measures of the copy network. We also carry out analyses for variations in the copying policy such as fanout splitting wherein a copy request from a single packet may be completed over two time slots, and fixed channel priority wherein there exists a certain priority among input channels.",

author = "Hegde, \{Manju V.\} and Min, \{P. S.\} and A. Chandra and H. Saidi",

year = "1994",

language = "English",

note = "Proceedings of the 1994 IEEE International Symposium on Information Theory ; Conference date: 27-06-1994 Through 01-07-1994",

}

TY - CONF

T1 - Shared buffering in nonblocking copy networks

AU - Hegde, Manju V.

AU - Min, P. S.

AU - Chandra, A.

AU - Saidi, H.

PY - 1994

Y1 - 1994

N2 - This paper investigates the performance of nonblocking copy networks employing the shared buffering scheme. We use the technique of tagged Markov chains to derive the stationary distributions for the occupancy of the buffers. Based on these stationary distributions, delay, throughput, and packet loss probability are calculated as critical performance measures of the copy network. We also carry out analyses for variations in the copying policy such as fanout splitting wherein a copy request from a single packet may be completed over two time slots, and fixed channel priority wherein there exists a certain priority among input channels.

AB - This paper investigates the performance of nonblocking copy networks employing the shared buffering scheme. We use the technique of tagged Markov chains to derive the stationary distributions for the occupancy of the buffers. Based on these stationary distributions, delay, throughput, and packet loss probability are calculated as critical performance measures of the copy network. We also carry out analyses for variations in the copying policy such as fanout splitting wherein a copy request from a single packet may be completed over two time slots, and fixed channel priority wherein there exists a certain priority among input channels.

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

M3 - Paper

AN - SCOPUS:0028722287

T2 - Proceedings of the 1994 IEEE International Symposium on Information Theory

Y2 - 27 June 1994 through 1 July 1994

ER -

Shared buffering in nonblocking copy networks

Abstract

Conference

Other files and links

Fingerprint

Cite this