Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Maria Kihl is active.

Publication


Featured researches published by Maria Kihl.


IEEE Communications Surveys and Tutorials | 2008

Inter-vehicle communication systems: a survey

Mihail L. Sichitiu; Maria Kihl

Inter-vehicle communication (IVC) systems (i.e., systems not relying on roadside infrastructure) have the potential to radically improve the safety, efficiency, and comfort of everyday road travel. Their main advantage is that they bypass the need for expensive infrastructure; their major drawback is the comparatively complex networking protocols and the need for significant penetration before their applications can become effective. In this article we present several major classes of applications and the types of services they require from an underlying network. We then proceed to analyze existing networking protocols in a bottom-up fashion, from the physical to the transport layers, as well as security aspects related to IVC systems. We conclude the article by presenting several projects related to IVC as well as a review of common performance evaluation techniques for IVC systems.


international conference on telecommunications | 2003

Web server performance modeling using an M/G/1/K*PS queue

Jianhua Cao; Mikael Andersson; Christian Nyberg; Maria Kihl

Performance modeling is an important topic in capacity planning and overload control for web servers. We present an M/G/1/K*PS queueing model of a web server. The arrival process of HTTP requests is assumed to be Poissonian and the service discipline is processor sharing. The total number of requests that can be processed at one time was limited to K. Closed form expressions were obtained for web server performance metrics such as average response time, throughput and blocking probability. The average of the service time requirement and the limit of the number of requests being served were model parameters. The parameters were estimated by maximizing the log-likelihood function of the measured average response time. Compared to other models, this model is conceptually simple and it is easy to estimate model parameters. The model had been validated through lab measurements. The performance metrics predicted by the model fit well to the experimental outcome.


wired wireless internet communications | 2007

Reliable geographical multicast routing in vehicular ad-hoc networks

Maria Kihl; Mihail L. Sichitiu; Ted Ekeroth; Michael Rozenberg

Vehicular ad-hoc networks (VANETs) offer a large number of new potential applications without relying on significant infrastructure. Many of these applications benefit from multi-hop relaying of information, thus requiring a routing protocol. Characteristics unique to VANETs (such as high mobility and the need for geographical addressing) make many conven tional ad hoc routing protocols unsuitable. Also, some envisioned applica tions have end-to-end QoS requirements. In this paper we propose a new multicast routing protocol specifically designed for VANETs. Its purpose is to provide a routing service for a future reliable transport protocol. We eval uate its performance using realistic network and traffic models. It is shown that it is possible to implement a reliable multicast routing protocol for VANETs.


scientific cloud computing | 2012

Efficient provisioning of bursty scientific workloads on the cloud using adaptive elasticity control

Ahmed Ali-Eldin; Maria Kihl; Johan Tordsson; Erik Elmroth

Elasticity is the ability of a cloud infrastructure to dynamically change the amount of resources allocated to a running service as load changes. We build an autonomous elasticity controller that changes the number of virtual machines allocated to a service based on both monitored load changes and predictions of future load. The cloud infrastructure is modeled as a G/G/N queue. This model is used to construct a hybrid reactive-adaptive controller that quickly reacts to sudden load changes, prevents premature release of resources, takes into account the heterogeneity of the workload, and avoids oscillations. Using simulations with Web and cluster workload traces, we show that our proposed controller lowers the number of delayed requests by a factor of 70 for the Web traces and 3 for the cluster traces when compared to a reactive controller. Our controller also decreases the average number of queued requests by a factor of 3 for both traces, and reduces oscillations by a factor of 7 for the Web traces and 3 for the cluster traces. This comes at the expense of between 20% and 30% over-provisioning, as compared to a few percent for the reactive controller.


IEEE Transactions on Network and Service Management | 2009

Resource allocation and disturbance rejection in web servers using SLAs and virtualized servers

Martin Ansbjerg Kjaer; Maria Kihl; Anders Robertsson

Resource management in IT-enterprises gain more and more attention due to high operation costs. For instance, web sites are subject to very changing traffic-loads over the year, over the day, or even over the minute. Online adaption to the changing environment is one way to reduce losses in the operation. Control systems based on feedback provide methods for such adaption, but is in nature slow, since changes in the environment has to propagate through the system before being compensated. Therefore, feed-forward systems can be introduced that has shown to improve the transient performance. However, earlier proposed feed-forward systems have been based on offline estimation. In this article we show that off-line estimations can be problematic in online applications. Therefore, we propose a method where parameters are estimated online, and thus also adapts to the changing environment. We compare our solution to two other control strategies proposed in the literature, which are based on off-line estimation of certain parameters. We evaluate the controllers with both discrete-event simulations and experiments in our testbed. The investigations show the strength of our proposed control system.


american control conference | 2003

Analysis and design of admission control in Web-server systems

A. Robertson; Björn Wittenmark; Maria Kihl

All service control nodes, for example Web sites or Mobile Switching Centers, can be modeled as server systems with one or more servers processing the incoming requests. To avoid overload at the service control node different types of admission control mechanisms are usually implemented. In this paper we discuss, from a control point of view, the modeling of a service control-node. The queue is assumed to be an M/G/1-system and is modeled by a nonlinear flow model and a simplified discrete-time model is used in the analysis and design of the system. An admission control system based on a PI-controller combined with an anti-reset windup feature is developed. The stability of the admission control system is analyzed and the stability of the closed loop system is proved. The results from the simplified queue model are verified through discrete-event simulations of the system.


international world wide web conferences | 2008

Control-theoretic Analysis of Admission Control Mechanisms for Web Server Systems

Maria Kihl; Anders Robertsson; Mikael Andersson; Björn Wittenmark

Web sites are exposed to high rates of incoming requests. The servers may become overloaded during temporary traffic peaks when more requests arrive than the server is designed for. An admission control mechanism rejects some requests whenever the arriving traffic is too high and thereby maintains an acceptable load in the system. This paper presents how admission control mechanisms can be designed with a combination of queueing theory and control theory. In this paper we model an Apache web server as a GI/G/1-system and then design a PI-controller, commonly used in automatic control, for the server. The controller has been implemented as a module inside the Apache source code. Measurements from the laboratory setup show how robust the implemented controller is, and how it corresponds to the results from the theoretical analysis.


Performance and control of next-generation communication networks : [ITCom's Conference on Performance and Control of Next-Generation Communication Networks] ; 9 - 10 September 2003, Orlando, Florida, USA (SPIE proceedings series ; vol. 5244); 5244(1), pp 53-64 (2003) | 2003

Modelling and Design of Admission Control Mechanisms for Web Servers using Non-linear Control Theory

Mikael Andersson; Maria Kihl; Anders Robertsson

Web sites are exposed to high rates of incoming requests. Since web sites are sensitive to overload, admission control mechanisms are often implemented. The purpose of such a mechanism is to prevent requests from entering the web server during high loads. This paper presents how admission control mechanisms can be designed and implemented with a combination of queueing theory and control theory. Since web servers behave non-linear and stochastic, queueing theory can be used for web server modelling. However, there are no mathematical tools in queueing theory to use when designing admission control mechanisms. Instead, control theory contains the needed mathematical tools. By analysing queueing systems with control theoretic methods, good admission control mechanisms can be designed for web server systems. In this paper we model an Apache web server as a GI/G/1-system. Then, we use control theory to design a PI-controller, commonly used in automatic control, for the web server. In the paper we describe the design of the controller and also how it can be implemented in a real system. The controller has been implemented and tested together with the Apache web server. The server was placed in a laboratory network together with a traffic generator which was used to represent client requests. Measurements in the laboratory setup show how robust the implemented controller is, and how it correspond to the results from the theoretical analysis.


conference on decision and control | 2004

Admission control for Web server systems - design and experimental evaluation

Anders Robertsson; Björn Wittenmark; Maria Kihl; Mikael Andersson

In communication systems, all service control nodes, such as for example Web sites or mobile switching centers, can be modeled as a server system with one or more servers processing the incoming requests. To avoid overload at the service node some type of admission control mechanism is usually implemented to guarantee good performance also during high traffic loads. In this paper we investigate, from a control point of view, the nonlinear discrete-time modeling of a server system, and the analysis and design of load control mechanisms based upon this model. Verification of the server model behavior with respect to queue theoretic models are made and the load control mechanisms are implemented on an Apache Web server and experimentally evaluated.


international symposium on computers and communications | 2003

Analysis of admission control mechanisms using non-linear control theory

Maria Kihl; Anders Robertsson; Björn Wittenmark

All service control nodes can be modelled as a server system with one or more servers processing incoming requests. In this paper we show how non-linear control theory may be used when analyzing admission control mechanisms for server systems. Two models are developed, one linear and one non-linear. We show that, due to the non-linearities appearing in a real server system, linear control theory is sufficient when designing controllers for these systems. With non-linear analysis, however, the dynamics of a server system may be analysed and taken care of by choosing the controller parameters appropriately.

Collaboration


Dive into the Maria Kihl's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge