Multi-user resource-sharing problem for the Internet

In this thesis we study a series of multi-user resource-sharing problems for the Internet, which involve distribution of a common resource among participants of multi-user systems (servers or networks). We study concurrently accessible resources, which for end-users may be exclusively accessible or non-exclusively. For all kinds we suggest a separate algorithm or a modification of common reputation scheme. Every algorithm or method is studied from different perspectives: optimality of protocols, selfishness of end users, fairness of the protocol for end users. On the one hand the multifaceted analysis allows us to select the most suited protocols among a set of various available ones based on trade-offs of optima criteria. On the other hand, the future Internet predictions dictate new rules for the optimality we should take into account and new properties of the networks that cannot be neglected anymore. In this thesis we have studied new protocols for such resource-sharing problems as the backoff protocol, defense mechanisms against Denial-of-Service, fairness and confidentiality for users in overlay networks. For backoff protocol we present analysis of a general backoff scheme, where an optimization is applied to a general-view backoff function. It leads to an optimality condition for backoff protocols in both slot times and continuous time models. Additionally we present an extension for the backoff scheme in order to achieve fairness for the participants in an unfair environment, such as wireless signal strengths. Finally, for the backoff algorithm we suggest a reputation scheme that deals with misbehaving nodes. For the next problem -- denial-of-service attacks, we suggest two schemes that deal with the malicious behavior for two conditions: forged identities and unspoofed identities. For the first one we suggest a novel most-knocked-first-served algorithm, while for the latter we apply a reputation mechanism in order to restrict resource access for misbehaving nodes. Finally, we study the reputation scheme for the overlays and peer-to-peer networks, where resource is not placed on a common station, but spread across the network. The theoretical analysis suggests what behavior will be selected by the end station under such a reputation mechanism.

Herrat, jätkät ja sotataito : Kansalaissotilas- ja ammattisotilasarmeijan rakentuminen 1920- ja 1930-luvulla

Gentlemen, Lads and the Art of War The Construction of Citizen Soldier- and Professional Soldier Armies into the Miracle of the Winter War During the 1920s and 1930s The Miracle of the Winter War was not a myth - at least according to them, who were making that miracle to happen. This study is not just about the Armed Forces and society, but moreover a study about civil society inside the organization of armed forces. Conscription kept Finnish military organization (and is still keeping) very closely connected with civil society and therefore there is no need to locate the possible critical misunderstandings brought by two different identity-based approaches. The great performance of the Armed Forces during the Second World War was not made of superior art of war. It was not the high level of discipline either. Art of war is basically a (deep level) cultural level equation that has more to do with culturally absorbed schemes of meaning making than rational decision-making. Naturally attrition based approach to effect-making directed the organizational methods in attrition based organisational practices, where there were only minor possibilities to practice any manoeuvre-based organisational behaviour. The practice and method of leadership lent similarly to the attrition-based thinking, which directed the organisational cultural thoughts towards composition that confirmed antagonism between gentlemen and lads . This setting has been absorbed and learned through cultural socialisation and was therefore not a product of the military organisation itself. The Finnish Armed Forces included two different communities (gentlemen and lads) within the same organisation as there were both the official and the unofficial organisations presented. This caused problems as they both made meaning-making processes simultaneously. These organisations had their own overlapping and in most cases also contradictory social meanings. The unofficial organisation has been overshadowed by the vast number of studies concerning the official organisation. The main reason for this systematic neglect is based on the reality of the attitudes and living conditions of the micro-level organisation which produced (perhaps) too realistic and repulsive viewpoints that are presenting a picture of a national level identity process in a way that is separating it from the ideals made to verify the ethos of national values. Complaining, griping, grumbling and moaning are usually situated in a category of abnormal and unwanted behaviour. However, within the context of a citizen soldier army community this was more of a characteristic feature of that organisation (in Finland) and therefore it was crucially important to locate the context of that abnormal behaviour. According to this study, it was not a malicious act but moreover seriously formed efforts in trying to use common sense in the chaos citizen soldiers faced when they were uniformed and placed in an unfamiliar process of disciplinary measures and frictions and competition between different ranks. There is much evidence that reinforces the argument that what seemed to be the most unconventional behaviour was finally the most efficient in a sense of military performance.

Revocation and update of trust in autonomous delay tolerant networks

A Delay Tolerant Network (DTN) is a dynamic, fragmented, and ephemeral network formed by a large number of highly mobile nodes. DTNs are ephemeral networks with highly mobile autonomous nodes. This requires distributed and self-organised approaches to trust management. Revocation and replacement of security credentials under adversarial influence by preserving the trust on the entity is still an open problem. Existing methods are mostly limited to detection and removal of malicious nodes. This paper makes use of the mobility property to provide a distributed, self-organising, and scalable revocation and replacement scheme. The proposed scheme effectively utilises the Leverage of Common Friends (LCF) trust system concepts to revoke compromised security credentials, replace them with new ones, whilst preserving the trust on them. The level of achieved entity confidence is thereby preserved. Security and performance of the proposed scheme is evaluated using an experimental data set in comparison with other schemes based around the LCF concept. Our extensive experimental results show that the proposed scheme distributes replacement credentials up to 35% faster and spreads spoofed credentials of strong collaborating adversaries up to 50% slower without causing any significant increase on the communication and storage overheads, when compared to other LCF based schemes.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Perceptions Towards Adoption of Mobile Self-services: A Case Study (Available in Hanken intranet only)

This thesis is an exploratory case study that aims to understand the attitudes affecting adoption of mobile self-services. This study used a demo mobile self-service that could be used by consumers for making address changes. The service was branded with a large and trusted Finnish brand. The theoretical framework that was used consisted of adoption theories of technology, adoption theories of self-service and literature concerning mobile services. The reviewed adoption theories of both technology and self-service had their foundation in IDT or TRA/TPB. Based on the reviewed theories an initial framework was created. The empirical data collection was done through three computer aided group interview sessions with a total of 32 respondents. The data analysis started from the premises of the initial framework. Based on the empirical data the framework was constantly reviewed and altered and the data recoded accordingly. The result of this thesis was a list of attitudinal factors that affect the adoption of a mobile self-service either positively or negatively. The factors that were found to affect the attitudes towards adoption of mobile self-services positively were: that the service was time & place independent and saved time. Most respondents, but not all, also had a positive attitude towards adoption due to ease of use and being mentally compatible with the service. Factors that affected adoption negatively were lack of technical compatibility, perceived risk for high costs and risk for malicious software. The identified factors were triangulated in respect to existing literature and general attitudes towards mobile services.

An adaptive MAC protocol in MANETs: a democratic approach

Mobile ad-hoc networks (MANETs) have recently drawn significant research attention since they offer unique benefits and versatility with respect to bandwidth spatial reuse, intrinsic fault tolerance, and low-cost rapid deployment. This paper addresses the issue of delay sensitive realtime data transport in these type of networks. An effective QoS mechanism is thereby required for the speedy transport of the realtime data. QoS issue in MANET is an open-end problem. Various QoS measures are incorporated in the upperlayers of the network, but a few techniques addresses QoS techniques in the MAC layer. There are quite a few QoS techniques in the MAC layer for the infrastructure based wireless network. The goal and the challenge is to achieve a QoS delivery and a priority access to the real time traffic in adhoc wireless environment, while maintaining democracy in the resource allocation. We propose a MAC layer protocol called "FCP based FAMA protocol", which allocates the channel resources to the needy in a more democratic way, by examining the requirements, malicious behavior and genuineness of the request. We have simulated both the FAMA as well as FCP based FAMA and tested in various MANET conditions. Simulated results have clearly shown a performance improvement in the channel utilization and a decrease in the delay parameters in the later case. Our new protocol outperforms the other QoS aware MAC layer protocols.

Influence limitation in multi-campaign social networks: A Shapley value based approach

We investigate the problem of influence limitation in the presence of competing campaigns in a social network. Given a negative campaign which starts propagating from a specified source and a positive/counter campaign that is initiated, after a certain time delay, to limit the the influence or spread of misinformation by the negative campaign, we are interested in finding the top k influential nodes at which the positive campaign may be triggered. This problem has numerous applications in situations such as limiting the propagation of rumor, arresting the spread of virus through inoculation, initiating a counter-campaign against malicious propaganda, etc. The influence function for the generic influence limitation problem is non-submodular. Restricted versions of the influence limitation problem, reported in the literature, assume submodularity of the influence function and do not capture the problem in a realistic setting. In this paper, we propose a novel computational approach for the influence limitation problem based on Shapley value, a solution concept in cooperative game theory. Our approach works equally effectively for both submodular and non-submodular influence functions. Experiments on standard real world social network datasets reveal that the proposed approach outperforms existing heuristics in the literature. As a non-trivial extension, we also address the problem of influence limitation in the presence of multiple competing campaigns.

A trust model for routing in MANETs: a cognitive agents based approach

Mobile ad hoc networks (MANETs) is one of the successful wireless network paradigms which offers unrestricted mobility without depending on any underlying infrastructure. MANETs have become an exciting and im- portant technology in recent years because of the rapid proliferation of variety of wireless devices, and increased use of ad hoc networks in various applications. Like any other networks, MANETs are also prone to variety of attacks majorly in routing side, most of the proposed secured routing solutions based on cryptography and authentication methods have greater overhead, which results in latency problems and resource crunch problems, especially in energy side. The successful working of these mechanisms also depends on secured key management involving a trusted third authority, which is generally difficult to implement in MANET environ-ment due to volatile topology. Designing a secured routing algorithm for MANETs which incorporates the notion of trust without maintaining any trusted third entity is an interesting research problem in recent years. This paper propose a new trust model based on cognitive reasoning,which associates the notion of trust with all the member nodes of MANETs using a novel Behaviors-Observations- Beliefs(BOB) model. These trust values are used for detec- tion and prevention of malicious and dishonest nodes while routing the data. The proposed trust model works with the DTM-DSR protocol, which involves computation of direct trust between any two nodes using cognitive knowledge. We have taken care of trust fading over time, rewards, and penalties while computing the trustworthiness of a node and also route. A simulator is developed for testing the proposed algorithm, the results of experiments shows incorporation of cognitive reasoning for computation of trust in routing effectively detects intrusions in MANET environment, and generates more reliable routes for secured routing of data.

Regenerating codes for errors and erasures in distributed storage

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures at the nodes or links, during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-Matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.

Locating the attacker of wormhole attack by using the honeypot

Mobile Ad hoc Networks (MANETs) having strikingly superior features also come with notable disadvantage and troubles and the most exigent amongst all being security related issues. Such an ringent network dexterously pave approach for the malicious nodes. Hence providing security is a tedious task. For such a dynamic environment, a security system which dynamically observes the attacker's plans and protect the highly sophisticated resources is in high demand. In this paper we present a method of providing security against wormhole attacks to a MANET by learning about the environment dynamically and adapting itself to avoid malicious nodes. We accomplish this with the assistance of Honeypot. Our method predicts the wormhole attack that may take place and protect the resources well-in advance. Also it cleverly deal with the attacker by using previous history and different type of messages to locate the attacker. Several experiments suggest that the system is accurate in handling wormhole attack.

Evangélicos em ação nas favelas cariocas: um estudo sócio-antropológico sobre redes de proteção, tráfico de drogas e religião no Complexo de Acari

O objetivo desta tese é discutir como os moradores de favelas no Rio de Janeiro fazem para experimentar segurança em meio ao cotidiano marcado por inseguranças, violência e vulnerabilidade social. Minha hipótese central é que os moradores destas localidades visualizam nas lealdades primordiais (GEERTZ, 2008 [1973]), nas relações de vizinhança e em redes formadas em torno do pertencimento a instituições religiosas, sobretudo as pentecostais e neopentecostais a base da segurança necessária para organizarem suas vidas, suas rotinas. Busquei responder às questões que me animavam a partir de um investimento etnográfico em duas favelas cariocas, a saber, Santa Marta, localizada no bairro de Botafogo, Zona Sul, e, principalmente, Acari, localizada entre bairros da Zona Norte da cidade. Ao longo da etnografia realizei entrevistas semi-estruturadas com moradores evangélicos, traficantes, homens, mulheres, jovens e idosos, lideranças políticas e culturais. A partir destas entrevistas, assim como das conversas informais com moradores nestas favelas, pude observar a grande dificuldade que os moradores das referidas localidades têm, face à violência, para experimentar constantemente segurança e confiança, mesmo no caso dos moradores que desfrutam de densas redes de solidariedade e proteção baseadas no parentesco e/ou na partilha de identidade religiosa pentecostal. A paranóia, o medo da fofoca e do inimigo à espreita tomam conta do cotidiano de moradores (e também de traficantes). Neste contexto, identifiquei nas suas tentativas de consolidação de vínculos sociais e afetivos, mas também em seus diversos cálculos em termos de evitação da violência suas principais estratégias para viver o dia-a-dia com certa tranqüilidade. O curso da etnografia possibilitou, ainda, refletir sobre a importância da articulação analítica de dois eixos temáticos para o estudo da favela como fenômeno urbano/social hoje: religião e violência. Esta avaliação é fruto da observação das aproximações entre traficantes que passaram, nessas localidades, a experimentar novas formas de expressão de fé. Se, nas décadas de 1980-1990, os traficantes de Acari expunham em seus corpos, em suas casas e nos muros da favela imagens e orações que remetiam ao universo religioso afro-brasileiro, na atualidade, acionam uma gramática pentecostal e pintam nos muros da favela salmos e outras passagens bíblicas. Se antes pediam proteção às mães-de-santo, agora pedem proteção às lideranças evangélicas e à comunidade de irmãos, assim como comemoram seus aniversários em cultos de ação de graça. A interface entre traficantes e evangélicos nas favelas estudadas, com destaque para Acari, vem produzindo, sustento, reequilíbrios de poder no interior do campo político e religioso local e, até, supralocal.

Increasing the design strength of glass – fractography and stress testing

Brittleness is the unintended, but inevitable consequence of producing a transparent ceramic for architectural applications such as the soda-lime glass. Its tensile strength is particularly sensitive to surface imperfections, such as that from natural weathering and malicious damage. Although a significant amount of testing of new glass has been carried out, there has been surprisingly little testing on weathered glass. Due to the variable nature of the causes of surface damage, the lack of data on weathered glass leads to a considerable degree of uncertainty in the long-term strength of exposed glass. This paper presents the results of recent tests on weathered annealed glass which has been exposed to natural weathering for more than 20 years. The tests include experimental investigations using the co-axial ring setup as well as optical and atomic force microscopy of the glass surfaces. The experimental data from these tests is subsequently used to extend existing fracture mechanics-based models to predict the strength of weathered glass. It is shown that using an automated approach based directly on finite element analysis results can give an increase in effective design strength in the order of 70 to 100% when compared to maximum stress methods. It is also shown that by combining microscopy and strength test results, it is possible to quantitatively characterise the damage on glass surfaces.

Consensus on homogeneous manifolds

The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external reference and communicate their relative state according to an interconnection graph. The paper first formalizes the consensus problem for synchronization (i.e. maximizing the consensus) and balancing (i.e. minimizing the consensus); it thereby introduces the induced arithmetic mean, an easily computable mean position on CCH manifolds. Then it proposes and analyzes various consensus algorithms on manifolds: natural gradient algorithms which reach local consensus equilibria; an adaptation using auxiliary variables for almost-global synchronization or balancing; and a stochastic gossip setting for global synchronization. It closes by investigating the dependence of synchronization properties on the attraction function between interacting agents on the circle. The theory is also illustrated on SO(n) and on the Grassmann manifolds. ©2009 IEEE.

Layered Architecture for Secure E-Commerce Applications

We present a layered architecture for secure e-commerce applications and protocols with fully automated dispute-resolution process, robust to communication failures and malicious faults. Our design is modular, with precise yet general-purpose interfaces and functionalities, and allows usage as an underlying secure service to different e-commerce, e-banking and other distributed systems. The interfaces support diverse, flexible and extensible payment scenarios and instruments, including direct buyer-seller payments as well as (the more common) indirect payments via payment service providers (e.g. banks). Our design is practical, efficient, and ensures reliability and security under realistic failure and delay conditions.

流媒体分发与传输关键技术研究

随着Internet技术的飞速发展，流媒体分发技术取得了长足的进步，同时，日益增加的用户、视频数据和流媒体交互式需求，也给大规模流媒体分发服务带来了新的挑战。另外一方面，随着宽带无线接入技术发展的日新月异，如何有效利用多种接入方式为用户提供更高质量的流媒体服务是当前通信技术领域迫切需要解决的问题。本文对基于应用层支持交互式的P2P流媒体分发技术及基于传输层支持Multihoming的SCTP流媒体传输技术进行了相关研究，主要贡献和创新点如下： 第一、提出了一种支持随机访问的协作式P2P流媒体分发方案。该方案采用平衡二叉树将媒体对象进行分布式分段预取缓存，用于媒体流快速定位，利用缓存重叠机制构建非结构化网络，用于节点间常规媒体流分发。分别设计了媒体预取算法及邻居节点搜索算法，给出了节点失效恢复策略及支持随机访问的协作过程。仿真试验结果表明，在随机访问及网络波动过程中，该方案能够提供高平滑质量的P2P媒体流服务。 第二、提出了一种基于数据驱动及分布式存储的P2P VoD解决方案。该方案融合了平衡多叉树与基于数据驱动的随机图网络两种拓扑。利用gossip算法构建和维护随机图网络中的邻居节点关系，采用数据驱动机制进行邻居节点间媒体流的分发，进一步降低了源服务器的负载。设计了一种基于平衡多叉树的分布式预取缓存算法，提高了随机访问的搜索效率。仿真试验结果和分析表明，两种网络拓扑的协作机制有效地解决了P2P VoD中视频传输及交互式操作问题。 第三、设计和实现了一种基于Trace驱动及SCTP的MPEG-4视频传输评估平台Evalvid-SCTP。Evalvid-SCTP提供了在仿真环境下SCTP流媒体实时传输及视频质量评估的解决方案。在Multihoming环境下，Evalvid-SCTP可以有效地分析SCTP在不同网络条件和负载下的流媒体传输行为特征和传输质量。 第四、提出了SCTP流媒体单路径传输最佳协议参数配置策略及多路径并行传输策略。评估了在单路径传输机制下快速重传策略、超时重传策略、路径故障检测门限值设置，三者配合时在多种网络条件下的流媒体传输性能，并综合以上各种发现提出了在不同的路径条件下应该采取的重传路径选择策略以及路径故障检测门限值设置方案。评估了在多路径并行传输下融合SCTP部分可靠特性的流媒体传输性能，提出了针对流媒体传输，多路径并行传输应采取的策略。