Please use this identifier to cite or link to this item:
Title: Approximation to the stationary distribution of information flows in a communication network
Authors: CAO YI
Keywords: Communication Network, Stationary Distribution, Bandwidth Sharing
Issue Date: 17-Jan-2006
Citation: CAO YI (2006-01-17). Approximation to the stationary distribution of information flows in a communication network. ScholarBank@NUS Repository.
Abstract: In this study we propose a procedure to approximately compute the stationary distribution of the number of transmitting information flows in a communication network. The flows arrive to the network according to Poisson processes with exponentially distributed flow volumes, and traverse through a fixed path of transmission links in the network. The links have finite transmission capacities which are allocated to the information flows concurrently transmitting in the network according to some dynamic bandwidth sharing rule, which ensures the stability of the total number of information flows ongoing in the network. The procedure is based on dynamic approximation of the bandwidth allocated to concurrent information flows in the network. Numerical examples show that the procedure produces the numerical solution of the network within 2% of the true values.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis_CaoYi.pdf651.69 kBAdobe PDF



Page view(s)

checked on Apr 20, 2019


checked on Apr 20, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.