Font Size: a A A

A cost minimization methodology for shaping of self-similar traffic

Posted on:2000-03-17Degree:M.ScType:Thesis
University:Carleton University (Canada)Candidate:Doubrovina, GalinaFull Text:PDF
GTID:2468390014966053Subject:Systems Science
Abstract/Summary:
This work addresses the problem of determining the parameters of ATM network traffic shaper which is represented as a single server queue with finite buffer and deterministic service rate. In our scheme, the user wishes to gain access to the network with certain cell loss probability guaranteed when the input traffic is self-similar. The user has to provide the network with mean cell rate, variance, degree of self-similarity (Hurst parameter) of the submitted traffic and the desirable QoS. The network is able to provide a connection if the traffic is shaped by the user or by the network, and if sufficient resources are available to accommodate the shaped traffic stream. The network form the user to declare his/her traffic parameters as close to reality as possible in order not to pay extra money. This allows the network to get more revenue by admitting more users. We formulate a minimization problem to determine the optimal parameters for the traffic shaper and use techniques of non-linear programming to obtain the solution. In our approach, traffic shaping involves minimization of the connection cost in terms of the network resources, such that access to the network is obtained and the desired QoS is provided by the connection. The algorithm of the proposed scheme is described and its workability is shown for self-similar traffic.
Keywords/Search Tags:Traffic, Network, Minimization
Related items