B08_Lagzdinyte - Copy - Petri net based traffic source...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Petri net – based traffic source models for guaranteed performance service in packet – switching networks Ingrida Lagzdinyte 1 and Dangis Rimkus 2 In the guaranteed performance service packet – switching network design it is necessary to have all possible situations of packet flows in the network. With that end of view after choosing network’s architecture and throughputs there is a need to generate packet flows with the parameters we want. In this paper a generated packet flow is described with such parameters as maximum burst size, peak packet rate, minimum packet rate and is limited with the Xmin and ( σ ; ρ ) models. The given Petri net traffic source model takes into account these traffic parameters. Given analytical expressions describe the relations between them and Petri net characteristics. Comparison of traffic flow samples generated by Petri net and theoretical traffic source model is presented. 1 Introduction Data transmission systems have been grown by technological advances in the last years. The speed and capacity of various electronic components in a communication system, such as transmission interfaces, switch fabrics, memory, processors, have all followed technological curves, that have grown either linearly or exponentially [1]. Incoming of new high speed networking technology has introduced opportunities and require a low-loss, low-latency, low- jitter, and assured bandwidth service. Applications such as voice over IP (VoIP), video and online trading programs, scientific visualization and medical imaging require such a robust network-treatment. One of the most difficult aspects of high-speed network development is management design also. In the guaranteed performance service packet – switching network design it is necessary to have all possible situations of packet flows in the network. With that end of view after choosing network’s architecture and throughputs there is a need to generate packet flows with the parameters we want. 2 Traffic Models in Guaranteed Service Though scientists analyses the same set of most important parameters to characterize networks performance, there is no common agreement on which traffic models are the most suitable for describing certain situations in the network. In the traditional queueing theory literature most models are based on stochastic processes. One of the most popular ones are the Poisson model for data [2], “on-off” model for describing the voice sources [3], Markovian models for video sources [4]. But characterizing the important properties of the source these models are either too simple or too complex for tractable analysis. Recently, several models are proposed which do not describe the exact traffic source but bound it and operate only with the constraint parameters (see Table 1).
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

B08_Lagzdinyte - Copy - Petri net based traffic source...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online