Raimo Kantola

Evaluation of transport protocols for the session initiation protocol

SCTP is a newly developed transport protocol tailored for signaling transport. Whereas in theory SCTP is supposed to achieve a much better performance than TCP and UDP, at present there are no experimental results showing SCTPs real benefits. This article analyzes SCTPs strengths and weaknesses and provides simulation results. We implemented SIP on top of UDP, TCP, and SCTP in the network simulator and compared the three transport protocols under different network conditions.

ICN: interest-based clustering network

An interest-based clustering peer-to-peer network (ICN) architecture is introduced in this paper. ICN uses a lot of Freenet mechanisms and is based on cache management. ICN is self-organizing, fully distributed, scalable, and logically hierarchical. In ICN, the upper level is bound by de Bruijn graph. Nodes in the lower level self-cluster based on interest. Through analysis and simulation, ICN shows good fault-tolerance, efficient data retrieval and resource usage as well as low overhead traffic.

TruSMS: A Trustworthy SMS Spam Control System based on Trust Management

Abstract The fast growth of mobile networks has greatly enriched our life by disseminating information and providing communications at any time and anywhere. However, at the same time, when people gather and exchange useful information, they also receive unwanted data and contents, such as spam and unsolicited commercial advertisements. SMS (Short Message Service) spam is one typical example of unwanted contents, which has caused a serious problem to mobile users by intruding their devices, occupying device memories and irritating the users. More critically, some of these fraudulent messages deceive users and cause them incalculable loss. SMS spam control has become a crucial issue that impacts the further success of mobile networks. A number of researches have been conducted to control unwanted contents or traffic, some are based on trust and reputation mechanisms. But the literature still lacks an effective solution for SMS spam control. In this paper, we present the design and implementation of an SMS spam control system named TruSMS based on trust management. It can control SMS spam from its source to destinations according to trust evaluation by analyzing spam detection behaviors and SMS traffic data. We evaluate TruSMS performance under a variety of intrusions and attacks with a prototype system implementation. The result shows that TruSMS is effective with regard to accuracy, efficiency and robustness, which imply its trustworthiness.

Performance evaluation of GSM handover traffic in a GPRS/GSM network

The introduction of GPRS services into GSM networks creates new challenges to network planning engineers. One critical challenge comes from the requirement for providing a certain quality of service for GPRS traffic without significantly degrading the performance of existing GSM services. In a GSM/GPRS integrated network, it becomes necessary to reserve exclusive channels for GPRS in order to provide base-line QoS for GPRS users. On the other hand, the exclusive reservation obviously reduces the capacity of GSM traffic so that it has a significant impact on the performance of GSM traffic (especially GSM handover traffic). In this paper, we primarily evaluate the performance degradation of GSM handover traffic due to the introduction of GPRS in a GSM/GPRS network when various priority schemes for handover traffic over new call traffic are applied. A simplified case study of a GPRS/GSM network is simulated by using an event-driven simulator. The effect of an increasing GPRS penetration factor on the performance of existing GSM services is also studied. Our key results show that the performance of existing GSM handover traffic can be significantly degraded by the capacity reduction resulting from the introduction of GPRS but can be amended by using appropriate priority schemes.

Security for Future Software Defined Mobile Networks

5G constitutes the next revolution in mobile communications. It is expected to deliver ultra-fast, ultra-reliable network access supporting a massive increase of data traffic and connected nodes. Different technologies are emerging to address the requirements of future mobile networks, such as Software Defined Networking (SDN), Network Function Virtualization (NFV) and cloud computing concepts. In this paper, we introduce the security challenges these new technologies are facing, inherent to the new telecommunication paradigm. We also present a multitier approach to secure Software Defined Mobile Network (SDMN) by tackling security at different levels to protect the network itself and its users. First, we secure the communication channels between network elements by leveraging Host Identity Protocol (HIP) and IPSec tunnelling. Then, we restrict the unwanted access to the mobile backhaul network with policy based communications. It also protects the backhaul devices from source address spoofing and Denial of Service (DoS) attacks. Finally, we leverage Software Defined Monitoring (SDM) and data collection to detect, prevent and react to security threats.

Influence of link state updating on the performance and cost of QoS routing in an intranet

QoS routing has been regarded as an essential enhancing mechanism for providing differentiated QoS in the IP networks. QoS routing needs link state updating algorithms for acquiring accurate link state information (e.g., available link bandwidth) to compute routes. However, an unsuitable link state updating also brings excess computation and communication cost so that seriously degrades the performance of QoS routing. In this paper, we present four link state update algorithms for QoS routing in an Intranet, i.e., period based, threshold based, equal class based, and unequal class based updating. By doing extensive simulations, we investigate and compare their impact on the performance and cost of on-demand QoS routing in an intranet. Our simulation results prove that QoS routing can achieve both high performance and low cost under the careful selection of link state updating algorithms and their parameters.

Analysis on the acceptance of Global Trust Management for unwanted traffic control based on game theory

The Internet has witnessed an incredible growth in its pervasive use and brought unprecedented convenience to its users. However, an increasing amount of unwanted traffic, such as spam and malware, severely burdens both users and Internet service providers (ISPs), which arouses wide public concern. A Global Trust Management (GTM) system was proposed and demonstrated to be accurate, robust and effective on unwanted traffic control in our previous work (Yan et?al., 2011, 2013). But its acceptance by network entities (ISPs and hosts) is crucial to its practical deployment and final success. In this paper, we investigate the acceptance conditions of the GTM system using game theory. Considering the selfish nature of network entities, we address our problem as a social dilemma. To enhance cooperation among network entities, a public-goods-based GTM game is formulated with a trust-based punishment mechanism that can provide the incentives of behaving cooperatively for network entities. Meanwhile, the conditions of the adoption of GTM system are figured out. We also carry out a number of simulations to illustrate the acceptance conditions of the GTM system in practical deployment, and show the effectiveness of the trust-based punishment mechanism. Furthermore, suggestions for ISPs cooperating with antivirus vendors are put forward.

Unwanted Traffic Control via Global Trust Management

Peoples life has been totally changed by the fast growth of Internet. It provides an incentive platform for many killer services and applications. However, it also offers an easy channel to distribute various contents that could be unwanted by users. This paper proposes a generic unwanted traffic control solution through global trust management. It can control unwanted traffic from its source to destinations according to trust evaluation. Simulation based evaluation shows that the solution is effective with regard to accuracy, efficiency and robustness against a number of malicious attacks.

Incentive Problem for Ad Hoc Networks Scalability

Ad hoc networks still have unsolved fundamental problems such as scalability, security and QoS. Ad hoc networks have to compete with existing wireless technologies that already provide networking capabilities with low cost. The main driver for ad hoc networks is to have a zero-cost and self-created IP network. We consider scalability as the main inconvenience for future deployment of ad hoc networks. In this paper we analyse the scalability in a real testbed and we propose a simple and novel solution based on relay nodes. The relay nodes require consuming additional resources that users may not be willing to support. We use game theory to demonstrate that users will cooperate if a rewarding mechanism is implemented. Therefore, the proposed solution for scalable ad hoc networks requires a tight interaction between routing and MAC layer to enforce the rewarding mechanism. A new node architecture different from the OSI layering structure is required

SDN optimized caching in LTE mobile networks

This paper provides an overview of the current LTE architecture and the proposed solutions to integrate Software Defined Network (SDN) technology. The integration of SDN into mobile networks become Software Defined Mobile Network (SDMN), which provides new benefits such as dynamic and efficient caching. Firstly, the paper proposes the integration of SDN in LTE networks on disruptive approach that replaces current mobile transport with SDN based network. Secondly, the benefits of SDN integration to provide optimized content caching is presented. This paper presents a concrete advantage of SDMN for content delivery. Thus, the paper describes the benefits from operator and end user points of view based on a simple scenario of content delivery using dynamic caching reallocation.