A
Ari Viinikainen
Researcher at Information Technology University
Publications - 25
Citations - 196
Ari Viinikainen is an academic researcher from Information Technology University. The author has contributed to research in topics: Quality of service & Scheduling (computing). The author has an hindex of 7, co-authored 25 publications receiving 177 citations. Previous affiliations of Ari Viinikainen include University of Jyväskylä.
Papers
More filters
Proceedings ArticleDOI
Machine learning classification model for Network based Intrusion Detection System
TL;DR: A Machine Learning (ML) based model for Network based Intrusion Detection Systems (NIDS) that can be integrated with traditional intrusion detection systems in order to detect advanced threats and reduce false positives is proposed.
Proceedings ArticleDOI
Performance evaluation of the flow-based fast handover method for Mobile IPv6 network
TL;DR: A new method for faster handover in IPv6 networks, called Flow based Fast Handover for MIPv6 (FFHMIPv 6), which uses the features of the IPv6 protocol and benefits from IPv6 traffic control.
Proceedings ArticleDOI
Flow-based Fast Handover method for Mobile IPv6 network
TL;DR: The paper compares the performance of the FFHMIPv6 method to other fundamental handover methods with Network Simulator 2 (ns-2).
Journal ArticleDOI
Flow-based fast handover for mobile IPv6 environment - implementation and analysis
TL;DR: This paper presents the Flow-based Fast Handover for Mobile IPv6 (FFHMIPv6) for fast redirection of the MN's downstream flows during the Care-of-Address registration (binding update) process and another method speeding up the upstream handover by using a special Hand- of-Address (HofA) during registration process.
Proceedings ArticleDOI
Bandwidth allocation and pricing for telecommunications network
TL;DR: A packet scheduling scheme which ensures bandwidth as a quality of service (QoS) requirement and optimizes revenue of the network service provider is presented and a closed form formula for updating the adaptive weights of a packet scheduler is derived from a revenue-based optimization problem.