89 research outputs found
Asymptotic buffer overflow probabilities in multiclass multiplexers : part II : the GLQF policy
Cover title.Includes bibliographical references (p. 33-35).Supported by a Presidential Young Investigator Award. DDM-9158118 Matching funds from Draper Laboratory. Supported by ARO. DAAL-03-92-G-0115Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis
Energy-efficient wireless communication
In this chapter we present an energy-efficient highly adaptive network interface architecture and a novel data link layer protocol for wireless networks that provides Quality of Service (QoS) support for diverse traffic types. Due to the dynamic nature of wireless networks, adaptations in bandwidth scheduling and error control are necessary to achieve energy efficiency and an acceptable quality of service. In our approach we apply adaptability through all layers of the protocol stack, and provide feedback to the applications. In this way the applications can adapt the data streams, and the network protocols can adapt the communication parameters
Some aspects of traffic control and performance evaluation of ATM networks
The emerging high-speed Asynchronous Transfer Mode (ATM) networks are expected to integrate through statistical multiplexing large numbers of traffic sources having a broad range of statistical characteristics and different Quality of Service (QOS) requirements. To achieve high utilisation of network resources while maintaining the QOS, efficient traffic management strategies have to be developed. This thesis considers the problem of traffic control for ATM networks. The thesis studies the application of neural networks to various ATM traffic control issues such as feedback congestion control, traffic characterization, bandwidth estimation, and Call Admission Control (CAC). A novel adaptive congestion control approach based on a neural network that uses reinforcement learning is developed. It is shown that the neural controller is very effective in providing general QOS control. A Finite Impulse Response (FIR) neural network is proposed to adaptively predict the traffic arrival process by learning the relationship between the past and future traffic variations. On the basis of this prediction, a feedback flow control scheme at input access nodes of the network is presented. Simulation results demonstrate significant performance improvement over conventional control mechanisms. In addition, an accurate yet computationally efficient approach to effective bandwidth estimation for multiplexed connections is investigated. In this method, a feed forward neural network is employed to model the nonlinear relationship between the effective bandwidth and the traffic situations and a QOS measure. Applications of this approach to admission control, bandwidth allocation and dynamic routing are also discussed. A detailed investigation has indicated that CAC schemes based on effective bandwidth approximation can be very conservative and prevent optimal use of network resources. A modified effective bandwidth CAC approach is therefore proposed to overcome the drawback of conventional methods. Considering statistical multiplexing between traffic sources, we directly calculate the effective bandwidth of the aggregate traffic which is modelled by a two-state Markov modulated Poisson process via matching four important statistics. We use the theory of large deviations to provide a unified description of effective bandwidths for various traffic sources and the associated ATM multiplexer queueing performance approximations, illustrating their strengths and limitations. In addition, a more accurate estimation method for ATM QOS parameters based on the Bahadur-Rao theorem is proposed, which is a refinement of the original effective bandwidth approximation and can lead to higher link utilisation
A review of connection admission control algorithms for ATM networks
The emergence of high-speed networks such as those with ATM integrates large numbers of services with a wide range of characteristics. Admission control is a prime instrument for controlling congestion in the network. As part of connection services to an ATM system, the Connection Admission Control (CAC) algorithm decides if another call or connection can be admitted to the Broadband Network. The main task of the CAC is to ensure that the broadband resources will not saturate or overflow within a very small probability. It limits the connections and guarantees Quality of Service for the new connection. The algorithm for connection admission is crucial in determining bandwidth utilisation efficiency. With statistical multiplexing more calls can be allocated on a network link, while still maintaining the Quality of Service specified by the connection with traffic parameters and type of service.
A number of algorithms for admission control for Broadband Services with ATM Networks are described and compared for performance under different traffic loads. There is a general description of the ATM Network as an introduction. Issues to do with source distributions and traffic models are explored in Chapter 2. Chapter 3 provides an extensive presentation of the CAC algorithms for ATM Broadband Networks. The ideas about the Effective Bandwidth are reviewed in Chapter 4, and a different approach to admission control using online measurement is presented in Chapter 5. Chapter 6 has the numerical evaluation of four of the key algorithms, with simulations. Finally Chapter 7 has conclusions of the findings and explores some possibilities for further work
Two extensions of Kingman's GI/G/1 bound
A simple bound in GI/G/1 queues was obtained by Kingman using a discrete martingale transform. We extend this technique to 1) multiclass queues and 2) Markov Additive Processes (MAPs) whose background processes can be time-inhomogeneous or have an uncountable state-space. Both extensions are facilitated by a necessary and sufficient ordinary differential equation (ODE) condition for MAPs to admit continuous martingale transforms. Simulations show that the bounds on waiting time distributions are almost exact in heavy-traffic, including the cases of 1) heterogeneous input, e.g., mixing Weibull and Erlang-k classes and 2) Generalized Markovian Arrival Processes, a new class extending the Batch Markovian Arrival Processes to continuous batch sizes
Stochastic Dynamic Programming and Stochastic Fluid-Flow Models in the Design and Analysis of Web-Server Farms
A Web-server farm is a specialized facility designed specifically for housing Web
servers catering to one or more Internet facing Web sites. In this dissertation, stochastic
dynamic programming technique is used to obtain the optimal admission control
policy with different classes of customers, and stochastic
uid-
ow models
are used to compute the performance measures in the network. The two types of
network traffic considered in this research are streaming (guaranteed bandwidth per
connection) and elastic (shares available bandwidth equally among connections).
We first obtain the optimal admission control policy using stochastic dynamic
programming, in which, based on the number of requests of each type being served,
a decision is made whether to allow or deny service to an incoming request. In
this subproblem, we consider a xed bandwidth capacity server, which allocates the
requested bandwidth to the streaming requests and divides all of the remaining bandwidth
equally among all of the elastic requests. The performance metric of interest in
this case will be the blocking probability of streaming traffic, which will be computed
in order to be able to provide Quality of Service (QoS) guarantees.
Next, we obtain bounds on the expected waiting time in the system for elastic
requests that enter the system. This will be done at the server level in such a way
that the total available bandwidth for the requests is constant. Trace data will be
converted to an ON-OFF source and
fluid-
flow models will be used for this analysis. The results are compared with both the mean waiting time obtained by simulating
real data, and the expected waiting time obtained using traditional queueing models.
Finally, we consider the network of servers and routers within the Web farm where
data from servers
flows and merges before getting transmitted to the requesting users
via the Internet. We compute the waiting time of the elastic requests at intermediate
and edge nodes by obtaining the distribution of the out
ow of the upstream node.
This out
ow distribution is obtained by using a methodology based on minimizing the
deviations from the constituent in
flows. This analysis also helps us to compute waiting
times at different bandwidth capacities, and hence obtain a suitable bandwidth to
promise or satisfy the QoS guarantees.
This research helps in obtaining performance measures for different traffic classes
at a Web-server farm so as to be able to promise or provide QoS guarantees; while at
the same time helping in utilizing the resources of the server farms efficiently, thereby
reducing the operational costs and increasing energy savings
Performance modeling and control of web servers
This thesis deals with the task of modeling a web server and designing a mechanism that can prevent the web server from being overloaded. Four papers are presented. The first paper gives an M/G/1/K processor sharing model of a single web server. The model is validated against measurements ands imulations on the commonly usedw eb server Apache. A description is given on how to calculate the necessary parameters in the model. The second paper introduces an admission control mechanism for the Apache web server basedon a combination of queuing theory andcon trol theory. The admission control mechanism is tested in the laboratory, implemented as a stand-alone application in front of the web server. The third paper continues the work from the secondp aper by discussing stability. This time, the admission control mechanism is implemented as a module within the Apache source code. Experiments show the stability and settling time of the controller. Finally, the fourth paper investigates the concept of service level agreements for a web site. The agreements allow a maximum response time anda minimal throughput to be set. The requests are sorted into classes, where each class is assigneda weight (representing the income for the web site owner). Then an optimization algorithm is appliedso that the total profit for the web site during overload is maximized
- …