Reliable Server Pooling - Evaluierung, Optimierung und Erweiterung einer neuen IETF-Architektur

The Reliable Server Pooling (RSerPool) architecture currently under standardization by the IETF RSerPool Working Group is an overlay network framework to provide server replication and session failover capabilities to applications using it. These functionalities as such are not new, but their combination into one generic, application-independent framework is. Initial goal of this thesis is to gain insight into the complex RSerPool mechanisms by performing experimental and simulative proof-of-concept tests. The further goals are to systematically validate the RSerPool architecture and its protocols, provide improvements and optimizations where necessary and propose extensions if useful. Based on these evaluations, recommendations to implementers and users of RSerPool should be provided, giving guidelines for the tuning of system parameters and the appropriate configuration of application scenarios. In particular, it is also a goal to transfer insights, optimizations and extensions of the RSerPool protocols from simulation to reality and also to bring the achievements from research into application by supporting and contributing relevant results to the IETF's ongoing RSerPool standardization process. To achieve the described goals, a prototype implementation as well as a simulation model are designed and realized at first. Using a generic application model and appropriate performance metrics, the performance of RSerPool systems in failure-free and server failure scenarios is systematically evaluated in order to identify critical parameter ranges and problematic protocol behaviour. Improvements developed as result of these performance analyses are evaluated and finally contributed into the standardization process of RSerPool

Prise de décision de handover vertical pour la gestion de mobilité dans les réseaux hétérogènes sans fil

L évolution des technologies réseaux sans fil, des terminaux mobiles ainsi que des contenus et des services créent des environnements hétérogènes de plus en plus complexes. Dans ce contexte, un compromis entre la mobilité, la transparence et la performance apparaît. Des utilisateurs mobiles, ayant différents profils et préférences, voudraient être toujours connectés au meilleur réseau à tout moment, sans avoir à se soucier des différentes transitions entre réseaux hétérogènes. Face à cette complexité, il parait nécessaire de proposer de nouvelles approches afin de rendre ces systèmes plus autonomes et de rendre les décisions de handover vertical plus efficaces. Cette thèse se concentre sur la gestion de mobilité verticale, plus précisément sur la prise de décision de handover vertical dans un environnement de réseaux hétérogènes sans fil. Après l identification des différents paramètres de prise de décision et l analyse de l état de l art relié à la gestion de la mobilité verticale, nous avons proposé un système de réputation qui permet de réduire les délais de prise de décision. La réputation d un réseau est introduite comme une nouvelle métrique de prise de décision qui peut être recueillie à partir des expériences précédentes des utilisateurs sur ce réseau. Nous montrons que la réputation est une métrique efficace qui permet l anticipation du handover et accélère la prise de décision. Bien que l objectif principal soit de garantir la meilleure qualité de service et l utilisation optimale des ressources radios, les aspects économiques doivent également être considérés, y compris la minimisation des coûts pour les utilisateurs et la maximisation des revenus pour les fournisseurs de services ou les opérateurs. Nous proposons alors, dans la deuxième partie de la thèse, un mécanisme de prise de décision basé sur la théorie des jeux. Ce dernier permet la maximisation des utilités des réseaux et des utilisateurs. Dans cette solution, chaque réseau disponible joue un jeu de Stackelberg avec un ensemble d utilisateurs, tandis que les utilisateurs jouent un jeu de Nash entre eux pour partager les ressources radios limitées. Un point d équilibre de Nash, qui maximise l utilité de l utilisateur et les revenus des fournisseurs de services, est trouvé et utilisé pour le contrôle d admission et la prise de décision de handover vertical. Dans la troisième partie de cette thèse, nous proposons et discutons deux différentes solutions architecturales sur lesquelles nos mécanismes de prise de décision proposés peuvent être intégrés. La première architecture proposée est basée sur la norme IEEE 802.21 à laquelle nous proposons certaines extensions. La seconde architecture proposée est basée sur un niveau de contrôle composé de deux couches de virtualisation. La virtualisation est assurée via des agents capables de faire un raisonnement et de prendre des décisions pour le compte d entités physiques qu ils représentent au sein du système. Cette architecture permet une plus grande flexibilitéMobility management over heterogeneous wireless networks is becoming a major interest area as new technologies and services continue to proliferate within the wireless networking market. In this context, seamless mobility is considered to be crucial for ubiquitous computing. Service providers aim to increase the revenue and to improve users satisfaction. However there are still many technical and architectural challenges to overcome before achieving the required interoperability and coexistence of heterogeneous wireless access networks. Indeed, the context of wireless networks is offering multiple and heterogeneous technologies (e.g. 2G to 4G, WiFi, Wimax, TETRA,...). On the one hand, this rich environment allows users to take profit from different capacities and coverage characteristics. Indeed, this diversity can provide users with high flexibility and allow them to seamlessly connect at any time and any where to the access technology that best fits their requirements. Additionally, cooperation between these different technologies can provide higher efficiency in the usage of the scarce wireless resources offering more economic systems for network providers. On the other hand, the heterogeneity of technologies and architectures and the multiplication of networks and service providers creates a complex environment where cooperation becomes challenging at different levels including and not limited to mobility management, radio resource provisioning, Quality of Service and security guarantees. This thesis is focusing on mobility management and mainly on decision making for Vertical handover within heterogeneous wireless network environments. After the analysis of the related state of the art, we first propose a reputation based approach that allows fast vertical handover decision making. A decision making scheme is then built on that approach. Network s reputation, is a new metric that can be gathered from previous users experiences in the networks. We show that it is an efficient construct to speed up the vertical handover decision making thanks to anticipation functionalities. While the main objective remains guaranteeing the best Quality of Service and optimal radio resource utilization, economical aspects have also to be considered including cost minimization for users and revenue maximization for network providers. For this aim, we propose, in the second part of the thesis, a game theoretic based scheme that allows maximizing benefits for both networks and users. In this solution, each available network plays a Stackelberg game with a finite set of users, while users are playing a Nash game among themselves to share the limited radio resources. A Nash equilibrium point, that maximizes the user s utility and the service provider revenue, is found and used for admission control and vertical handover decision making. The analyses of the optimal bandwidth/prices and the revenue at the equilibrium point show that there are some possible policies to use according to user s requirements in terms of QoS and to network capacities. For instance, we pointed out that networks having same capacities and different reputation values should charge users with different prices which makes reputation management very important to attract users and maximize networks revenue. In the third part of this thesis, we provide and discuss two different architectural and implementation solutions on which our proposed vertical handover decision mechanisms can be integrated. The first proposed architecture is a centralized one. It is based on the IEEE 802.21 standard to which some extensions are proposed. The second proposed architecture is distributed. It is based on an overlay control level composed of two virtualization layers able to make reasoning on behalf of physical entities within the system. This architecture allows higher flexibility especially for loosely coupled interconnected networksEVRY-INT (912282302) / SudocSudocFranceF

Computer Science and Technology Series : XV Argentine Congress of Computer Science. Selected papers

CACIC'09 was the fifteenth Congress in the CACIC series. It was organized by the School of Engineering of the National University of Jujuy. The Congress included 9 Workshops with 130 accepted papers, 1 main Conference, 4 invited tutorials, different meetings related with Computer Science Education (Professors, PhD students, Curricula) and an International School with 5 courses. CACIC 2009 was organized following the traditional Congress format, with 9 Workshops covering a diversity of dimensions of Computer Science Research. Each topic was supervised by a committee of three chairs of different Universities. The call for papers attracted a total of 267 submissions. An average of 2.7 review reports were collected for each paper, for a grand total of 720 review reports that involved about 300 different reviewers. A total of 130 full papers were accepted and 20 of them were selected for this book.Red de Universidades con Carreras en Informática (RedUNCI

Revisiting the IETF multipath extensions on transport layer

Load sharing on the transport layer of the OSI reference model is an important topic in the IETF standardization. This approach is also supported by the industry to optimize the use of the resources in a network like the Internet. After many trials, two basic sets of mechanisms and functionalities on the transport layer have been proposed by the IETF to achieve load sharing. These basic sets extend the protocol mechanisms that were originally designed for the use in singlepath dominated networks and represent only a first step to introduce a real end-to-end multipath transfer on the Internet. These first basic sets must be investigated and improved for the next steps. The Transmission Control Protocol (TCP) and the Stream Control Transmission Protocol (SCTP) provide the basis for the two IETF end-to-end multipath extensions. Both singlepath transport protocols have a different historical background but similar goals. These can be characterized by a reliable, connection-oriented and ordered data transport. However, initial experiments with the IETF multipath extensions in real networks show unexpected and in some cases clearly inadequate results. It is becoming rather apparent that the singlepath transport protocol specifications with their singlepath goals have a significant impact on the effectiveness of the load sharing mechanism and, furthermore, that the severity of the influence depends on the topology. The new mechanisms for multipath transfer include, in particular, an extended “path management” and “scheduling” task. The mechanisms addressing the path management organize the new, alternative paths and the scheduling mechanisms sup- port their effective use. For both protocol extensions of TCP and SCTP, an interaction can be identified between the new load sharing mechanisms and the existing specifications for singlepath transfer. This thesis systematically identifies the impact factors of the singlepath specifications on the new load sharing mechanisms and demonstrates their effects. In addition to the focus on the optimal use, the fair distribution of resources across all connections must be taken into account in the IETF standardization process. This so-called “fairness” discus- sion is mandatory for a transport protocol in the IETF context and has a direct impact on the overall system performance. Furthermore, this thesis discusses the currently implemented load sharing extensions and analyzes their weaknesses. Moreover, in this work new design approaches are developed to decrease the impact

Computer Science and Technology Series : XV Argentine Congress of Computer Science. Selected papers

CACIC'09 was the fifteenth Congress in the CACIC series. It was organized by the School of Engineering of the National University of Jujuy. The Congress included 9 Workshops with 130 accepted papers, 1 main Conference, 4 invited tutorials, different meetings related with Computer Science Education (Professors, PhD students, Curricula) and an International School with 5 courses. CACIC 2009 was organized following the traditional Congress format, with 9 Workshops covering a diversity of dimensions of Computer Science Research. Each topic was supervised by a committee of three chairs of different Universities. The call for papers attracted a total of 267 submissions. An average of 2.7 review reports were collected for each paper, for a grand total of 720 review reports that involved about 300 different reviewers. A total of 130 full papers were accepted and 20 of them were selected for this book.Red de Universidades con Carreras en Informática (RedUNCI

Modeling and acceleration of content delivery in world wide web

Ph.DDOCTOR OF PHILOSOPH

A Performance Evaluation of RSerPool Server Selection Policies in Varying Heterogeneous Capacity Scenarios

Reliable Server Pooling (RSerPool) is a protocol framework for server redundancy and session failover, currently still under standardization by the IETF RSerPool WG. Server redundancy influences load distribution and load balancing, which both are important for the performance of RSerPool systems. Especially, a good load balancing strategy is crucial if the servers of a pool are heterogeneous. Some research on this subject has already been performed, but a detailed analysis on the question of how to make best use of additional capacity in dynamic pools is still open. Therefore, the aim of this paper is, after an outline of the RSerPool framework, to simulatively examine the performance of RSerPool server selection strategies in scenarios of pools with varying server heterogeneity. In particular, this paper examines and evaluates a simple but very effective new policy, achieving a significant performance improvement in such situations