Review of the convolution algorithm for evaluating service
                integrated systems

Villy Bæk Iversen

Review of the convolution algorithm for evaluating service integrated systems

Villy Bæk Iversen

Research output: Book/Report › Report › Research › peer-review

Abstract

In this paper we give a review of the applicability of the convolution algorithm. By this we are able to evaluate communication networks end--to--end with e.g. BPP multi-ratetraffic models insensitive to the holding time distribution. Rearrangement, minimum allocation, and maximum allocation are included. For each individual traffic stream we are able to find various congestion measures, moments of overflow traffic, and derivatives.

Original language	English

Number of pages	16
Publication status	Published - 1997
Event	COST 257 meeting - Leidschendam, Netherlands Duration: 22 Jan 1997 → 23 Jan 1997

Conference

Conference	COST 257 meeting
Country/Territory	Netherlands
City	Leidschendam
Period	22/01/1997 → 23/01/1997

OpenUrl availability

Full text

Cite this

@book{c9c88ce7e44549568f3f1f2c5ea9a8c4,

title = "Review of the convolution algorithm for evaluating service integrated systems",

abstract = "In this paper we give a review of the applicability of the convolution algorithm. By this we are able to evaluate communication networks end--to--end with e.g. BPP multi-ratetraffic models insensitive to the holding time distribution. Rearrangement, minimum allocation, and maximum allocation are included. For each individual traffic stream we are able to find various congestion measures, moments of overflow traffic, and derivatives.",

author = "Iversen, {Villy B{\ae}k}",

year = "1997",

language = "English",

note = "COST 257 meeting ; Conference date: 22-01-1997 Through 23-01-1997",

}

TY - RPRT

T1 - Review of the convolution algorithm for evaluating service integrated systems

AU - Iversen, Villy Bæk

PY - 1997

Y1 - 1997

N2 - In this paper we give a review of the applicability of the convolution algorithm. By this we are able to evaluate communication networks end--to--end with e.g. BPP multi-ratetraffic models insensitive to the holding time distribution. Rearrangement, minimum allocation, and maximum allocation are included. For each individual traffic stream we are able to find various congestion measures, moments of overflow traffic, and derivatives.

AB - In this paper we give a review of the applicability of the convolution algorithm. By this we are able to evaluate communication networks end--to--end with e.g. BPP multi-ratetraffic models insensitive to the holding time distribution. Rearrangement, minimum allocation, and maximum allocation are included. For each individual traffic stream we are able to find various congestion measures, moments of overflow traffic, and derivatives.

M3 - Report

BT - Review of the convolution algorithm for evaluating service integrated systems

T2 - COST 257 meeting

Y2 - 22 January 1997 through 23 January 1997

ER -