Analytical Models and Efficient Dimensioning Algorithms for Communication Systems In Randomly Changing Traffic Environments

Show full item record

Title: Analytical Models and Efficient Dimensioning Algorithms for Communication Systems In Randomly Changing Traffic Environments
Author: Tian, Wenhong
Advisors: Dr. Khalid Harfoush, Committee Member
Dr. William Stewart, Committee Member
Dr. Harry Perros, Committee Chair
Dr. Mike Devetsikiotis, Committee Member
Abstract: Analysis and design of communication systems in today's dynamically changing environment face a lot of challenges. Communication systems are not static but are dynamically changing today. Networks can become overloaded at one moment and underutilized at the next. Humans simply cannot respond to changes fast enough; computer programs must be used. Queueing theory has typically been used to address queueing problems of communication networks under the assumption that the inter-arrival times and the service times are renewal processes, and the arrival rate and bandwidth requirement of each customer is constant. In today's dynamically changing environment, such as in high-speed integrated-services wired and wireless networks and Web service, these assumptions are frequently unjustified. Our research focuses on the performance evaluation and efficient resource dimensioning algorithms of communication systems in a dynamically changing environment. The topics investigated are either new or they have not been studied well in the literature. One of our contributions is providing efficient dimensioning algorithms in closed-form with a constant or near linear complexity. In this thesis, we considered the following cases: a) the arrival rates of customers are time-varying, b) the bandwidth requirement of a customer is variable, c) integrated streaming and data traffic where the available bandwidth for the data traffic is dynamically changing and d) a statistical multiplexer with autocorrelated and bursty arrival processes. This work starts with the dynamic analysis and design of a communication link when the arrivals are time-varying. The time-varying arrivals capture the nature of a dynamic traffic environment. Using transient analysis, we dimension a link under time-varying arrivals and transient load. We compare some methods (both numerical and closed-form) in the literature and propose efficient ways to design the system under study. We next consider the case when the customer's bandwidth requirements are time-varying. A multi-rate loss model with class-change is proposed and the blocking probability is calculated using an iterative recursive formula. The optimal dimensioning of the capacity of this system is obtained using a formula with a constant cost. Subsequently we consider a model to analyze the integrated streaming traffic and data traffic, where the data traffic is bursty with a time-varying bandwidth shared with the streaming traffic. Using priority decomposition, we proposed closed-form solution for dimensioning of both streaming and data traffic. Finally we analyze a statistical multiplexer in a packet-switched network where the arrival process is the superposition of n independent identical bursty and autocorrelated arrival processes. We construct the superposition of these arrival processes and characterize the departure process from the multiplexer by exact Laplace transform for the first time and a two-stage Markov-modulated Poisson process. These results permit us to analyze and dimension the system more efficiently under study.
Date: 2009-01-25
Degree: PhD
Discipline: Computer Science
URI: http://www.lib.ncsu.edu/resolver/1840.16/5269


Files in this item

Files Size Format View
etd.pdf 779.2Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record