Network


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

Hotspot


Dive into the research topics where Timo O. Alanko is active.

Publication


Featured researches published by Timo O. Alanko.


Second International Workshop on Services in Distributed and Networked Environments | 1995

Optimizing World-Wide Web for weakly connected mobile workstations: An indirect approach

Mika Liljeberg; Timo O. Alanko; Markku Kojo; Heimo Laamanen; Kimmo E. E. Raatikainen

Modern portable computers and wireless connections over cellular telephone networks have created a new platform for distributed information processing. We have designed a communication architecture that makes it possible to exploit the existing TCP/IP communication protocols but that also takes into account specific features of cellular links. Our communication architecture is based on the concept of indirect interaction. The mediating interceptor is the bridge between the worlds of wireless and wireline communication. It also provides enhanced functionality that improves fault-tolerance and performance. In this paper we demonstrate how the architecture is used to improve the performance of the WWW information browsing. Similar solution methods can be applied to other existing applications and protocols.<<ETX>>


Archive | 1996

Connecting Mobile Workstations to the Internet Over a Digital Cellular Telephone Network

Markku Kojo; Kimmo E. E. Raatikainen; Timo O. Alanko

Modern portable computers and wireless connections over a cellular telephone network have created a new platform for distributed information processing. We present a communication architecture framework which makes it possible to exploit the existing TCP/IP communication architecture but which also takes into account the specific features of wireless links. Our communication architecture is based on the principle of indirect interaction. The mediating interceptor, Mobile-Connection Host, is the bridge between the worlds of wireless and wireline communication. The interceptor also provides enhanced functionality that improves fault-tolerance and performance for applications aware of mobility. Prototypes of the architecture are implemented both for the Unix (Linux) and for the Windows (3.11) platform.


IEEE Journal on Selected Areas in Communications | 1997

An efficient transport service for slow wireless telephone links

Markku Kojo; Kimmo E. E. Raatikainen; Mika Liljeberg; Jani Kiiskinen; Timo O. Alanko

Modern digital cellular telephones and portable computers have created a new platform for distributed information processing. However, the characteristics of wireless telephone links are different from those of wireline links. With standard TCP/IP protocols, this can lead to severe performance problems; some are related to the control of the wireless link, some to the cooperation of the wireless link and the fixed network. One possible solution is to split the end-to-end communication path into two parts, and to establish a separate control for each part. The Mowgli communication architecture is a sophisticated elaboration of this basic idea covering several data communication layers. One of its main components is the Mowgli data channel service (MDCS), which transparently replaces the standard TCP/IP core protocols over the slow wireless link. We discuss how the Mowgli approach, using the MDCS, alleviates the problems encountered with TCP/IP protocols over slow wireless links. The results of our performance tests indicate the merits of the Mowgli approach. The transfer times and the response times become more stable, transfer times for multiple parallel bidirectional transfers are substantially reduced, and response times in interactive work can be kept at a low and predictable level, even when there is other traffic on the wireless link.


acm special interest group on data communication | 1994

Measured performance of data transmission over cellular telephone networks

Timo O. Alanko; Markku Kojo; Heimo Laamanen; Mika Liljeberg; Marko Moilanen; Kimmo E. E. Raatikainen

Recent developments in mobile communication and personal computer technology have laid a new foundation for mobile computing. Performance of the data communication system as seen by an application program is a fundamental factor when communication infrastructure at the application layer is designed. This paper provides results of performance measurements of data transmission over two different cellular telephone networks, a digital GSM-network and an analogue NMT-network. Since our emphasis is on performance as seen by application programs, we use the standard TCP/IP protocols in the measurements. The performance is measured using three basic operations: establishment of a wireless dial-up connection, exchange of request-reply messages, and bulk data transfer. The external conditions under which the measurements were carried out present a normal office environment when the field strength of the cellular link is good or fairly good.


personal indoor and mobile radio communications | 1997

Mowgli: improvements for Internet applications using slow wireless links

Timo O. Alanko; Markku Kojo; Mika Liljeberg; Kimmo E. E. Raatikainen

Modern cellular telephone systems extend the usability of portable personal computers enormously. A nomadic user can be given ubiquitous access to remote information stores and computing services. However, the behavior of wireless links creates severe inconveniences within the traditional data communication paradigm. We give an overview of the problems related to wireless mobility. We also present a new software architecture for mastering the problems and discuss a new paradigm for designing mobile distributed applications. The key idea in the architecture is to place a mediator, a distributed intelligent agent, between the mobile node and the wireline network.


international symposium on computer modeling, measurement and evaluation | 1980

Methodology and empirical results of program behaviour measurements

Timo O. Alanko; Ilkka J. Haikala; Petri Kutvonen

Program behaviour characteristics were examined using data gathered from real program executions. Experiments were performed in a segmented virtual memory with a working set policy; the analyzing costs were kept low using an efficient data reduction method. Empirical results were obtained concerning the influence of the window size on program behaviour characteristics, the accuracy of some average working set size approximations and the sensitivity of program behaviour to the programs input data. These results show that some commonly used assumptions concerning program behaviour are inaccurate. Also there seem to exist “ill-behaving” programs, the behaviour of which does not correspond well with results obtained earlier. The effects of real-time delays during program execution were considered using a new simple method. As an additional experiment, segmenting and paging were compared using various performance statistics; the results seem to favour segmenting.


IFIP World Conference on Mobile Communications | 1996

Mobile computing based on GSM: The Mowgli approach

Timo O. Alanko; Markku Kojo; Heimo Laamanen; Kimmo E. E. Raatikainen; Martti Tienari

Modern cellular telephone systems extend the usability of portable personal computers enormously. A nomadic user can be given ubiquitous access to remote information stores and computing services. However, the behavior of wireless links creates severe inconveniences within the traditional data communication paradigm. In this paper we give an overview of the problems related to wireless mobility. We also present a new software architecture for mastering them and discuss a new paradigm for designing mobile distributed applications. The key idea in the architecture is to place a mediator, a distributed intelligent agent, between the mobile node and the wireline network. A prototype implementation of the architecture exists in an environment consisting of Linux and Windows platforms and the GSM cellular telephone network.


IEEE Transactions on Software Engineering | 1984

Virtual Memory Behavior of Some Sorting Algorithms

Timo O. Alanko; Hannu Erkiö; Ilkka J. Haikala

Experimnental results are given about the performance of six sorting algorithms in a virtual memory based on the working set principle. With one exception, the algorithms are general internal sorting algorithms and not especially tuned for virtual memory. Algorithms are compared in terms of their time requirements, space requirements, and space-time integrals. The relative performances of the algorithms vary from one measure to the other. Especially in terms of a space-time integral, quicksort turns out to be the best algorithm, also in a working set virtual memory environment.


Internet Research | 1999

Mobile Access to the Internet: A Mediator-Based Solution.

Timo O. Alanko; Markku Kojo; Mika Liljeberg; Kimmo E. E. Raatikainen

Nomadicity is a new challenge for computing and communication technologies. Modern cellular telephone systems extend the usability of portable personal computers enormously. A nomadic user can be given ubiquitous access to remote information stores and computing services. However, the behaviour of wireless links creates severe inconveniences within the traditional data communication paradigm. In this paper we give an overview of the problems related to wireless mobility. We also present a new software architecture for mastering the problems and discuss a new paradigm for designing mobile distributed applications. The key idea in the architecture is to place a mediator, a distributed intelligent agent, between the mobile node and the wireline network.


Information Processing Letters | 1986

On the calculation of control transition probabilities in a program

Timo O. Alanko; R.L. Smelianski

Abstract In the above examples we have considered some basic program constructs. We have assumed that the distribution functions of the needed variables are known at the entry point of each program construct. We have shown how the corresponding distribution functions change during the execution of the program construct. Based on these changing distribution functions the transition probabilities connected to the arcs of the control-flow graph can be calculated locally. Combining these constructs to programs does not give trouble: the needed probabilities are obtained as products of appropriate conditional probabilities. For a large class of programs, the distribution functions can be calculated passing through the control-flow graph in a step-by-step fashion.

Collaboration


Dive into the Timo O. Alanko's collaboration.

Top Co-Authors

Avatar

Markku Kojo

University of Helsinki

View shared research outputs
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